7 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; 0 honoured the contract we drafted, 1 violated it and 1 has no contract verdict; 5 failures of our instrument; 1 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/2406.08414.json · badge: /api/ran/2406.08414.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 |
|---|---|---|
| luchris429/DiscoPOP | canonical (classifier label) classifier basis not recorded on the link |
5 ran · 0 no recorded run |
| vanderschaarlab/discopop | reimplementation (classifier label) classifier basis: classifier_2025 |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| apply_chat_template | Ran ran; our contract draft was wrong, not the code |
luchris429/DiscoPOP/src/alignment/data.py code served (permissive licence) · get_code("9be97bcdb51fd634") 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.
|
| extract_docstring | Ran ran; our contract draft was wrong, not the code |
luchris429/DiscoPOP/src/alignment/decontaminate.py code served (permissive licence) · get_code("0edeacd7a9034f53") 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.
|
| init_archive | Ran ran; our contract draft was wrong, not the code |
vanderschaarlab/discopop/scripts/launch_evo.py code served (permissive licence) · get_code("96f002b17b0af96e") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| is_openai_format | Ran ran, violated the contract we drafted |
luchris429/DiscoPOP/src/alignment/data.py pointer only (licence: MIT); the stored copy get_code serves, from tengxiao1/cal-dpo, is pointer only (licence: NONE) · get_code("4253aac010c4504f") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tengxiao1/cal-dpo, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| load_dataset_column | Ran ran on a synthesized input |
luchris429/DiscoPOP/src/alignment/decontaminate.py code served (permissive licence) · get_code("a3791c5c2185e013") 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 list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| normalize_whitespace | Ran ran; our contract draft was wrong, not the code |
luchris429/DiscoPOP/src/alignment/decontaminate.py code served (permissive licence) · get_code("f43e59d239019e86") 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.
|
| validate_code | Ran ran; our contract draft was wrong, not the code |
vanderschaarlab/discopop/scripts/launch_evo.py code served (permissive licence) · get_code("6c1e6f76c77c843d") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| train_gpo | Not yet run unverified (harvested, no recorded run) |
vanderschaarlab/discopop/scripts/launch_evo.py code served (permissive licence) · get_code("d303691c35493431") 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, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 4 the same month, 5 later) and 3 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 |
|---|---|---|---|
| is_openai_format | 12 other papers 1 dated earlier, 1 the same month, 10 later |
2405.14734 (2024-05) SimPO: Simple Preference Optimization with a Reference-Free Reward |
2406.19371 (2024-06) Suri: Multi-constraint Instruction Following for Long-form Text Generation 2407.09014 (2024-07) COMPACT: Compressing Retrieved Documents Actively for Question Answering and 9 more not named here |
| extract_docstring | 10 other papers 1 dated earlier, 1 the same month, 8 later |
2405.14734 (2024-05) SimPO: Simple Preference Optimization with a Reference-Free Reward |
2406.19371 (2024-06) Suri: Multi-constraint Instruction Following for Long-form Text Generation 2407.09014 (2024-07) COMPACT: Compressing Retrieved Documents Actively for Question Answering and 7 more not named here |
| normalize_whitespace | 9 other papers 1 dated earlier, 1 the same month, 7 later |
2405.14734 (2024-05) SimPO: Simple Preference Optimization with a Reference-Free Reward |
2406.19371 (2024-06) Suri: Multi-constraint Instruction Following for Long-form Text Generation 2407.09014 (2024-07) COMPACT: Compressing Retrieved Documents Actively for Question Answering and 6 more not named here |
| load_dataset_column | 8 other papers 1 dated earlier, 1 the same month, 6 later |
2405.14734 (2024-05) SimPO: Simple Preference Optimization with a Reference-Free Reward |
2406.19371 (2024-06) Suri: Multi-constraint Instruction Following for Long-form Text Generation 2407.09014 (2024-07) COMPACT: Compressing Retrieved Documents Actively for Question Answering and 5 more not named here |
| apply_chat_template | 7 other papers 1 dated earlier, 6 later |
2405.14734 (2024-05) SimPO: Simple Preference Optimization with a Reference-Free Reward |
2407.09014 (2024-07) COMPACT: Compressing Retrieved Documents Actively for Question Answering 2409.03444 (2024-09) Fine-tuning large language models for domain adaptation: Exploration of training strategies, scaling, model merging and synergistic capabilities and 4 more not named here |
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.
Offline preference optimization is a key method for enhancing and controlling the quality of Large Language Model (LLM) outputs. Typically, preference optimization is approached as an offline supervised learning task using manually-crafted convex loss functions. While these methods are based on theoretical insights, they are inherently constrained by human creativity, so the large search space of possible loss functions remains under explored. We address this by performing LLM-driven objective discovery to automatically discover new state-of-the-art preference optimization algorithms without (expert) human intervention. Specifically, we iteratively prompt an LLM to propose and implement new preference optimization loss functions based on previously-evaluated performance metrics. This process leads to the discovery of previously-unknown and performant preference optimization algorithms. The best performing of these we call Discovered Preference Optimization (DiscoPOP), a novel algorithm that adaptively blends logistic and exponential losses. Experiments demonstrate the state-of-the-art performance of DiscoPOP and its successful transfer to held-out tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.08414")
get_code_for_paper("2406.08414")
have("2406.08414")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.08414.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.08414)
Connect an agent — have() is free.