{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OQ7QM2DBVAAYR6KOTAXH5KVYDW","short_pith_number":"pith:OQ7QM2DB","schema_version":"1.0","canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","source":{"kind":"arxiv","id":"1301.3766","version":3},"attestation_state":"computed","paper":{"title":"Random directed forest and the Brownian web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anish Sarkar, Kumarjit Saha, Rahul Roy","submitted_at":"2013-01-16T17:55:41Z","abstract_excerpt":"Consider the $d$ dimensional lattice $\\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\\mathbb{u} := (\\mathbb{u}(1), \\mathbb{u}(2),...,\\mathbb{u}(d))$ is connected by an edge to another open vertex which has the minimum $L_1$ distance among all the open vertices with $\\mathbb{x}(d)>\\mathbb{u}(d)$. It is shown that this random graph is a tree almost surely for $d=2$ and 3 and it is an infinite collection of disjoint trees for $d\\geq 4$. In addition for $d=2$, we show that when properly scaled, family of its paths converges in distribu"},"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":"1301.3766","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-16T17:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"a62c7b97a7aa0c18c3df26d77d1d7317b09c6dfff6769f8628f3de0576853189","abstract_canon_sha256":"a5d1a95d484f9ca7038cdfc1913a814a0e088c4719c9ff0590930ce0372142cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:10.974823Z","signature_b64":"hfDUDJ3AYgF4W8R6zid9QzxN37D6VTvnbbehzVY8BqsdrVdEyq4wGcTO74P7UJGbtxYtC3MhInZv+C91bJS7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","last_reissued_at":"2026-05-18T02:26:10.974098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:10.974098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random directed forest and the Brownian web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anish Sarkar, Kumarjit Saha, Rahul Roy","submitted_at":"2013-01-16T17:55:41Z","abstract_excerpt":"Consider the $d$ dimensional lattice $\\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\\mathbb{u} := (\\mathbb{u}(1), \\mathbb{u}(2),...,\\mathbb{u}(d))$ is connected by an edge to another open vertex which has the minimum $L_1$ distance among all the open vertices with $\\mathbb{x}(d)>\\mathbb{u}(d)$. It is shown that this random graph is a tree almost surely for $d=2$ and 3 and it is an infinite collection of disjoint trees for $d\\geq 4$. In addition for $d=2$, we show that when properly scaled, family of its paths converges in distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3766","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":"1301.3766","created_at":"2026-05-18T02:26:10.974207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3766v3","created_at":"2026-05-18T02:26:10.974207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3766","created_at":"2026-05-18T02:26:10.974207+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQ7QM2DBVAAY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQ7QM2DBVAAYR6KO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQ7QM2DB","created_at":"2026-05-18T12:27:54.935989+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/OQ7QM2DBVAAYR6KOTAXH5KVYDW","json":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW.json","graph_json":"https://pith.science/api/pith-number/OQ7QM2DBVAAYR6KOTAXH5KVYDW/graph.json","events_json":"https://pith.science/api/pith-number/OQ7QM2DBVAAYR6KOTAXH5KVYDW/events.json","paper":"https://pith.science/paper/OQ7QM2DB"},"agent_actions":{"view_html":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW","download_json":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW.json","view_paper":"https://pith.science/paper/OQ7QM2DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3766&json=true","fetch_graph":"https://pith.science/api/pith-number/OQ7QM2DBVAAYR6KOTAXH5KVYDW/graph.json","fetch_events":"https://pith.science/api/pith-number/OQ7QM2DBVAAYR6KOTAXH5KVYDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/action/storage_attestation","attest_author":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/action/author_attestation","sign_citation":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/action/citation_signature","submit_replication":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/action/replication_record"}},"created_at":"2026-05-18T02:26:10.974207+00:00","updated_at":"2026-05-18T02:26:10.974207+00:00"}