{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NPXX2CNCYXJ4QOSWVW5RWXN6C6","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":"dd417c1ee4e4ec80f4c571b0e1b5bcf8fbde6315a5e6efc7d5eebbc34bf919db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-16T17:10:18Z","title_canon_sha256":"ee6cecd54504bfd17f36c8fe967f046a5cd664bdf44c195724add72d8ef46f13"},"schema_version":"1.0","source":{"id":"2302.08432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08432","created_at":"2026-07-05T06:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08432v2","created_at":"2026-07-05T06:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08432","created_at":"2026-07-05T06:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"NPXX2CNCYXJ4","created_at":"2026-07-05T06:30:03Z"},{"alias_kind":"pith_short_16","alias_value":"NPXX2CNCYXJ4QOSW","created_at":"2026-07-05T06:30:03Z"},{"alias_kind":"pith_short_8","alias_value":"NPXX2CNC","created_at":"2026-07-05T06:30:03Z"}],"graph_snapshots":[{"event_id":"sha256:31810a3f4a70b0994215eccf51b973608cce7c4e511c328734e70dd4d76df025","target":"graph","created_at":"2026-07-05T06:30:03Z","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/2302.08432/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the dynamic approximate maximum bipartite matching problem we are given bipartite graph $G$ undergoing updates and our goal is to maintain a matching of $G$ which is large compared the maximum matching size $\\mu(G)$. We define a dynamic matching algorithm to be $\\alpha$ (respectively $(\\alpha, \\beta)$)-approximate if it maintains matching $M$ such that at all times $|M | \\geq \\mu(G) \\cdot \\alpha$ (respectively $|M| \\geq \\mu(G) \\cdot \\alpha - \\beta$).\n  We present the first deterministic $(1-\\epsilon )$-approximate dynamic matching algorithm with $O(poly(\\epsilon ^{-1}))$ amortized update ti","authors_text":"Joakim Blikstad, Peter Kiss","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-16T17:10:18Z","title":"Incremental $(1-\\epsilon)$-approximate dynamic matching in $O(poly(1/\\epsilon))$ update time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08432","kind":"arxiv","version":2},"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:51bef6404ef52f67a808a8988cdc10735819b9cc71c027195672e9a5005f8166","target":"record","created_at":"2026-07-05T06:30:03Z","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":"dd417c1ee4e4ec80f4c571b0e1b5bcf8fbde6315a5e6efc7d5eebbc34bf919db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-16T17:10:18Z","title_canon_sha256":"ee6cecd54504bfd17f36c8fe967f046a5cd664bdf44c195724add72d8ef46f13"},"schema_version":"1.0","source":{"id":"2302.08432","kind":"arxiv","version":2}},"canonical_sha256":"6bef7d09a2c5d3c83a56adbb1b5dbe179ff511884eaedc620413152b1b1f83eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bef7d09a2c5d3c83a56adbb1b5dbe179ff511884eaedc620413152b1b1f83eb","first_computed_at":"2026-07-05T06:30:03.897097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:03.897097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fygfNrUoIs9MKwWhe4dxczIhEIjrUdjxiZCNDYjdnXzY1RbXo9i95CxwTfYhDWkYHtV9lEXhYYqDCGu9L9sRAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:03.897550Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.08432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51bef6404ef52f67a808a8988cdc10735819b9cc71c027195672e9a5005f8166","sha256:31810a3f4a70b0994215eccf51b973608cce7c4e511c328734e70dd4d76df025"],"state_sha256":"787e872cbf407f9a0dd21924917affb1a090177b5b99ca59536420fb7708a1d2"}