{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TF5OSTMFEJ5GGYZ3VEXVWGTBBJ","short_pith_number":"pith:TF5OSTMF","canonical_record":{"source":{"id":"2605.12766","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-12T21:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"9ab1bd087ce865a44430de1f297922e98a1e5df9eac366c91df7313f449bad23","abstract_canon_sha256":"7e84ed2820587e3d1f6667516adabaa28c70a00c5322dcc8ef9c861c0a1aa317"},"schema_version":"1.0"},"canonical_sha256":"997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4","source":{"kind":"arxiv","id":"2605.12766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12766","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12766v1","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12766","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"TF5OSTMFEJ5G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TF5OSTMFEJ5GGYZ3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TF5OSTMF","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TF5OSTMFEJ5GGYZ3VEXVWGTBBJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12766","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-12T21:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"9ab1bd087ce865a44430de1f297922e98a1e5df9eac366c91df7313f449bad23","abstract_canon_sha256":"7e84ed2820587e3d1f6667516adabaa28c70a00c5322dcc8ef9c861c0a1aa317"},"schema_version":"1.0"},"canonical_sha256":"997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:48.244326Z","signature_b64":"N+c2Mekg+7KcM/R+8BKs3qIJaXxKInvkMD/eFMdcO3AyNSfXpOfokGhPk0dIScgY1+1R91dmiDWGa++fgqpKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4","last_reissued_at":"2026-05-18T03:09:48.243441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:48.243441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12766","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-18T03:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VdMPFwEqLxGfLnWhwQD5pft9BgnTRfd1fHoB2L5y+7KNVExtz2AtxqtIY46H1o6bTK9+A+r++M7C/+ctdOpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:25.242508Z"},"content_sha256":"7f9d38614dfa2f1348f376a177ae1c4389e9c0bf761965f717bafc2b61b313c6","schema_version":"1.0","event_id":"sha256:7f9d38614dfa2f1348f376a177ae1c4389e9c0bf761965f717bafc2b61b313c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TF5OSTMFEJ5GGYZ3VEXVWGTBBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bridge: Optimizing Collective Communication Schedules in Reconfigurable Networks with Reusable Subrings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anton Juerss, Stefan Schmid","submitted_at":"2026-05-12T21:30:46Z","abstract_excerpt":"Optical circuit-switched networks have emerged as an appealing alternative to electrical fabrics as they can reconfigure the network topology at runtime, reducing communication cost and improving bandwidth utilization. Yet exploiting optical reconfigurable networks for collective communication comes with a fundamental trade-off: each reconfiguration incurs non-negligible delay, communication must pause while the fabric reconfigures, and the benefit of a new topology depends on future traffic. The central question is therefore when reconfiguration is worth its cost. While prior work has demonst"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our evaluation shows that Bridge reduces All-to-All completion time by typically 3× to 10× over static baselines even with millisecond-scale reconfiguration delays. For AllReduce, Bridge uniformly outperforms existing reconfiguration strategies, delivers up to 1.5× speedup, and exceeds the bandwidth-optimal Ring algorithm by 1.5× to 6.6× on low to moderate-sized workloads.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That collective communication traffic exactly follows Bruck's pattern structure and that future communication partners can be predicted well enough to set up reusable subrings without frequent extra reconfigurations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Bridge reduces All-to-All completion time by typically 3x to 10x and improves AllReduce by up to 6.6x over Ring by reusing optical subrings across multiple steps in reconfigurable networks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"582a512e7c9ceca9f9af298d10ce4f771a899fc1d5566a8ea61438410d9c91f9"},"source":{"id":"2605.12766","kind":"arxiv","version":1},"verdict":{"id":"f29a27f5-ae83-461c-854a-7c6daaf51baf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:34:39.823612Z","strongest_claim":"Our evaluation shows that Bridge reduces All-to-All completion time by typically 3× to 10× over static baselines even with millisecond-scale reconfiguration delays. For AllReduce, Bridge uniformly outperforms existing reconfiguration strategies, delivers up to 1.5× speedup, and exceeds the bandwidth-optimal Ring algorithm by 1.5× to 6.6× on low to moderate-sized workloads.","one_line_summary":"Bridge reduces All-to-All completion time by typically 3x to 10x and improves AllReduce by up to 6.6x over Ring by reusing optical subrings across multiple steps in reconfigurable networks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That collective communication traffic exactly follows Bruck's pattern structure and that future communication partners can be predicted well enough to set up reusable subrings without frequent extra reconfigurations.","pith_extraction_headline":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps."},"references":{"count":35,"sample":[{"doi":"","year":2026,"title":"[n. d.]. ns-3 Network Simulator. https://www.nsnam.org/. Accessed: 2026-03-26","work_id":"0de6eef3-9d34-43a6-846f-9bdb51082ee7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3772356.3772395","year":2025,"title":"Vamsi Addanki. 2025. When Light Bends to the Collective Will: A The- ory and Vision for Adaptive Photonic Scale-up Domains. InProceedings of the 24th ACM Workshop on Hot Topics in Networks(UMD Campus,","work_id":"7eb7022c-2aa7-4b5c-a5d4-255b184e26ea","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3579312","year":2023,"title":"Vamsi Addanki, Chen Avin, and Stefan Schmid. 2023. Mars: Near- Optimal Throughput with Shallow Buffers in Reconfigurable Data- center Networks.Proc. ACM Meas. Anal. Comput. Syst.7, 1, Article 2 (March","work_id":"400e2fcf-88ea-42ca-a451-d467670f3c77","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3651890.3672248","year":2024,"title":"Daniel Amir, Nitika Saran, Tegan Wilson, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon. 2024. Shale: A Practical, Scal- able Oblivious Reconfigurable Network. InProceedings of the ACM SI","work_id":"18c06271-d2ab-4b81-9ad2-11d338d43362","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3310165.3310170","year":2019,"title":"Chen Avin and Stefan Schmid. 2019. Toward demand-aware network- ing: a theory for self-adjusting networks.SIGCOMM Comput. Commun. Rev.48, 5 (Jan. 2019), 31–40. doi:10.1145/3310165.3310170","work_id":"fc1e5be4-3c91-4d16-8b20-0bdc5db76958","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"65c1851c5b089a1e7415ec3ce6bc7c1fb8435097a9212ab998f7781015df930c","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":"f29a27f5-ae83-461c-854a-7c6daaf51baf"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8SF5Sx1xYerykvUM7MHZWEn38rNsIYAJgx3OXPenNry4xgeRMS/Z680fH7LLG1PzR6uf354wCx8VArgHuhDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:25.243771Z"},"content_sha256":"ba4732d700d322bd25cfe6afc11eb11e271fbfc0dd56cfffbfabcb9fb74ccfda","schema_version":"1.0","event_id":"sha256:ba4732d700d322bd25cfe6afc11eb11e271fbfc0dd56cfffbfabcb9fb74ccfda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/bundle.json","state_url":"https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/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-26T01:14:25Z","links":{"resolver":"https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ","bundle":"https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/bundle.json","state":"https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TF5OSTMFEJ5GGYZ3VEXVWGTBBJ","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":"7e84ed2820587e3d1f6667516adabaa28c70a00c5322dcc8ef9c861c0a1aa317","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-12T21:30:46Z","title_canon_sha256":"9ab1bd087ce865a44430de1f297922e98a1e5df9eac366c91df7313f449bad23"},"schema_version":"1.0","source":{"id":"2605.12766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12766","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12766v1","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12766","created_at":"2026-05-18T03:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"TF5OSTMFEJ5G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TF5OSTMFEJ5GGYZ3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TF5OSTMF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ba4732d700d322bd25cfe6afc11eb11e271fbfc0dd56cfffbfabcb9fb74ccfda","target":"graph","created_at":"2026-05-18T03:09:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our evaluation shows that Bridge reduces All-to-All completion time by typically 3× to 10× over static baselines even with millisecond-scale reconfiguration delays. For AllReduce, Bridge uniformly outperforms existing reconfiguration strategies, delivers up to 1.5× speedup, and exceeds the bandwidth-optimal Ring algorithm by 1.5× to 6.6× on low to moderate-sized workloads."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That collective communication traffic exactly follows Bruck's pattern structure and that future communication partners can be predicted well enough to set up reusable subrings without frequent extra reconfigurations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Bridge reduces All-to-All completion time by typically 3x to 10x and improves AllReduce by up to 6.6x over Ring by reusing optical subrings across multiple steps in reconfigurable networks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps."}],"snapshot_sha256":"582a512e7c9ceca9f9af298d10ce4f771a899fc1d5566a8ea61438410d9c91f9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Optical circuit-switched networks have emerged as an appealing alternative to electrical fabrics as they can reconfigure the network topology at runtime, reducing communication cost and improving bandwidth utilization. Yet exploiting optical reconfigurable networks for collective communication comes with a fundamental trade-off: each reconfiguration incurs non-negligible delay, communication must pause while the fabric reconfigures, and the benefit of a new topology depends on future traffic. The central question is therefore when reconfiguration is worth its cost. While prior work has demonst","authors_text":"Anton Juerss, Stefan Schmid","cross_cats":[],"headline":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-12T21:30:46Z","title":"Bridge: Optimizing Collective Communication Schedules in Reconfigurable Networks with Reusable Subrings"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"[n. d.]. ns-3 Network Simulator. https://www.nsnam.org/. Accessed: 2026-03-26","work_id":"0de6eef3-9d34-43a6-846f-9bdb51082ee7","year":2026},{"cited_arxiv_id":"","doi":"10.1145/3772356.3772395","is_internal_anchor":false,"ref_index":2,"title":"Vamsi Addanki. 2025. When Light Bends to the Collective Will: A The- ory and Vision for Adaptive Photonic Scale-up Domains. InProceedings of the 24th ACM Workshop on Hot Topics in Networks(UMD Campus,","work_id":"7eb7022c-2aa7-4b5c-a5d4-255b184e26ea","year":2025},{"cited_arxiv_id":"","doi":"10.1145/3579312","is_internal_anchor":false,"ref_index":3,"title":"Vamsi Addanki, Chen Avin, and Stefan Schmid. 2023. Mars: Near- Optimal Throughput with Shallow Buffers in Reconfigurable Data- center Networks.Proc. ACM Meas. Anal. Comput. Syst.7, 1, Article 2 (March","work_id":"400e2fcf-88ea-42ca-a451-d467670f3c77","year":2023},{"cited_arxiv_id":"","doi":"10.1145/3651890.3672248","is_internal_anchor":false,"ref_index":4,"title":"Daniel Amir, Nitika Saran, Tegan Wilson, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon. 2024. Shale: A Practical, Scal- able Oblivious Reconfigurable Network. InProceedings of the ACM SI","work_id":"18c06271-d2ab-4b81-9ad2-11d338d43362","year":2024},{"cited_arxiv_id":"","doi":"10.1145/3310165.3310170","is_internal_anchor":false,"ref_index":5,"title":"Chen Avin and Stefan Schmid. 2019. Toward demand-aware network- ing: a theory for self-adjusting networks.SIGCOMM Comput. Commun. Rev.48, 5 (Jan. 2019), 31–40. doi:10.1145/3310165.3310170","work_id":"fc1e5be4-3c91-4d16-8b20-0bdc5db76958","year":2019}],"snapshot_sha256":"65c1851c5b089a1e7415ec3ce6bc7c1fb8435097a9212ab998f7781015df930c"},"source":{"id":"2605.12766","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:34:39.823612Z","id":"f29a27f5-ae83-461c-854a-7c6daaf51baf","model_set":{"reader":"grok-4.3"},"one_line_summary":"Bridge reduces All-to-All completion time by typically 3x to 10x and improves AllReduce by up to 6.6x over Ring by reusing optical subrings across multiple steps in reconfigurable networks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps.","strongest_claim":"Our evaluation shows that Bridge reduces All-to-All completion time by typically 3× to 10× over static baselines even with millisecond-scale reconfiguration delays. For AllReduce, Bridge uniformly outperforms existing reconfiguration strategies, delivers up to 1.5× speedup, and exceeds the bandwidth-optimal Ring algorithm by 1.5× to 6.6× on low to moderate-sized workloads.","weakest_assumption":"That collective communication traffic exactly follows Bruck's pattern structure and that future communication partners can be predicted well enough to set up reusable subrings without frequent extra reconfigurations."}},"verdict_id":"f29a27f5-ae83-461c-854a-7c6daaf51baf"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f9d38614dfa2f1348f376a177ae1c4389e9c0bf761965f717bafc2b61b313c6","target":"record","created_at":"2026-05-18T03:09:48Z","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":"7e84ed2820587e3d1f6667516adabaa28c70a00c5322dcc8ef9c861c0a1aa317","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-12T21:30:46Z","title_canon_sha256":"9ab1bd087ce865a44430de1f297922e98a1e5df9eac366c91df7313f449bad23"},"schema_version":"1.0","source":{"id":"2605.12766","kind":"arxiv","version":1}},"canonical_sha256":"997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4","first_computed_at":"2026-05-18T03:09:48.243441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:48.243441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N+c2Mekg+7KcM/R+8BKs3qIJaXxKInvkMD/eFMdcO3AyNSfXpOfokGhPk0dIScgY1+1R91dmiDWGa++fgqpKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:48.244326Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f9d38614dfa2f1348f376a177ae1c4389e9c0bf761965f717bafc2b61b313c6","sha256:ba4732d700d322bd25cfe6afc11eb11e271fbfc0dd56cfffbfabcb9fb74ccfda"],"state_sha256":"20533e59508c0df1b99e8bfcb3c37f8d13d4771133a97b5fff9467b516233420"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KhP+bCFFCtwpH8dvr3gtJNmqOUc8zIMQWoNfNgVgOOBiAG8VoT32IgH4CrMMCn+Za9WAwye+QNVjjHk7w3sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:14:25.249599Z","bundle_sha256":"d676a92735293e9bf6a85f6597ec56e5a034d9d8fcb7496a966a80194310277b"}}