{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LP37CFJKTXCKP7XP3ZACZSCWB5","short_pith_number":"pith:LP37CFJK","schema_version":"1.0","canonical_sha256":"5bf7f1152a9dc4a7feefde402cc8560f5497ace9d88d64a29dedcf2d22ccfc55","source":{"kind":"arxiv","id":"1301.3156","version":1},"attestation_state":"computed","paper":{"title":"A remarkably simple and accurate method for computing the Bayes Factor from a Markov chain Monte Carlo Simulation of the Posterior Distribution in high dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"astro-ph.IM","authors_text":"Ilsang Yoon, Martin D. Weinberg, Neal Katz","submitted_at":"2013-01-14T21:10:59Z","abstract_excerpt":"Weinberg (2012) described a constructive algorithm for computing the marginal likelihood, Z, from a Markov chain simulation of the posterior distribution. Its key point is: the choice of an integration subdomain that eliminates subvolumes with poor sampling owing to low tail-values of posterior probability. Conversely, this same idea may be used to choose the subdomain that optimizes the accuracy of Z. Here, we explore using the simulated distribution to define a small region of high posterior probability, followed by a numerical integration of the sample in the selected region using the volum"},"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":"1301.3156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-01-14T21:10:59Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"cd5617dabe1f09bfa7124acab216cbaa9ddff69dde38c45b5a5fd40d8d1b264d","abstract_canon_sha256":"d75f62fa450d4a5ee8bc73315418b928dfac519da9917e247a7dc349e5b468a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:26.348546Z","signature_b64":"kaCX0NchBKO/66ti51mx7TKq+58kruvc6oiGJATLN+pNWduLHx1c/pUE70jZzkscf+0Idkts1pobDxAz7oIiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf7f1152a9dc4a7feefde402cc8560f5497ace9d88d64a29dedcf2d22ccfc55","last_reissued_at":"2026-05-18T03:36:26.348100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:26.348100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A remarkably simple and accurate method for computing the Bayes Factor from a Markov chain Monte Carlo Simulation of the Posterior Distribution in high dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"astro-ph.IM","authors_text":"Ilsang Yoon, Martin D. Weinberg, Neal Katz","submitted_at":"2013-01-14T21:10:59Z","abstract_excerpt":"Weinberg (2012) described a constructive algorithm for computing the marginal likelihood, Z, from a Markov chain simulation of the posterior distribution. Its key point is: the choice of an integration subdomain that eliminates subvolumes with poor sampling owing to low tail-values of posterior probability. Conversely, this same idea may be used to choose the subdomain that optimizes the accuracy of Z. Here, we explore using the simulated distribution to define a small region of high posterior probability, followed by a numerical integration of the sample in the selected region using the volum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3156","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":"1301.3156","created_at":"2026-05-18T03:36:26.348155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3156v1","created_at":"2026-05-18T03:36:26.348155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3156","created_at":"2026-05-18T03:36:26.348155+00:00"},{"alias_kind":"pith_short_12","alias_value":"LP37CFJKTXCK","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LP37CFJKTXCKP7XP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LP37CFJK","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1306.2144","citing_title":"Importance Nested Sampling and the MultiNest Algorithm","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5","json":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5.json","graph_json":"https://pith.science/api/pith-number/LP37CFJKTXCKP7XP3ZACZSCWB5/graph.json","events_json":"https://pith.science/api/pith-number/LP37CFJKTXCKP7XP3ZACZSCWB5/events.json","paper":"https://pith.science/paper/LP37CFJK"},"agent_actions":{"view_html":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5","download_json":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5.json","view_paper":"https://pith.science/paper/LP37CFJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3156&json=true","fetch_graph":"https://pith.science/api/pith-number/LP37CFJKTXCKP7XP3ZACZSCWB5/graph.json","fetch_events":"https://pith.science/api/pith-number/LP37CFJKTXCKP7XP3ZACZSCWB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5/action/storage_attestation","attest_author":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5/action/author_attestation","sign_citation":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5/action/citation_signature","submit_replication":"https://pith.science/pith/LP37CFJKTXCKP7XP3ZACZSCWB5/action/replication_record"}},"created_at":"2026-05-18T03:36:26.348155+00:00","updated_at":"2026-05-18T03:36:26.348155+00:00"}