{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B5IBKUKOUDY23Q4DD26ZL7KVFN","short_pith_number":"pith:B5IBKUKO","schema_version":"1.0","canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","source":{"kind":"arxiv","id":"1309.6824","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse Causal Models is not NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joris Mooij, Tom Claassen, Tom Heskes","submitted_at":"2013-09-26T12:36:47Z","abstract_excerpt":"This paper shows that causal model discovery is not an NP-hard problem, in the sense that for sparse graphs bounded by node degree k the sound and complete causal model can be obtained in worst case order N^{2(k+2)} independence tests, even when latent variables and selection bias may be present. We present a modification of the well-known FCI algorithm that implements the method for an independence oracle, and suggest improvements for sample/real-world data versions. It does not contradict any known hardness results, and does not solve an NP-hard problem: it just proves that sparse causal dis"},"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.6824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"d013625f0872d80ab03deea6ef251942de17dd28261b8ec5538084d611313ebe","abstract_canon_sha256":"20630530d94cc172bccf70d9c03be43a3fab9c29c06d0a10307e9537b150369a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.310537Z","signature_b64":"zoKGtZe59JWHTNZKOhFlhciKsVj2BRHOexwvvvDITazcTzGkZ7V+v/GgmkdWHU6bl4UU3HLKPXKcvj6nzqKoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","last_reissued_at":"2026-05-18T03:12:10.309654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.309654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Causal Models is not NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joris Mooij, Tom Claassen, Tom Heskes","submitted_at":"2013-09-26T12:36:47Z","abstract_excerpt":"This paper shows that causal model discovery is not an NP-hard problem, in the sense that for sparse graphs bounded by node degree k the sound and complete causal model can be obtained in worst case order N^{2(k+2)} independence tests, even when latent variables and selection bias may be present. We present a modification of the well-known FCI algorithm that implements the method for an independence oracle, and suggest improvements for sample/real-world data versions. It does not contradict any known hardness results, and does not solve an NP-hard problem: it just proves that sparse causal dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6824","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.6824","created_at":"2026-05-18T03:12:10.309801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6824v1","created_at":"2026-05-18T03:12:10.309801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6824","created_at":"2026-05-18T03:12:10.309801+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5IBKUKOUDY2","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5IBKUKOUDY23Q4D","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5IBKUKO","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.20396","citing_title":"Score-Based Causal Discovery of Latent Variable Causal Models","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2510.04378","citing_title":"Score-based Greedy Search for Structure Identification of Partially Observed Linear Causal Models","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN","json":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN.json","graph_json":"https://pith.science/api/pith-number/B5IBKUKOUDY23Q4DD26ZL7KVFN/graph.json","events_json":"https://pith.science/api/pith-number/B5IBKUKOUDY23Q4DD26ZL7KVFN/events.json","paper":"https://pith.science/paper/B5IBKUKO"},"agent_actions":{"view_html":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN","download_json":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN.json","view_paper":"https://pith.science/paper/B5IBKUKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6824&json=true","fetch_graph":"https://pith.science/api/pith-number/B5IBKUKOUDY23Q4DD26ZL7KVFN/graph.json","fetch_events":"https://pith.science/api/pith-number/B5IBKUKOUDY23Q4DD26ZL7KVFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/action/storage_attestation","attest_author":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/action/author_attestation","sign_citation":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/action/citation_signature","submit_replication":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/action/replication_record"}},"created_at":"2026-05-18T03:12:10.309801+00:00","updated_at":"2026-05-18T03:12:10.309801+00:00"}