Nisheeth Vishnoi, L Celis, Amit Kumar, Andrew Xu
5 of 5 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 0 have no contract verdict; 5 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/2409.04897.json · badge: /api/ran/2409.04897.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 |
|---|---|---|
| sandrewxu/centralizedselectionwithpreferencebias | canonical (classifier label) classifier basis: classifier_2025 |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| a_inst_wise | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sandrewxu/centralizedselectionwithpreferencebias/algorithms.py pointer only (licence: NONE) · get_code("ad5ea2b3648d8d4b") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sandrewxu/centralizedselectionwithpreferencebias 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. |
| a_inst_wise | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sandrewxu/centralizedselectionwithpreferencebias/algorithms.py pointer only (licence: NONE) · get_code("1d2eee09bda8d34e") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sandrewxu/centralizedselectionwithpreferencebias 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. |
| gale_shapley | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sandrewxu/centralizedselectionwithpreferencebias/algorithms.py pointer only (licence: NONE) · get_code("ed7e6f01330affb4") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sandrewxu/centralizedselectionwithpreferencebias 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. |
| gale_shapley | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sandrewxu/centralizedselectionwithpreferencebias/algorithms.py pointer only (licence: NONE) · get_code("ce0315c4ce3be6fc") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sandrewxu/centralizedselectionwithpreferencebias 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. |
| group_wise | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sandrewxu/centralizedselectionwithpreferencebias/algorithms.py pointer only (licence: NONE) · get_code("1cbc1babb286f1fa") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sandrewxu/centralizedselectionwithpreferencebias 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 5 samples lifted from this paper's linked repositories, 5 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.
This paper considers the scenario in which there are multiple institutions, each with a limited capacity for candidates, and candidates, each with preferences over the institutions. A central entity evaluates the utility of each candidate to the institutions, and the goal is to select candidates for each institution in a way that maximizes utility while also considering the candidates' preferences. The paper focuses on the setting in which candidates are divided into multiple groups and the observed utilities of candidates in some groups are biased-systematically lower than their true utilities. The first result is that, in these biased settings, prior algorithms can lead to selections with sub-optimal true utility and significant discrepancies in the fraction of candidates from each group that get their preferred choices. Subsequently, an algorithm is presented along with proof that it produces selections that achieve near-optimal group fairness with respect to preferences while also nearly maximizing the true utility under distributional assumptions. Further, extensive empirical validation of these results in real-world and synthetic settings, in which the distributional assumptions may not hold, are presented.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2409.04897")
get_code_for_paper("2409.04897")
have("2409.04897")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2409.04897.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2409.04897)
Connect an agent — have() is free.