{"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/notears-linear","entry":"notears_linear","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":9,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":7,"n_places_pointer_only_link_open":0,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2510.12503","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-12503","title":"The robustness of differentiable Causal Discovery in misspecified Scenarios","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"arxiv_id":"2410.06163","arxiv_id_is_arxiv":true,"paper":"/paper/likelihood-based-differentiable-structure","title":"Markov Equivalence and Consistency in Differentiable Structure Learning","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"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":"algs/notears/linear.py","file_url":"https://github.com/superkaiba/causal-llm-bfs/blob/HEAD/algs/notears/linear.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"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":"simulation/Python/notears/notears/linear.py","file_url":"https://github.com/chunlinli/defuse/blob/HEAD/simulation/Python/notears/notears/linear.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"arxiv_id":"2007.09445","arxiv_id_is_arxiv":true,"paper":"/paper/structure-mapping-for-transferability-of","title":"Structure Mapping for Transferability of Causal Models","date":"2020-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"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":"xunzheng/notears","path":"notears/linear.py","file_url":"https://github.com/xunzheng/notears/blob/HEAD/notears/linear.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"arxiv_id":"1909.13189","arxiv_id_is_arxiv":true,"paper":"/paper/learning-sparse-nonparametric-dags","title":"Learning Sparse Nonparametric DAGs","date":"2019-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}},{"arxiv_id":"1803.01422","arxiv_id_is_arxiv":true,"paper":"/paper/dags-with-no-tears-continuous-optimization","title":"DAGs with NO TEARS: Continuous Optimization for Structure Learning","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8121d0e3bc3faff7","code_sha256_prefix":"8121d0e3bc3faff7","mcp_get_code":{"code_sha256":"8121d0e3bc3faff7"}}],"record_sha256":"11d83c613fc8ff11ccbc1ede6d6381040982fb2f0ad80e6f28ca5e0dcb009986","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}