{"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"}