{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LNEBWGZEPKSOARFJFUQTRPO3QS","short_pith_number":"pith:LNEBWGZE","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"},"canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","source":{"kind":"arxiv","id":"2201.12710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12710","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12710v1","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12710","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"LNEBWGZEPKSO","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"LNEBWGZEPKSOARFJ","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"LNEBWGZE","created_at":"2026-07-05T03:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LNEBWGZEPKSOARFJFUQTRPO3QS","target":"record","payload":{"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"},"canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","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"},"source_kind":"arxiv","source_id":"2201.12710","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-07-05T03:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmZnnIRMmlUfjtLO9qIzFB6b/9ct6Z17EW1t95PWU4fiTOkrlTXgWeOUWhWAPLi961122/lGfojEw4SJqbDCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:32:04.187665Z"},"content_sha256":"b4f675ba8b76772476d52910d09800d694d1d98aa7639fdffc821da625ecd334","schema_version":"1.0","event_id":"sha256:b4f675ba8b76772476d52910d09800d694d1d98aa7639fdffc821da625ecd334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LNEBWGZEPKSOARFJFUQTRPO3QS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiEOXz5VlW9gT5KmF8SP/9IKQC3bdlS67PWED5x6o6GI1LUT79/Df5YZndQK18dJiqNHHdM3+RD+JWlj6nCdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:32:04.188280Z"},"content_sha256":"8f8bbd4af5a18ca5e6aace5953fa24c8466b290a8f801179ad4baff1b2fdd34d","schema_version":"1.0","event_id":"sha256:8f8bbd4af5a18ca5e6aace5953fa24c8466b290a8f801179ad4baff1b2fdd34d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/bundle.json","state_url":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/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-08-16T00:32:04Z","links":{"resolver":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS","bundle":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/bundle.json","state":"https://pith.science/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNEBWGZEPKSOARFJFUQTRPO3QS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LNEBWGZEPKSOARFJFUQTRPO3QS","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":"4095db21272edd0b2c0c127129524854827251a480d0d9375d2b41ee632c61fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T03:31:05Z","title_canon_sha256":"c9fb69876e3da3b1913b2ae31a2792882ba78ce6753935fedca078f707a21790"},"schema_version":"1.0","source":{"id":"2201.12710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12710","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12710v1","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12710","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"LNEBWGZEPKSO","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"LNEBWGZEPKSOARFJ","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"LNEBWGZE","created_at":"2026-07-05T03:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:8f8bbd4af5a18ca5e6aace5953fa24c8466b290a8f801179ad4baff1b2fdd34d","target":"graph","created_at":"2026-07-05T03:52:39Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.12710/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Sepehr Assadi, Vihan Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T03:31:05Z","title":"An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12710","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4f675ba8b76772476d52910d09800d694d1d98aa7639fdffc821da625ecd334","target":"record","created_at":"2026-07-05T03:52:39Z","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":"4095db21272edd0b2c0c127129524854827251a480d0d9375d2b41ee632c61fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T03:31:05Z","title_canon_sha256":"c9fb69876e3da3b1913b2ae31a2792882ba78ce6753935fedca078f707a21790"},"schema_version":"1.0","source":{"id":"2201.12710","kind":"arxiv","version":1}},"canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b481b1b247aa4e044a92d2138bddb849647a80fbcbd1a950d1d03ef7bd76e05","first_computed_at":"2026-07-05T03:52:39.351959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:39.351959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8L7meToKcPcXBZOtum2ldS3N6xwmjP1jiOOq0hAkTRuys0g9gQFOFPJaxs44vDybDe5jFnKbARYhRr22BJHDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:39.352382Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4f675ba8b76772476d52910d09800d694d1d98aa7639fdffc821da625ecd334","sha256:8f8bbd4af5a18ca5e6aace5953fa24c8466b290a8f801179ad4baff1b2fdd34d"],"state_sha256":"4860c662f9594068813366710b75bc6cce59c67386cd87d34aadf26b1a8507b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMTca+B1fg47VYj1We6ubaDi+BVqyP4xfFA5U2WvhsyqB8Fb9wrXv6tUKRVI9P+kQZJIXESBJ/9X9toad91/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T00:32:04.192051Z","bundle_sha256":"cf63079387ebdd0c9a8d1d4c73b6eced17f5567dd5216f654890ea4d47d79716"}}