{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:7XHTTXIBHZHC2HILEJCABFATIA","short_pith_number":"pith:7XHTTXIB","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"},"canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","source":{"kind":"arxiv","id":"math/0407118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407118","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407118v1","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407118","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"7XHTTXIBHZHC","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"7XHTTXIBHZHC2HIL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"7XHTTXIB","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:7XHTTXIBHZHC2HILEJCABFATIA","target":"record","payload":{"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"},"canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","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"},"source_kind":"arxiv","source_id":"math/0407118","source_version":1,"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-18T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGjZuNByqtBavXMC/4HTrjNCaI4jOCjk4dyIf9WHV3s3NjnK3jA1qICA93Be7PEUv+aXc3qz5WErgK/KHKzvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:09:58.872610Z"},"content_sha256":"feb88b4d78e441dcd9ba16df71d62ed9315c92fe7449f4659e0be2b4612fd8dc","schema_version":"1.0","event_id":"sha256:feb88b4d78e441dcd9ba16df71d62ed9315c92fe7449f4659e0be2b4612fd8dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:7XHTTXIBHZHC2HILEJCABFATIA","target":"graph","payload":{"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"},"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-18T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TM0hHMbjrxGAcaimKS9pwsyk/R9Pvu/+Laf7MWDhxVPsQ5WvxqlZ62GUShWqIsKtZ/dObWxUATnEWjOYhHuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:09:58.872952Z"},"content_sha256":"e149a04327dd9d78d08b1a1c7823541bc92bcd571ebc86e05f347a89c28291cb","schema_version":"1.0","event_id":"sha256:e149a04327dd9d78d08b1a1c7823541bc92bcd571ebc86e05f347a89c28291cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/bundle.json","state_url":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XHTTXIBHZHC2HILEJCABFATIA/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-28T23:09:58Z","links":{"resolver":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA","bundle":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/bundle.json","state":"https://pith.science/pith/7XHTTXIBHZHC2HILEJCABFATIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XHTTXIBHZHC2HILEJCABFATIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:7XHTTXIBHZHC2HILEJCABFATIA","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":"dde48e6989ccd50c74231061951f8769280942af0f1a925db123fad8c9d12b65","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T08:02:05Z","title_canon_sha256":"cae962ef2c0f5a4fc8966f8266cf77c01a08334c3a3e2bb296c7024265f29dc1"},"schema_version":"1.0","source":{"id":"math/0407118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407118","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407118v1","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407118","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"7XHTTXIBHZHC","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"7XHTTXIBHZHC2HIL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"7XHTTXIB","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:e149a04327dd9d78d08b1a1c7823541bc92bcd571ebc86e05f347a89c28291cb","target":"graph","created_at":"2026-05-18T01:05:26Z","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":"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","authors_text":"Anish Sarkar, Rahul Roy, Sreela Gangopadhyay","cross_cats":[],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T08:02:05Z","title":"Random oriented Trees: a Model of drainage networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407118","kind":"arxiv","version":1},"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:feb88b4d78e441dcd9ba16df71d62ed9315c92fe7449f4659e0be2b4612fd8dc","target":"record","created_at":"2026-05-18T01:05:26Z","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":"dde48e6989ccd50c74231061951f8769280942af0f1a925db123fad8c9d12b65","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T08:02:05Z","title_canon_sha256":"cae962ef2c0f5a4fc8966f8266cf77c01a08334c3a3e2bb296c7024265f29dc1"},"schema_version":"1.0","source":{"id":"math/0407118","kind":"arxiv","version":1}},"canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdcf39dd013e4e2d1d0b2244009413402042b4e808cdc8de79e60fda8128093e","first_computed_at":"2026-05-18T01:05:26.223161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:26.223161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tA0BB1Qu5zGJAriqzCTHbhu1/3Cs7UPcPsOlVKa0NFCQMtRgoOKIW9Ex1dn8BD14H42mxA+GXQ/r2ZmU3jjlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:26.223767Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0407118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feb88b4d78e441dcd9ba16df71d62ed9315c92fe7449f4659e0be2b4612fd8dc","sha256:e149a04327dd9d78d08b1a1c7823541bc92bcd571ebc86e05f347a89c28291cb"],"state_sha256":"f9acaa2c95347f69868ee24d246d4f76a8de5898c7dfd1a9c127104d02b63e84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+jCd6nKUtRX2Izn3aCYwyme3m0kODTDdC4Zfh+5EXTVwGMoDQhFnDNGI5eJU1qjUkjLoQbtWBAYJutMBGjfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T23:09:58.874819Z","bundle_sha256":"c2bd482ea295864f411fdd2a8a4569943bbef5100a0846b3aa8e2bde2de61ce9"}}