{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5YQT5QESINORXVMIUD22MTRAQ","short_pith_number":"pith:C5YQT5QE","canonical_record":{"source":{"id":"1604.06418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-21T18:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"e22d6e3236c8a0f06108ca7b5c0655a567560b7ef3d45b43f3f6d2490efc0df1","abstract_canon_sha256":"0d498b2f9419ef52fc1ee5692efa28a50f3d9e42d901b2f25fbd57101b40b44f"},"schema_version":"1.0"},"canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","source":{"kind":"arxiv","id":"1604.06418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06418","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06418v1","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06418","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"C5YQT5QESINO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5YQT5QESINORXVM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5YQT5QE","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5YQT5QESINORXVMIUD22MTRAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-21T18:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"e22d6e3236c8a0f06108ca7b5c0655a567560b7ef3d45b43f3f6d2490efc0df1","abstract_canon_sha256":"0d498b2f9419ef52fc1ee5692efa28a50f3d9e42d901b2f25fbd57101b40b44f"},"schema_version":"1.0"},"canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:30.188621Z","signature_b64":"7v3eqfSZ7K4QYC42Ae2e3YPfPGgwtJhj9/jb+V4uSXZiQ03hzn+lWA3bLjgTlgzJoZre06TfdPYtxEJ8nFLZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","last_reissued_at":"2026-05-18T01:16:30.187952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:30.187952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06418","source_version":1,"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:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ui+7ed+c4q9vIKSeLgNhu8H97o0J7CjKBBGtm2ZFLqDJvssTVSyUUhvRrXCOpxKxhADVOtQhNlnHtUD1qt9UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:11:56.155116Z"},"content_sha256":"ca693723fd4aea1ac22fbbe368facd159033a96bbf7d1b59afd2e5ef5aa81e19","schema_version":"1.0","event_id":"sha256:ca693723fd4aea1ac22fbbe368facd159033a96bbf7d1b59afd2e5ef5aa81e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5YQT5QESINORXVMIUD22MTRAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David J. Aldous","submitted_at":"2016-04-21T18:55:36Z","abstract_excerpt":"A simple lemma bounds $\\mathrm{s.d.}(T)/\\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result concerns a model of first passage percolation on a finite graph, where the traversal times of edges are independent Exponentials with arbitrary rates. Consider the percolation time $X$ between two arbitrary vertices. We prove that $\\mathrm{s.d.}(X)/\\mathbb{E} X$ is small if and only if $\\Xi/\\mathbb{E} X$ is small, where $\\Xi$ is the maximal edge-traversal time i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06418","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":""},"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:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2Alb8XnxLI2iXfPnWmwZVkQnyMbkJn5BhN0TfZSA/Yvc26W+Fj2hRC+hn15wCw42mZHlNgQrJhL4OMOMmNhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:11:56.155820Z"},"content_sha256":"38a9bbb60ca05a0e619f60697eb3fceb5c026197e47103c8b84755efcbc99f9f","schema_version":"1.0","event_id":"sha256:38a9bbb60ca05a0e619f60697eb3fceb5c026197e47103c8b84755efcbc99f9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/bundle.json","state_url":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5YQT5QESINORXVMIUD22MTRAQ/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-23T13:11:56Z","links":{"resolver":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ","bundle":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/bundle.json","state":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5YQT5QESINORXVMIUD22MTRAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5YQT5QESINORXVMIUD22MTRAQ","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":"0d498b2f9419ef52fc1ee5692efa28a50f3d9e42d901b2f25fbd57101b40b44f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-21T18:55:36Z","title_canon_sha256":"e22d6e3236c8a0f06108ca7b5c0655a567560b7ef3d45b43f3f6d2490efc0df1"},"schema_version":"1.0","source":{"id":"1604.06418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06418","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06418v1","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06418","created_at":"2026-05-18T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"C5YQT5QESINO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5YQT5QESINORXVM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5YQT5QE","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:38a9bbb60ca05a0e619f60697eb3fceb5c026197e47103c8b84755efcbc99f9f","target":"graph","created_at":"2026-05-18T01:16: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":"A simple lemma bounds $\\mathrm{s.d.}(T)/\\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result concerns a model of first passage percolation on a finite graph, where the traversal times of edges are independent Exponentials with arbitrary rates. Consider the percolation time $X$ between two arbitrary vertices. We prove that $\\mathrm{s.d.}(X)/\\mathbb{E} X$ is small if and only if $\\Xi/\\mathbb{E} X$ is small, where $\\Xi$ is the maximal edge-traversal time i","authors_text":"David J. Aldous","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-21T18:55:36Z","title":"Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06418","kind":"arxiv","version":1},"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:ca693723fd4aea1ac22fbbe368facd159033a96bbf7d1b59afd2e5ef5aa81e19","target":"record","created_at":"2026-05-18T01:16: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":"0d498b2f9419ef52fc1ee5692efa28a50f3d9e42d901b2f25fbd57101b40b44f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-21T18:55:36Z","title_canon_sha256":"e22d6e3236c8a0f06108ca7b5c0655a567560b7ef3d45b43f3f6d2490efc0df1"},"schema_version":"1.0","source":{"id":"1604.06418","kind":"arxiv","version":1}},"canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","first_computed_at":"2026-05-18T01:16:30.187952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:30.187952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7v3eqfSZ7K4QYC42Ae2e3YPfPGgwtJhj9/jb+V4uSXZiQ03hzn+lWA3bLjgTlgzJoZre06TfdPYtxEJ8nFLZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:30.188621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca693723fd4aea1ac22fbbe368facd159033a96bbf7d1b59afd2e5ef5aa81e19","sha256:38a9bbb60ca05a0e619f60697eb3fceb5c026197e47103c8b84755efcbc99f9f"],"state_sha256":"c9be39945507888f66fe3e3602474a4703f958e0524ed8145c8b01a3494ed973"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJXdklbZjX9YaxeoMH+sCxje4IlfhyzqlBzs9z8HBKtq+k79LzTYG4xCFyaD6XIMSAE6VqJ8+lXNPNkfq++8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T13:11:56.159994Z","bundle_sha256":"b3e3f80327112889f601259e50d5ab5659e5b741b42b3edac071aec0d498af24"}}