{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G6ZZOHGFKH2PDMZCOG6TSBW3GO","short_pith_number":"pith:G6ZZOHGF","schema_version":"1.0","canonical_sha256":"37b3971cc551f4f1b32271bd3906db338859c740898040f0dfe398bc249e8656","source":{"kind":"arxiv","id":"2606.11271","version":1},"attestation_state":"computed","paper":{"title":"The $K$-th nearest neighbor random walk on a Poisson point process gets trapped","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anne-Laure Basdevant (LPSM (UMR\\_8001)), David Coupier (IMT Nord Europe), Jean-Baptiste Gou\\'er\\'e (IDP), Marie Th\\'eret (FP2M, Modal'x)","submitted_at":"2026-06-09T08:21:41Z","abstract_excerpt":"The $K$-th nearest neighbor random walk $(X_n)_{n \\geq 0}$ on a homogeneous Poisson point process $\\chi$ on $\\R^d$ ($d\\geq 1$), starts at the origin and at each step picks its next Poisson point among its closest neighbors according to i.i.d. labels having the same distribution as $K$. Our main result (Theorem 1) states that the number of Poisson points visited by $(X_n)_{n \\geq 0}$ admits an exponential decay whenever the random variable $K$ has a bounded support (BS). In particular, the $K$-th nearest neighbor random walk visits finitely many Poisson points if and only if $K$ satisfies Assum"},"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":"2606.11271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-09T08:21:41Z","cross_cats_sorted":[],"title_canon_sha256":"9819c56d7d6cc6b81c991245069b44c0bb6ba3898256ab824d80ca3dd5faa2a5","abstract_canon_sha256":"ce8d74ab24b73a05cf0b1b498413c437643a2597a194d3eb7977023ed0cd4f1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:15.967337Z","signature_b64":"vF833rqHzHXvTLxqN7/wHo2X/9+7Yjq1ZyeD1hLdBYBB+ns03i0YfGjEiRmInT16mWwUhzF+1yAlXRjpc2SqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b3971cc551f4f1b32271bd3906db338859c740898040f0dfe398bc249e8656","last_reissued_at":"2026-06-11T00:08:15.966638Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:15.966638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $K$-th nearest neighbor random walk on a Poisson point process gets trapped","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anne-Laure Basdevant (LPSM (UMR\\_8001)), David Coupier (IMT Nord Europe), Jean-Baptiste Gou\\'er\\'e (IDP), Marie Th\\'eret (FP2M, Modal'x)","submitted_at":"2026-06-09T08:21:41Z","abstract_excerpt":"The $K$-th nearest neighbor random walk $(X_n)_{n \\geq 0}$ on a homogeneous Poisson point process $\\chi$ on $\\R^d$ ($d\\geq 1$), starts at the origin and at each step picks its next Poisson point among its closest neighbors according to i.i.d. labels having the same distribution as $K$. Our main result (Theorem 1) states that the number of Poisson points visited by $(X_n)_{n \\geq 0}$ admits an exponential decay whenever the random variable $K$ has a bounded support (BS). In particular, the $K$-th nearest neighbor random walk visits finitely many Poisson points if and only if $K$ satisfies Assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11271","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11271/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":"2606.11271","created_at":"2026-06-11T00:08:15.966745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11271v1","created_at":"2026-06-11T00:08:15.966745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11271","created_at":"2026-06-11T00:08:15.966745+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6ZZOHGFKH2P","created_at":"2026-06-11T00:08:15.966745+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6ZZOHGFKH2PDMZC","created_at":"2026-06-11T00:08:15.966745+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6ZZOHGF","created_at":"2026-06-11T00:08:15.966745+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/G6ZZOHGFKH2PDMZCOG6TSBW3GO","json":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO.json","graph_json":"https://pith.science/api/pith-number/G6ZZOHGFKH2PDMZCOG6TSBW3GO/graph.json","events_json":"https://pith.science/api/pith-number/G6ZZOHGFKH2PDMZCOG6TSBW3GO/events.json","paper":"https://pith.science/paper/G6ZZOHGF"},"agent_actions":{"view_html":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO","download_json":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO.json","view_paper":"https://pith.science/paper/G6ZZOHGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11271&json=true","fetch_graph":"https://pith.science/api/pith-number/G6ZZOHGFKH2PDMZCOG6TSBW3GO/graph.json","fetch_events":"https://pith.science/api/pith-number/G6ZZOHGFKH2PDMZCOG6TSBW3GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO/action/storage_attestation","attest_author":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO/action/author_attestation","sign_citation":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO/action/citation_signature","submit_replication":"https://pith.science/pith/G6ZZOHGFKH2PDMZCOG6TSBW3GO/action/replication_record"}},"created_at":"2026-06-11T00:08:15.966745+00:00","updated_at":"2026-06-11T00:08:15.966745+00:00"}