{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2ONSGS4VJES66OJCZGIYMFDG63","short_pith_number":"pith:2ONSGS4V","canonical_record":{"source":{"id":"1711.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-11T02:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"ee20911bcb8d88b68279f74f70009da5bfc2e423464b75f0e66251995051c3bd","abstract_canon_sha256":"bb4de81e58d96d2857420d37b843df0a8ac7991d9bf62b5611ea7572e1a304de"},"schema_version":"1.0"},"canonical_sha256":"d39b234b954925ef3922c991861466f6f6f2990f3196992b863393fa53b2ca35","source":{"kind":"arxiv","id":"1711.04059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04059","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04059v1","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04059","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"pith_short_12","alias_value":"2ONSGS4VJES6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ONSGS4VJES66OJC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ONSGS4V","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2ONSGS4VJES66OJCZGIYMFDG63","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-11T02:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"ee20911bcb8d88b68279f74f70009da5bfc2e423464b75f0e66251995051c3bd","abstract_canon_sha256":"bb4de81e58d96d2857420d37b843df0a8ac7991d9bf62b5611ea7572e1a304de"},"schema_version":"1.0"},"canonical_sha256":"d39b234b954925ef3922c991861466f6f6f2990f3196992b863393fa53b2ca35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:50.210939Z","signature_b64":"IPW1mTfBCRiMU3cDAO9sjxrXkAspn7svwTQXVnjP/qei9lyOVHOWaWgyfIkmPe8ASd0lESPEynjUBh2xPHFxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39b234b954925ef3922c991861466f6f6f2990f3196992b863393fa53b2ca35","last_reissued_at":"2026-05-18T00:30:50.210338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:50.210338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04059","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-18T00:30:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRaLEBmhd9TYR/nw1NjXnSVzbrAG+3LefoWGVzA6gEwD9nRdDD6JLExaaZa2rsVVOXnRklQJFXUmXZCfGSScBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:30:27.936874Z"},"content_sha256":"c7fa45a260d5d070137cd87450436e97b7e512924046d355df7925b0da5471cd","schema_version":"1.0","event_id":"sha256:c7fa45a260d5d070137cd87450436e97b7e512924046d355df7925b0da5471cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2ONSGS4VJES66OJCZGIYMFDG63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Time Constant for Last Passage Percolation on Complete Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Rui Zhu, Xian-Yuan Wu","submitted_at":"2017-11-11T02:04:06Z","abstract_excerpt":"This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\\{1,2,\\ldots,n\\}$, and i.i.d. sequence $\\{X_e:e\\in E_n\\}$ be the passage times of edges. Denote by $W_n$ the largest passage time among all self-avoiding paths from 1 to $n$. First, it is proved that $W_n/n$ converges to constant $\\mu$, where $\\mu$ is called the time constant and coincides with the essential supremum of $X_e$. Second, when $\\mu<\\infty$, it is proved that the deviation probability $P(W_n/n\\leq \\mu-x)$ decays as fast as $e^{-\\Theta("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04059","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-18T00:30:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocHGuix/nkSTlGeHVwjjoQYmg01HXx9oU2nbgr74UGy0bleUYeOdSblxe5oLSt8snMY2YLzHRf7k7eIIQUbPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:30:27.937232Z"},"content_sha256":"8c7a0fd21ac1ca768df7160a867092f1a624c61526e280cc47420b0cf3b49e3b","schema_version":"1.0","event_id":"sha256:8c7a0fd21ac1ca768df7160a867092f1a624c61526e280cc47420b0cf3b49e3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ONSGS4VJES66OJCZGIYMFDG63/bundle.json","state_url":"https://pith.science/pith/2ONSGS4VJES66OJCZGIYMFDG63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ONSGS4VJES66OJCZGIYMFDG63/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-22T10:30:27Z","links":{"resolver":"https://pith.science/pith/2ONSGS4VJES66OJCZGIYMFDG63","bundle":"https://pith.science/pith/2ONSGS4VJES66OJCZGIYMFDG63/bundle.json","state":"https://pith.science/pith/2ONSGS4VJES66OJCZGIYMFDG63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ONSGS4VJES66OJCZGIYMFDG63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2ONSGS4VJES66OJCZGIYMFDG63","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":"bb4de81e58d96d2857420d37b843df0a8ac7991d9bf62b5611ea7572e1a304de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-11T02:04:06Z","title_canon_sha256":"ee20911bcb8d88b68279f74f70009da5bfc2e423464b75f0e66251995051c3bd"},"schema_version":"1.0","source":{"id":"1711.04059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04059","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04059v1","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04059","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"pith_short_12","alias_value":"2ONSGS4VJES6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ONSGS4VJES66OJC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ONSGS4V","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8c7a0fd21ac1ca768df7160a867092f1a624c61526e280cc47420b0cf3b49e3b","target":"graph","created_at":"2026-05-18T00:30:50Z","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":"This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\\{1,2,\\ldots,n\\}$, and i.i.d. sequence $\\{X_e:e\\in E_n\\}$ be the passage times of edges. Denote by $W_n$ the largest passage time among all self-avoiding paths from 1 to $n$. First, it is proved that $W_n/n$ converges to constant $\\mu$, where $\\mu$ is called the time constant and coincides with the essential supremum of $X_e$. Second, when $\\mu<\\infty$, it is proved that the deviation probability $P(W_n/n\\leq \\mu-x)$ decays as fast as $e^{-\\Theta(","authors_text":"Rui Zhu, Xian-Yuan Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-11T02:04:06Z","title":"On The Time Constant for Last Passage Percolation on Complete Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04059","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:c7fa45a260d5d070137cd87450436e97b7e512924046d355df7925b0da5471cd","target":"record","created_at":"2026-05-18T00:30:50Z","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":"bb4de81e58d96d2857420d37b843df0a8ac7991d9bf62b5611ea7572e1a304de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-11T02:04:06Z","title_canon_sha256":"ee20911bcb8d88b68279f74f70009da5bfc2e423464b75f0e66251995051c3bd"},"schema_version":"1.0","source":{"id":"1711.04059","kind":"arxiv","version":1}},"canonical_sha256":"d39b234b954925ef3922c991861466f6f6f2990f3196992b863393fa53b2ca35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d39b234b954925ef3922c991861466f6f6f2990f3196992b863393fa53b2ca35","first_computed_at":"2026-05-18T00:30:50.210338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:50.210338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IPW1mTfBCRiMU3cDAO9sjxrXkAspn7svwTQXVnjP/qei9lyOVHOWaWgyfIkmPe8ASd0lESPEynjUBh2xPHFxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:50.210939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7fa45a260d5d070137cd87450436e97b7e512924046d355df7925b0da5471cd","sha256:8c7a0fd21ac1ca768df7160a867092f1a624c61526e280cc47420b0cf3b49e3b"],"state_sha256":"623ab3a3d269214af0f86873d26676bdf700ff4f8e74d7c4efacdc6d627e87fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXVPVm0oue7B+VjjDw3I8OU6NQxBCNoUkoyue/pCA2bwBEdhF1ZKMSWUazNZAZL35LHSI/aMI7/PNEEdGB+qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:30:27.939276Z","bundle_sha256":"1bae1647371f0c117d683fb1a650f6cc8d2a539ed700d19af62fc870bf6af6ff"}}