{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:LEK3E6PBOJSEZFZ7XU55H44ORO","short_pith_number":"pith:LEK3E6PB","schema_version":"1.0","canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","source":{"kind":"arxiv","id":"math/0107140","version":3},"attestation_state":"computed","paper":{"title":"Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Harry Kesten, Itai Benjamini, Oded Schramm, Yuval Peres","submitted_at":"2001-07-19T21:12:23Z","abstract_excerpt":"The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the USF in Z^d are adjacent a.s. if 5 <= d <= 8, but not if d >= 9. More generally, let N(x,y) be the minimum number of edges outside the USF in a path joining x and y in Z^d. Then a.s. max{N(x,y) : x,y in Z^d} is the integer part of (d-1)/4. The notion of stochastic dimension for random relations in the lattice is introduced and used in the proof."},"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":"math/0107140","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2001-07-19T21:12:23Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"56855087123f7df6b144ef61d1a9a0fd4e91cf156a7d2af480dd334b082adbf4","abstract_canon_sha256":"4c0bc150cabbc5f31df7ef3e8cf5bfba4d8533d1cd1eafb85885224ac4d51889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:41:50.906555Z","signature_b64":"Q5YvZf8gzDVJi9s79skJ1e6SYvuLUM7fD43m1iZ7S9OGURMYPmPrFyGMJ/X4j4K2dsJvI3EdmOFLbCCl0A22Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","last_reissued_at":"2026-07-04T15:41:50.906116Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:41:50.906116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Harry Kesten, Itai Benjamini, Oded Schramm, Yuval Peres","submitted_at":"2001-07-19T21:12:23Z","abstract_excerpt":"The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the USF in Z^d are adjacent a.s. if 5 <= d <= 8, but not if d >= 9. More generally, let N(x,y) be the minimum number of edges outside the USF in a path joining x and y in Z^d. Then a.s. max{N(x,y) : x,y in Z^d} is the integer part of (d-1)/4. The notion of stochastic dimension for random relations in the lattice is introduced and used in the proof."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0107140","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/math/0107140/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":"math/0107140","created_at":"2026-07-04T15:41:50.906181+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0107140v3","created_at":"2026-07-04T15:41:50.906181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0107140","created_at":"2026-07-04T15:41:50.906181+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEK3E6PBOJSE","created_at":"2026-07-04T15:41:50.906181+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEK3E6PBOJSEZFZ7","created_at":"2026-07-04T15:41:50.906181+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEK3E6PB","created_at":"2026-07-04T15:41:50.906181+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/LEK3E6PBOJSEZFZ7XU55H44ORO","json":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO.json","graph_json":"https://pith.science/api/pith-number/LEK3E6PBOJSEZFZ7XU55H44ORO/graph.json","events_json":"https://pith.science/api/pith-number/LEK3E6PBOJSEZFZ7XU55H44ORO/events.json","paper":"https://pith.science/paper/LEK3E6PB"},"agent_actions":{"view_html":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO","download_json":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO.json","view_paper":"https://pith.science/paper/LEK3E6PB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0107140&json=true","fetch_graph":"https://pith.science/api/pith-number/LEK3E6PBOJSEZFZ7XU55H44ORO/graph.json","fetch_events":"https://pith.science/api/pith-number/LEK3E6PBOJSEZFZ7XU55H44ORO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/action/storage_attestation","attest_author":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/action/author_attestation","sign_citation":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/action/citation_signature","submit_replication":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/action/replication_record"}},"created_at":"2026-07-04T15:41:50.906181+00:00","updated_at":"2026-07-04T15:41:50.906181+00:00"}