{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:GEWNYEM3IK6AOAM6JF3ACGO6UJ","short_pith_number":"pith:GEWNYEM3","schema_version":"1.0","canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","source":{"kind":"arxiv","id":"math/0209395","version":2},"attestation_state":"computed","paper":{"title":"Poisson trees, succession lines and coalescing random walks","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"C. Landim, H. Thorisson, P. A. Ferrari","submitted_at":"2002-09-27T23:58:00Z","abstract_excerpt":"We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of coordinates. We show that (1) the graph has one topological end --that is, from any point there is exactly one infinite self-avoiding path; (2) the graph has a unique connected component if d=2 and d=3 (a tree) and it has infinitely many components if d\\ge 4 (a forest); (3) in d=2 and d=3 we construct a bijection between the points of the Poisson process and Z using t"},"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":"math/0209395","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2002-09-27T23:58:00Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"38bc9139e71a809a51db97ad4ffbaaab1b09ef4be0b06256ea6c6522a4ffdad1","abstract_canon_sha256":"37d6aa76bd1b94fc8d8c886cbd7df96827d8f02e1fdedbe356686dd6b7b325fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:43.146866Z","signature_b64":"X6hM4aRkOyFkpQPN8d4MsIB2BjnI2xTlUA3yIX2TG0vvXylap//86tCz0+GihiDAG4t2ESb4erUAG6PCBOtxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","last_reissued_at":"2026-05-18T04:08:43.146354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:43.146354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poisson trees, succession lines and coalescing random walks","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"C. Landim, H. Thorisson, P. A. Ferrari","submitted_at":"2002-09-27T23:58:00Z","abstract_excerpt":"We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of coordinates. We show that (1) the graph has one topological end --that is, from any point there is exactly one infinite self-avoiding path; (2) the graph has a unique connected component if d=2 and d=3 (a tree) and it has infinitely many components if d\\ge 4 (a forest); (3) in d=2 and d=3 we construct a bijection between the points of the Poisson process and Z using t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0209395","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":"math/0209395","created_at":"2026-05-18T04:08:43.146448+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0209395v2","created_at":"2026-05-18T04:08:43.146448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0209395","created_at":"2026-05-18T04:08:43.146448+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEWNYEM3IK6A","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEWNYEM3IK6AOAM6","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEWNYEM3","created_at":"2026-05-18T12:25:50.845339+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/GEWNYEM3IK6AOAM6JF3ACGO6UJ","json":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ.json","graph_json":"https://pith.science/api/pith-number/GEWNYEM3IK6AOAM6JF3ACGO6UJ/graph.json","events_json":"https://pith.science/api/pith-number/GEWNYEM3IK6AOAM6JF3ACGO6UJ/events.json","paper":"https://pith.science/paper/GEWNYEM3"},"agent_actions":{"view_html":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ","download_json":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ.json","view_paper":"https://pith.science/paper/GEWNYEM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0209395&json=true","fetch_graph":"https://pith.science/api/pith-number/GEWNYEM3IK6AOAM6JF3ACGO6UJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GEWNYEM3IK6AOAM6JF3ACGO6UJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/action/storage_attestation","attest_author":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/action/author_attestation","sign_citation":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/action/citation_signature","submit_replication":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/action/replication_record"}},"created_at":"2026-05-18T04:08:43.146448+00:00","updated_at":"2026-05-18T04:08:43.146448+00:00"}