{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C5YQT5QESINORXVMIUD22MTRAQ","short_pith_number":"pith:C5YQT5QE","schema_version":"1.0","canonical_sha256":"177109f604921ae8deac4507ad327104087d6883f335304bb7415f500ecb0207","source":{"kind":"arxiv","id":"1604.06418","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.06418","created_at":"2026-05-18T01:16:30.188072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06418v1","created_at":"2026-05-18T01:16:30.188072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06418","created_at":"2026-05-18T01:16:30.188072+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5YQT5QESINO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5YQT5QESINORXVM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5YQT5QE","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09511","citing_title":"Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ","json":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ.json","graph_json":"https://pith.science/api/pith-number/C5YQT5QESINORXVMIUD22MTRAQ/graph.json","events_json":"https://pith.science/api/pith-number/C5YQT5QESINORXVMIUD22MTRAQ/events.json","paper":"https://pith.science/paper/C5YQT5QE"},"agent_actions":{"view_html":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ","download_json":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ.json","view_paper":"https://pith.science/paper/C5YQT5QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06418&json=true","fetch_graph":"https://pith.science/api/pith-number/C5YQT5QESINORXVMIUD22MTRAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/C5YQT5QESINORXVMIUD22MTRAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/action/storage_attestation","attest_author":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/action/author_attestation","sign_citation":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/action/citation_signature","submit_replication":"https://pith.science/pith/C5YQT5QESINORXVMIUD22MTRAQ/action/replication_record"}},"created_at":"2026-05-18T01:16:30.188072+00:00","updated_at":"2026-05-18T01:16:30.188072+00:00"}