{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZTN6HJL4YFE5YN6IBHG5P3IZEX","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":"181bccd45627fce70e1228d7eb7d9c83f69d785040247053e6a8b30b7c43dd4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-15T14:31:51Z","title_canon_sha256":"3e7039410f2deaba91d3f29db47a076b4cd2daf177b0feec0d2ed55e00117b97"},"schema_version":"1.0","source":{"id":"1810.06382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06382","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06382v1","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06382","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZTN6HJL4YFE5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTN6HJL4YFE5YN6I","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTN6HJL4","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e253c047050ea8a1cfa275e88da1b1ebd637f26db220d2cacd68cc1d7087cc28","target":"graph","created_at":"2026-05-18T00:03:20Z","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"},"paper":{"abstract_excerpt":"We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\\mathbb{Z}^d$: Suppose that $\\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of the forest. Then either every $k$-tuple of distinct trees has property $\\mathscr{A}$ almost surely, or no $k$-tuple of distinct trees has property $\\mathscr{A}$ almost surely. This generalizes the indistinguishability theorem of the author and Nachmias (2016), which applied to individual trees. Our results apply more generally to any graph that has the Liou","authors_text":"Tom Hutchcroft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-15T14:31:51Z","title":"Indistinguishability of collections of trees in the uniform spanning forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06382","kind":"arxiv","version":1},"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:38acd7d8021dcb00cbdfccef920101fde4bd854aa1fc1e545062baee439dd1fc","target":"record","created_at":"2026-05-18T00:03:20Z","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":"181bccd45627fce70e1228d7eb7d9c83f69d785040247053e6a8b30b7c43dd4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-15T14:31:51Z","title_canon_sha256":"3e7039410f2deaba91d3f29db47a076b4cd2daf177b0feec0d2ed55e00117b97"},"schema_version":"1.0","source":{"id":"1810.06382","kind":"arxiv","version":1}},"canonical_sha256":"ccdbe3a57cc149dc37c809cdd7ed1925d08e8efa44c5d89ec3f6e3c005c027d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdbe3a57cc149dc37c809cdd7ed1925d08e8efa44c5d89ec3f6e3c005c027d4","first_computed_at":"2026-05-18T00:03:20.627422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:20.627422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"deIioh9y0yn2YEee+thzOjhZ9xqo5t5qco9F4hHPr7qoJjdKpendYflXjYeprAUNE5UREetkeQeaLDSv3sskDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:20.628018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38acd7d8021dcb00cbdfccef920101fde4bd854aa1fc1e545062baee439dd1fc","sha256:e253c047050ea8a1cfa275e88da1b1ebd637f26db220d2cacd68cc1d7087cc28"],"state_sha256":"96f41a2e8470cf172e6912ee6c46dff766a425b937250c9ab21a58c6ff8cb5bc"}