None of the 5 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (5 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/2212.06140.json · badge: /api/ran/2212.06140.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 |
|---|---|---|
| sumonbis/farify | canonical (classifier label) classifier basis not recorded on the link |
0 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| ground_net | Not yet run unverified (harvested, no recorded run) |
sumonbis/farify/utils/AC-10-Model-Functions.py code served (permissive licence) · get_code("e5985de39f542d48") How it ranno invocation recorded. |
| layer_net | Not yet run unverified (harvested, no recorded run) |
sumonbis/farify/utils/AC-1-Model-Functions.py code served (permissive licence) · get_code("617a2df124deccad") How it ranno invocation recorded. |
| net | Not yet run unverified (harvested, no recorded run) |
sumonbis/farify/utils/AC-1-Model-Functions.py code served (permissive licence) · get_code("85e93073f2dfae83") How it ranno invocation recorded. |
| net | Not yet run unverified (harvested, no recorded run) |
sumonbis/farify/utils/AC-10-Model-Functions.py code served (permissive licence) · get_code("4dd66df8b7f1741c") How it ranno invocation recorded. |
| z3_net | Not yet run unverified (harvested, no recorded run) |
sumonbis/farify/utils/AC-1-Model-Functions.py code served (permissive licence) · get_code("ebb3b38d09a32652") How it ranno invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 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 5 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.
Fairness of machine learning (ML) software has become a major concern in the recent past. Although recent research on testing and improving fairness have demonstrated impact on real-world software, providing fairness guarantee in practice is still lacking. Certification of ML models is challenging because of the complex decision-making process of the models. In this paper, we proposed Fairify, an SMT-based approach to verify individual fairness property in neural network (NN) models. Individual fairness ensures that any two similar individuals get similar treatment irrespective of their protected attributes e.g., race, sex, age. Verifying this fairness property is hard because of the global checking and non-linear computation nodes in NN. We proposed sound approach to make individual fairness verification tractable for the developers. The key idea is that many neurons in the NN always remain inactive when a smaller part of the input domain is considered. So, Fairify leverages whitebox access to the models in production and then apply formal analysis based pruning. Our approach adopts input partitioning and then prunes the NN for each partition to provide fairness certification or counterexample. We leveraged interval arithmetic and activation heuristic of the neurons to perform the pruning as necessary. We evaluated Fairify on 25 real-world neural networks collected from four different sources, and demonstrated the effectiveness, scalability and performance over baseline and closely related work. Fairify is also configurable based on the domain and size of the NN. Our novel formulation of the problem can answer targeted verification queries with relaxations and counterexamples, which have practical implications.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2212.06140")
get_code_for_paper("2212.06140")
have("2212.06140")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2212.06140.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2212.06140)
Connect an agent — have() is free.