{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DRWDESM272XI2WWD67AFN3JULF","short_pith_number":"pith:DRWDESM2","schema_version":"1.0","canonical_sha256":"1c6c32499afeae8d5ac3f7c056ed345962254464315173c71be091c87be8c29c","source":{"kind":"arxiv","id":"2301.08547","version":3},"attestation_state":"computed","paper":{"title":"Infinite collision property for the three-dimensional uniform spanning tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Satomi Watanabe","submitted_at":"2023-01-20T13:06:20Z","abstract_excerpt":"Let $\\mathcal{U}$ be the uniform spanning tree on $\\mathbb{Z}^3$, whose probability law is denoted by $\\mathbf{P}$. For $\\mathbf{P}$-a.s. realization of $\\mathcal{U}$, the recurrence of the the simple random walk on $\\mathcal{U}$ is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on $\\mathcal{U}$ collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on $\\mathcal{U}$, which provides another proof of the infinite collision property of $\\mathcal{U}$."},"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":"2301.08547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-01-20T13:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"1e7467ccc3232a67089d8e357ae4669e4101f98a4967e476db005319bb8c9a7f","abstract_canon_sha256":"7038cef4d3e5268d70e3afef60bbe28c3dcbce1eed19fb25b78f4355cc45d4c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:22.106496Z","signature_b64":"GlB6AIlqShLWJFiasz031ZcRMe/MPTLNdu4RI+GB4cgZqAD4j9JD/hgjzDI2l5zcYaVs8Tl43v92KnNbmYuUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6c32499afeae8d5ac3f7c056ed345962254464315173c71be091c87be8c29c","last_reissued_at":"2026-07-05T05:40:22.106130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:22.106130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite collision property for the three-dimensional uniform spanning tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Satomi Watanabe","submitted_at":"2023-01-20T13:06:20Z","abstract_excerpt":"Let $\\mathcal{U}$ be the uniform spanning tree on $\\mathbb{Z}^3$, whose probability law is denoted by $\\mathbf{P}$. For $\\mathbf{P}$-a.s. realization of $\\mathcal{U}$, the recurrence of the the simple random walk on $\\mathcal{U}$ is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on $\\mathcal{U}$ collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on $\\mathcal{U}$, which provides another proof of the infinite collision property of $\\mathcal{U}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08547","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/2301.08547/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":"2301.08547","created_at":"2026-07-05T05:40:22.106189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08547v3","created_at":"2026-07-05T05:40:22.106189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08547","created_at":"2026-07-05T05:40:22.106189+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRWDESM272XI","created_at":"2026-07-05T05:40:22.106189+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRWDESM272XI2WWD","created_at":"2026-07-05T05:40:22.106189+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRWDESM2","created_at":"2026-07-05T05:40:22.106189+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/DRWDESM272XI2WWD67AFN3JULF","json":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF.json","graph_json":"https://pith.science/api/pith-number/DRWDESM272XI2WWD67AFN3JULF/graph.json","events_json":"https://pith.science/api/pith-number/DRWDESM272XI2WWD67AFN3JULF/events.json","paper":"https://pith.science/paper/DRWDESM2"},"agent_actions":{"view_html":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF","download_json":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF.json","view_paper":"https://pith.science/paper/DRWDESM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08547&json=true","fetch_graph":"https://pith.science/api/pith-number/DRWDESM272XI2WWD67AFN3JULF/graph.json","fetch_events":"https://pith.science/api/pith-number/DRWDESM272XI2WWD67AFN3JULF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF/action/storage_attestation","attest_author":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF/action/author_attestation","sign_citation":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF/action/citation_signature","submit_replication":"https://pith.science/pith/DRWDESM272XI2WWD67AFN3JULF/action/replication_record"}},"created_at":"2026-07-05T05:40:22.106189+00:00","updated_at":"2026-07-05T05:40:22.106189+00:00"}