{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B5IBKUKOUDY23Q4DD26ZL7KVFN","short_pith_number":"pith:B5IBKUKO","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"},"canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","source":{"kind":"arxiv","id":"1309.6824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6824","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6824v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6824","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"B5IBKUKOUDY2","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5IBKUKOUDY23Q4D","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5IBKUKO","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B5IBKUKOUDY23Q4DD26ZL7KVFN","target":"record","payload":{"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"},"canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","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"},"source_kind":"arxiv","source_id":"1309.6824","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKMJ+veyMrbpTvGdLJTnUsRJkbgVdjmu+v1IGhxXaJlQdWR/w9mjgyt7jhXBKyIQWJn5w9UNAPd3U5nzouUlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:48:16.182966Z"},"content_sha256":"71773dec27f79b0101dd4c8599d6310a707a2c7b0ca34e2117ebef2bab2623ca","schema_version":"1.0","event_id":"sha256:71773dec27f79b0101dd4c8599d6310a707a2c7b0ca34e2117ebef2bab2623ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B5IBKUKOUDY23Q4DD26ZL7KVFN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVmczk14CbARZlC5o6g70M6EokgutJ34iJg/8rryr+22LWFtUm2cFOjL5GfVASqL1O8DhzGFlHQBYKPp8tLCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:48:16.183649Z"},"content_sha256":"337d19406c076a97d376cab2ae251f308d89cb61765f974afac537444b80b103","schema_version":"1.0","event_id":"sha256:337d19406c076a97d376cab2ae251f308d89cb61765f974afac537444b80b103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/bundle.json","state_url":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T21:48:16Z","links":{"resolver":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN","bundle":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/bundle.json","state":"https://pith.science/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5IBKUKOUDY23Q4DD26ZL7KVFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B5IBKUKOUDY23Q4DD26ZL7KVFN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"20630530d94cc172bccf70d9c03be43a3fab9c29c06d0a10307e9537b150369a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:36:47Z","title_canon_sha256":"d013625f0872d80ab03deea6ef251942de17dd28261b8ec5538084d611313ebe"},"schema_version":"1.0","source":{"id":"1309.6824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6824","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6824v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6824","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"B5IBKUKOUDY2","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5IBKUKOUDY23Q4D","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5IBKUKO","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:337d19406c076a97d376cab2ae251f308d89cb61765f974afac537444b80b103","target":"graph","created_at":"2026-05-18T03:12:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Joris Mooij, Tom Claassen, Tom Heskes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:36:47Z","title":"Learning Sparse Causal Models is not NP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6824","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71773dec27f79b0101dd4c8599d6310a707a2c7b0ca34e2117ebef2bab2623ca","target":"record","created_at":"2026-05-18T03:12:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"20630530d94cc172bccf70d9c03be43a3fab9c29c06d0a10307e9537b150369a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:36:47Z","title_canon_sha256":"d013625f0872d80ab03deea6ef251942de17dd28261b8ec5538084d611313ebe"},"schema_version":"1.0","source":{"id":"1309.6824","kind":"arxiv","version":1}},"canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f5015514ea0f1adc3831ebd95fd552b609de06eadd0737920c94e75722b69cd","first_computed_at":"2026-05-18T03:12:10.309654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.309654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zoKGtZe59JWHTNZKOhFlhciKsVj2BRHOexwvvvDITazcTzGkZ7V+v/GgmkdWHU6bl4UU3HLKPXKcvj6nzqKoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.310537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71773dec27f79b0101dd4c8599d6310a707a2c7b0ca34e2117ebef2bab2623ca","sha256:337d19406c076a97d376cab2ae251f308d89cb61765f974afac537444b80b103"],"state_sha256":"b25ac42445c83b424c9f73e3e5ff3b850c9f3842cf7f3f53115ca67e5dc36af9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fI36/2VR1yAPydYSinqoPV+3bRz5N9H7+kgpsMspOUWeKb1zlxJjJCm8B6pFZrCjiHsLGf5AVJ3i3BRwXRO6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:48:16.186705Z","bundle_sha256":"e93594550a58a4303fe9750913d0e6db5c1d5d99adfd9bdee8974e1fbd3fdd9b"}}