{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MF3PQTBGJTYLTMRLBWC4VWR37J","short_pith_number":"pith:MF3PQTBG","schema_version":"1.0","canonical_sha256":"6176f84c264cf0b9b22b0d85cada3bfa4aaf3fc106630fe30658a665e6b9b868","source":{"kind":"arxiv","id":"1812.10858","version":3},"attestation_state":"computed","paper":{"title":"Branching interlacements and tree-indexed random walks in tori","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Qingsan Zhu","submitted_at":"2018-12-28T01:19:42Z","abstract_excerpt":"We introduce a model of branching interlacements for general critical offspring distributions. It consists of a countable collection of infinite tree-indexed random walk trajectories on $Z^d,d\\geq5$. We show that this model turns out to be the local limit of the tree-indexed random walk in a discrete torus, conditioned on the size proportional to the volume of the torus. This generalizes the previous results of Angel, R\\'{a}th and the author, for the critical geometric offspring distribution. Our model also includes the model of random interlacements introduced by Sznitman as a degenerate case"},"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":"1812.10858","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-28T01:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"9a7ba4ceddd0e171fa938c1b6b5a7f7b20ef50063147d5ae494c9e54be75d7fc","abstract_canon_sha256":"47f0f0908caa42c7816f86dc032a97f05270780a817380a8b77ecc02eb3ee418"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:02.704287Z","signature_b64":"nC0LphWPLKQFGNtt6epaEutkwF3lai8W5L8IG3QshHLSXfkFYCAFis4z2wanYp3nkXxIaxzbewsUCqbret5SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6176f84c264cf0b9b22b0d85cada3bfa4aaf3fc106630fe30658a665e6b9b868","last_reissued_at":"2026-07-05T00:23:02.703905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:02.703905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Branching interlacements and tree-indexed random walks in tori","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Qingsan Zhu","submitted_at":"2018-12-28T01:19:42Z","abstract_excerpt":"We introduce a model of branching interlacements for general critical offspring distributions. It consists of a countable collection of infinite tree-indexed random walk trajectories on $Z^d,d\\geq5$. We show that this model turns out to be the local limit of the tree-indexed random walk in a discrete torus, conditioned on the size proportional to the volume of the torus. This generalizes the previous results of Angel, R\\'{a}th and the author, for the critical geometric offspring distribution. Our model also includes the model of random interlacements introduced by Sznitman as a degenerate case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10858","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.10858/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1812.10858","created_at":"2026-07-05T00:23:02.703963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10858v3","created_at":"2026-07-05T00:23:02.703963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10858","created_at":"2026-07-05T00:23:02.703963+00:00"},{"alias_kind":"pith_short_12","alias_value":"MF3PQTBGJTYL","created_at":"2026-07-05T00:23:02.703963+00:00"},{"alias_kind":"pith_short_16","alias_value":"MF3PQTBGJTYLTMRL","created_at":"2026-07-05T00:23:02.703963+00:00"},{"alias_kind":"pith_short_8","alias_value":"MF3PQTBG","created_at":"2026-07-05T00:23:02.703963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09459","citing_title":"Multipoint connectivity in the branching interlacement process","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J","json":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J.json","graph_json":"https://pith.science/api/pith-number/MF3PQTBGJTYLTMRLBWC4VWR37J/graph.json","events_json":"https://pith.science/api/pith-number/MF3PQTBGJTYLTMRLBWC4VWR37J/events.json","paper":"https://pith.science/paper/MF3PQTBG"},"agent_actions":{"view_html":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J","download_json":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J.json","view_paper":"https://pith.science/paper/MF3PQTBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10858&json=true","fetch_graph":"https://pith.science/api/pith-number/MF3PQTBGJTYLTMRLBWC4VWR37J/graph.json","fetch_events":"https://pith.science/api/pith-number/MF3PQTBGJTYLTMRLBWC4VWR37J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J/action/storage_attestation","attest_author":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J/action/author_attestation","sign_citation":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J/action/citation_signature","submit_replication":"https://pith.science/pith/MF3PQTBGJTYLTMRLBWC4VWR37J/action/replication_record"}},"created_at":"2026-07-05T00:23:02.703963+00:00","updated_at":"2026-07-05T00:23:02.703963+00:00"}