{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3VRYBQ5MFPDFRA6PG4FBO7TB4C","short_pith_number":"pith:3VRYBQ5M","schema_version":"1.0","canonical_sha256":"dd6380c3ac2bc65883cf370a177e61e0a11f29448bb737c6ff33c7d3a9937b62","source":{"kind":"arxiv","id":"1206.6848","version":1},"attestation_state":"computed","paper":{"title":"MCMC for doubly-intractable distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"David MacKay, Iain Murray, Zoubin Ghahramani","submitted_at":"2012-06-27T16:23:56Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) algorithms are routinely used to draw samples from distributions with intractable normalization constants. However, standard MCMC algorithms do not apply to doubly-intractable distributions in which there are additional parameter-dependent normalization terms; for example, the posterior over parameters of an undirected graphical model. An ingenious auxiliary-variable scheme (Moeller et al., 2004) offers a solution: exact sampling (Propp and Wilson, 1996) is used to sample from a Metropolis-Hastings proposal for which the acceptance probability is tractable. Unfo"},"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.6848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-06-27T16:23:56Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"52ae5e27d37b3415faa29f23c6c1b31f5d4be908565ba8e1e15165d968cb67c0","abstract_canon_sha256":"3970de940183759a8cf9a9c97757d82957fab00738fbd5e941d358cadd7dc755"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.578210Z","signature_b64":"lXHeoL9VpHyRJhYDoy7YfT98gcgfT6nw8NNcyZAwK1MYj+HqUZMnZNNo3NDIUM37UdrWcXnNtZTRfiTyc2O/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd6380c3ac2bc65883cf370a177e61e0a11f29448bb737c6ff33c7d3a9937b62","last_reissued_at":"2026-05-18T03:52:15.577385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.577385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MCMC for doubly-intractable distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"David MacKay, Iain Murray, Zoubin Ghahramani","submitted_at":"2012-06-27T16:23:56Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) algorithms are routinely used to draw samples from distributions with intractable normalization constants. However, standard MCMC algorithms do not apply to doubly-intractable distributions in which there are additional parameter-dependent normalization terms; for example, the posterior over parameters of an undirected graphical model. An ingenious auxiliary-variable scheme (Moeller et al., 2004) offers a solution: exact sampling (Propp and Wilson, 1996) is used to sample from a Metropolis-Hastings proposal for which the acceptance probability is tractable. Unfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6848","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.6848","created_at":"2026-05-18T03:52:15.577496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6848v1","created_at":"2026-05-18T03:52:15.577496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6848","created_at":"2026-05-18T03:52:15.577496+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VRYBQ5MFPDF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VRYBQ5MFPDFRA6P","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VRYBQ5M","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00771","citing_title":"Penalized Likelihood for Dyadic Network Formation Models with Degree Heterogeneity","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08116","citing_title":"A unifying view of contrastive learning, importance sampling, and bridge sampling for energy-based models","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C","json":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C.json","graph_json":"https://pith.science/api/pith-number/3VRYBQ5MFPDFRA6PG4FBO7TB4C/graph.json","events_json":"https://pith.science/api/pith-number/3VRYBQ5MFPDFRA6PG4FBO7TB4C/events.json","paper":"https://pith.science/paper/3VRYBQ5M"},"agent_actions":{"view_html":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C","download_json":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C.json","view_paper":"https://pith.science/paper/3VRYBQ5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6848&json=true","fetch_graph":"https://pith.science/api/pith-number/3VRYBQ5MFPDFRA6PG4FBO7TB4C/graph.json","fetch_events":"https://pith.science/api/pith-number/3VRYBQ5MFPDFRA6PG4FBO7TB4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C/action/storage_attestation","attest_author":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C/action/author_attestation","sign_citation":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C/action/citation_signature","submit_replication":"https://pith.science/pith/3VRYBQ5MFPDFRA6PG4FBO7TB4C/action/replication_record"}},"created_at":"2026-05-18T03:52:15.577496+00:00","updated_at":"2026-05-18T03:52:15.577496+00:00"}