{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y6NNBYNDN3OQ5HUIE2KJVBVVLO","short_pith_number":"pith:Y6NNBYND","canonical_record":{"source":{"id":"1402.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-12T18:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"ac86acb4b7c0d551739aed14d719cb3979afe266d82e8312634232d78977743f","abstract_canon_sha256":"1046dbe8d94469edcfcf5630a1305eb2814e489014bd754426bd791fefc445fe"},"schema_version":"1.0"},"canonical_sha256":"c79ad0e1a36edd0e9e8826949a86b55b87649735b6c9e6d07774c650c2fd0723","source":{"kind":"arxiv","id":"1402.2928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2928","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2928v2","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2928","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"Y6NNBYNDN3OQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y6NNBYNDN3OQ5HUI","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y6NNBYND","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y6NNBYNDN3OQ5HUIE2KJVBVVLO","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-12T18:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"ac86acb4b7c0d551739aed14d719cb3979afe266d82e8312634232d78977743f","abstract_canon_sha256":"1046dbe8d94469edcfcf5630a1305eb2814e489014bd754426bd791fefc445fe"},"schema_version":"1.0"},"canonical_sha256":"c79ad0e1a36edd0e9e8826949a86b55b87649735b6c9e6d07774c650c2fd0723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:24.111777Z","signature_b64":"Oip4XUmsqMhgmGv6SFiVh+qnRui2h6X3E4HfahwOIWiBx4l1uA/e09B4uvOMMiSe8YlGAYe0SGARhp0tnXANAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c79ad0e1a36edd0e9e8826949a86b55b87649735b6c9e6d07774c650c2fd0723","last_reissued_at":"2026-05-18T02:50:24.111179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:24.111179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2928","source_version":2,"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-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+2CUmp8DPwlfYuUFHAyNt8waD5FwTbhHyp+ZhukLlzReti6PztsUrMOIEbA6EhKFrk+CZBybrQzBn0v6K8XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:22:25.718046Z"},"content_sha256":"4246fdc02e7872e7213b21b650b4b17442e8aaddd5c7561ec52b013311e84c46","schema_version":"1.0","event_id":"sha256:4246fdc02e7872e7213b21b650b4b17442e8aaddd5c7561ec52b013311e84c46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y6NNBYNDN3OQ5HUIE2KJVBVVLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unoriented first-passage percolation on the n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2014-02-12T18:47:55Z","abstract_excerpt":"The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\\{0, 1\\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned independent mean 1 exponential costs, the minimum length $T_n$ of a path from $(0, 0, \\dots, 0)$ to $(1, 1, \\dots, 1)$ converges in probability to $\\ln(1+\\sqrt{2}) \\approx 0.881$. It has previously been shown by Fill and Pemantle (1993) that this so-called first-passage time asymptotically almost surely satisfies $\\ln(1+\\sqrt{2}) - o(1) \\leq T_n \\leq 1+o(1)$, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2928","kind":"arxiv","version":2},"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-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9I1bhGe3Jf4eJzgZn11L1gcXLye8R6/eEjP3IAKkjSsPhoUyVN5PZf517YLdou9+RzU+0edrPF21zK/7trAVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:22:25.718430Z"},"content_sha256":"6d1bd33e7463cac4cbb9507f8e751c9cb7c5116c35688f31af7e03e5e91ec16e","schema_version":"1.0","event_id":"sha256:6d1bd33e7463cac4cbb9507f8e751c9cb7c5116c35688f31af7e03e5e91ec16e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/bundle.json","state_url":"https://pith.science/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/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-29T20:22:25Z","links":{"resolver":"https://pith.science/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO","bundle":"https://pith.science/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/bundle.json","state":"https://pith.science/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6NNBYNDN3OQ5HUIE2KJVBVVLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y6NNBYNDN3OQ5HUIE2KJVBVVLO","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":"1046dbe8d94469edcfcf5630a1305eb2814e489014bd754426bd791fefc445fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-12T18:47:55Z","title_canon_sha256":"ac86acb4b7c0d551739aed14d719cb3979afe266d82e8312634232d78977743f"},"schema_version":"1.0","source":{"id":"1402.2928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2928","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2928v2","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2928","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"Y6NNBYNDN3OQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y6NNBYNDN3OQ5HUI","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y6NNBYND","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:6d1bd33e7463cac4cbb9507f8e751c9cb7c5116c35688f31af7e03e5e91ec16e","target":"graph","created_at":"2026-05-18T02:50:24Z","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":"The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\\{0, 1\\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned independent mean 1 exponential costs, the minimum length $T_n$ of a path from $(0, 0, \\dots, 0)$ to $(1, 1, \\dots, 1)$ converges in probability to $\\ln(1+\\sqrt{2}) \\approx 0.881$. It has previously been shown by Fill and Pemantle (1993) that this so-called first-passage time asymptotically almost surely satisfies $\\ln(1+\\sqrt{2}) - o(1) \\leq T_n \\leq 1+o(1)$, and ","authors_text":"Anders Martinsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-12T18:47:55Z","title":"Unoriented first-passage percolation on the n-cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2928","kind":"arxiv","version":2},"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:4246fdc02e7872e7213b21b650b4b17442e8aaddd5c7561ec52b013311e84c46","target":"record","created_at":"2026-05-18T02:50:24Z","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":"1046dbe8d94469edcfcf5630a1305eb2814e489014bd754426bd791fefc445fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-12T18:47:55Z","title_canon_sha256":"ac86acb4b7c0d551739aed14d719cb3979afe266d82e8312634232d78977743f"},"schema_version":"1.0","source":{"id":"1402.2928","kind":"arxiv","version":2}},"canonical_sha256":"c79ad0e1a36edd0e9e8826949a86b55b87649735b6c9e6d07774c650c2fd0723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c79ad0e1a36edd0e9e8826949a86b55b87649735b6c9e6d07774c650c2fd0723","first_computed_at":"2026-05-18T02:50:24.111179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:24.111179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oip4XUmsqMhgmGv6SFiVh+qnRui2h6X3E4HfahwOIWiBx4l1uA/e09B4uvOMMiSe8YlGAYe0SGARhp0tnXANAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:24.111777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4246fdc02e7872e7213b21b650b4b17442e8aaddd5c7561ec52b013311e84c46","sha256:6d1bd33e7463cac4cbb9507f8e751c9cb7c5116c35688f31af7e03e5e91ec16e"],"state_sha256":"8389c37794720977bd05bc4f56b5086a023a6f54f736ecbc841e951d604f68b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7aV/qKzCLAQglveLnNokmVpbb8NjeMXVaVN61rKO7ScaCjUthVjfW1FhyaOdaiU6MEWIHdVEIqk88mg4NYbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:22:25.720647Z","bundle_sha256":"fc417a6956578d299a24ccad05d0cd2c1c4ceabbec48c0850d2235103317ac78"}}