{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PI2WNRQWIGFYR6PKHF5CIGYCXH","short_pith_number":"pith:PI2WNRQW","schema_version":"1.0","canonical_sha256":"7a3566c616418b88f9ea397a241b02b9f484269879c931f9d8247a0644dee59d","source":{"kind":"arxiv","id":"1206.6831","version":1},"attestation_state":"computed","paper":{"title":"Pearl's Calculus of Intervention Is Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Valtorta, Yimin Huang","submitted_at":"2012-06-27T16:17:19Z","abstract_excerpt":"This paper is concerned with graphical criteria that can be used to solve the problem of identifying casual effects from nonexperimental data in a causal Bayesian network structure, i.e., a directed acyclic graph that represents causal relationships. We first review Pearl's work on this topic [Pearl, 1995], in which several useful graphical criteria are presented. Then we present a complete algorithm [Huang and Valtorta, 2006b] for the identifiability problem. By exploiting the completeness of this algorithm, we prove that the three basic do-calculus rules that Pearl presents are complete, in "},"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":"1206.6831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:17:19Z","cross_cats_sorted":[],"title_canon_sha256":"bb71dc93455603ef1af17d1fd26b2dd984b7b2684c4c228aebed59a3b053b72e","abstract_canon_sha256":"35ecf7be9cb35ed5b6db5b5bb3436eff14ae534e513270aec6654fb1316f2d2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.732597Z","signature_b64":"qVWvoZf78pkHAUHHGOgqi6qFu5RT1TF+TdrVBa1oj0Zduzzv7kI2aLeZXGeTWqJAAjh9PtEBPruSBjQXsEqHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3566c616418b88f9ea397a241b02b9f484269879c931f9d8247a0644dee59d","last_reissued_at":"2026-05-18T03:52:15.731917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.731917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pearl's Calculus of Intervention Is Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Valtorta, Yimin Huang","submitted_at":"2012-06-27T16:17:19Z","abstract_excerpt":"This paper is concerned with graphical criteria that can be used to solve the problem of identifying casual effects from nonexperimental data in a causal Bayesian network structure, i.e., a directed acyclic graph that represents causal relationships. We first review Pearl's work on this topic [Pearl, 1995], in which several useful graphical criteria are presented. Then we present a complete algorithm [Huang and Valtorta, 2006b] for the identifiability problem. By exploiting the completeness of this algorithm, we prove that the three basic do-calculus rules that Pearl presents are complete, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6831","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1206.6831","created_at":"2026-05-18T03:52:15.732025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6831v1","created_at":"2026-05-18T03:52:15.732025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6831","created_at":"2026-05-18T03:52:15.732025+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI2WNRQWIGFY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI2WNRQWIGFYR6PK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI2WNRQW","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20007","citing_title":"Identifying Interventional Joint Distributions via Extended Bridge Functions","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01134","citing_title":"To Use AI as Dice of Possibilities with Timing Computation","ref_index":128,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH","json":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH.json","graph_json":"https://pith.science/api/pith-number/PI2WNRQWIGFYR6PKHF5CIGYCXH/graph.json","events_json":"https://pith.science/api/pith-number/PI2WNRQWIGFYR6PKHF5CIGYCXH/events.json","paper":"https://pith.science/paper/PI2WNRQW"},"agent_actions":{"view_html":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH","download_json":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH.json","view_paper":"https://pith.science/paper/PI2WNRQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6831&json=true","fetch_graph":"https://pith.science/api/pith-number/PI2WNRQWIGFYR6PKHF5CIGYCXH/graph.json","fetch_events":"https://pith.science/api/pith-number/PI2WNRQWIGFYR6PKHF5CIGYCXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH/action/storage_attestation","attest_author":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH/action/author_attestation","sign_citation":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH/action/citation_signature","submit_replication":"https://pith.science/pith/PI2WNRQWIGFYR6PKHF5CIGYCXH/action/replication_record"}},"created_at":"2026-05-18T03:52:15.732025+00:00","updated_at":"2026-05-18T03:52:15.732025+00:00"}