{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XL6FA724FVWXOX6ZSVGORTDK3X","short_pith_number":"pith:XL6FA724","canonical_record":{"source":{"id":"1501.00217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-31T22:06:22Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"e48cbadce8e11653511ce7d1dcedb0d10b5ed7c6315bad021f8feb12ea55a88a","abstract_canon_sha256":"f0023d38b64bad9fc4340a3275c100b610392c4c6057ee6901e95b7d46c03b01"},"schema_version":"1.0"},"canonical_sha256":"bafc507f5c2d6d775fd9954ce8cc6addc10d1782820760aaf8d2fb40399e5521","source":{"kind":"arxiv","id":"1501.00217","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00217","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00217v3","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00217","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"XL6FA724FVWX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XL6FA724FVWXOX6Z","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XL6FA724","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XL6FA724FVWXOX6ZSVGORTDK3X","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-31T22:06:22Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"e48cbadce8e11653511ce7d1dcedb0d10b5ed7c6315bad021f8feb12ea55a88a","abstract_canon_sha256":"f0023d38b64bad9fc4340a3275c100b610392c4c6057ee6901e95b7d46c03b01"},"schema_version":"1.0"},"canonical_sha256":"bafc507f5c2d6d775fd9954ce8cc6addc10d1782820760aaf8d2fb40399e5521","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:46.390064Z","signature_b64":"hU6MkpLqX+FJk5FRWwDL/edkdF56H+/AWEv3woOtRrA28PUQsUL5DhlHD8/0XhQfWH3oVgRaMJCno/+A6bhqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bafc507f5c2d6d775fd9954ce8cc6addc10d1782820760aaf8d2fb40399e5521","last_reissued_at":"2026-05-18T01:27:46.389280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:46.389280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00217","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgZAIbEXuG9BR9VR5arKUHcw9jY5c3YncIYGYKoZQxocKjERbn5dX6qtI3xhZdRi84jKhoNTLnkVP2ZMfXL+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:15:58.008818Z"},"content_sha256":"7d9e9c2cc214b0439dd7a560a4b8fa52ed927d24860da407222f08906fd65f70","schema_version":"1.0","event_id":"sha256:7d9e9c2cc214b0439dd7a560a4b8fa52ed927d24860da407222f08906fd65f70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XL6FA724FVWXOX6ZSVGORTDK3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The parallel replica method for computing equilibrium averages of Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.NA","authors_text":"David Aristoff","submitted_at":"2014-12-31T22:06:22Z","abstract_excerpt":"An algorithm is proposed for computing equilibrium averages of Markov chains which suffer from metastability -- the tendency to remain in one or more subsets of state space for long time intervals. The algorithm, called the parallel replica method (or ParRep), uses many parallel processors to explore these subsets more efficiently. Numerical simulations on a simple model demonstrate consistency of the method. A proof of consistency is given in an idealized setting. The parallel replica method can be considered a generalization of A.F. Voter's parallel replica dynamics, originally developed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00217","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMdNVPXkKVb7g1p2K+yCccuCeUqf7FXMRcYsHJ0OF/eHuKOqjLpOnUN4CrXpKLCtracYBuv7gkiFebnljfDVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:15:58.009580Z"},"content_sha256":"0622e31ba1795902e7f5acdb950e97a727eaac1eb711cf94956be8eb8bd755fb","schema_version":"1.0","event_id":"sha256:0622e31ba1795902e7f5acdb950e97a727eaac1eb711cf94956be8eb8bd755fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XL6FA724FVWXOX6ZSVGORTDK3X/bundle.json","state_url":"https://pith.science/pith/XL6FA724FVWXOX6ZSVGORTDK3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XL6FA724FVWXOX6ZSVGORTDK3X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T17:15:58Z","links":{"resolver":"https://pith.science/pith/XL6FA724FVWXOX6ZSVGORTDK3X","bundle":"https://pith.science/pith/XL6FA724FVWXOX6ZSVGORTDK3X/bundle.json","state":"https://pith.science/pith/XL6FA724FVWXOX6ZSVGORTDK3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XL6FA724FVWXOX6ZSVGORTDK3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XL6FA724FVWXOX6ZSVGORTDK3X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0023d38b64bad9fc4340a3275c100b610392c4c6057ee6901e95b7d46c03b01","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-31T22:06:22Z","title_canon_sha256":"e48cbadce8e11653511ce7d1dcedb0d10b5ed7c6315bad021f8feb12ea55a88a"},"schema_version":"1.0","source":{"id":"1501.00217","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00217","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00217v3","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00217","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"XL6FA724FVWX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XL6FA724FVWXOX6Z","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XL6FA724","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:0622e31ba1795902e7f5acdb950e97a727eaac1eb711cf94956be8eb8bd755fb","target":"graph","created_at":"2026-05-18T01:27:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An algorithm is proposed for computing equilibrium averages of Markov chains which suffer from metastability -- the tendency to remain in one or more subsets of state space for long time intervals. The algorithm, called the parallel replica method (or ParRep), uses many parallel processors to explore these subsets more efficiently. Numerical simulations on a simple model demonstrate consistency of the method. A proof of consistency is given in an idealized setting. The parallel replica method can be considered a generalization of A.F. Voter's parallel replica dynamics, originally developed to ","authors_text":"David Aristoff","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-31T22:06:22Z","title":"The parallel replica method for computing equilibrium averages of Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00217","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d9e9c2cc214b0439dd7a560a4b8fa52ed927d24860da407222f08906fd65f70","target":"record","created_at":"2026-05-18T01:27:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0023d38b64bad9fc4340a3275c100b610392c4c6057ee6901e95b7d46c03b01","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-31T22:06:22Z","title_canon_sha256":"e48cbadce8e11653511ce7d1dcedb0d10b5ed7c6315bad021f8feb12ea55a88a"},"schema_version":"1.0","source":{"id":"1501.00217","kind":"arxiv","version":3}},"canonical_sha256":"bafc507f5c2d6d775fd9954ce8cc6addc10d1782820760aaf8d2fb40399e5521","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bafc507f5c2d6d775fd9954ce8cc6addc10d1782820760aaf8d2fb40399e5521","first_computed_at":"2026-05-18T01:27:46.389280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:46.389280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hU6MkpLqX+FJk5FRWwDL/edkdF56H+/AWEv3woOtRrA28PUQsUL5DhlHD8/0XhQfWH3oVgRaMJCno/+A6bhqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:46.390064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00217","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d9e9c2cc214b0439dd7a560a4b8fa52ed927d24860da407222f08906fd65f70","sha256:0622e31ba1795902e7f5acdb950e97a727eaac1eb711cf94956be8eb8bd755fb"],"state_sha256":"11a59c3d605382a5f84c88b9e68f766f19f64e3c76fb6ae93c136ba2a7c3bb20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUMmTyaDX9kPWvQ7pLXPl2p+DuRtCX4chfSbU2hXY3YnYKnIqRctCysX+7EUdRtGA0QC2wvK4mTgPZYbn7e+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:15:58.013840Z","bundle_sha256":"0726615c89cd933ebed7c04ec6bb581304933ba0825bb240ed34ac939c5d1508"}}