Michael Curry, John Dickerson, Neehar Peri, Samuel Dooley
3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 2 failures of our instrument; 0 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/2106.03215.json · badge: /api/ran/2106.03215.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 |
|---|---|---|
| neeharperi/preferencenet | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| neeharperi/PreferenceNet | marked official in Papers with Code Papers with Code archive |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| PreferenceNet | Ran ran on a synthesized input · constructed an object; no result was computed |
neeharperi/PreferenceNet/learnable_preferences/preference/network.py pointer only (licence: NONE) · get_code("9abc1213b9566eb7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, neeharperi/PreferenceNet 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. |
| label_assignment | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
neeharperi/preferencenet/compare_mechanism/evaluate.py pointer only (licence: NONE) · get_code("b8dade094ca76eb1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, neeharperi/preferencenet 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. |
| window | Ran ran; our contract draft was wrong, not the code |
neeharperi/preferencenet/compare_mechanism/evaluate.py pointer only (licence: NONE) · get_code("bcf927bef1ed7397") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, neeharperi/preferencenet 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. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 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 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.
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.
The design of optimal auctions is a problem of interest in economics, game theory and computer science. Despite decades of effort, strategyproof, revenuemaximizing auction designs are still not known outside of restricted settings. However, recent methods using deep learning have shown some success in approximating optimal auctions, recovering several known solutions and outperforming strong baselines when optimal auctions are not known. In addition to maximizing revenue, auction mechanisms may also seek to encourage socially desirable constraints such as allocation fairness or diversity. However, these philosophical notions neither have standardization nor do they have widely accepted formal definitions. In this paper, we propose PreferenceNet, an extension of existing neural-network-based auction mechanisms to encode constraints using (potentially human-provided) exemplars of desirable allocations. In addition, we introduce a new metric to evaluate an auction allocations' adherence to such socially desirable constraints and demonstrate that our proposed method is competitive with current state-of-the-art neural-network based auction designs. We validate our approach through human subject research and show that we are able to effectively capture real human preferences. Our code is available on GitHub * The first two authors contributed equally to this work. 35th Conference on Neural Information Processing Systems (NeurIPS 2021),
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.03215")
get_code_for_paper("2106.03215")
have("2106.03215")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.03215.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.03215)
Connect an agent — have() is free.