{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MEEQDFRCDFEUTHBHEAVZMJN4WK","short_pith_number":"pith:MEEQDFRC","schema_version":"1.0","canonical_sha256":"61090196221949499c27202b9625bcb2b960502bc20883d9a99a5c7e15eb1d61","source":{"kind":"arxiv","id":"1503.05621","version":1},"attestation_state":"computed","paper":{"title":"Automated Parameter Blocking for Efficient Markov-Chain Monte Carlo Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Christopher J. Paciorek, Clifford Anderson-Bergman, Daniel Turek, Perry de Valpine","submitted_at":"2015-03-19T00:20:16Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) sampling is an important and commonly used tool for the analysis of hierarchical models. Nevertheless, practitioners generally have two options for MCMC: utilize existing software that generates a black-box \"one size fits all\" algorithm, or the challenging (and time consuming) task of implementing a problem-specific MCMC algorithm. Either choice may result in inefficient sampling, and hence researchers have become accustomed to MCMC runtimes on the order of days (or longer) for large models. We propose an automated procedure to determine an efficient MCMC algori"},"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":"1503.05621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-19T00:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"6e59b9a0e9b29c9edf152d84e629805f4491618769e97b48e0fcf2f9fe315b6d","abstract_canon_sha256":"05632e1678a7b95bee9069896f78fbb8bec4d1ee3cea537f8fbd69c0c3669edd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:58.575603Z","signature_b64":"mopuKKt6gy276iYO/dQnk41LGlDMAFZF8z/RqOHZMWydMebRwBfWw7Ehocu8K52kjv49vJH1Bl90nHM0n8orBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61090196221949499c27202b9625bcb2b960502bc20883d9a99a5c7e15eb1d61","last_reissued_at":"2026-05-18T02:20:58.574994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:58.574994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Parameter Blocking for Efficient Markov-Chain Monte Carlo Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Christopher J. Paciorek, Clifford Anderson-Bergman, Daniel Turek, Perry de Valpine","submitted_at":"2015-03-19T00:20:16Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) sampling is an important and commonly used tool for the analysis of hierarchical models. Nevertheless, practitioners generally have two options for MCMC: utilize existing software that generates a black-box \"one size fits all\" algorithm, or the challenging (and time consuming) task of implementing a problem-specific MCMC algorithm. Either choice may result in inefficient sampling, and hence researchers have become accustomed to MCMC runtimes on the order of days (or longer) for large models. We propose an automated procedure to determine an efficient MCMC algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05621","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":"1503.05621","created_at":"2026-05-18T02:20:58.575066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05621v1","created_at":"2026-05-18T02:20:58.575066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05621","created_at":"2026-05-18T02:20:58.575066+00:00"},{"alias_kind":"pith_short_12","alias_value":"MEEQDFRCDFEU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MEEQDFRCDFEUTHBH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MEEQDFRC","created_at":"2026-05-18T12:29:32.376354+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/MEEQDFRCDFEUTHBHEAVZMJN4WK","json":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK.json","graph_json":"https://pith.science/api/pith-number/MEEQDFRCDFEUTHBHEAVZMJN4WK/graph.json","events_json":"https://pith.science/api/pith-number/MEEQDFRCDFEUTHBHEAVZMJN4WK/events.json","paper":"https://pith.science/paper/MEEQDFRC"},"agent_actions":{"view_html":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK","download_json":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK.json","view_paper":"https://pith.science/paper/MEEQDFRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05621&json=true","fetch_graph":"https://pith.science/api/pith-number/MEEQDFRCDFEUTHBHEAVZMJN4WK/graph.json","fetch_events":"https://pith.science/api/pith-number/MEEQDFRCDFEUTHBHEAVZMJN4WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK/action/storage_attestation","attest_author":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK/action/author_attestation","sign_citation":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK/action/citation_signature","submit_replication":"https://pith.science/pith/MEEQDFRCDFEUTHBHEAVZMJN4WK/action/replication_record"}},"created_at":"2026-05-18T02:20:58.575066+00:00","updated_at":"2026-05-18T02:20:58.575066+00:00"}