{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:63ATWAE7NYI76NB4ABDODZRZPZ","short_pith_number":"pith:63ATWAE7","schema_version":"1.0","canonical_sha256":"f6c13b009f6e11ff343c0046e1e6397e7132f613b72cdc114ac920ba89f565a7","source":{"kind":"arxiv","id":"2211.02605","version":2},"attestation_state":"computed","paper":{"title":"On the upper tail large deviation rate function for chemical distance in supercritical percolation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Barbara Dembin, Shuta Nakajima","submitted_at":"2022-11-04T17:19:51Z","abstract_excerpt":"We consider the supercritical bond percolation on $\\mathbb Z^d$ and study the graph distance on the percolation graph called the chemical distance. It is well-known that there exists a deterministic constant $\\mu(x)$ such that the chemical distance $\\mathcal D(0,nx)$ between two connected points $0$ and $nx$ grows like $n\\mu(x)$. Garet and Marchand (Ann. Prob., 2007) proved that the probability of the upper tail large deviation event $\\left\\{n\\mu(x)(1+\\varepsilon)<\\mathcal D(0,nx)<\\infty\\right\\} $ decays exponentially with respect to $n$. In this paper, we prove the existence of the rate funct"},"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":"2211.02605","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-11-04T17:19:51Z","cross_cats_sorted":[],"title_canon_sha256":"62bf98bc5dbf5dc627658a59bd3a2657e65af3da7521fd173de6e12fd3662129","abstract_canon_sha256":"05a15bbc156d1f15463b3f1f97e3da89179b7574fae9c54c14e3f05cf82d2c7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:41.293290Z","signature_b64":"CPKkHGWoc+tl3aBDfFLqyRHQ4XY/hLIbdY2HNUyaj78spYZDWrs2kUMU7eG7j7J3qYBPLsqsdJlrqw+dJGCmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c13b009f6e11ff343c0046e1e6397e7132f613b72cdc114ac920ba89f565a7","last_reissued_at":"2026-07-05T05:59:41.292861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:41.292861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the upper tail large deviation rate function for chemical distance in supercritical percolation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Barbara Dembin, Shuta Nakajima","submitted_at":"2022-11-04T17:19:51Z","abstract_excerpt":"We consider the supercritical bond percolation on $\\mathbb Z^d$ and study the graph distance on the percolation graph called the chemical distance. It is well-known that there exists a deterministic constant $\\mu(x)$ such that the chemical distance $\\mathcal D(0,nx)$ between two connected points $0$ and $nx$ grows like $n\\mu(x)$. Garet and Marchand (Ann. Prob., 2007) proved that the probability of the upper tail large deviation event $\\left\\{n\\mu(x)(1+\\varepsilon)<\\mathcal D(0,nx)<\\infty\\right\\} $ decays exponentially with respect to $n$. In this paper, we prove the existence of the rate funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02605","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.02605/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.02605","created_at":"2026-07-05T05:59:41.292921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02605v2","created_at":"2026-07-05T05:59:41.292921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02605","created_at":"2026-07-05T05:59:41.292921+00:00"},{"alias_kind":"pith_short_12","alias_value":"63ATWAE7NYI7","created_at":"2026-07-05T05:59:41.292921+00:00"},{"alias_kind":"pith_short_16","alias_value":"63ATWAE7NYI76NB4","created_at":"2026-07-05T05:59:41.292921+00:00"},{"alias_kind":"pith_short_8","alias_value":"63ATWAE7","created_at":"2026-07-05T05:59:41.292921+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03320","citing_title":"Large deviation principle at speed $n$ for the random metric in first-passage percolation","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ","json":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ.json","graph_json":"https://pith.science/api/pith-number/63ATWAE7NYI76NB4ABDODZRZPZ/graph.json","events_json":"https://pith.science/api/pith-number/63ATWAE7NYI76NB4ABDODZRZPZ/events.json","paper":"https://pith.science/paper/63ATWAE7"},"agent_actions":{"view_html":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ","download_json":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ.json","view_paper":"https://pith.science/paper/63ATWAE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02605&json=true","fetch_graph":"https://pith.science/api/pith-number/63ATWAE7NYI76NB4ABDODZRZPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/63ATWAE7NYI76NB4ABDODZRZPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ/action/storage_attestation","attest_author":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ/action/author_attestation","sign_citation":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ/action/citation_signature","submit_replication":"https://pith.science/pith/63ATWAE7NYI76NB4ABDODZRZPZ/action/replication_record"}},"created_at":"2026-07-05T05:59:41.292921+00:00","updated_at":"2026-07-05T05:59:41.292921+00:00"}