{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5BTRJMHEFWU76LRMTM6F3Y4Y6Q","short_pith_number":"pith:5BTRJMHE","canonical_record":{"source":{"id":"1609.06363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-20T21:14:29Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"82d497bf9e49dbcf829b19cc44e150756e4fe2847f75d6366bfc32def9a02179","abstract_canon_sha256":"27857be5d106c3f978bf528e6c1dca63d46e7e1c98edcc5012980f2708596ec7"},"schema_version":"1.0"},"canonical_sha256":"e86714b0e42da9ff2e2c9b3c5de398f4025932096e61e4fceab3152f49c9ce11","source":{"kind":"arxiv","id":"1609.06363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06363","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06363v3","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06363","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"5BTRJMHEFWU7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BTRJMHEFWU76LRM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BTRJMHE","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5BTRJMHEFWU76LRMTM6F3Y4Y6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-20T21:14:29Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"82d497bf9e49dbcf829b19cc44e150756e4fe2847f75d6366bfc32def9a02179","abstract_canon_sha256":"27857be5d106c3f978bf528e6c1dca63d46e7e1c98edcc5012980f2708596ec7"},"schema_version":"1.0"},"canonical_sha256":"e86714b0e42da9ff2e2c9b3c5de398f4025932096e61e4fceab3152f49c9ce11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.633625Z","signature_b64":"9AHyngbnEbOBx0gpLsRmqZfi7B/iQ2amdr2zsZQKlnMaH0AOhL+5kMKVVpfhrRW7/bYc30nN2UdQyBq4Sh5aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86714b0e42da9ff2e2c9b3c5de398f4025932096e61e4fceab3152f49c9ce11","last_reissued_at":"2026-05-18T00:27:30.632825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.632825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06363","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-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEjgD4YPGPMhZDpclxbfou5tdxka4pNP/IjTEGO8iP+A2WdGAXGZnb7ZQzZLP3exIX41QpMf48t4mkf3w82HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:32:06.685089Z"},"content_sha256":"f34b15a1b3a3d1b81c3da4853b23327be3cfc398bf93fd906783ef58463cbe62","schema_version":"1.0","event_id":"sha256:f34b15a1b3a3d1b81c3da4853b23327be3cfc398bf93fd906783ef58463cbe62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5BTRJMHEFWU76LRMTM6F3Y4Y6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stationary averaging for multi-scale continuous time Markov chains using parallel replica dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"David Aristoff, Petr Plech\\'a\\v{c}, Ting Wang","submitted_at":"2016-09-20T21:14:29Z","abstract_excerpt":"We propose two algorithms for simulating continuous time Markov chains in the presence of metastability. We show that the algorithms correctly estimate, under the ergodicity assumption, stationary averages of the process. Both algorithms, based on the idea of the parallel replica method, use parallel computing in order to explore metastable sets more efficiently. The algorithms require no assumptions on the Markov chains beyond ergodicity and the presence of identifiable metastability.\n  In particular, there is no assumption on reversibility. For simpler illustration of the algorithms, we assu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06363","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-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Bj4/L71+qy4+KA3mGHEbXr5/3tHfdbkI6f0rX8eGttt+XRJlTuvybPMWuMeCH3gV0CZcJ2QubhuKUpfMhwdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:32:06.685595Z"},"content_sha256":"20f097aa236ef62885488f641b66b9d02d7faf81b18d86b32f0db5494eae9b3d","schema_version":"1.0","event_id":"sha256:20f097aa236ef62885488f641b66b9d02d7faf81b18d86b32f0db5494eae9b3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/bundle.json","state_url":"https://pith.science/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/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-05-28T22:32:06Z","links":{"resolver":"https://pith.science/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q","bundle":"https://pith.science/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/bundle.json","state":"https://pith.science/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BTRJMHEFWU76LRMTM6F3Y4Y6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5BTRJMHEFWU76LRMTM6F3Y4Y6Q","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":"27857be5d106c3f978bf528e6c1dca63d46e7e1c98edcc5012980f2708596ec7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-20T21:14:29Z","title_canon_sha256":"82d497bf9e49dbcf829b19cc44e150756e4fe2847f75d6366bfc32def9a02179"},"schema_version":"1.0","source":{"id":"1609.06363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06363","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06363v3","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06363","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"5BTRJMHEFWU7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BTRJMHEFWU76LRM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BTRJMHE","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:20f097aa236ef62885488f641b66b9d02d7faf81b18d86b32f0db5494eae9b3d","target":"graph","created_at":"2026-05-18T00:27:30Z","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":"We propose two algorithms for simulating continuous time Markov chains in the presence of metastability. We show that the algorithms correctly estimate, under the ergodicity assumption, stationary averages of the process. Both algorithms, based on the idea of the parallel replica method, use parallel computing in order to explore metastable sets more efficiently. The algorithms require no assumptions on the Markov chains beyond ergodicity and the presence of identifiable metastability.\n  In particular, there is no assumption on reversibility. For simpler illustration of the algorithms, we assu","authors_text":"David Aristoff, Petr Plech\\'a\\v{c}, Ting Wang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-20T21:14:29Z","title":"Stationary averaging for multi-scale continuous time Markov chains using parallel replica dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06363","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:f34b15a1b3a3d1b81c3da4853b23327be3cfc398bf93fd906783ef58463cbe62","target":"record","created_at":"2026-05-18T00:27:30Z","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":"27857be5d106c3f978bf528e6c1dca63d46e7e1c98edcc5012980f2708596ec7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-20T21:14:29Z","title_canon_sha256":"82d497bf9e49dbcf829b19cc44e150756e4fe2847f75d6366bfc32def9a02179"},"schema_version":"1.0","source":{"id":"1609.06363","kind":"arxiv","version":3}},"canonical_sha256":"e86714b0e42da9ff2e2c9b3c5de398f4025932096e61e4fceab3152f49c9ce11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e86714b0e42da9ff2e2c9b3c5de398f4025932096e61e4fceab3152f49c9ce11","first_computed_at":"2026-05-18T00:27:30.632825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:30.632825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9AHyngbnEbOBx0gpLsRmqZfi7B/iQ2amdr2zsZQKlnMaH0AOhL+5kMKVVpfhrRW7/bYc30nN2UdQyBq4Sh5aBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:30.633625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34b15a1b3a3d1b81c3da4853b23327be3cfc398bf93fd906783ef58463cbe62","sha256:20f097aa236ef62885488f641b66b9d02d7faf81b18d86b32f0db5494eae9b3d"],"state_sha256":"f3e6e389ef74c1e10c0992d0d57c7c1fd99065894e9e28b0c75f6b7e05d5b9ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MKDU+C/73YdkSF3ZqnNelmTQH6N/+sR0BZOm9dReWqxppjHsy3IyimZ8Q8l1y7KJttRSh7IwKCTuoFjINqDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:32:06.689011Z","bundle_sha256":"4189be848566f400025825eaf059c3b536cc347e9357cb7ee985635f89f35dbf"}}