{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7XHL2HYE5IRLT4RNINOQKJ6OCA","short_pith_number":"pith:7XHL2HYE","schema_version":"1.0","canonical_sha256":"fdcebd1f04ea22b9f22d435d0527ce10031cb8efbbbc1a6cb34f85b6c6221d33","source":{"kind":"arxiv","id":"1612.00406","version":1},"attestation_state":"computed","paper":{"title":"Connectivity properties of Branching Interlacements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Yuan Zhang","submitted_at":"2016-12-01T20:08:14Z","abstract_excerpt":"We consider connectivity properties of the Branching Interlacements model in $\\mathbb{Z}^d,~d\\ge5$, recently introduced by Angel, R\\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the branching interlacements are connected via at most $\\lceil d/4\\rceil$ conditioned critical branching random walks from the underlying Poisson process, and that this upper bound is sharp. In particular every such two branching random walks intersect if and only if $5\\le d\\le 8$. The stochastic dimension of branching random walk result is of independent interes"},"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":"1612.00406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-01T20:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"52b31337c4d3d3522b118624529f158f9046c3fe619262ad291271bdba9b6e28","abstract_canon_sha256":"7a33aab3b36761f1582d15327bc3dbd589fb560ac5785e1d3d42c3551b10ae4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.297918Z","signature_b64":"Wev420yW3tnRaplKjQ4hjFC52oRJ68vpTWvvDK21m8lnkeq4Pr6YB4xRaEYu3Gb1Cm7NulRnI0GKfx/qvNb+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdcebd1f04ea22b9f22d435d0527ce10031cb8efbbbc1a6cb34f85b6c6221d33","last_reissued_at":"2026-05-18T00:56:05.297209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.297209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity properties of Branching Interlacements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Yuan Zhang","submitted_at":"2016-12-01T20:08:14Z","abstract_excerpt":"We consider connectivity properties of the Branching Interlacements model in $\\mathbb{Z}^d,~d\\ge5$, recently introduced by Angel, R\\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the branching interlacements are connected via at most $\\lceil d/4\\rceil$ conditioned critical branching random walks from the underlying Poisson process, and that this upper bound is sharp. In particular every such two branching random walks intersect if and only if $5\\le d\\le 8$. The stochastic dimension of branching random walk result is of independent interes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00406","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":"1612.00406","created_at":"2026-05-18T00:56:05.297336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00406v1","created_at":"2026-05-18T00:56:05.297336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00406","created_at":"2026-05-18T00:56:05.297336+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XHL2HYE5IRL","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XHL2HYE5IRLT4RN","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XHL2HYE","created_at":"2026-05-18T12:30:04.600751+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/7XHL2HYE5IRLT4RNINOQKJ6OCA","json":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA.json","graph_json":"https://pith.science/api/pith-number/7XHL2HYE5IRLT4RNINOQKJ6OCA/graph.json","events_json":"https://pith.science/api/pith-number/7XHL2HYE5IRLT4RNINOQKJ6OCA/events.json","paper":"https://pith.science/paper/7XHL2HYE"},"agent_actions":{"view_html":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA","download_json":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA.json","view_paper":"https://pith.science/paper/7XHL2HYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00406&json=true","fetch_graph":"https://pith.science/api/pith-number/7XHL2HYE5IRLT4RNINOQKJ6OCA/graph.json","fetch_events":"https://pith.science/api/pith-number/7XHL2HYE5IRLT4RNINOQKJ6OCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA/action/storage_attestation","attest_author":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA/action/author_attestation","sign_citation":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA/action/citation_signature","submit_replication":"https://pith.science/pith/7XHL2HYE5IRLT4RNINOQKJ6OCA/action/replication_record"}},"created_at":"2026-05-18T00:56:05.297336+00:00","updated_at":"2026-05-18T00:56:05.297336+00:00"}