{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","short_pith_number":"pith:4FQPCRO7","canonical_record":{"source":{"id":"2605.14195","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T23:25:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef60f686e5c3ab4092b1d49977ceb327704e2e558499df643d2c560d79490cd7","abstract_canon_sha256":"890832021df4cc06d752b08b24385733d7ca790b77e4f62d8f6bb31dd16ef460"},"schema_version":"1.0"},"canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","source":{"kind":"arxiv","id":"2605.14195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14195","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14195v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14195","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"4FQPCRO77KG4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4FQPCRO77KG467E3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4FQPCRO7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14195","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T23:25:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef60f686e5c3ab4092b1d49977ceb327704e2e558499df643d2c560d79490cd7","abstract_canon_sha256":"890832021df4cc06d752b08b24385733d7ca790b77e4f62d8f6bb31dd16ef460"},"schema_version":"1.0"},"canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.099609Z","signature_b64":"olvR4pd8u8SxGa3M9hb/KzoMUCaaibt07cFVaEt9nV+/5hpOJL7vrosXh/V53Q2H0HQ1c5o2qEY3YhUNgSXiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","last_reissued_at":"2026-05-17T23:39:11.098921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.098921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14195","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-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AXOs2NoM+7Tl5BlA+0eq9P7jY3LpyMd2RnlJKi1X9e+qJLHJTC503hQqDCnVbWNal2Q2PMMJj6xTVQz1XnKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:36:20.473669Z"},"content_sha256":"03b33d336f504382b71063aac9bf1157c3cdcdf0026fb75feda1ccd8d9cad011","schema_version":"1.0","event_id":"sha256:03b33d336f504382b71063aac9bf1157c3cdcdf0026fb75feda1ccd8d9cad011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Matching via Local Sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient.","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Edith Cohen, Mohammad Roghani, Sara Ahmadian","submitted_at":"2026-05-13T23:25:15Z","abstract_excerpt":"The classic online stochastic matching problem typically requires immediate and irrevocable matching decisions. However, in many modern decentralized systems such as real-time ride-hailing and distributed cloud computing, the primary bottleneck is often local communication bandwidth rather than the timing of the match itself. We formalize this challenge by introducing a two-stage local sparsification framework. In this setting, arriving requests must prune their realized compatibility sets to a strict budget of $k$ edges before a central coordinator optimizes the global matching. This creates "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that under sufficient spread, our sparsifier globally preserves the expected size of the maximum matching.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The fractional solution of the expected instance must exhibit sufficient spread; the paper does not specify how this spread is guaranteed or measured in practice when the instance is unknown in advance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A local selection rule based on a fractional solution of the expected instance preserves the expected maximum matching size under sufficient spread and yields near-optimal global matchings with small local budgets on ride-hailing data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b40d5f4140954abebfe5c712623688730074d1fbd0ffdb9a1e4dd8f5f2d3f39c"},"source":{"id":"2605.14195","kind":"arxiv","version":1},"verdict":{"id":"57b49e50-00f9-469e-add5-c114952d0e7f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:33:02.709866Z","strongest_claim":"We prove that under sufficient spread, our sparsifier globally preserves the expected size of the maximum matching.","one_line_summary":"A local selection rule based on a fractional solution of the expected instance preserves the expected maximum matching size under sufficient spread and yields near-optimal global matchings with small local budgets on ride-hailing data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The fractional solution of the expected instance must exhibit sufficient spread; the paper does not specify how this spread is guaranteed or measured in practice when the instance is unknown in advance.","pith_extraction_headline":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient."},"references":{"count":39,"sample":[{"doi":"10.1002/rsa.3240060107","year":1995,"title":"Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, and Stephen Suen. Randomized greedy matching II.Random Struct. Algorithms, 6(1):55–74, 1995. doi: 10.1002/RSA.3240060107. URLhttps://doi.org/10.1002/r","work_id":"96cc4a68-5621-4617-9893-51e706ffe564","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.icalp.2021.19","year":2021,"title":"Beating two-thirds for random-order streaming match- ing","work_id":"a8fb0bbb-2789-4b26-9529-8d9bf5ee3418","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Sign-rank of k - H amming distance is constant","work_id":"5fd4b01f-47c3-4faa-a1ac-715b003b010a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-15775-2","year":2010,"title":"Improved bounds for online stochastic matching","work_id":"c8804d22-b85b-449c-af4e-df7b8cb8f395","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Approximating maximum matching requires almost quadratic time","work_id":"71eb4c96-ef18-42ef-907e-3d2e21ffdc00","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":39,"snapshot_sha256":"3e2c11d92573022f15b25991c9b86c7b17530fa4319758abfd6b719800af257d","internal_anchors":1},"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":"57b49e50-00f9-469e-add5-c114952d0e7f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cm/x+D8go80VvsSTFAY6EJ6jq9UIjEroVNOZaj//2YZnEsMo7ZyN8ff0gyVE9kBwUrz4oo5fBhziR0DmNJKGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:36:20.474326Z"},"content_sha256":"bb32559342fd25b7cc50a7bdb23fc1b04c69c81c5e89af220449be5aa581c0e1","schema_version":"1.0","event_id":"sha256:bb32559342fd25b7cc50a7bdb23fc1b04c69c81c5e89af220449be5aa581c0e1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/FOCS.2019.00014.URLhttps://arxiv.org/abs/1904.08255) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. Online matching with general arrivals. InProceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 70–87. IEEE, 2019. d","arxiv_id":"2605.14195","detector":"doi_compliance","evidence":{"ref_index":16,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. Online matching with general arrivals. InProceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 70–87. IEEE, 2019. d","reconstructed_doi":"10.1109/FOCS.2019.00014.URLhttps://arxiv.org/abs/1904.08255"},"severity":"advisory","ref_index":16,"audited_at":"2026-05-19T05:49:03.641569Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/FOCS.2019.00014.URLhttps://arxiv.org/abs/1904.08255","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"090b6833eeacf9e1e316d9007d34ba486418e5eb7fcc10d639d511f568444e76","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":57,"payload_sha256":"8622422f2923a0e8467480e6ba05cfd31cb91f8816bf65c987984cad6de71963","signature_b64":"6wh008i+GwoAj5vne0y8aNzgib36TUDbinUnG+taDNOreIeWOQASQSW3GkMl9Mcm0Q8Jzio/fvzEfX3uEfQcCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TcWI71PFV7KdtjMpL86XHH5AEp9G63DOCFGD5KO+KDDr53l5J4sFAhoEcFwOwY55eldiwPIoWvNAatlJUhTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:36:20.475335Z"},"content_sha256":"0727407858830c369655383be2ab35bff2734f4c0246067e2e520e16cb6f1259","schema_version":"1.0","event_id":"sha256:0727407858830c369655383be2ab35bff2734f4c0246067e2e520e16cb6f1259"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/bundle.json","state_url":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FQPCRO77KG467E3LQ2DYIC442/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-21T05:36:20Z","links":{"resolver":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442","bundle":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/bundle.json","state":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FQPCRO77KG467E3LQ2DYIC442/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"890832021df4cc06d752b08b24385733d7ca790b77e4f62d8f6bb31dd16ef460","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T23:25:15Z","title_canon_sha256":"ef60f686e5c3ab4092b1d49977ceb327704e2e558499df643d2c560d79490cd7"},"schema_version":"1.0","source":{"id":"2605.14195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14195","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14195v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14195","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"4FQPCRO77KG4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4FQPCRO77KG467E3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4FQPCRO7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bb32559342fd25b7cc50a7bdb23fc1b04c69c81c5e89af220449be5aa581c0e1","target":"graph","created_at":"2026-05-17T23:39:11Z","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":"We prove that under sufficient spread, our sparsifier globally preserves the expected size of the maximum matching."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The fractional solution of the expected instance must exhibit sufficient spread; the paper does not specify how this spread is guaranteed or measured in practice when the instance is unknown in advance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A local selection rule based on a fractional solution of the expected instance preserves the expected maximum matching size under sufficient spread and yields near-optimal global matchings with small local budgets on ride-hailing data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient."}],"snapshot_sha256":"b40d5f4140954abebfe5c712623688730074d1fbd0ffdb9a1e4dd8f5f2d3f39c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The classic online stochastic matching problem typically requires immediate and irrevocable matching decisions. However, in many modern decentralized systems such as real-time ride-hailing and distributed cloud computing, the primary bottleneck is often local communication bandwidth rather than the timing of the match itself. We formalize this challenge by introducing a two-stage local sparsification framework. In this setting, arriving requests must prune their realized compatibility sets to a strict budget of $k$ edges before a central coordinator optimizes the global matching. This creates ","authors_text":"Edith Cohen, Mohammad Roghani, Sara Ahmadian","cross_cats":["cs.LG"],"headline":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T23:25:15Z","title":"Stochastic Matching via Local Sparsification"},"references":{"count":39,"internal_anchors":1,"resolved_work":39,"sample":[{"cited_arxiv_id":"","doi":"10.1002/rsa.3240060107","is_internal_anchor":false,"ref_index":1,"title":"Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, and Stephen Suen. Randomized greedy matching II.Random Struct. Algorithms, 6(1):55–74, 1995. doi: 10.1002/RSA.3240060107. URLhttps://doi.org/10.1002/r","work_id":"96cc4a68-5621-4617-9893-51e706ffe564","year":1995},{"cited_arxiv_id":"","doi":"10.4230/lipics.icalp.2021.19","is_internal_anchor":false,"ref_index":2,"title":"Beating two-thirds for random-order streaming match- ing","work_id":"a8fb0bbb-2789-4b26-9529-8d9bf5ee3418","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Sign-rank of k - H amming distance is constant","work_id":"5fd4b01f-47c3-4faa-a1ac-715b003b010a","year":2025},{"cited_arxiv_id":"","doi":"10.1007/978-3-642-15775-2","is_internal_anchor":false,"ref_index":4,"title":"Improved bounds for online stochastic matching","work_id":"c8804d22-b85b-449c-af4e-df7b8cb8f395","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Approximating maximum matching requires almost quadratic time","work_id":"71eb4c96-ef18-42ef-907e-3d2e21ffdc00","year":2024}],"snapshot_sha256":"3e2c11d92573022f15b25991c9b86c7b17530fa4319758abfd6b719800af257d"},"source":{"id":"2605.14195","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:33:02.709866Z","id":"57b49e50-00f9-469e-add5-c114952d0e7f","model_set":{"reader":"grok-4.3"},"one_line_summary":"A local selection rule based on a fractional solution of the expected instance preserves the expected maximum matching size under sufficient spread and yields near-optimal global matchings with small local budgets on ride-hailing data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Local sparsification guided by fractional solutions preserves the expected size of the maximum matching when spread is sufficient.","strongest_claim":"We prove that under sufficient spread, our sparsifier globally preserves the expected size of the maximum matching.","weakest_assumption":"The fractional solution of the expected instance must exhibit sufficient spread; the paper does not specify how this spread is guaranteed or measured in practice when the instance is unknown in advance."}},"verdict_id":"57b49e50-00f9-469e-add5-c114952d0e7f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:03b33d336f504382b71063aac9bf1157c3cdcdf0026fb75feda1ccd8d9cad011","target":"record","created_at":"2026-05-17T23:39:11Z","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":"890832021df4cc06d752b08b24385733d7ca790b77e4f62d8f6bb31dd16ef460","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T23:25:15Z","title_canon_sha256":"ef60f686e5c3ab4092b1d49977ceb327704e2e558499df643d2c560d79490cd7"},"schema_version":"1.0","source":{"id":"2605.14195","kind":"arxiv","version":1}},"canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","first_computed_at":"2026-05-17T23:39:11.098921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.098921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"olvR4pd8u8SxGa3M9hb/KzoMUCaaibt07cFVaEt9nV+/5hpOJL7vrosXh/V53Q2H0HQ1c5o2qEY3YhUNgSXiCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.099609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03b33d336f504382b71063aac9bf1157c3cdcdf0026fb75feda1ccd8d9cad011","sha256:bb32559342fd25b7cc50a7bdb23fc1b04c69c81c5e89af220449be5aa581c0e1","sha256:0727407858830c369655383be2ab35bff2734f4c0246067e2e520e16cb6f1259"],"state_sha256":"f105194b7970edd144fe13f4026463c41abf78f245895b22009f01be2fada9ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdxkAtYuI7LikiAeJrXtEjqXoAMy4C5Y4UDhziWTPmxfrHxuqz0sqLwLitb2K7xV18QC2k9/CBeX/HB4y3uhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:36:20.478114Z","bundle_sha256":"3ddd56fc11c65b4f439d8945b146fcd7cf6d31c73b5e0c56cc0b2fb161edb57e"}}