{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7NXDADRNC74OOA3IDBDBKJNNF2","short_pith_number":"pith:7NXDADRN","schema_version":"1.0","canonical_sha256":"fb6e300e2d17f8e7036818461525ad2e98bf9a4d704e70a78319e28a1a72b0bb","source":{"kind":"arxiv","id":"1010.0773","version":3},"attestation_state":"computed","paper":{"title":"The 2d-Directed Spanning Forest is almost surely a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"CMAP), David Coupier (LPP), Viet Chi Tran (LPP","submitted_at":"2010-10-05T06:04:14Z","abstract_excerpt":"We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually a tree. Contrary to other directed forests of the literature, no Markovian process can be introduced to study the paths in our DSF. Our proof is based on a comparison argument between surface and perimeter from percolation theory. We then show that this result still holds when the points of N belonging to an auxiliary Boolean model are removed. Using these r"},"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":"1010.0773","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-05T06:04:14Z","cross_cats_sorted":[],"title_canon_sha256":"59f35c9999e0a3203dddac3ea7c26b5affff976e3bcb74c33c184b9f7cc79c0a","abstract_canon_sha256":"79a8859ac533e5b3b3825d13aa131f6d8a855e754281262e7c77468f509d190c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:03.610131Z","signature_b64":"d3JMIY1p1kVGJQw8vc4/XOyIRmbdQqI+ymT00EpgSctyAC0yGrQsIYl6eTexhza4TbzbC7XXpYgctinf5QJPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6e300e2d17f8e7036818461525ad2e98bf9a4d704e70a78319e28a1a72b0bb","last_reissued_at":"2026-05-18T03:40:03.609079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:03.609079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 2d-Directed Spanning Forest is almost surely a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"CMAP), David Coupier (LPP), Viet Chi Tran (LPP","submitted_at":"2010-10-05T06:04:14Z","abstract_excerpt":"We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually a tree. Contrary to other directed forests of the literature, no Markovian process can be introduced to study the paths in our DSF. Our proof is based on a comparison argument between surface and perimeter from percolation theory. We then show that this result still holds when the points of N belonging to an auxiliary Boolean model are removed. Using these r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0773","kind":"arxiv","version":3},"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":"1010.0773","created_at":"2026-05-18T03:40:03.609205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0773v3","created_at":"2026-05-18T03:40:03.609205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0773","created_at":"2026-05-18T03:40:03.609205+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NXDADRNC74O","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NXDADRNC74OOA3I","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NXDADRN","created_at":"2026-05-18T12:26:05.355336+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/7NXDADRNC74OOA3IDBDBKJNNF2","json":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2.json","graph_json":"https://pith.science/api/pith-number/7NXDADRNC74OOA3IDBDBKJNNF2/graph.json","events_json":"https://pith.science/api/pith-number/7NXDADRNC74OOA3IDBDBKJNNF2/events.json","paper":"https://pith.science/paper/7NXDADRN"},"agent_actions":{"view_html":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2","download_json":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2.json","view_paper":"https://pith.science/paper/7NXDADRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0773&json=true","fetch_graph":"https://pith.science/api/pith-number/7NXDADRNC74OOA3IDBDBKJNNF2/graph.json","fetch_events":"https://pith.science/api/pith-number/7NXDADRNC74OOA3IDBDBKJNNF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2/action/storage_attestation","attest_author":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2/action/author_attestation","sign_citation":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2/action/citation_signature","submit_replication":"https://pith.science/pith/7NXDADRNC74OOA3IDBDBKJNNF2/action/replication_record"}},"created_at":"2026-05-18T03:40:03.609205+00:00","updated_at":"2026-05-18T03:40:03.609205+00:00"}