Cheng Zhang, Chao Ma, Joel Jennings, Matthew Ashman, Agrin Hilmkil
None of the 6 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (6 no recorded run), measured 2026-11-22; 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/2303.12703.json · badge: /api/ran/2303.12703.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 |
|---|---|---|
| microsoft/causica | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 6 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| AdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("03b0fa1c9bd7973f") How it ranno invocation recorded. |
| ConstrainedAdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("72d4c409f1fb090c") How it ranno invocation recorded. |
| LaggedAdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("4317bc976673cbd1") How it ranno invocation recorded. |
| LaggedConstrainedAdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("9e07309f7d2ec732") How it ranno invocation recorded. |
| TemporalAdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("fcec9dc288b9be7f") How it ranno invocation recorded. |
| TemporalConstrainedAdjacencyDistribution | Not yet run unverified (harvested, no recorded run) |
microsoft/causica/src/causica/distributions/adjacency/constrained_adjacency_distributions.py code served (permissive licence) · get_code("aef77bba1fa257d7") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 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 6 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.
Latent confounding has been a long-standing obstacle for causal reasoning from observational data. One popular approach is to model the data using acyclic directed mixed graphs (ADMGs), which describe ancestral relations between variables using directed and bidirected edges. However, existing methods using AD-MGs are based on either linear functional assumptions or a discrete search that is complicated to use and lacks computational tractability for large datasets. In this work, we further extend the existing body of work and develop a novel gradientbased approach to learning an ADMG with non-linear functional relations from observational data. We first show that the presence of latent confounding is identifiable under the assumptions of bow-free ADMGs with non-linear additive noise models. With this insight, we propose a novel neural causal model based on autoregressive flows for ADMG learning. This not only enables us to determine complex causal structural relationships behind the data in the presence of latent confounding, but also estimate their functional relationships (hence treatment effects) simultaneously. We further validate our approach via experiments on both synthetic and real-world datasets, and demonstrate the competitive performance against relevant baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2303.12703")
get_code_for_paper("2303.12703")
have("2303.12703")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2303.12703.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2303.12703)
Connect an agent — have() is free.