{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:COHWHVYELSORFM4J52QMCHGOWC","short_pith_number":"pith:COHWHVYE","canonical_record":{"source":{"id":"1408.1664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T17:40:36Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"f08d363bd7d6632de779a7fb8de97c07cdd35fa8902b3f70ba17a497cacb800e","abstract_canon_sha256":"576900979821ba6db01adbccf0993066aec739119d4fbbdace713fa17f56a0c6"},"schema_version":"1.0"},"canonical_sha256":"138f63d7045c9d12b389eea0c11cceb092ce63c6eeb7b692aee6d67be32421df","source":{"kind":"arxiv","id":"1408.1664","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1664","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1664v3","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1664","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"COHWHVYELSOR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"COHWHVYELSORFM4J","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"COHWHVYE","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:COHWHVYELSORFM4J52QMCHGOWC","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T17:40:36Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"f08d363bd7d6632de779a7fb8de97c07cdd35fa8902b3f70ba17a497cacb800e","abstract_canon_sha256":"576900979821ba6db01adbccf0993066aec739119d4fbbdace713fa17f56a0c6"},"schema_version":"1.0"},"canonical_sha256":"138f63d7045c9d12b389eea0c11cceb092ce63c6eeb7b692aee6d67be32421df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:07.233310Z","signature_b64":"LVY/aJU/vzSluyllv2aVZDEMoPVh2o0N50p6LHmdCk4yUntNmqKlb2Qe22VblhjEPNhS1ShkU6unn7bFp58kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"138f63d7045c9d12b389eea0c11cceb092ce63c6eeb7b692aee6d67be32421df","last_reissued_at":"2026-05-18T01:09:07.232803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:07.232803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1664","source_version":3,"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hG+KGkQfUa1IcbdbGrrKJ5MUn2Y30kaJeebl7+lVAxfFBaulvC1eUP53L/qJhMDh4ux9Xn5JiZKr7ZJoXJ7iCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:27:32.229908Z"},"content_sha256":"21dc18595c9914e346cbcaee0a8f99b55ece08a8d6db97b9c1a7a0f13d3bb41f","schema_version":"1.0","event_id":"sha256:21dc18595c9914e346cbcaee0a8f99b55ece08a8d6db97b9c1a7a0f13d3bb41f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:COHWHVYELSORFM4J52QMCHGOWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Algorithm for Exact Bayesian Structure Discovery in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.AI","authors_text":"Jin Tian, Olga Nikolova, Srinivas Aluru, Yetian Chen","submitted_at":"2014-08-07T17:40:36Z","abstract_excerpt":"Exact Bayesian structure discovery in Bayesian networks requires exponential time and space. Using dynamic programming (DP), the fastest known sequential algorithm computes the exact posterior probabilities of structural features in $O(2(d+1)n2^n)$ time and space, if the number of nodes (variables) in the Bayesian network is $n$ and the in-degree (the number of parents) per node is bounded by a constant $d$. Here we present a parallel algorithm capable of computing the exact posterior probabilities for all $n(n-1)$ edges with optimal parallel space efficiency and nearly optimal parallel time e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1664","kind":"arxiv","version":3},"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQFocM1CY5BIF1ghYkRSFq+5X0SmxYb6r/iRIXFfAzBG0VXAT3eggb6p4k1ZMXwVf36vW/JWmuPuO81/rQK7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:27:32.230396Z"},"content_sha256":"8ecbe12d017b3f6c0f4aefe43864d992afc339e87c90c2127fa49fe58532555f","schema_version":"1.0","event_id":"sha256:8ecbe12d017b3f6c0f4aefe43864d992afc339e87c90c2127fa49fe58532555f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COHWHVYELSORFM4J52QMCHGOWC/bundle.json","state_url":"https://pith.science/pith/COHWHVYELSORFM4J52QMCHGOWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COHWHVYELSORFM4J52QMCHGOWC/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-08-21T11:27:32Z","links":{"resolver":"https://pith.science/pith/COHWHVYELSORFM4J52QMCHGOWC","bundle":"https://pith.science/pith/COHWHVYELSORFM4J52QMCHGOWC/bundle.json","state":"https://pith.science/pith/COHWHVYELSORFM4J52QMCHGOWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COHWHVYELSORFM4J52QMCHGOWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:COHWHVYELSORFM4J52QMCHGOWC","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":"576900979821ba6db01adbccf0993066aec739119d4fbbdace713fa17f56a0c6","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T17:40:36Z","title_canon_sha256":"f08d363bd7d6632de779a7fb8de97c07cdd35fa8902b3f70ba17a497cacb800e"},"schema_version":"1.0","source":{"id":"1408.1664","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1664","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1664v3","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1664","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"COHWHVYELSOR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"COHWHVYELSORFM4J","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"COHWHVYE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:8ecbe12d017b3f6c0f4aefe43864d992afc339e87c90c2127fa49fe58532555f","target":"graph","created_at":"2026-05-18T01:09:07Z","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":"Exact Bayesian structure discovery in Bayesian networks requires exponential time and space. Using dynamic programming (DP), the fastest known sequential algorithm computes the exact posterior probabilities of structural features in $O(2(d+1)n2^n)$ time and space, if the number of nodes (variables) in the Bayesian network is $n$ and the in-degree (the number of parents) per node is bounded by a constant $d$. Here we present a parallel algorithm capable of computing the exact posterior probabilities for all $n(n-1)$ edges with optimal parallel space efficiency and nearly optimal parallel time e","authors_text":"Jin Tian, Olga Nikolova, Srinivas Aluru, Yetian Chen","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T17:40:36Z","title":"A Parallel Algorithm for Exact Bayesian Structure Discovery in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1664","kind":"arxiv","version":3},"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:21dc18595c9914e346cbcaee0a8f99b55ece08a8d6db97b9c1a7a0f13d3bb41f","target":"record","created_at":"2026-05-18T01:09:07Z","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":"576900979821ba6db01adbccf0993066aec739119d4fbbdace713fa17f56a0c6","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-07T17:40:36Z","title_canon_sha256":"f08d363bd7d6632de779a7fb8de97c07cdd35fa8902b3f70ba17a497cacb800e"},"schema_version":"1.0","source":{"id":"1408.1664","kind":"arxiv","version":3}},"canonical_sha256":"138f63d7045c9d12b389eea0c11cceb092ce63c6eeb7b692aee6d67be32421df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"138f63d7045c9d12b389eea0c11cceb092ce63c6eeb7b692aee6d67be32421df","first_computed_at":"2026-05-18T01:09:07.232803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:07.232803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVY/aJU/vzSluyllv2aVZDEMoPVh2o0N50p6LHmdCk4yUntNmqKlb2Qe22VblhjEPNhS1ShkU6unn7bFp58kDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:07.233310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1664","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21dc18595c9914e346cbcaee0a8f99b55ece08a8d6db97b9c1a7a0f13d3bb41f","sha256:8ecbe12d017b3f6c0f4aefe43864d992afc339e87c90c2127fa49fe58532555f"],"state_sha256":"35dc318c07e3abc9b372133f2422001937a132833f6c0a3ada1392b731f376e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63tcmoQTwIJy+8jZsxtux0nT5Ga6RYo59kc8zq3XHMfxhknRx/GSyyntTi1J1CeDW6WTDVAnlFJLi+fWIad8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T11:27:32.235324Z","bundle_sha256":"801c4cc33f02b9a25e5f3ab368f57a2ce5ab0e3d56096bb9d51ebc5daf2cfe44"}}