{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OQ7QM2DBVAAYR6KOTAXH5KVYDW","short_pith_number":"pith:OQ7QM2DB","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"},"canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","source":{"kind":"arxiv","id":"1301.3766","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3766","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3766v3","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3766","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"OQ7QM2DBVAAY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OQ7QM2DBVAAYR6KO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OQ7QM2DB","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OQ7QM2DBVAAYR6KOTAXH5KVYDW","target":"record","payload":{"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"},"canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","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"},"source_kind":"arxiv","source_id":"1301.3766","source_version":3,"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-18T02:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bo0bRkEvyYQCJQGrSbwb4t3LZLqFS8gvQfDacIzQVuMhlxVNFCLIquDzLsXBFk2ODwLsogT7SKoVLAZLdnGgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:07.129121Z"},"content_sha256":"73230b55aaa6d763152c676946e060236f37483fa8d41c4f78d61135392adc18","schema_version":"1.0","event_id":"sha256:73230b55aaa6d763152c676946e060236f37483fa8d41c4f78d61135392adc18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OQ7QM2DBVAAYR6KOTAXH5KVYDW","target":"graph","payload":{"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"},"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-18T02:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlGd7RmjbSfQ2/zmP46lXWWwDI5QWal69b1O0Tpe/YcNbHfnUHnW6bIpIfQS7Sl7sNfuiEQeCSVcvh0D2jGvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:07.130020Z"},"content_sha256":"fc88c628f0ad4893fa619a08e882e654c7606e860ad21f1e11c99e0e489cc298","schema_version":"1.0","event_id":"sha256:fc88c628f0ad4893fa619a08e882e654c7606e860ad21f1e11c99e0e489cc298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/bundle.json","state_url":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/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-11T17:18:07Z","links":{"resolver":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW","bundle":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/bundle.json","state":"https://pith.science/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ7QM2DBVAAYR6KOTAXH5KVYDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OQ7QM2DBVAAYR6KOTAXH5KVYDW","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":"a5d1a95d484f9ca7038cdfc1913a814a0e088c4719c9ff0590930ce0372142cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-16T17:55:41Z","title_canon_sha256":"a62c7b97a7aa0c18c3df26d77d1d7317b09c6dfff6769f8628f3de0576853189"},"schema_version":"1.0","source":{"id":"1301.3766","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3766","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3766v3","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3766","created_at":"2026-05-18T02:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"OQ7QM2DBVAAY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OQ7QM2DBVAAYR6KO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OQ7QM2DB","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:fc88c628f0ad4893fa619a08e882e654c7606e860ad21f1e11c99e0e489cc298","target":"graph","created_at":"2026-05-18T02:26:10Z","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 $\\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","authors_text":"Anish Sarkar, Kumarjit Saha, Rahul Roy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-16T17:55:41Z","title":"Random directed forest and the Brownian web"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3766","kind":"arxiv","version":3},"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:73230b55aaa6d763152c676946e060236f37483fa8d41c4f78d61135392adc18","target":"record","created_at":"2026-05-18T02:26:10Z","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":"a5d1a95d484f9ca7038cdfc1913a814a0e088c4719c9ff0590930ce0372142cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-16T17:55:41Z","title_canon_sha256":"a62c7b97a7aa0c18c3df26d77d1d7317b09c6dfff6769f8628f3de0576853189"},"schema_version":"1.0","source":{"id":"1301.3766","kind":"arxiv","version":3}},"canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"743f066861a80188f94e982e7eaab81d96dccc542c5b01ddf780ee26ae88c344","first_computed_at":"2026-05-18T02:26:10.974098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:10.974098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hfDUDJ3AYgF4W8R6zid9QzxN37D6VTvnbbehzVY8BqsdrVdEyq4wGcTO74P7UJGbtxYtC3MhInZv+C91bJS7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:10.974823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3766","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73230b55aaa6d763152c676946e060236f37483fa8d41c4f78d61135392adc18","sha256:fc88c628f0ad4893fa619a08e882e654c7606e860ad21f1e11c99e0e489cc298"],"state_sha256":"954d79e7d39ea6a9ce496de1c32cb90980c80b3a52f339e11b2f948ff28fd9f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XL4PBVuZDBc3ygTfMXpxHs5IcfXUDxNM2HJIM40FLzIC+GB0tXo/P4GJzPhGI+vdFbETvphC2+iSiYkbGrLgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:18:07.133967Z","bundle_sha256":"7fe0e60bcb1c6165ed7ec03121862581f7a2422535228a872eb114ee468d72b5"}}