{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SROTDUYWK52UISIR6AVBG4GE6I","short_pith_number":"pith:SROTDUYW","canonical_record":{"source":{"id":"1206.5247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-20T14:54:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2ef08265198d3660a548f988a3556fdfd67b6d4c822d9331e8fe2e495df27575","abstract_canon_sha256":"a90c657c843fe000db9111f1b2a5ab126033ab577f17cbfb16e2ab4d1a8ce807"},"schema_version":"1.0"},"canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","source":{"kind":"arxiv","id":"1206.5247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5247","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5247v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5247","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"SROTDUYWK52U","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SROTDUYWK52UISIR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SROTDUYW","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SROTDUYWK52UISIR6AVBG4GE6I","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-20T14:54:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2ef08265198d3660a548f988a3556fdfd67b6d4c822d9331e8fe2e495df27575","abstract_canon_sha256":"a90c657c843fe000db9111f1b2a5ab126033ab577f17cbfb16e2ab4d1a8ce807"},"schema_version":"1.0"},"canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.956733Z","signature_b64":"uZSpA3o7GLxGekSrtiUAkGZ18eeRs5W+XhyHU79AyovW89um25TQOe9uFLNacgjmDykKKgbTEbqqoMyxT/ufAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","last_reissued_at":"2026-05-18T03:52:40.956063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.956063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5247","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWx5vp4Ftq+BrIAfj2E1C850X2VxTrE3TSHUQquFbxZ9eSKh9JQ3fEhaGVOC4HV8JtFnt0DSSsGzWvCHG7NsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:39:03.107169Z"},"content_sha256":"89bb174cabfae669b9cfc6e8c8a4d80f2f27495da518abe3b64522404256aaf3","schema_version":"1.0","event_id":"sha256:89bb174cabfae669b9cfc6e8c8a4d80f2f27495da518abe3b64522404256aaf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SROTDUYWK52UISIR6AVBG4GE6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian structure learning using dynamic programming and MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Eaton, Kevin Murphy","submitted_at":"2012-06-20T14:54:43Z","abstract_excerpt":"MCMC methods for sampling from the space of DAGs can mix poorly due to the local nature of the proposals that are commonly used. It has been shown that sampling from the space of node orders yields better results [FK03, EW06]. Recently, Koivisto and Sood showed how one can analytically marginalize over orders using dynamic programming (DP) [KS04, Koi06]. Their method computes the exact marginal posterior edge probabilities, thus avoiding the need for MCMC. Unfortunately, there are four drawbacks to the DP technique: it can only use modular priors, it can only compute posteriors over modular fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5247","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjBqzof9AbFptCY6daMtHohVyCX77gdiLxOqy0JaNEAOI2ymO/bVDHRjuL778WZx87uLIpKSFZ1tTkgiOY3dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:39:03.107527Z"},"content_sha256":"3dd3349cfd737e639d366d763f2604902118137caf7a0b6f0de8b7e5883d9d7a","schema_version":"1.0","event_id":"sha256:3dd3349cfd737e639d366d763f2604902118137caf7a0b6f0de8b7e5883d9d7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/bundle.json","state_url":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SROTDUYWK52UISIR6AVBG4GE6I/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-07T14:39:03Z","links":{"resolver":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I","bundle":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/bundle.json","state":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SROTDUYWK52UISIR6AVBG4GE6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SROTDUYWK52UISIR6AVBG4GE6I","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":"a90c657c843fe000db9111f1b2a5ab126033ab577f17cbfb16e2ab4d1a8ce807","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-20T14:54:43Z","title_canon_sha256":"2ef08265198d3660a548f988a3556fdfd67b6d4c822d9331e8fe2e495df27575"},"schema_version":"1.0","source":{"id":"1206.5247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5247","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5247v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5247","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"SROTDUYWK52U","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SROTDUYWK52UISIR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SROTDUYW","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:3dd3349cfd737e639d366d763f2604902118137caf7a0b6f0de8b7e5883d9d7a","target":"graph","created_at":"2026-05-18T03:52:40Z","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":"MCMC methods for sampling from the space of DAGs can mix poorly due to the local nature of the proposals that are commonly used. It has been shown that sampling from the space of node orders yields better results [FK03, EW06]. Recently, Koivisto and Sood showed how one can analytically marginalize over orders using dynamic programming (DP) [KS04, Koi06]. Their method computes the exact marginal posterior edge probabilities, thus avoiding the need for MCMC. Unfortunately, there are four drawbacks to the DP technique: it can only use modular priors, it can only compute posteriors over modular fe","authors_text":"Daniel Eaton, Kevin Murphy","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-20T14:54:43Z","title":"Bayesian structure learning using dynamic programming and MCMC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5247","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:89bb174cabfae669b9cfc6e8c8a4d80f2f27495da518abe3b64522404256aaf3","target":"record","created_at":"2026-05-18T03:52:40Z","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":"a90c657c843fe000db9111f1b2a5ab126033ab577f17cbfb16e2ab4d1a8ce807","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-20T14:54:43Z","title_canon_sha256":"2ef08265198d3660a548f988a3556fdfd67b6d4c822d9331e8fe2e495df27575"},"schema_version":"1.0","source":{"id":"1206.5247","kind":"arxiv","version":1}},"canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","first_computed_at":"2026-05-18T03:52:40.956063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:40.956063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZSpA3o7GLxGekSrtiUAkGZ18eeRs5W+XhyHU79AyovW89um25TQOe9uFLNacgjmDykKKgbTEbqqoMyxT/ufAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:40.956733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89bb174cabfae669b9cfc6e8c8a4d80f2f27495da518abe3b64522404256aaf3","sha256:3dd3349cfd737e639d366d763f2604902118137caf7a0b6f0de8b7e5883d9d7a"],"state_sha256":"b81cb0c5a637a387ad57a8edc05d67455d803b1e1c04207ad01974e0c13f702c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVzp8qnvG0n7+PLsQzw78ooh3H6pIIufQrI/J75bXGHm01OXGyi2Zz8GXEJR6Xfa66lFOCk7ZM6wtfnYlk/dCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:39:03.109420Z","bundle_sha256":"17e6771161e3db7a36a33cdefc48c393266a02580721d81df042ddb05fc11867"}}