{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:GEWNYEM3IK6AOAM6JF3ACGO6UJ","short_pith_number":"pith:GEWNYEM3","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"},"canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","source":{"kind":"arxiv","id":"math/0209395","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0209395","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0209395v2","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0209395","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"GEWNYEM3IK6A","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GEWNYEM3IK6AOAM6","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GEWNYEM3","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:GEWNYEM3IK6AOAM6JF3ACGO6UJ","target":"record","payload":{"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"},"canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","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"},"source_kind":"arxiv","source_id":"math/0209395","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+ZEh2g0qYt3hNPnDkemn22UQzwtpJsDQOr08zj4mKH3YKuhM9XDHDK0BPxXI5hZrb4zzK4UaPv9U5CqEzkQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:26:26.701755Z"},"content_sha256":"bfcd6f63e651841468994ee449feee6a0208cfc24cc049fd529a03b39085a981","schema_version":"1.0","event_id":"sha256:bfcd6f63e651841468994ee449feee6a0208cfc24cc049fd529a03b39085a981"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:GEWNYEM3IK6AOAM6JF3ACGO6UJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOIL8xR6e7aFgqkM7jrUbYdWbwdtFSjtzgPxQ5LY5LEugceYqwJToWhRUfFqHoDmQ2EGBJnzfv/ZYzGbGcqDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:26:26.702546Z"},"content_sha256":"51063e832bf86c4c087b2f4618b5b81a65d53668cfd7f01cfecdceda83788bbc","schema_version":"1.0","event_id":"sha256:51063e832bf86c4c087b2f4618b5b81a65d53668cfd7f01cfecdceda83788bbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/bundle.json","state_url":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T12:26:26Z","links":{"resolver":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ","bundle":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/bundle.json","state":"https://pith.science/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEWNYEM3IK6AOAM6JF3ACGO6UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:GEWNYEM3IK6AOAM6JF3ACGO6UJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37d6aa76bd1b94fc8d8c886cbd7df96827d8f02e1fdedbe356686dd6b7b325fa","cross_cats_sorted":["math-ph","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2002-09-27T23:58:00Z","title_canon_sha256":"38bc9139e71a809a51db97ad4ffbaaab1b09ef4be0b06256ea6c6522a4ffdad1"},"schema_version":"1.0","source":{"id":"math/0209395","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0209395","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0209395v2","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0209395","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"GEWNYEM3IK6A","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GEWNYEM3IK6AOAM6","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GEWNYEM3","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:51063e832bf86c4c087b2f4618b5b81a65d53668cfd7f01cfecdceda83788bbc","target":"graph","created_at":"2026-05-18T04:08:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"C. Landim, H. Thorisson, P. A. Ferrari","cross_cats":["math-ph","math.MP"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2002-09-27T23:58:00Z","title":"Poisson trees, succession lines and coalescing random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0209395","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfcd6f63e651841468994ee449feee6a0208cfc24cc049fd529a03b39085a981","target":"record","created_at":"2026-05-18T04:08:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37d6aa76bd1b94fc8d8c886cbd7df96827d8f02e1fdedbe356686dd6b7b325fa","cross_cats_sorted":["math-ph","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2002-09-27T23:58:00Z","title_canon_sha256":"38bc9139e71a809a51db97ad4ffbaaab1b09ef4be0b06256ea6c6522a4ffdad1"},"schema_version":"1.0","source":{"id":"math/0209395","kind":"arxiv","version":2}},"canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"312cdc119b42bc07019e49760119dea253bf318a811f914e304417e5543a7449","first_computed_at":"2026-05-18T04:08:43.146354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:43.146354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6hM4aRkOyFkpQPN8d4MsIB2BjnI2xTlUA3yIX2TG0vvXylap//86tCz0+GihiDAG4t2ESb4erUAG6PCBOtxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:43.146866Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0209395","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfcd6f63e651841468994ee449feee6a0208cfc24cc049fd529a03b39085a981","sha256:51063e832bf86c4c087b2f4618b5b81a65d53668cfd7f01cfecdceda83788bbc"],"state_sha256":"fc4d2307afaeb185c11aaa42fb21ca430c5ea55831eac3d36d36ceae06668ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgdWy3Bge92IvWXgOvy5PcWq6zQ8e9C66hUkWcjGrWrcNgKrPIfYzydTEsXH5OPLtoPy9KehnGCFMNvb/xGECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:26:26.706603Z","bundle_sha256":"1af10bbcf571084bb5bba5d8cba66779ee46544286dcf6cab10f86814064ed35"}}