{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EFNLQJP3TRBVRTETVKMKWD3I5Y","short_pith_number":"pith:EFNLQJP3","canonical_record":{"source":{"id":"1205.2620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:30:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ebdc9837f568af0b820458e081d346a0e2b8842781ba4357e9a086ae6fdd4d6","abstract_canon_sha256":"d12d1e1e1b8e7df0f8eeb5fa046a9357f2e21f45766252a6b38cb7852152bec3"},"schema_version":"1.0"},"canonical_sha256":"215ab825fb9c4358cc93aa98ab0f68ee1c17c73845d66132760101276478dae2","source":{"kind":"arxiv","id":"1205.2620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2620","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2620v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2620","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFNLQJP3TRBV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFNLQJP3TRBVRTET","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFNLQJP3","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EFNLQJP3TRBVRTETVKMKWD3I5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:30:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ebdc9837f568af0b820458e081d346a0e2b8842781ba4357e9a086ae6fdd4d6","abstract_canon_sha256":"d12d1e1e1b8e7df0f8eeb5fa046a9357f2e21f45766252a6b38cb7852152bec3"},"schema_version":"1.0"},"canonical_sha256":"215ab825fb9c4358cc93aa98ab0f68ee1c17c73845d66132760101276478dae2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.874062Z","signature_b64":"uXO2FATSW8hTvMQRUeXGfhnijsC9HVnv36BojDPh6OPcl2mqBYDPpnIsQGVrfhXgi/FinJRuI3magNH6pcnlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215ab825fb9c4358cc93aa98ab0f68ee1c17c73845d66132760101276478dae2","last_reissued_at":"2026-05-18T03:55:47.873544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.873544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2620","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dErcXHjWa8dS4AzHaZIwFAszUdwdA/CEMWKaP86cmsWZr7+EqpsJ78+qbsfPwzrkXmthw5ytG/k702n9zMA2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:06:30.937892Z"},"content_sha256":"eb646f3b13ca7e027c6b72fef0f58ae2b60543dcd0a89bf5812bc0124a623270","schema_version":"1.0","event_id":"sha256:eb646f3b13ca7e027c6b72fef0f58ae2b60543dcd0a89bf5812bc0124a623270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EFNLQJP3TRBVRTETVKMKWD3I5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Structure Discovery in Bayesian Networks with Less Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Mikko Koivisto, Pekka Parviainen","submitted_at":"2012-05-09T17:30:15Z","abstract_excerpt":"The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2nnO(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space-time tradeoffs for finding an optimal network structure. When little space is available, we apply the Gurevich-Shelah recurrence-originally proposed for the Hamiltonian path problem-and obtain time 22n-snO(1) in space 2snO(1) for any s = n/2, n/4, n/8, . . .; we assume the indegree of each node is bounded by a constant. For the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2620","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1RaaVHAltDbUSAF+u4HS4xsoNRsYzY7pox4/El19QEeEKZzEyWxPUooTmF1CogsK6d5zKTvPW/m7Qmtk09QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:06:30.938233Z"},"content_sha256":"e7cad3e8da85847c7dcb9d7daf00e8a69b9ff5707925ebf67d19ae1ca0689fd7","schema_version":"1.0","event_id":"sha256:e7cad3e8da85847c7dcb9d7daf00e8a69b9ff5707925ebf67d19ae1ca0689fd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/bundle.json","state_url":"https://pith.science/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/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-06-30T15:06:30Z","links":{"resolver":"https://pith.science/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y","bundle":"https://pith.science/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/bundle.json","state":"https://pith.science/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFNLQJP3TRBVRTETVKMKWD3I5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EFNLQJP3TRBVRTETVKMKWD3I5Y","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":"d12d1e1e1b8e7df0f8eeb5fa046a9357f2e21f45766252a6b38cb7852152bec3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:30:15Z","title_canon_sha256":"5ebdc9837f568af0b820458e081d346a0e2b8842781ba4357e9a086ae6fdd4d6"},"schema_version":"1.0","source":{"id":"1205.2620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2620","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2620v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2620","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFNLQJP3TRBV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFNLQJP3TRBVRTET","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFNLQJP3","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:e7cad3e8da85847c7dcb9d7daf00e8a69b9ff5707925ebf67d19ae1ca0689fd7","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2nnO(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space-time tradeoffs for finding an optimal network structure. When little space is available, we apply the Gurevich-Shelah recurrence-originally proposed for the Hamiltonian path problem-and obtain time 22n-snO(1) in space 2snO(1) for any s = n/2, n/4, n/8, . . .; we assume the indegree of each node is bounded by a constant. For the","authors_text":"Mikko Koivisto, Pekka Parviainen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:30:15Z","title":"Exact Structure Discovery in Bayesian Networks with Less Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2620","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:eb646f3b13ca7e027c6b72fef0f58ae2b60543dcd0a89bf5812bc0124a623270","target":"record","created_at":"2026-05-18T03:55:47Z","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":"d12d1e1e1b8e7df0f8eeb5fa046a9357f2e21f45766252a6b38cb7852152bec3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:30:15Z","title_canon_sha256":"5ebdc9837f568af0b820458e081d346a0e2b8842781ba4357e9a086ae6fdd4d6"},"schema_version":"1.0","source":{"id":"1205.2620","kind":"arxiv","version":1}},"canonical_sha256":"215ab825fb9c4358cc93aa98ab0f68ee1c17c73845d66132760101276478dae2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215ab825fb9c4358cc93aa98ab0f68ee1c17c73845d66132760101276478dae2","first_computed_at":"2026-05-18T03:55:47.873544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.873544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXO2FATSW8hTvMQRUeXGfhnijsC9HVnv36BojDPh6OPcl2mqBYDPpnIsQGVrfhXgi/FinJRuI3magNH6pcnlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.874062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb646f3b13ca7e027c6b72fef0f58ae2b60543dcd0a89bf5812bc0124a623270","sha256:e7cad3e8da85847c7dcb9d7daf00e8a69b9ff5707925ebf67d19ae1ca0689fd7"],"state_sha256":"08b62a75db555b37c05e90a9a8567e0dbf8d3459d9533dd6b9c9c46fdc85a09a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVPbiasvjD5XFIrAD8fxPBlHDpTPNqE0jLoiF3HxMcniJmy+8zFH9U+UnzVNQjtYzxVVSPTJ89yKvN72V5vACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:06:30.940032Z","bundle_sha256":"eba0057d6112758c37235c3cf2d68a544426e83d81e5f4f82107fe0798af6742"}}