{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5Q23XJO4ENI7P2Y3MF6DISEBGY","short_pith_number":"pith:5Q23XJO4","schema_version":"1.0","canonical_sha256":"ec35bba5dc2351f7eb1b617c3448813635cf9327c183abc16b4dd2b946add3dc","source":{"kind":"arxiv","id":"2111.04095","version":2},"attestation_state":"computed","paper":{"title":"Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gal Novik, Raanan Y. Rohekar, Shami Nisimov, Yaniv Gurwicz","submitted_at":"2021-11-07T14:04:46Z","abstract_excerpt":"We present a sound and complete algorithm, called iterative causal discovery (ICD), for recovering causal graphs in the presence of latent confounders and selection bias. ICD relies on the causal Markov and faithfulness assumptions and recovers the equivalence class of the underlying causal graph. It starts with a complete graph, and consists of a single iterative stage that gradually refines this graph by identifying conditional independence (CI) between connected nodes. Independence and causal relations entailed after any iteration are correct, rendering ICD anytime. Essentially, we tie the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.04095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-07T14:04:46Z","cross_cats_sorted":["cs.AI","stat.ME","stat.ML"],"title_canon_sha256":"0b738473408814f9906580ad59013d150735b5474b4dab0d9cd5030552b0fc7b","abstract_canon_sha256":"a57ed1bafb3946e5d1db21ffc9b23838bb2c10d385bc7cf6672f8a10e08ce7af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:46.911706Z","signature_b64":"phIa23QY1s+4iOvD3ThZ/GE6nVd4Ny6qAlzwbH/rCanicstBfeL4EoJxtNla3oHkhAEHBLNYlX4xylGriTHuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec35bba5dc2351f7eb1b617c3448813635cf9327c183abc16b4dd2b946add3dc","last_reissued_at":"2026-07-05T03:48:46.911275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:46.911275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gal Novik, Raanan Y. Rohekar, Shami Nisimov, Yaniv Gurwicz","submitted_at":"2021-11-07T14:04:46Z","abstract_excerpt":"We present a sound and complete algorithm, called iterative causal discovery (ICD), for recovering causal graphs in the presence of latent confounders and selection bias. ICD relies on the causal Markov and faithfulness assumptions and recovers the equivalence class of the underlying causal graph. It starts with a complete graph, and consists of a single iterative stage that gradually refines this graph by identifying conditional independence (CI) between connected nodes. Independence and causal relations entailed after any iteration are correct, rendering ICD anytime. Essentially, we tie the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04095","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.04095/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.04095","created_at":"2026-07-05T03:48:46.911335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04095v2","created_at":"2026-07-05T03:48:46.911335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04095","created_at":"2026-07-05T03:48:46.911335+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q23XJO4ENI7","created_at":"2026-07-05T03:48:46.911335+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q23XJO4ENI7P2Y3","created_at":"2026-07-05T03:48:46.911335+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q23XJO4","created_at":"2026-07-05T03:48:46.911335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13430","citing_title":"Towards a holistic understanding of Selection Bias for Causal Effect Identification","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY","json":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY.json","graph_json":"https://pith.science/api/pith-number/5Q23XJO4ENI7P2Y3MF6DISEBGY/graph.json","events_json":"https://pith.science/api/pith-number/5Q23XJO4ENI7P2Y3MF6DISEBGY/events.json","paper":"https://pith.science/paper/5Q23XJO4"},"agent_actions":{"view_html":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY","download_json":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY.json","view_paper":"https://pith.science/paper/5Q23XJO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04095&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q23XJO4ENI7P2Y3MF6DISEBGY/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q23XJO4ENI7P2Y3MF6DISEBGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY/action/storage_attestation","attest_author":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY/action/author_attestation","sign_citation":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY/action/citation_signature","submit_replication":"https://pith.science/pith/5Q23XJO4ENI7P2Y3MF6DISEBGY/action/replication_record"}},"created_at":"2026-07-05T03:48:46.911335+00:00","updated_at":"2026-07-05T03:48:46.911335+00:00"}