6 of 13 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; 0 honoured the contract we drafted, 0 violated it and 6 have no contract verdict; 0 failures of our instrument; 7 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/1911.10092.json · badge: /api/ran/1911.10092.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 |
|---|---|---|
| JayMan91/aaai_predit_then_optimize | canonical (classifier label) classifier basis: census |
6 ran · 7 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| data_reading | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/EnergyCost/ICON.py code served (permissive licence) · get_code("ee1c6a3a00be8bc6") 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.
|
| get_data | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/sgd_learner.py code served (permissive licence) · get_code("2dd8ceebf2a365ec") 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 Tensor, ndim 2, dtype family float, shape (3, 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.
|
| get_kn_indicators | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/sgd_learner.py code served (permissive licence) · get_code("1592e9edaea942e4") 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.
|
| get_profits | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/EnergyCost/energy_cost.py code served (permissive licence) · get_code("aa97787abf6034a7") 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.
|
| shortest_path | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/sgd_learner.py code served (permissive licence) · get_code("95c25164471c4610") 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 (24,) 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.
|
| solveKnapsackGreedily | Ran ran on a synthesized input |
JayMan91/aaai_predit_then_optimize/KnapsackSolving.py code served (permissive licence) · get_code("ba3145cb5e3d8213") 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.
|
| ICON_scheduling | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/EnergyCost/ICON.py code served (permissive licence) · get_code("2a98612374aa111c") How it ranno invocation recorded. |
| ICON_scheduling_relaxation | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/EnergyCost/ICON.py code served (permissive licence) · get_code("61a4f21373e9ada4") How it ranno invocation recorded. |
| get_energy | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/get_energy.py code served (permissive licence) · get_code("3ee7504e77ee94cb") How it ranno invocation recorded. |
| get_energy_grouped | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/get_energy.py code served (permissive licence) · get_code("8234b742ce34e9d8") How it ranno invocation recorded. |
| get_energy_pandas | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/get_energy.py code served (permissive licence) · get_code("0d9b18d5fefc09ef") How it ranno invocation recorded. |
| solveKnapsackProblem | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/KnapsackSolving.py code served (permissive licence) · get_code("6788adf385135210") How it ranno invocation recorded. |
| solveKnapsackProblemRelaxation | Not yet run unverified (harvested, no recorded run) |
JayMan91/aaai_predit_then_optimize/KnapsackSolving.py code served (permissive licence) · get_code("964934cb816c76c8") How it ranno invocation recorded. |
Of 13 samples lifted from this paper's linked repositories, 13 carry a function identity and 0 do not. Of the 13 distinct functions with an identity, 12 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 12 later) and 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| data_reading | 2 other papers 2 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
2112.03609 (2021-12) Decision-Focused Learning: Through the Lens of Learning to Rank |
| get_energy_pandas | 2 other papers 2 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
2112.03609 (2021-12) Decision-Focused Learning: Through the Lens of Learning to Rank |
| ICON_scheduling | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| ICON_scheduling_relaxation | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| get_data | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| get_energy | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| get_energy_grouped | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| get_kn_indicators | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| shortest_path | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| solveKnapsackGreedily | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| solveKnapsackProblem | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
|
| solveKnapsackProblemRelaxation | 1 other paper 1 later |
2010.13943 (2020-10) Interior Point Solving for LP-based prediction+optimisation |
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.
Combinatorial optimization assumes that all parameters of the optimization problem, e.g. the weights in the objective function is fixed. Often, these weights are mere estimates and increasingly machine learning techniques are used to for their estimation. Recently, Smart Predict and Optimize (SPO) has been proposed for problems with a linear objective function over the predictions, more specifically linear programming problems. It takes the regret of the predictions on the linear problem into account, by repeatedly solving it during learning. We investigate the use of SPO to solve more realistic discrete optimization problems. The main challenge is the repeated solving of the optimization problem. To this end, we investigate ways to relax the problem as well as warmstarting the learning and the solving. Our results show that even for discrete problems it often suffices to train by solving the relaxation in the SPO loss. Furthermore, this approach outperforms, for most instances, the state-of-the-art approach of Wilder, Dilkina, and Tambe. We experiment with weighted knapsack problems as well as complex scheduling problems and show for the first time that a predict-and-optimize approach can successfully be used on large-scale combinatorial optimization problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.10092")
get_code_for_paper("1911.10092")
have("1911.10092")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.10092.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.10092)
Connect an agent — have() is free.