{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZTN6HJL4YFE5YN6IBHG5P3IZEX","short_pith_number":"pith:ZTN6HJL4","canonical_record":{"source":{"id":"1810.06382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-15T14:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"3e7039410f2deaba91d3f29db47a076b4cd2daf177b0feec0d2ed55e00117b97","abstract_canon_sha256":"181bccd45627fce70e1228d7eb7d9c83f69d785040247053e6a8b30b7c43dd4b"},"schema_version":"1.0"},"canonical_sha256":"ccdbe3a57cc149dc37c809cdd7ed1925d08e8efa44c5d89ec3f6e3c005c027d4","source":{"kind":"arxiv","id":"1810.06382","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZTN6HJL4YFE5YN6IBHG5P3IZEX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-15T14:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"3e7039410f2deaba91d3f29db47a076b4cd2daf177b0feec0d2ed55e00117b97","abstract_canon_sha256":"181bccd45627fce70e1228d7eb7d9c83f69d785040247053e6a8b30b7c43dd4b"},"schema_version":"1.0"},"canonical_sha256":"ccdbe3a57cc149dc37c809cdd7ed1925d08e8efa44c5d89ec3f6e3c005c027d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:20.628018Z","signature_b64":"deIioh9y0yn2YEee+thzOjhZ9xqo5t5qco9F4hHPr7qoJjdKpendYflXjYeprAUNE5UREetkeQeaLDSv3sskDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdbe3a57cc149dc37c809cdd7ed1925d08e8efa44c5d89ec3f6e3c005c027d4","last_reissued_at":"2026-05-18T00:03:20.627422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:20.627422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06382","source_version":1,"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-05-18T00:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajnRB45nS96tKYGIfylfXlbJ6sBMYz+NacLobRLE4/e3QnIDV+hpzAslYRjvwWe42Yv/IerLgTX1Y/PuxACDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:49.942083Z"},"content_sha256":"38acd7d8021dcb00cbdfccef920101fde4bd854aa1fc1e545062baee439dd1fc","schema_version":"1.0","event_id":"sha256:38acd7d8021dcb00cbdfccef920101fde4bd854aa1fc1e545062baee439dd1fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZTN6HJL4YFE5YN6IBHG5P3IZEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Indistinguishability of collections of trees in the uniform spanning forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tom Hutchcroft","submitted_at":"2018-10-15T14:31:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06382","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THd3a2VZfPLAQZna233giWfnyQP3lmHg5vHWoSQca3V3cak98CgsdeHRO3gaeo4WD955nZCmUR8/hjHIyxRQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:49.942608Z"},"content_sha256":"e253c047050ea8a1cfa275e88da1b1ebd637f26db220d2cacd68cc1d7087cc28","schema_version":"1.0","event_id":"sha256:e253c047050ea8a1cfa275e88da1b1ebd637f26db220d2cacd68cc1d7087cc28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/bundle.json","state_url":"https://pith.science/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/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-05-31T00:25:49Z","links":{"resolver":"https://pith.science/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX","bundle":"https://pith.science/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/bundle.json","state":"https://pith.science/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTN6HJL4YFE5YN6IBHG5P3IZEX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGlPhqTnHpivb+gU6tSXdoZ39Ad+UuC4q11fyNxdnaH111V4cBkpV3eJRHe9jlb0nFuspNiVKhxl1U+ZMp4/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:25:49.945718Z","bundle_sha256":"68e9f46ad11ce24cd084956039fa3bcbd725c553033d1df4cb8d9df179396be9"}}