{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4EWPGX7DL4JJTG2WYAMTGUDEM2","short_pith_number":"pith:4EWPGX7D","schema_version":"1.0","canonical_sha256":"e12cf35fe35f12999b56c019335064669ea18248ca618429ca0dd71f72ccef4d","source":{"kind":"arxiv","id":"1309.6843","version":1},"attestation_state":"computed","paper":{"title":"A Sound and Complete Algorithm for Learning Causal Models from Relational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Arbour, David Jensen, Katerina Marazopoulou, Marc Maier","submitted_at":"2013-09-26T12:43:12Z","abstract_excerpt":"The PC algorithm learns maximally oriented causal Bayesian networks. However, there is no equivalent complete algorithm for learning the structure of relational models, a more expressive generalization of Bayesian networks. Recent developments in the theory and representation of relational models support lifted reasoning about conditional independence. This enables a powerful constraint for orienting bivariate dependencies and forms the basis of a new algorithm for learning structure. We present the relational causal discovery (RCD) algorithm that learns causal relational models. We prove that"},"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":"1309.6843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"918ff613c9ebb998b3ff27e95dfae7fbe3674d0c37cce4d563a76e0fcb012f7b","abstract_canon_sha256":"65c4959dbdb9e4a97256ad1b0012d79a70c58b828538f451d6c1d0b5c8662266"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.147534Z","signature_b64":"Y0RsdbSXcSSHmEOidR/NPmGH4S/gt9VqQR2Y2gK2pfS/kaWd4824J61HWM8aKgwbdIlUq3f7g0b8VZqqKNNzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e12cf35fe35f12999b56c019335064669ea18248ca618429ca0dd71f72ccef4d","last_reissued_at":"2026-05-18T03:12:10.146860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.146860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sound and Complete Algorithm for Learning Causal Models from Relational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Arbour, David Jensen, Katerina Marazopoulou, Marc Maier","submitted_at":"2013-09-26T12:43:12Z","abstract_excerpt":"The PC algorithm learns maximally oriented causal Bayesian networks. However, there is no equivalent complete algorithm for learning the structure of relational models, a more expressive generalization of Bayesian networks. Recent developments in the theory and representation of relational models support lifted reasoning about conditional independence. This enables a powerful constraint for orienting bivariate dependencies and forms the basis of a new algorithm for learning structure. We present the relational causal discovery (RCD) algorithm that learns causal relational models. We prove that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6843","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":"1309.6843","created_at":"2026-05-18T03:12:10.146977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6843v1","created_at":"2026-05-18T03:12:10.146977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6843","created_at":"2026-05-18T03:12:10.146977+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EWPGX7DL4JJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EWPGX7DL4JJTG2W","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EWPGX7D","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2","json":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2.json","graph_json":"https://pith.science/api/pith-number/4EWPGX7DL4JJTG2WYAMTGUDEM2/graph.json","events_json":"https://pith.science/api/pith-number/4EWPGX7DL4JJTG2WYAMTGUDEM2/events.json","paper":"https://pith.science/paper/4EWPGX7D"},"agent_actions":{"view_html":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2","download_json":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2.json","view_paper":"https://pith.science/paper/4EWPGX7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6843&json=true","fetch_graph":"https://pith.science/api/pith-number/4EWPGX7DL4JJTG2WYAMTGUDEM2/graph.json","fetch_events":"https://pith.science/api/pith-number/4EWPGX7DL4JJTG2WYAMTGUDEM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2/action/storage_attestation","attest_author":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2/action/author_attestation","sign_citation":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2/action/citation_signature","submit_replication":"https://pith.science/pith/4EWPGX7DL4JJTG2WYAMTGUDEM2/action/replication_record"}},"created_at":"2026-05-18T03:12:10.146977+00:00","updated_at":"2026-05-18T03:12:10.146977+00:00"}