{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y5ZEMQVME6KAEZQEMQFNZ2FH33","short_pith_number":"pith:Y5ZEMQVM","schema_version":"1.0","canonical_sha256":"c7724642ac2794026604640adce8a7dec3988bcf7670cab1b51d4cb0011e88e3","source":{"kind":"arxiv","id":"1801.05777","version":1},"attestation_state":"computed","paper":{"title":"On the number of maximal paths in directed last-passage percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fedor Nazarov, Harry Kesten, Hugo Duminil-Copin, Vladas Sidoravicius, Yuval Peres","submitted_at":"2018-01-17T18:01:00Z","abstract_excerpt":"We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\\mathbb Z}^d$ $(d\\geq2)$ in which weights take finitely many values is typically exponentially large."},"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":"1801.05777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-17T18:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"59c9c1fce18bd7d6af36e5921daf9d4e757e28546c30b4086164c9fe111b9c9e","abstract_canon_sha256":"85852617b6e0c09eeec63d9e218b8e9db875348a83e3a3ac53040d7b28fda095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:40.206409Z","signature_b64":"liCaM44Av41+qLxGKwRLdOr5Pybk6fxvYZLEqJyqQkNhhw+H1VlKe9i5Ml6zeIx8B+/HqHq0iHBp0DMxMUGmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7724642ac2794026604640adce8a7dec3988bcf7670cab1b51d4cb0011e88e3","last_reissued_at":"2026-05-18T00:25:40.205655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:40.205655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of maximal paths in directed last-passage percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fedor Nazarov, Harry Kesten, Hugo Duminil-Copin, Vladas Sidoravicius, Yuval Peres","submitted_at":"2018-01-17T18:01:00Z","abstract_excerpt":"We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\\mathbb Z}^d$ $(d\\geq2)$ in which weights take finitely many values is typically exponentially large."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05777","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":"1801.05777","created_at":"2026-05-18T00:25:40.205783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05777v1","created_at":"2026-05-18T00:25:40.205783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05777","created_at":"2026-05-18T00:25:40.205783+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5ZEMQVME6KA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5ZEMQVME6KAEZQE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5ZEMQVM","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33","json":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33.json","graph_json":"https://pith.science/api/pith-number/Y5ZEMQVME6KAEZQEMQFNZ2FH33/graph.json","events_json":"https://pith.science/api/pith-number/Y5ZEMQVME6KAEZQEMQFNZ2FH33/events.json","paper":"https://pith.science/paper/Y5ZEMQVM"},"agent_actions":{"view_html":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33","download_json":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33.json","view_paper":"https://pith.science/paper/Y5ZEMQVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05777&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5ZEMQVME6KAEZQEMQFNZ2FH33/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5ZEMQVME6KAEZQEMQFNZ2FH33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33/action/storage_attestation","attest_author":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33/action/author_attestation","sign_citation":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33/action/citation_signature","submit_replication":"https://pith.science/pith/Y5ZEMQVME6KAEZQEMQFNZ2FH33/action/replication_record"}},"created_at":"2026-05-18T00:25:40.205783+00:00","updated_at":"2026-05-18T00:25:40.205783+00:00"}