{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GT5RIKQYMFU7OB6FJP2BEZ75JK","short_pith_number":"pith:GT5RIKQY","schema_version":"1.0","canonical_sha256":"34fb142a186169f707c54bf41267fd4a8810af9f0a6fb87821c13ab7ec504992","source":{"kind":"arxiv","id":"2110.13017","version":6},"attestation_state":"computed","paper":{"title":"Nested $\\hat R$: Assessing the convergence of Markov chain Monte Carlo when running many short chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Aki Vehtari, Andrew Gelman, Charles C. Margossian, Lionel Riou-Durand, Matthew D. Hoffman, Pavel Sountsov","submitted_at":"2021-10-25T14:53:55Z","abstract_excerpt":"Recent developments in parallel Markov chain Monte Carlo (MCMC) algorithms allow us to run thousands of chains almost as quickly as a single chain, using hardware accelerators such as GPUs. While each chain still needs to forget its initial point during a warmup phase, the subsequent sampling phase can be shorter than in classical settings, where we run only a few chains. To determine if the resulting short chains are reliable, we need to assess how close the Markov chains are to their stationary distribution after warmup. The potential scale reduction factor $\\widehat R$ is a popular converge"},"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":"2110.13017","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-10-25T14:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"81822f60031321d57df23698a40a9b640655bd64b521a2d9c14d65f7858941ea","abstract_canon_sha256":"4a37e089a0e4af8b00f3c20cd1f16f3180ee970f299d3b97cf999c4214f6cc0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:52.211913Z","signature_b64":"z8q7gYb6ls1yLXRlqIpNi8EJ+D+mzzhaRd2HlbakPuB2ukU2wctstNbqhjohEkB3I+9jopDwIHOYDKnJ8ZnHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34fb142a186169f707c54bf41267fd4a8810af9f0a6fb87821c13ab7ec504992","last_reissued_at":"2026-07-05T08:24:52.211517Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:52.211517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested $\\hat R$: Assessing the convergence of Markov chain Monte Carlo when running many short chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Aki Vehtari, Andrew Gelman, Charles C. Margossian, Lionel Riou-Durand, Matthew D. Hoffman, Pavel Sountsov","submitted_at":"2021-10-25T14:53:55Z","abstract_excerpt":"Recent developments in parallel Markov chain Monte Carlo (MCMC) algorithms allow us to run thousands of chains almost as quickly as a single chain, using hardware accelerators such as GPUs. While each chain still needs to forget its initial point during a warmup phase, the subsequent sampling phase can be shorter than in classical settings, where we run only a few chains. To determine if the resulting short chains are reliable, we need to assess how close the Markov chains are to their stationary distribution after warmup. The potential scale reduction factor $\\widehat R$ is a popular converge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13017","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.13017/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.13017","created_at":"2026-07-05T08:24:52.211573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.13017v6","created_at":"2026-07-05T08:24:52.211573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13017","created_at":"2026-07-05T08:24:52.211573+00:00"},{"alias_kind":"pith_short_12","alias_value":"GT5RIKQYMFU7","created_at":"2026-07-05T08:24:52.211573+00:00"},{"alias_kind":"pith_short_16","alias_value":"GT5RIKQYMFU7OB6F","created_at":"2026-07-05T08:24:52.211573+00:00"},{"alias_kind":"pith_short_8","alias_value":"GT5RIKQY","created_at":"2026-07-05T08:24:52.211573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05846","citing_title":"Comparative study of Bayesian and Frequentist methods for epidemic forecasting: Insights from simulated and historical data","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK","json":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK.json","graph_json":"https://pith.science/api/pith-number/GT5RIKQYMFU7OB6FJP2BEZ75JK/graph.json","events_json":"https://pith.science/api/pith-number/GT5RIKQYMFU7OB6FJP2BEZ75JK/events.json","paper":"https://pith.science/paper/GT5RIKQY"},"agent_actions":{"view_html":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK","download_json":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK.json","view_paper":"https://pith.science/paper/GT5RIKQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.13017&json=true","fetch_graph":"https://pith.science/api/pith-number/GT5RIKQYMFU7OB6FJP2BEZ75JK/graph.json","fetch_events":"https://pith.science/api/pith-number/GT5RIKQYMFU7OB6FJP2BEZ75JK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK/action/storage_attestation","attest_author":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK/action/author_attestation","sign_citation":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK/action/citation_signature","submit_replication":"https://pith.science/pith/GT5RIKQYMFU7OB6FJP2BEZ75JK/action/replication_record"}},"created_at":"2026-07-05T08:24:52.211573+00:00","updated_at":"2026-07-05T08:24:52.211573+00:00"}