{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FG22ZWIS27GZMO4L7WAXDB7SGB","short_pith_number":"pith:FG22ZWIS","schema_version":"1.0","canonical_sha256":"29b5acd912d7cd963b8bfd817187f2306d5d63bb9a38eaf034ff4fdbdca6c9fb","source":{"kind":"arxiv","id":"1201.4485","version":1},"attestation_state":"computed","paper":{"title":"On the Markov transition kernels for first-passage percolation on the ladder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eckhard Schlemm","submitted_at":"2012-01-21T15:36:00Z","abstract_excerpt":"We consider the first-passage percolation problem on the random graph with vertex set N\\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for the first-passage times l_n between the vertices (0,0) and (n,0), thus extending earlier results about the almost sure convergence of l_n/n as n goes to infinity. We use generating function techniques to compute the n-step transition kernels of a closely related Markov chain which can be used to calculate explicitly the asymptotic variance in the central li"},"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":"1201.4485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-21T15:36:00Z","cross_cats_sorted":[],"title_canon_sha256":"958828b0c99b51a8c0377d143b604579aa5383160c997ebf61e445294fd86771","abstract_canon_sha256":"b0b90750ca2675d7c9da1c894f8e7423ff23b354ff89e58192803d66e8949181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:05.922560Z","signature_b64":"/EfzEtz8VcVgIDJRUT0LlAT4X6YElMuVWM1UsCAu+REfHHwn59xipreWMmt+RK9tUI8OYuVkzjdXPzIyCBglDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b5acd912d7cd963b8bfd817187f2306d5d63bb9a38eaf034ff4fdbdca6c9fb","last_reissued_at":"2026-05-18T04:04:05.922199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:05.922199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Markov transition kernels for first-passage percolation on the ladder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eckhard Schlemm","submitted_at":"2012-01-21T15:36:00Z","abstract_excerpt":"We consider the first-passage percolation problem on the random graph with vertex set N\\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for the first-passage times l_n between the vertices (0,0) and (n,0), thus extending earlier results about the almost sure convergence of l_n/n as n goes to infinity. We use generating function techniques to compute the n-step transition kernels of a closely related Markov chain which can be used to calculate explicitly the asymptotic variance in the central li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4485","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":"1201.4485","created_at":"2026-05-18T04:04:05.922252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4485v1","created_at":"2026-05-18T04:04:05.922252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4485","created_at":"2026-05-18T04:04:05.922252+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG22ZWIS27GZ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG22ZWIS27GZMO4L","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG22ZWIS","created_at":"2026-05-18T12:27:06.952714+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/FG22ZWIS27GZMO4L7WAXDB7SGB","json":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB.json","graph_json":"https://pith.science/api/pith-number/FG22ZWIS27GZMO4L7WAXDB7SGB/graph.json","events_json":"https://pith.science/api/pith-number/FG22ZWIS27GZMO4L7WAXDB7SGB/events.json","paper":"https://pith.science/paper/FG22ZWIS"},"agent_actions":{"view_html":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB","download_json":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB.json","view_paper":"https://pith.science/paper/FG22ZWIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4485&json=true","fetch_graph":"https://pith.science/api/pith-number/FG22ZWIS27GZMO4L7WAXDB7SGB/graph.json","fetch_events":"https://pith.science/api/pith-number/FG22ZWIS27GZMO4L7WAXDB7SGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB/action/storage_attestation","attest_author":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB/action/author_attestation","sign_citation":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB/action/citation_signature","submit_replication":"https://pith.science/pith/FG22ZWIS27GZMO4L7WAXDB7SGB/action/replication_record"}},"created_at":"2026-05-18T04:04:05.922252+00:00","updated_at":"2026-05-18T04:04:05.922252+00:00"}