{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/is-dag","entry":"is_dag","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":5,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2601.10531","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10531","title":"Coarsening Causal DAG Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"juangamella/gnies","path":"gnies/scores/gnies_score.py","file_url":"https://github.com/juangamella/gnies/blob/HEAD/gnies/scores/gnies_score.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0082be59a89f4711","code_sha256_prefix":"0082be59a89f4711","mcp_get_code":{"code_sha256":"0082be59a89f4711"}},{"arxiv_id":"2411.03865","arxiv_id_is_arxiv":true,"paper":"/paper/adasociety-an-adaptive-environment-with","title":"AdaSociety: An Adaptive Environment with Social Structures for Multi-Agent Decision-Making","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigai-ai/AdaSociety","path":"cal_oracle.py","file_url":"https://github.com/bigai-ai/AdaSociety/blob/HEAD/cal_oracle.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, bigai-ai/AdaSociety (NOASSERTION)","code_sha256":"b9ed603f9906d216","code_sha256_prefix":"b9ed603f9906d216","mcp_get_code":{"code_sha256":"b9ed603f9906d216"}},{"arxiv_id":"2410.23862","arxiv_id_is_arxiv":true,"paper":"/paper/ps-dag-projected-stochastic-approximation","title":"$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kz29/-psiDAG","path":"utils.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"849e07492ff99bf0","code_sha256_prefix":"849e07492ff99bf0","mcp_get_code":{"code_sha256":"849e07492ff99bf0"}},{"arxiv_id":"2407.06015","arxiv_id_is_arxiv":true,"paper":"/paper/simulation-based-benchmarking-for-causal","title":"Simulation-based Benchmarking for Causal Structure Learning in Gene Perturbation Experiments","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luka-kovacevic/causalregnet","path":"causalregnet/utils.py","file_url":"https://github.com/luka-kovacevic/causalregnet/blob/HEAD/causalregnet/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jeroenbe/d-struct, and GitHub detected no licence in that repository when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2403.14843","arxiv_id_is_arxiv":true,"paper":"/paper/local-causal-discovery-with-linear-non","title":"Local Causal Discovery with Linear non-Gaussian Cyclic Models","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markdana/local-ling-discovery","path":"utils/graph.py","file_url":"https://github.com/markdana/local-ling-discovery/blob/HEAD/utils/graph.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c1bf98579e1564c","code_sha256_prefix":"3c1bf98579e1564c","mcp_get_code":{"code_sha256":"3c1bf98579e1564c"}},{"arxiv_id":"2402.01207","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-causal-graph-discovery-using-large","title":"Efficient Causal Graph Discovery Using Large Language Models","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"superkaiba/causal-llm-bfs","path":"utils.py","file_url":"https://github.com/superkaiba/causal-llm-bfs/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, superkaiba/causal-llm-bfs when it was checked","code_sha256":"5bd72185d3deeffe","code_sha256_prefix":"5bd72185d3deeffe","mcp_get_code":{"code_sha256":"5bd72185d3deeffe"}},{"arxiv_id":"2310.16981","arxiv_id_is_arxiv":true,"paper":"/paper/reimagining-synthetic-tabular-data-generation-1","title":"Reimagining Synthetic Tabular Data Generation through Data-Centric AI: A Comprehensive Benchmark","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLasse/data-centric-synthetic-data","path":"src/data_centric_synth/causal_discovery/dagma.py","file_url":"https://github.com/HLasse/data-centric-synthetic-data/blob/HEAD/src/data_centric_synth/causal_discovery/dagma.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jeroenbe/d-struct, and GitHub detected no licence in that repository when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2302.03178","arxiv_id_is_arxiv":true,"paper":"/paper/nonlinear-causal-discovery-with-confounders","title":"Nonlinear Causal Discovery with Confounders","date":null,"month_inferred_from_arxiv_id":"2023-02","title_source":"archive","repo":"chunlinli/defuse","path":"defuse/utils.py","file_url":"https://github.com/chunlinli/defuse/blob/HEAD/defuse/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jeroenbe/d-struct, and GitHub detected no licence in that repository when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2209.08037","arxiv_id_is_arxiv":true,"paper":"/paper/dagma-learning-dags-via-m-matrices-and-a-log","title":"DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samiatto/colide","path":"utils.py","file_url":"https://github.com/samiatto/colide/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"935903491a9e59b4","code_sha256_prefix":"935903491a9e59b4","mcp_get_code":{"code_sha256":"935903491a9e59b4"}},{"arxiv_id":"2206.06354","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-and-transportable-structure","title":"Differentiable and Transportable Structure Learning","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeroenbe/d-struct","path":"src/dstruct.py","file_url":"https://github.com/jeroenbe/d-struct/blob/HEAD/src/dstruct.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jeroenbe/d-struct when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2110.09356","arxiv_id_is_arxiv":true,"paper":"/paper/towards-federated-bayesian-network-structure","title":"Towards Federated Bayesian Network Structure Learning with Continuous Optimization","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignavierng/notears-admm","path":"notears_admm/utils.py","file_url":"https://github.com/ignavierng/notears-admm/blob/HEAD/notears_admm/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jeroenbe/d-struct, and GitHub detected no licence in that repository when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2106.01474","arxiv_id_is_arxiv":true,"paper":"/paper/testing-directed-acyclic-graph-via-structural","title":"Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunzhe-zhou/sugar","path":"SUGAR/utils.py","file_url":"https://github.com/yunzhe-zhou/sugar/blob/HEAD/SUGAR/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jeroenbe/d-struct, and GitHub detected no licence in that repository when it was checked","code_sha256":"786b48473c9f4aec","code_sha256_prefix":"786b48473c9f4aec","mcp_get_code":{"code_sha256":"786b48473c9f4aec"}},{"arxiv_id":"2006.10201","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-role-of-sparsity-and-dag-constraints","title":"On the Role of Sparsity and DAG Constraints for Learning Linear DAGs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignavier/golem","path":"src/utils/utils.py","file_url":"https://github.com/ignavier/golem/blob/HEAD/src/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e4f1aef57de46e20","code_sha256_prefix":"e4f1aef57de46e20","mcp_get_code":{"code_sha256":"e4f1aef57de46e20"}}],"record_sha256":"6f0b18f485ea90971cc7fbaf4b95d4328fbcf96fa8ebac9970e4e9c65d67e611","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}