{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:2MPYLEQE4TEDAWUHYGVCJBYOU7","short_pith_number":"pith:2MPYLEQE","schema_version":"1.0","canonical_sha256":"d31f859204e4c8305a87c1aa24870ea7d8d1e6de3309000190e840405cf737e6","source":{"kind":"arxiv","id":"math/0407281","version":1},"attestation_state":"computed","paper":{"title":"Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better","license":"","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Radford M. Neal","submitted_at":"2004-07-15T19:44:23Z","abstract_excerpt":"I show how any reversible Markov chain on a finite state space that is irreducible, and hence suitable for estimating expectations with respect to its invariant distribution, can be used to construct a non-reversible Markov chain on a related state space that can also be used to estimate these expectations, with asymptotic variance at least as small as that using the reversible chain (typically smaller). The non-reversible chain achieves this improvement by avoiding (to the extent possible) transitions that backtrack to the state from which the chain just came. The proof that this modification"},"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":"math/0407281","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-07-15T19:44:23Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9518e2d0b801aa0f7ff1ed3c2b471b8474030a935a8de808164d77f20b9bc273","abstract_canon_sha256":"edd7923eb4e4b6bde983d9500acfe38a279d8ba3f8db2eeeb1a245d86c724c23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:01:54.579679Z","signature_b64":"I0WYlCivfbjq1Iz1GBRk0rRK4kUdVGmenAyR+AqyyDws3DlgjTHaaJfid8SJu12KR1qmwEwch4nGYsFdCWOyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d31f859204e4c8305a87c1aa24870ea7d8d1e6de3309000190e840405cf737e6","last_reissued_at":"2026-07-04T15:01:54.579267Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:01:54.579267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better","license":"","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Radford M. Neal","submitted_at":"2004-07-15T19:44:23Z","abstract_excerpt":"I show how any reversible Markov chain on a finite state space that is irreducible, and hence suitable for estimating expectations with respect to its invariant distribution, can be used to construct a non-reversible Markov chain on a related state space that can also be used to estimate these expectations, with asymptotic variance at least as small as that using the reversible chain (typically smaller). The non-reversible chain achieves this improvement by avoiding (to the extent possible) transitions that backtrack to the state from which the chain just came. The proof that this modification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407281","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0407281/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":"math/0407281","created_at":"2026-07-04T15:01:54.579335+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0407281v1","created_at":"2026-07-04T15:01:54.579335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407281","created_at":"2026-07-04T15:01:54.579335+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MPYLEQE4TED","created_at":"2026-07-04T15:01:54.579335+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MPYLEQE4TEDAWUH","created_at":"2026-07-04T15:01:54.579335+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MPYLEQE","created_at":"2026-07-04T15:01:54.579335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.30532","citing_title":"True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05324","citing_title":"Optimizing Irreversible Perturbations of the Unadjusted Langevin Algorithm","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2506.04082","citing_title":"Adaptive tuning of Hamiltonian Monte Carlo methods","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7","json":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7.json","graph_json":"https://pith.science/api/pith-number/2MPYLEQE4TEDAWUHYGVCJBYOU7/graph.json","events_json":"https://pith.science/api/pith-number/2MPYLEQE4TEDAWUHYGVCJBYOU7/events.json","paper":"https://pith.science/paper/2MPYLEQE"},"agent_actions":{"view_html":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7","download_json":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7.json","view_paper":"https://pith.science/paper/2MPYLEQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0407281&json=true","fetch_graph":"https://pith.science/api/pith-number/2MPYLEQE4TEDAWUHYGVCJBYOU7/graph.json","fetch_events":"https://pith.science/api/pith-number/2MPYLEQE4TEDAWUHYGVCJBYOU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7/action/storage_attestation","attest_author":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7/action/author_attestation","sign_citation":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7/action/citation_signature","submit_replication":"https://pith.science/pith/2MPYLEQE4TEDAWUHYGVCJBYOU7/action/replication_record"}},"created_at":"2026-07-04T15:01:54.579335+00:00","updated_at":"2026-07-04T15:01:54.579335+00:00"}