SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1811.03532 · 2018

Scalable Robust Kidney Exchange

arXiv · PDF · Open in the Atlas

Code that ran

2 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 2 have no contract verdict; 0 failures of our instrument; 3 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/1811.03532.json · badge: /api/ran/1811.03532.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.

RepositoryRoleRan
duncanmcelfresh/RobustKidneyExchange canonical (classifier label)
classifier basis: census
2 ran · 3 no recorded run
FunctionStatusWhere it lives
find_selected_cycle Ran
ran on a synthesized input
duncanmcelfresh/RobustKidneyExchange/kidney_utils.py
code served (permissive licence) · get_code("656ae4c30ccb2b65")
How it ran

Ran 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 int; 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.

import torch

torch.manual_seed(0)

# Analyze the function:
# - v_id: used as a key/value in dictionary operations and list membership check
# - next_vv: used as a dictionary where keys are looked up (in operator) and values are retrieved
# The function detects cycles in a graph represented as a dictionary mapping

# Test case 1: Function should find a cycle
# Create a simple cycle: 1 -> 2 -> 3 -> 1
next_vv_cycle = {1: 2, 2: 3, 3: 1}
v_id_cycle = 1

# Test case 2: Function should return None (no cycle)
next_vv_no_cycle = {1: 2, 2: 3}
v_id_no_cycle = 1

# We'll use the cycle case
ARGS = {
    "v_id": 1,
    "next_vv": {1: 2, 2: 3, 3: 1}
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list, ndim 1, dtype family int — a list output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
find_selected_path Ran
ran on a synthesized input
duncanmcelfresh/RobustKidneyExchange/kidney_utils.py
code served (permissive licence) · get_code("ad93682ba7864e0e")
How it ran

Ran 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 int; 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.

import torch
import numpy as np

torch.manual_seed(0)

# Analyzing the function:
# - find_selected_path takes v_id and next_vv
# - v_id is used as a dictionary key and appended to a list
# - next_vv is used with 'in' operator and as a dictionary for lookups
# - The function builds a path by following links in next_vv until v_id is no longer a key

# v_id should be a hashable identifier (int, str, etc.)
# next_vv should be a dict mapping v_id values to subsequent v_id values

v_id = 0
next_vv = {
    0: 1,
    1: 2,
    2: 3
}

ARGS = {
    "v_id": v_id,
    "next_vv": next_vv
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list, ndim 1, dtype family int — a list output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
chain_after_failure Not yet run
unverified (harvested, no recorded run)
duncanmcelfresh/RobustKidneyExchange/kidney_ndds.py
code served (permissive licence) · get_code("321dd256fbacccc1")
How it ran

no invocation recorded.

create_relabelled_ndds Not yet run
unverified (harvested, no recorded run)
duncanmcelfresh/RobustKidneyExchange/kidney_ndds.py
code served (permissive licence) · get_code("80c43a54e4073f37")
How it ran

no invocation recorded.

get_dist_from_nearest_ndd Not yet run
unverified (harvested, no recorded run)
duncanmcelfresh/RobustKidneyExchange/kidney_utils.py
code served (permissive licence) · get_code("dec55295b7874541")
How it ran

no invocation recorded.

Also present in other papers' code

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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

In barter exchanges, participants directly trade their endowed goods in a constrained economic setting without money. Transactions in barter exchanges are often facilitated via a central clearinghouse that must match participants even in the face of uncertainty---over participants, existence and quality of potential trades, and so on. Leveraging robust combinatorial optimization techniques, we address uncertainty in kidney exchange, a real-world barter market where patients swap (in)compatible paired donors. We provide two scalable robust methods to handle two distinct types of uncertainty in kidney exchange---over the quality and the existence of a potential match. The latter case directly addresses a weakness in all stochastic-optimization-based methods to the kidney exchange clearing problem, which all necessarily require explicit estimates of the probability of a transaction existing---a still-unsolved problem in this nascent market. We also propose a novel, scalable kidney exchange formulation that eliminates the need for an exponential-time constraint generation process in competing formulations, maintains provable optimality, and serves as a subsolver for our robust approach. For each type of uncertainty we demonstrate the benefits of robustness on real data from a large, fielded kidney exchange in the United States. We conclude by drawing parallels between robustness and notions of fairness in the kidney exchange setting.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1811.03532")
get_code_for_paper("1811.03532")
have("1811.03532")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1811.03532.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1811.03532.svg)](https://syntology.ai/paper/1811.03532)

Connect an agent — have() is free.