{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CW3K646QQYAXBXHZRJ2V56UQLF","short_pith_number":"pith:CW3K646Q","schema_version":"1.0","canonical_sha256":"15b6af73d0860170dcf98a755efa905958e4425e43af5be77ae60c7bb1b968b9","source":{"kind":"arxiv","id":"1006.1266","version":2},"attestation_state":"computed","paper":{"title":"Weak convergence for the minimal position in a branching random walk: a simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"elie aidekon, Zhan Shi","submitted_at":"2010-06-07T14:30:38Z","abstract_excerpt":"Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\\over 2} \\log n$ when $n\\to \\infty$. We give a simple and self-contained proof of this result, based exclusively on elementary properties of sums of i.i.d. real-valued random variables."},"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":"1006.1266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-06-07T14:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"92e525cc531cd7143d865f623b783849dfd0d400be4bec9f9f958f33cb229626","abstract_canon_sha256":"6648131ce0ef5a349aeb36090a43d2467ade641920fbf0a3ea3dd36267c07409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:14.316125Z","signature_b64":"iNHwsxeQnoVx3vour4EEO6duwFUDte4NC/umP22cWUylOFra6yrHcoVuVNc0mE7qBx++OrP09MJ+K/y3wLDgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b6af73d0860170dcf98a755efa905958e4425e43af5be77ae60c7bb1b968b9","last_reissued_at":"2026-05-18T04:30:14.315432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:14.315432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak convergence for the minimal position in a branching random walk: a simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"elie aidekon, Zhan Shi","submitted_at":"2010-06-07T14:30:38Z","abstract_excerpt":"Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\\over 2} \\log n$ when $n\\to \\infty$. We give a simple and self-contained proof of this result, based exclusively on elementary properties of sums of i.i.d. real-valued random variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1266","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1006.1266","created_at":"2026-05-18T04:30:14.315542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1266v2","created_at":"2026-05-18T04:30:14.315542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1266","created_at":"2026-05-18T04:30:14.315542+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW3K646QQYAX","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW3K646QQYAXBXHZ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW3K646Q","created_at":"2026-05-18T12:26:06.534383+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/CW3K646QQYAXBXHZRJ2V56UQLF","json":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF.json","graph_json":"https://pith.science/api/pith-number/CW3K646QQYAXBXHZRJ2V56UQLF/graph.json","events_json":"https://pith.science/api/pith-number/CW3K646QQYAXBXHZRJ2V56UQLF/events.json","paper":"https://pith.science/paper/CW3K646Q"},"agent_actions":{"view_html":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF","download_json":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF.json","view_paper":"https://pith.science/paper/CW3K646Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1266&json=true","fetch_graph":"https://pith.science/api/pith-number/CW3K646QQYAXBXHZRJ2V56UQLF/graph.json","fetch_events":"https://pith.science/api/pith-number/CW3K646QQYAXBXHZRJ2V56UQLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF/action/storage_attestation","attest_author":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF/action/author_attestation","sign_citation":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF/action/citation_signature","submit_replication":"https://pith.science/pith/CW3K646QQYAXBXHZRJ2V56UQLF/action/replication_record"}},"created_at":"2026-05-18T04:30:14.315542+00:00","updated_at":"2026-05-18T04:30:14.315542+00:00"}