{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LNEBWGZEPKSOARFJFUQTRPO3QS","short_pith_number":"pith:LNEBWGZE","schema_version":"1.0","canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","source":{"kind":"arxiv","id":"2201.12710","version":1},"attestation_state":"computed","paper":{"title":"An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi, Vihan Shah","submitted_at":"2022-01-30T03:31:05Z","abstract_excerpt":"We present an algorithm for the maximum matching problem in dynamic (insertion-deletions) streams with *asymptotically optimal* space complexity: for any $n$-vertex graph, our algorithm with high probability outputs an $\\alpha$-approximate matching in a single pass using $O(n^2/\\alpha^3)$ bits of space.\n  A long line of work on the dynamic streaming matching problem has reduced the gap between space upper and lower bounds first to $n^{o(1)}$ factors [Assadi-Khanna-Li-Yaroslavtsev; SODA 2016] and subsequently to $\\text{polylog}{(n)}$ factors [Dark-Konrad; CCC 2020]. Our upper bound now matches "},"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":"2201.12710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T03:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"c9fb69876e3da3b1913b2ae31a2792882ba78ce6753935fedca078f707a21790","abstract_canon_sha256":"4095db21272edd0b2c0c127129524854827251a480d0d9375d2b41ee632c61fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:39.352382Z","signature_b64":"z8L7meToKcPcXBZOtum2ldS3N6xwmjP1jiOOq0hAkTRuys0g9gQFOFPJaxs44vDybDe5jFnKbARYhRr22BJHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","last_reissued_at":"2026-07-05T03:52:39.351959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:39.351959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi, Vihan Shah","submitted_at":"2022-01-30T03:31:05Z","abstract_excerpt":"We present an algorithm for the maximum matching problem in dynamic (insertion-deletions) streams with *asymptotically optimal* space complexity: for any $n$-vertex graph, our algorithm with high probability outputs an $\\alpha$-approximate matching in a single pass using $O(n^2/\\alpha^3)$ bits of space.\n  A long line of work on the dynamic streaming matching problem has reduced the gap between space upper and lower bounds first to $n^{o(1)}$ factors [Assadi-Khanna-Li-Yaroslavtsev; SODA 2016] and subsequently to $\\text{polylog}{(n)}$ factors [Dark-Konrad; CCC 2020]. Our upper bound now matches "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12710","kind":"arxiv","version":1},"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/2201.12710/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":"2201.12710","created_at":"2026-07-05T03:52:39.352013+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12710v1","created_at":"2026-07-05T03:52:39.352013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12710","created_at":"2026-07-05T03:52:39.352013+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNEBWGZEPKSO","created_at":"2026-07-05T03:52:39.352013+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNEBWGZEPKSOARFJ","created_at":"2026-07-05T03:52:39.352013+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNEBWGZE","created_at":"2026-07-05T03:52:39.352013+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/LNEBWGZEPKSOARFJFUQTRPO3QS","json":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS.json","graph_json":"https://pith.science/api/pith-number/LNEBWGZEPKSOARFJFUQTRPO3QS/graph.json","events_json":"https://pith.science/api/pith-number/LNEBWGZEPKSOARFJFUQTRPO3QS/events.json","paper":"https://pith.science/paper/LNEBWGZE"},"agent_actions":{"view_html":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS","download_json":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS.json","view_paper":"https://pith.science/paper/LNEBWGZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12710&json=true","fetch_graph":"https://pith.science/api/pith-number/LNEBWGZEPKSOARFJFUQTRPO3QS/graph.json","fetch_events":"https://pith.science/api/pith-number/LNEBWGZEPKSOARFJFUQTRPO3QS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/action/storage_attestation","attest_author":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/action/author_attestation","sign_citation":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/action/citation_signature","submit_replication":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/action/replication_record"}},"created_at":"2026-07-05T03:52:39.352013+00:00","updated_at":"2026-07-05T03:52:39.352013+00:00"}