{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CULOI7EUSY5I5ASMPLTMOW7JFT","short_pith_number":"pith:CULOI7EU","schema_version":"1.0","canonical_sha256":"1516e47c94963a8e824c7ae6c75be92ceb198408cc21b67ea1df0535efeb796d","source":{"kind":"arxiv","id":"1705.06097","version":3},"attestation_state":"computed","paper":{"title":"Distance between configurations in Markov chain Monte Carlo simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"hep-lat","authors_text":"Masafumi Fukuma, Naoya Umeda, Nobuyuki Matsumoto","submitted_at":"2017-05-17T11:22:04Z","abstract_excerpt":"For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal form for the class of algorithms which generate local moves in the configuration space. We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance. We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of "},"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":"1705.06097","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-lat","submitted_at":"2017-05-17T11:22:04Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"6c919ebdcd4db39e5d68407b121f178019b07085711194c052d2308d2b21391b","abstract_canon_sha256":"7136b38538f0e1419900da5ea593041b7b25df0c9bd2d906433c9d6ca16e1133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:39.698834Z","signature_b64":"dU+PlG40t1He1pU/adWq49NKtZYVRaFUWXRvk78c79kreSRDlHgP5OdSOzEi5Ek0G3MBLOYtIjULLWijrYhlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1516e47c94963a8e824c7ae6c75be92ceb198408cc21b67ea1df0535efeb796d","last_reissued_at":"2026-05-18T00:20:39.698081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:39.698081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance between configurations in Markov chain Monte Carlo simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"hep-lat","authors_text":"Masafumi Fukuma, Naoya Umeda, Nobuyuki Matsumoto","submitted_at":"2017-05-17T11:22:04Z","abstract_excerpt":"For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal form for the class of algorithms which generate local moves in the configuration space. We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance. We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06097","kind":"arxiv","version":3},"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":"1705.06097","created_at":"2026-05-18T00:20:39.698216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06097v3","created_at":"2026-05-18T00:20:39.698216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06097","created_at":"2026-05-18T00:20:39.698216+00:00"},{"alias_kind":"pith_short_12","alias_value":"CULOI7EUSY5I","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CULOI7EUSY5I5ASM","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CULOI7EU","created_at":"2026-05-18T12:31:10.602751+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/CULOI7EUSY5I5ASMPLTMOW7JFT","json":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT.json","graph_json":"https://pith.science/api/pith-number/CULOI7EUSY5I5ASMPLTMOW7JFT/graph.json","events_json":"https://pith.science/api/pith-number/CULOI7EUSY5I5ASMPLTMOW7JFT/events.json","paper":"https://pith.science/paper/CULOI7EU"},"agent_actions":{"view_html":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT","download_json":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT.json","view_paper":"https://pith.science/paper/CULOI7EU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06097&json=true","fetch_graph":"https://pith.science/api/pith-number/CULOI7EUSY5I5ASMPLTMOW7JFT/graph.json","fetch_events":"https://pith.science/api/pith-number/CULOI7EUSY5I5ASMPLTMOW7JFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT/action/storage_attestation","attest_author":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT/action/author_attestation","sign_citation":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT/action/citation_signature","submit_replication":"https://pith.science/pith/CULOI7EUSY5I5ASMPLTMOW7JFT/action/replication_record"}},"created_at":"2026-05-18T00:20:39.698216+00:00","updated_at":"2026-05-18T00:20:39.698216+00:00"}