{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4FQPCRO77KG467E3LQ2DYIC442","short_pith_number":"pith:4FQPCRO7","schema_version":"1.0","canonical_sha256":"e160f145dffa8dcf7c9b5c343c205ce693294bb78c9c4d3beb15278c81f1d69d","source":{"kind":"arxiv","id":"2605.14195","version":1},"attestation_state":"computed","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 "},"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":true,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.14195","created_at":"2026-05-17T23:39:11.099040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14195v1","created_at":"2026-05-17T23:39:11.099040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14195","created_at":"2026-05-17T23:39:11.099040+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FQPCRO77KG4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FQPCRO77KG467E3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FQPCRO7","created_at":"2026-05-18T12:33:37.589309+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/4FQPCRO77KG467E3LQ2DYIC442","json":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442.json","graph_json":"https://pith.science/api/pith-number/4FQPCRO77KG467E3LQ2DYIC442/graph.json","events_json":"https://pith.science/api/pith-number/4FQPCRO77KG467E3LQ2DYIC442/events.json","paper":"https://pith.science/paper/4FQPCRO7"},"agent_actions":{"view_html":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442","download_json":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442.json","view_paper":"https://pith.science/paper/4FQPCRO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14195&json=true","fetch_graph":"https://pith.science/api/pith-number/4FQPCRO77KG467E3LQ2DYIC442/graph.json","fetch_events":"https://pith.science/api/pith-number/4FQPCRO77KG467E3LQ2DYIC442/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/action/storage_attestation","attest_author":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/action/author_attestation","sign_citation":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/action/citation_signature","submit_replication":"https://pith.science/pith/4FQPCRO77KG467E3LQ2DYIC442/action/replication_record"}},"created_at":"2026-05-17T23:39:11.099040+00:00","updated_at":"2026-05-17T23:39:11.099040+00:00"}