{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JZQ4CHIRIMESQAEZEBGQDMN2CM","short_pith_number":"pith:JZQ4CHIR","canonical_record":{"source":{"id":"2603.19717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-20T07:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"33211c09500117ef2768088cd200d6bc99f46d716154a1e7b80d2feaaa5db2f5","abstract_canon_sha256":"f20052c1f9edff240c67668a3f5e364343bcda59d2cec6df7eca6c4155328cdb"},"schema_version":"1.0"},"canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","source":{"kind":"arxiv","id":"2603.19717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.19717","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"2603.19717v2","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19717","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"JZQ4CHIRIMES","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_16","alias_value":"JZQ4CHIRIMESQAEZ","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_8","alias_value":"JZQ4CHIR","created_at":"2026-05-20T00:00:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JZQ4CHIRIMESQAEZEBGQDMN2CM","target":"record","payload":{"canonical_record":{"source":{"id":"2603.19717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-20T07:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"33211c09500117ef2768088cd200d6bc99f46d716154a1e7b80d2feaaa5db2f5","abstract_canon_sha256":"f20052c1f9edff240c67668a3f5e364343bcda59d2cec6df7eca6c4155328cdb"},"schema_version":"1.0"},"canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:36.884697Z","signature_b64":"zwMZM+0Cioga4sxkN9RdAfwFKAvXKwjxRBLhfEJGZncDOo8e+srGmnzpHFLSLw+flInc34IY5OzesRaxFjHXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","last_reissued_at":"2026-05-20T00:00:36.884019Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:36.884019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.19717","source_version":2,"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-20T00:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IG8p8LsXeRKx933muJ98iOgpyrenxItLduck+BRAYeRdJW2g2JqlOM5HzVg40hXqToRnGXZ9Bmx5TOQn5vQXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:22:44.411360Z"},"content_sha256":"5a6f9311423ee2535dc68ea05558b5b9de5bac2c9dd2c76860e6f7eb53af8887","schema_version":"1.0","event_id":"sha256:5a6f9311423ee2535dc68ea05558b5b9de5bac2c9dd2c76860e6f7eb53af8887"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JZQ4CHIRIMESQAEZEBGQDMN2CM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Indistinguishability in One-or-Two-Ended Forests on Unimodular Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ali Khezeli, Francois Baccelli","submitted_at":"2026-03-20T07:47:07Z","abstract_excerpt":"We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired uniform spanning forest, which is the only one-ended model previously studied in the literature. This approach can also be used for proving the indistinguishability of `level-sets' in this setting, where the previously available methods do not work. The approach leads to new indistinguishability results for a variety of models, including, for instance, river mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19717","kind":"arxiv","version":2},"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/2603.19717/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-05-20T00:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ny1wV2sbYXUocMAoV+QqAlJeuc19OpTEqhiucwXnqnPLA305ReKweiD7bBb7TCzuXippjaw1dPjMaHVlZSZcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:22:44.412105Z"},"content_sha256":"f44d0a719db465ecffe28ce74f63a2308b679db9cbd02e71e7440a0dfb6f16ec","schema_version":"1.0","event_id":"sha256:f44d0a719db465ecffe28ce74f63a2308b679db9cbd02e71e7440a0dfb6f16ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/bundle.json","state_url":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/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-06-09T02:22:44Z","links":{"resolver":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM","bundle":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/bundle.json","state":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JZQ4CHIRIMESQAEZEBGQDMN2CM","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":"f20052c1f9edff240c67668a3f5e364343bcda59d2cec6df7eca6c4155328cdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-20T07:47:07Z","title_canon_sha256":"33211c09500117ef2768088cd200d6bc99f46d716154a1e7b80d2feaaa5db2f5"},"schema_version":"1.0","source":{"id":"2603.19717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.19717","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"2603.19717v2","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19717","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"JZQ4CHIRIMES","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_16","alias_value":"JZQ4CHIRIMESQAEZ","created_at":"2026-05-20T00:00:36Z"},{"alias_kind":"pith_short_8","alias_value":"JZQ4CHIR","created_at":"2026-05-20T00:00:36Z"}],"graph_snapshots":[{"event_id":"sha256:f44d0a719db465ecffe28ce74f63a2308b679db9cbd02e71e7440a0dfb6f16ec","target":"graph","created_at":"2026-05-20T00:00:36Z","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/2603.19717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired uniform spanning forest, which is the only one-ended model previously studied in the literature. This approach can also be used for proving the indistinguishability of `level-sets' in this setting, where the previously available methods do not work. The approach leads to new indistinguishability results for a variety of models, including, for instance, river mod","authors_text":"Ali Khezeli, Francois Baccelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-20T07:47:07Z","title":"Indistinguishability in One-or-Two-Ended Forests on Unimodular Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19717","kind":"arxiv","version":2},"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:5a6f9311423ee2535dc68ea05558b5b9de5bac2c9dd2c76860e6f7eb53af8887","target":"record","created_at":"2026-05-20T00:00:36Z","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":"f20052c1f9edff240c67668a3f5e364343bcda59d2cec6df7eca6c4155328cdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-20T07:47:07Z","title_canon_sha256":"33211c09500117ef2768088cd200d6bc99f46d716154a1e7b80d2feaaa5db2f5"},"schema_version":"1.0","source":{"id":"2603.19717","kind":"arxiv","version":2}},"canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","first_computed_at":"2026-05-20T00:00:36.884019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:36.884019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwMZM+0Cioga4sxkN9RdAfwFKAvXKwjxRBLhfEJGZncDOo8e+srGmnzpHFLSLw+flInc34IY5OzesRaxFjHXBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:36.884697Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.19717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a6f9311423ee2535dc68ea05558b5b9de5bac2c9dd2c76860e6f7eb53af8887","sha256:f44d0a719db465ecffe28ce74f63a2308b679db9cbd02e71e7440a0dfb6f16ec"],"state_sha256":"c32a6e7921a4e482a714a540e64156e05a90e5a26c905db0ea5bd7890d2f61b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHzJaY1eb+fe3O7+hU0tby1gd336HDbzbZozhnHvbN9ZwmBVALk4hfdN3eEUdALaKMnbSFa8wMpINlvKG05WCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:22:44.416502Z","bundle_sha256":"929fbe175bab71848ac5a2376e86edee35552cafd26c8164d0beebc0fa876e35"}}