4 of 4 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; 4 failures of our instrument; 0 no recorded run), measured 2026-11-21; 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/2012.10203.json · badge: /api/ran/2012.10203.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 |
|---|---|---|
| haoming-codes/str-withheld | canonical (classifier label) classifier basis: classifier_2025 |
4 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| add_D_edges | Ran ran; our contract draft was wrong, not the code |
haoming-codes/str-withheld/credit.py pointer only (licence: GPL-3.0) · get_code("c2e31695fcf09285") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, haoming-codes/str-withheld, is not in the permissive set Syntology serves inline. 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. |
| can_report | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
haoming-codes/str-withheld/credit.py pointer only (licence: GPL-3.0) · get_code("0086df30c05b3cb5") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, haoming-codes/str-withheld, is not in the permissive set Syntology serves inline. 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. |
| fileToList | Ran ran; our contract draft was wrong, not the code |
haoming-codes/str-withheld/parse.py pointer only (licence: GPL-3.0) · get_code("996fdadfcecbb105") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, haoming-codes/str-withheld, is not in the permissive set Syntology serves inline. 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. |
| powerset | Ran ran; our contract draft was wrong, not the code |
haoming-codes/str-withheld/credit.py pointer only (licence: GPL-3.0) · get_code("ed13995bc898b48b") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, haoming-codes/str-withheld, is not in the permissive set Syntology serves inline. 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 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 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 4 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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Machine learning techniques can be useful in applications such as credit approval and college admission. However, to be classified more favorably in such contexts, an agent may decide to strategically withhold some of her features, such as bad test scores. This is a missing data problem with a twist: which data is missing {\em depends on the chosen classifier}, because the specific classifier is what may create the incentive to withhold certain feature values. We address the problem of training classifiers that are robust to this behavior. We design three classification methods: {\sc Mincut}, {\sc Hill-Climbing} ({\sc HC}) and Incentive-Compatible Logistic Regression ({\sc IC-LR}). We show that {\sc Mincut} is optimal when the true distribution of data is fully known. However, it can produce complex decision boundaries, and hence be prone to overfitting in some cases. Based on a characterization of truthful classifiers (i.e., those that give no incentive to strategically hide features), we devise a simpler alternative called {\sc HC} which consists of a hierarchical ensemble of out-of-the-box classifiers, trained using a specialized hill-climbing procedure which we show to be convergent. For several reasons, {\sc Mincut} and {\sc HC} are not effective in utilizing a large number of complementarily informative features. To this end, we present {\sc IC-LR}, a modification of Logistic Regression that removes the incentive to strategically drop features. We also show that our algorithms perform well in experiments on real-world data sets, and present insights into their relative performance in different settings.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2012.10203")
get_code_for_paper("2012.10203")
have("2012.10203")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2012.10203.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2012.10203)
Connect an agent — have() is free.