{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:LEK3E6PBOJSEZFZ7XU55H44ORO","short_pith_number":"pith:LEK3E6PB","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"},"canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","source":{"kind":"arxiv","id":"math/0107140","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0107140","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0107140v3","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0107140","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"LEK3E6PBOJSE","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"LEK3E6PBOJSEZFZ7","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"LEK3E6PB","created_at":"2026-07-04T15:41:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:LEK3E6PBOJSEZFZ7XU55H44ORO","target":"record","payload":{"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"},"canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","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"},"source_kind":"arxiv","source_id":"math/0107140","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-07-04T15:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+5Pp4gmHqTvjH5OsQ/Kc5SEiZlf1d1cib2O27mnXAsLkn9EuxNGhDUDTq2avMRyNj9eFoD2DWLQ4QwY8QvoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:47:44.044232Z"},"content_sha256":"a608e3eba8bf3ffb05b8958f69022175934932d01b8e55d93463ca07d6e0fbfb","schema_version":"1.0","event_id":"sha256:a608e3eba8bf3ffb05b8958f69022175934932d01b8e55d93463ca07d6e0fbfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:LEK3E6PBOJSEZFZ7XU55H44ORO","target":"graph","payload":{"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"},"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-07-04T15:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZifvJ+DSZLjRV7Lbq0zj6N67DcT5xcQTcCHxmVjCX+atL4dwkw/dBGRWRVfZf3mWgtv92qtIEn04Ivz9rBYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:47:44.045125Z"},"content_sha256":"e328bfc39288b882ddf15ab98e3509a173b3c54e37086ae8594be5d5bd07c64b","schema_version":"1.0","event_id":"sha256:e328bfc39288b882ddf15ab98e3509a173b3c54e37086ae8594be5d5bd07c64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/bundle.json","state_url":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/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-08-11T01:47:44Z","links":{"resolver":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO","bundle":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/bundle.json","state":"https://pith.science/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEK3E6PBOJSEZFZ7XU55H44ORO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:LEK3E6PBOJSEZFZ7XU55H44ORO","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":"4c0bc150cabbc5f31df7ef3e8cf5bfba4d8533d1cd1eafb85885224ac4d51889","cross_cats_sorted":["math-ph","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2001-07-19T21:12:23Z","title_canon_sha256":"56855087123f7df6b144ef61d1a9a0fd4e91cf156a7d2af480dd334b082adbf4"},"schema_version":"1.0","source":{"id":"math/0107140","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0107140","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0107140v3","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0107140","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"LEK3E6PBOJSE","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"LEK3E6PBOJSEZFZ7","created_at":"2026-07-04T15:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"LEK3E6PB","created_at":"2026-07-04T15:41:50Z"}],"graph_snapshots":[{"event_id":"sha256:e328bfc39288b882ddf15ab98e3509a173b3c54e37086ae8594be5d5bd07c64b","target":"graph","created_at":"2026-07-04T15:41:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0107140/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Harry Kesten, Itai Benjamini, Oded Schramm, Yuval Peres","cross_cats":["math-ph","math.MP"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2001-07-19T21:12:23Z","title":"Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0107140","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:a608e3eba8bf3ffb05b8958f69022175934932d01b8e55d93463ca07d6e0fbfb","target":"record","created_at":"2026-07-04T15:41:50Z","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":"4c0bc150cabbc5f31df7ef3e8cf5bfba4d8533d1cd1eafb85885224ac4d51889","cross_cats_sorted":["math-ph","math.MP"],"license":"","primary_cat":"math.PR","submitted_at":"2001-07-19T21:12:23Z","title_canon_sha256":"56855087123f7df6b144ef61d1a9a0fd4e91cf156a7d2af480dd334b082adbf4"},"schema_version":"1.0","source":{"id":"math/0107140","kind":"arxiv","version":3}},"canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5915b279e172644c973fbd3bd3f38e8b95fbf52d6e11b44ab7c7bcf559114a42","first_computed_at":"2026-07-04T15:41:50.906116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:41:50.906116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q5YvZf8gzDVJi9s79skJ1e6SYvuLUM7fD43m1iZ7S9OGURMYPmPrFyGMJ/X4j4K2dsJvI3EdmOFLbCCl0A22Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:41:50.906555Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0107140","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a608e3eba8bf3ffb05b8958f69022175934932d01b8e55d93463ca07d6e0fbfb","sha256:e328bfc39288b882ddf15ab98e3509a173b3c54e37086ae8594be5d5bd07c64b"],"state_sha256":"faf6d73b1a860104468671eafe9a3ac62a98f8470d267a45dc92b8a52cb8f4f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArO6iIxefeSxQZK0+wBEWWY1rnC3CQBbnmhRQtD6/EdVFHferTm0E63y0HZtMzHjuunt/JZleMsMpGXzAZlzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:47:44.052675Z","bundle_sha256":"221fa6da3f725c9eec890e788e5eaf9631b2a462e4b5cf09fe74b3161c4c1f06"}}