2 of 3 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 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/2301.03180.json · badge: /api/ran/2301.03180.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 |
|---|---|---|
| cxjdavin/subset-verification-and-search-algorithms-for-causal-dags | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_adj_list | Ran ran; our contract draft was wrong, not the code |
cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/our_code/subset_verify.py code served (permissive licence) · get_code("240897eb9d12e903") How it ranRan 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 dict. The image it ran in was not recorded. If your copy returns the same type 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.
|
| verification | Ran ran, honoured the contract we drafted |
cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/our_code/subset_verify.py code served (permissive licence) · get_code("df94980154fcbc1c") How it ranRan 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 2, 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.
|
| compute_minimum_vertex_cover | Not yet run unverified (harvested, no recorded run) |
cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/our_code/subset_verify.py code served (permissive licence) · get_code("3f45d429b6f29f13") How it ranno invocation 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, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 0 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| compute_minimum_vertex_cover | 1 other paper 1 dated earlier |
2206.15374 (2022-06) Verification and search algorithms for causal DAGs |
|
| get_adj_list | 1 other paper 1 dated earlier |
2206.15374 (2022-06) Verification and search algorithms for causal DAGs |
|
| verification | 1 other paper 1 dated earlier |
2206.15374 (2022-06) Verification and search algorithms for causal DAGs |
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.
Learning causal relationships between variables is a fundamental task in causal inference and directed acyclic graphs (DAGs) are a popular choice to represent the causal relationships. As one can recover a causal graph only up to its Markov equivalence class from observations, interventions are often used for the recovery task. Interventions are costly in general and it is important to design algorithms that minimize the number of interventions performed. In this work, we study the problem of identifying the smallest set of interventions required to learn the causal relationships between a subset of edges (target edges). Under the assumptions of faithfulness, causal sufficiency, and ideal interventions, we study this problem in two settings: when the underlying ground truth causal graph is known (subset verification) and when it is unknown (subset search). For the subset verification problem, we provide an efficient algorithm to compute a minimum sized interventional set; we further extend these results to bounded size non-atomic interventions and node-dependent interventional costs. For the subset search problem, in the worst case, we show that no algorithm (even with adaptivity or randomization) can achieve an approximation ratio that is asymptotically better than the vertex cover of the target edges when compared with the subset verification number. This result is surprising as there exists a logarithmic approximation algorithm for the search problem when we wish to recover the whole causal graph. To obtain our results, we prove several interesting structural properties of interventional causal graphs that we believe have applications beyond the subset verification/search problems studied here.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2301.03180")
get_code_for_paper("2301.03180")
have("2301.03180")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2301.03180.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2301.03180)
Connect an agent — have() is free.