{"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-acyclic","entry":"is_acyclic","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":7,"n_places_pointer_only":1,"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":4,"ran_draft_wrong":0,"ran_fixture":0,"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":"2605.17465","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17465","title":"TriOpt: A Scalable Algorithm for Linear Causal Discovery","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"E2real/CaPS","path":"utils.py","file_url":"https://github.com/E2real/CaPS/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":"fa44e114ab9d2bcf","code_sha256_prefix":"fa44e114ab9d2bcf","mcp_get_code":{"code_sha256":"fa44e114ab9d2bcf"}},{"arxiv_id":"2602.01483","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01483","title":"Causal Preference Elicitation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"csiro-funml/CaPE","path":"inference/candidate_selection.py","file_url":"https://github.com/csiro-funml/CaPE/blob/HEAD/inference/candidate_selection.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7911aa671a0408c5","code_sha256_prefix":"7911aa671a0408c5","mcp_get_code":{"code_sha256":"7911aa671a0408c5"}},{"arxiv_id":"2410.13054","arxiv_id_is_arxiv":true,"paper":"/paper/systems-with-switching-causal-relations-a","title":"Systems with Switching Causal Relations: A Meta-Causal Perspective","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MoritzWillig/metaCausalModels","path":"metaCausal/graph_sampling.py","file_url":"https://github.com/MoritzWillig/metaCausalModels/blob/HEAD/metaCausal/graph_sampling.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39aa124e0bda586c","code_sha256_prefix":"39aa124e0bda586c","mcp_get_code":{"code_sha256":"39aa124e0bda586c"}},{"arxiv_id":"2303.03187","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-differentiable-causal-discovery-via","title":"Boosting Differentiable Causal Discovery via Adaptive Sample Reweighting","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/rescore","path":"rescore_main.py","file_url":"https://github.com/anzhang314/rescore/blob/HEAD/rescore_main.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be580516aaa670c6","code_sha256_prefix":"be580516aaa670c6","mcp_get_code":{"code_sha256":"be580516aaa670c6"}},{"arxiv_id":"2206.07824","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-differentiable-causal-discovery","title":"Large-Scale Differentiable Causal Discovery of Factor Graphs","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"genentech/dcdfg","path":"dcdfg/utils/dag_optim.py","file_url":"https://github.com/genentech/dcdfg/blob/HEAD/dcdfg/utils/dag_optim.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":"a6e1c78ec030ed50","code_sha256_prefix":"a6e1c78ec030ed50","mcp_get_code":{"code_sha256":"a6e1c78ec030ed50"}},{"arxiv_id":"2107.10703","arxiv_id_is_arxiv":true,"paper":"/paper/typing-assumptions-improve-identification-in","title":"Typing assumptions improve identification in causal discovery","date":"2021-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/typed-dag","path":"typed_pc/tmec.py","file_url":"https://github.com/ElementAI/typed-dag/blob/HEAD/typed_pc/tmec.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":"952bd860820a32d3","code_sha256_prefix":"952bd860820a32d3","mcp_get_code":{"code_sha256":"952bd860820a32d3"}},{"arxiv_id":"1906.02226","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-based-neural-dag-learning","title":"Gradient-Based Neural DAG Learning","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"be580516aaa670c6","code_sha256_prefix":"be580516aaa670c6","mcp_get_code":{"code_sha256":"be580516aaa670c6"}}],"record_sha256":"6b14dfa8a9e7ee28a8fdcdfd5584cf06f5e98aa5d6de1bbff837e1938e0564b7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}