{"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":"/paper/verification-and-search-algorithms-for-causal","title":"Verification and search algorithms for causal DAGs","arxiv_id":"2206.15374","date":"2022-06-30","proceeding":null,"authors":["Davin Choo","Kirankumar Shiragur","Arnab Bhattacharyya"],"abstract":"We study two problems related to recovering causal graphs from interventional data: (i) $\\textit{verification}$, where the task is to check if a purported causal graph is correct, and (ii) $\\textit{search}$, where the task is to recover the correct causal graph. For both, we wish to minimize the number of interventions performed. For the first problem, we give a characterization of a minimal sized set of atomic interventions that is necessary and sufficient to check the correctness of a claimed causal graph. Our characterization uses the notion of $\\textit{covered edges}$, which enables us to obtain simple proofs and also easily reason about earlier known results. We also generalize our results to the settings of bounded size interventions and node-dependent interventional costs. For all the above settings, we provide the first known provable algorithms for efficiently computing (near)-optimal verifying sets on general graphs. For the second problem, we give a simple adaptive algorithm based on graph separators that produces an atomic intervention set which fully orients any essential graph while using $\\mathcal{O}(\\log n)$ times the optimal number of interventions needed to $\\textit{verify}$ (verifying size) the underlying DAG on $n$ vertices. This approximation is tight as $\\textit{any}$ search algorithm on an essential line graph has worst case approximation ratio of $\\Omega(\\log n)$ with respect to the verifying size. With bounded size interventions, each of size $\\leq k$, our algorithm gives an $\\mathcal{O}(\\log n \\cdot \\log k)$ factor approximation. Our result is the first known algorithm that gives a non-trivial approximation guarantee to the verifying size on general unweighted graphs and with bounded size interventions.","url_abs":"https://arxiv.org/abs/2206.15374v2","url_pdf":"https://arxiv.org/pdf/2206.15374v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"verification-and-search-algorithms-for-causal","repo_url":"https://github.com/cxjdavin/verification-and-search-algorithms-for-causal-dags","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"verification-and-search-algorithms-for-causal","repo_url":"https://github.com/cxjdavin/active-causal-structure-learning-with-advice","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"verification-and-search-algorithms-for-causal","repo_url":"https://github.com/cxjdavin/adaptivity-complexity-for-causal-graph-discovery","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"verification-and-search-algorithms-for-causal","repo_url":"https://github.com/cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.15374","atlas_url":"https://app.syntology.ai/?focus=2206.15374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15374"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.15374"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.15374"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.15374\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2206.15374"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2206.15374\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2206.15374"},"call":"get_concepts_for_paper(arxiv_id=\"2206.15374\")"}],"by_repo":[{"repo":"cxjdavin/verification-and-search-algorithms-for-causal-dags","kind":"official","samples":3,"ran":3,"instrument":3,"unverified":0},{"repo":"cxjdavin/active-causal-structure-learning-with-advice","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"cxjdavin/adaptivity-complexity-for-causal-graph-discovery","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2306.05781"],"harvested_for_calls":[{"arxiv_id":"2306.05781","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.05781"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.05781\")"}]},{"repo":"cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","kind":"listed","samples":3,"ran":2,"instrument":1,"unverified":1,"placed_by_identical_code":3}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2206.15374.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2206.15374.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cxjdavin/adaptivity-complexity-for-causal-graph-discovery","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cxjdavin/verification-and-search-algorithms-for-causal-dags","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cxjdavin/active-causal-structure-learning-with-advice","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","reach":null}],"summary":{"ran_draft_wrong":4,"ran_honours":1,"unverified":1},"n_samples":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":3,"ran":3,"n_ran_checked":0,"n_instrument":3,"repositories":1},"listed":{"samples":3,"ran":2,"n_ran_checked":1,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"59fa4f921007e606","code_sha256_prefix":"59fa4f921007e606","entry":"compute_covered_edges","repo":"cxjdavin/verification-and-search-algorithms-for-causal-dags","repo_kind":"official","path":"our_code/verify.py","file_url":"https://github.com/cxjdavin/verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/verify.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"G:DiGraph/0/?","fixture_out_type":"set","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"59fa4f921007e606"}},{"code_sha256":"cd77c6a358553aea","code_sha256_prefix":"cd77c6a358553aea","entry":"compute_minimum_vertex_cover","repo":"cxjdavin/verification-and-search-algorithms-for-causal-dags","repo_kind":"official","path":"our_code/verify.py","file_url":"https://github.com/cxjdavin/verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/verify.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"H:Graph/0/?","fixture_out_type":"set","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cd77c6a358553aea"}},{"code_sha256":"240897eb9d12e903","code_sha256_prefix":"240897eb9d12e903","entry":"get_adj_list","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"G:Graph/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"placed_by_identical_code":{"repo":"cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","path":"our_code/subset_verify.py","file_url":"https://github.com/cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/subset_verify.py","papers":["2301.03180"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"240897eb9d12e903"}},{"code_sha256":"f48242a57f021060","code_sha256_prefix":"f48242a57f021060","entry":"is_vertex_cover","repo":"cxjdavin/verification-and-search-algorithms-for-causal-dags","repo_kind":"official","path":"our_code/verify.py","file_url":"https://github.com/cxjdavin/verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/verify.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"G:Graph/0/?, vc:set/0/?","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f48242a57f021060"}},{"code_sha256":"df94980154fcbc1c","code_sha256_prefix":"df94980154fcbc1c","entry":"verification","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"placed_by_identical_code":{"repo":"cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","path":"our_code/subset_verify.py","file_url":"https://github.com/cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/subset_verify.py","papers":["2301.03180"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"df94980154fcbc1c"}},{"code_sha256":"3f45d429b6f29f13","code_sha256_prefix":"3f45d429b6f29f13","entry":"compute_minimum_vertex_cover","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"cxjdavin/subset-verification-and-search-algorithms-for-causal-dags","path":"our_code/subset_verify.py","file_url":"https://github.com/cxjdavin/subset-verification-and-search-algorithms-for-causal-dags/blob/HEAD/our_code/subset_verify.py","papers":["2301.03180"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"3f45d429b6f29f13"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"35ca0a3e4e924955caf1c91e4b6e4f8ae05c29c75cdad970ad2187efe269b284","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}