{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SROTDUYWK52UISIR6AVBG4GE6I","short_pith_number":"pith:SROTDUYW","schema_version":"1.0","canonical_sha256":"945d31d3165775444911f02a1370c4f20c3be1583feb4e4db17775ce776984f9","source":{"kind":"arxiv","id":"1206.5247","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5247","created_at":"2026-05-18T03:52:40.956170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5247v1","created_at":"2026-05-18T03:52:40.956170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5247","created_at":"2026-05-18T03:52:40.956170+00:00"},{"alias_kind":"pith_short_12","alias_value":"SROTDUYWK52U","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SROTDUYWK52UISIR","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SROTDUYW","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I","json":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I.json","graph_json":"https://pith.science/api/pith-number/SROTDUYWK52UISIR6AVBG4GE6I/graph.json","events_json":"https://pith.science/api/pith-number/SROTDUYWK52UISIR6AVBG4GE6I/events.json","paper":"https://pith.science/paper/SROTDUYW"},"agent_actions":{"view_html":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I","download_json":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I.json","view_paper":"https://pith.science/paper/SROTDUYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5247&json=true","fetch_graph":"https://pith.science/api/pith-number/SROTDUYWK52UISIR6AVBG4GE6I/graph.json","fetch_events":"https://pith.science/api/pith-number/SROTDUYWK52UISIR6AVBG4GE6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/action/storage_attestation","attest_author":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/action/author_attestation","sign_citation":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/action/citation_signature","submit_replication":"https://pith.science/pith/SROTDUYWK52UISIR6AVBG4GE6I/action/replication_record"}},"created_at":"2026-05-18T03:52:40.956170+00:00","updated_at":"2026-05-18T03:52:40.956170+00:00"}