SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2406.09177 · ICML · 2024

Scalable and Flexible Causal Discovery with an Efficient Test for Adjacency

Andrew Wilson, Alan Amin

arXiv · PDF · Open in the Atlas

Code that ran

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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 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/2406.09177.json · badge: /api/ran/2406.09177.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
alannawzadamin/dat-graph canonical (classifier label)
classifier basis: census
4 ran · 0 no recorded run
FunctionStatusWhere it lives
compare_mats Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
alannawzadamin/dat-graph/dat_graph/plotting.py
pointer only (licence: NONE) · get_code("a729a544891b83f7")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alannawzadamin/dat-graph when it was checked. 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.

meeks_rules Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
alannawzadamin/dat-graph/dat_graph/graph_ops.py
pointer only (licence: NONE) · get_code("fb2341d14e8b8291")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alannawzadamin/dat-graph when it was checked. 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.

orient_v_structures Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
alannawzadamin/dat-graph/dat_graph/graph_ops.py
pointer only (licence: NONE) · get_code("3ad1dab50e710906")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alannawzadamin/dat-graph when it was checked. 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.

remove_edges_to_dag Ran
ran, honoured the contract we drafted
alannawzadamin/dat-graph/dat_graph/graph_ops.py
pointer only (licence: NONE) · get_code("57d67d61c1fcda0f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alannawzadamin/dat-graph when it was checked. 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.

Also present in other papers' code

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-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

To make accurate predictions, understand mechanisms, and design interventions in systems of many variables, we wish to learn causal graphs from large scale data. Unfortunately the space of all possible causal graphs is enormous so scalably and accurately searching for the best fit to the data is a challenge. In principle we could substantially decrease the search space, or learn the graph entirely, by testing the conditional independence of variables. However, deciding if two variables are adjacent in a causal graph may require an exponential number of tests. Here we build a scalable and flexible method to evaluate if two variables are adjacent in a causal graph, the Differentiable Adjacency Test (DAT). DAT replaces an exponential number of tests with a provably equivalent relaxed problem. It then solves this problem by training two neural networks. We build a graph learning method based on DAT, DAT-Graph, that can also learn from data with interventions. DAT-Graph can learn graphs of 1000 variables with state of the art accuracy. Using the graph learned by DAT-Graph, we also build models that make much more accurate predictions of the effects of interventions on large scale RNA sequencing data.

For agents

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

get_harvested_code_for_paper("2406.09177")
get_code_for_paper("2406.09177")
have("2406.09177")

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

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

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

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

Connect an agent — have() is free.