{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JZQ4CHIRIMESQAEZEBGQDMN2CM","short_pith_number":"pith:JZQ4CHIR","schema_version":"1.0","canonical_sha256":"4e61c11d114309280099204d01b1ba1337e6d8ff50fcb4c884af85d2d24c2f4d","source":{"kind":"arxiv","id":"2603.19717","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.19717","created_at":"2026-05-20T00:00:36.884114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.19717v2","created_at":"2026-05-20T00:00:36.884114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19717","created_at":"2026-05-20T00:00:36.884114+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZQ4CHIRIMES","created_at":"2026-05-20T00:00:36.884114+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZQ4CHIRIMESQAEZ","created_at":"2026-05-20T00:00:36.884114+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZQ4CHIR","created_at":"2026-05-20T00:00:36.884114+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/JZQ4CHIRIMESQAEZEBGQDMN2CM","json":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM.json","graph_json":"https://pith.science/api/pith-number/JZQ4CHIRIMESQAEZEBGQDMN2CM/graph.json","events_json":"https://pith.science/api/pith-number/JZQ4CHIRIMESQAEZEBGQDMN2CM/events.json","paper":"https://pith.science/paper/JZQ4CHIR"},"agent_actions":{"view_html":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM","download_json":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM.json","view_paper":"https://pith.science/paper/JZQ4CHIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.19717&json=true","fetch_graph":"https://pith.science/api/pith-number/JZQ4CHIRIMESQAEZEBGQDMN2CM/graph.json","fetch_events":"https://pith.science/api/pith-number/JZQ4CHIRIMESQAEZEBGQDMN2CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/action/storage_attestation","attest_author":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/action/author_attestation","sign_citation":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/action/citation_signature","submit_replication":"https://pith.science/pith/JZQ4CHIRIMESQAEZEBGQDMN2CM/action/replication_record"}},"created_at":"2026-05-20T00:00:36.884114+00:00","updated_at":"2026-05-20T00:00:36.884114+00:00"}