{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:7XHTTXIBHZHC2HILEJCABFATIA","short_pith_number":"pith:7XHTTXIB","schema_version":"1.0","canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","source":{"kind":"arxiv","id":"math/0407118","version":1},"attestation_state":"computed","paper":{"title":"Random oriented Trees: a Model of drainage networks","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anish Sarkar, Rahul Roy, Sreela Gangopadhyay","submitted_at":"2004-07-08T08:02:05Z","abstract_excerpt":"Consider the d-dimensional lattice Z^d where each vertex is ``open'' or\n ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w satisfy w(d)=v(d)-1. In case of nonuniqueness of such a vertex w, we choose any one of the closest vertices with equal probability and independently of the other random mechanisms. It is shown that this random graph is a tree almost surely for d=2 and 3 and it is an infinite collection of distinct trees for d\\geq4. In addition, for any dimension, we show that 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/0407118","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T08:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"cae962ef2c0f5a4fc8966f8266cf77c01a08334c3a3e2bb296c7024265f29dc1","abstract_canon_sha256":"dde48e6989ccd50c74231061951f8769280942af0f1a925db123fad8c9d12b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:26.223767Z","signature_b64":"tA0BB1Qu5zGJAriqzCTHbhu1/3Cs7UPcPsOlVKa0NFCQMtRgoOKIW9Ex1dn8BD14H42mxA+GXQ/r2ZmU3jjlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","last_reissued_at":"2026-05-18T01:05:26.223161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:26.223161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random oriented Trees: a Model of drainage networks","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anish Sarkar, Rahul Roy, Sreela Gangopadhyay","submitted_at":"2004-07-08T08:02:05Z","abstract_excerpt":"Consider the d-dimensional lattice Z^d where each vertex is ``open'' or\n ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w satisfy w(d)=v(d)-1. In case of nonuniqueness of such a vertex w, we choose any one of the closest vertices with equal probability and independently of the other random mechanisms. It is shown that this random graph is a tree almost surely for d=2 and 3 and it is an infinite collection of distinct trees for d\\geq4. In addition, for any dimension, we show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407118","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":""},"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/0407118","created_at":"2026-05-18T01:05:26.223256+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0407118v1","created_at":"2026-05-18T01:05:26.223256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407118","created_at":"2026-05-18T01:05:26.223256+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XHTTXIBHZHC","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XHTTXIBHZHC2HIL","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XHTTXIB","created_at":"2026-05-18T12:25:52.051335+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/7XHTTXIBHZHC2HILEJCABFATIA","json":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA.json","graph_json":"https://pith.science/api/pith-number/7XHTTXIBHZHC2HILEJCABFATIA/graph.json","events_json":"https://pith.science/api/pith-number/7XHTTXIBHZHC2HILEJCABFATIA/events.json","paper":"https://pith.science/paper/7XHTTXIB"},"agent_actions":{"view_html":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA","download_json":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA.json","view_paper":"https://pith.science/paper/7XHTTXIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0407118&json=true","fetch_graph":"https://pith.science/api/pith-number/7XHTTXIBHZHC2HILEJCABFATIA/graph.json","fetch_events":"https://pith.science/api/pith-number/7XHTTXIBHZHC2HILEJCABFATIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/action/storage_attestation","attest_author":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/action/author_attestation","sign_citation":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/action/citation_signature","submit_replication":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/action/replication_record"}},"created_at":"2026-05-18T01:05:26.223256+00:00","updated_at":"2026-05-18T01:05:26.223256+00:00"}