Taihei Oki, Shinsaku Sakaue
6 of 8 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 5 failures of our instrument; 2 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2602.01682.json · badge: /api/ran/2602.01682.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| ssakaue/online-inverse-m-convex-public | canonical (classifier label) classifier basis: census |
6 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| euclidean_ball_projection | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
ssakaue/online-inverse-m-convex-public/experiments_core/utils.py code served (permissive licence) · get_code("9cd8e6db12335d19") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (4,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| load_config | Ran ran; our contract draft was wrong, not the code |
ssakaue/online-inverse-m-convex-public/experiments_core/config.py code served (permissive licence) · get_code("8e150028da12e7b8") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| resolve_config | Ran ran; our contract draft was wrong, not the code |
ssakaue/online-inverse-m-convex-public/experiments_core/config.py code served (permissive licence) · get_code("970bbe6d06f34997") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| to_pretty_json | Ran ran; our contract draft was wrong, not the code |
ssakaue/online-inverse-m-convex-public/experiments_core/utils.py code served (permissive licence) · get_code("6a19c71f332c145f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| top_m_binary | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
ssakaue/online-inverse-m-convex-public/experiments_core/utils.py code served (permissive licence) · get_code("f0510e3108b2fb13") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (6,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| topo_interior_point | Ran ran, honoured the contract we drafted |
ssakaue/online-inverse-m-convex-public/experiments_core/learners/base.py code served (permissive licence) · get_code("0ad56db1a5eb5582") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (5,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| build_learners | Not yet run unverified (harvested, no recorded run) |
ssakaue/online-inverse-m-convex-public/experiments_core/runner.py code served (permissive licence) · get_code("c3484756d6d99c36") How it ranno invocation recorded. |
| hyperparam_print_blob | Not yet run unverified (harvested, no recorded run) |
ssakaue/online-inverse-m-convex-public/experiments_core/config.py code served (permissive licence) · get_code("f028d6d81ecc8f66") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 8 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study online inverse linear optimization, also known as contextual recommendation, where a learner sequentially infers an agent's hidden objective vector from observed optimal actions over feasible sets that change over time. The learner aims to recommend actions that perform well under the agent's true objective, and the performance is measured by the regret, defined as the cumulative gap between the agent's optimal values and those achieved by the learner's recommended actions. Prior work has established a regret bound of O(d log T ), as well as a finite but exponentially large bound of exp(O(d log d)), where d is the dimension of the optimization problem and T is the time horizon, while a regret lower bound of Ω(d) is known (Gollapudi et al. 2021; Sakaue et al. 2025). Whether a finite regret bound polynomial in d is achievable or not has remained an open question. We partially resolve this by showing that when the feasible sets are M-convex -a broad class that includes matroids-a finite regret bound of O(d log d) is possible. We achieve this by combining a structural characterization of optimal solutions on M-convex sets with a geometric volume argument. Moreover, we extend our approach to adversarially corrupted feedback in up to C rounds. We obtain a regret bound of O((C + 1)d log d) without prior knowledge of C, by monitoring directed graphs induced by the observed feedback to detect corruptions adaptively.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.01682")
get_code_for_paper("2602.01682")
have("2602.01682")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2602.01682.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2602.01682)
Connect an agent — have() is free.