{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NPXX2CNCYXJ4QOSWVW5RWXN6C6","short_pith_number":"pith:NPXX2CNC","canonical_record":{"source":{"id":"2302.08432","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-16T17:10:18Z","cross_cats_sorted":[],"title_canon_sha256":"ee6cecd54504bfd17f36c8fe967f046a5cd664bdf44c195724add72d8ef46f13","abstract_canon_sha256":"dd417c1ee4e4ec80f4c571b0e1b5bcf8fbde6315a5e6efc7d5eebbc34bf919db"},"schema_version":"1.0"},"canonical_sha256":"6bef7d09a2c5d3c83a56adbb1b5dbe179ff511884eaedc620413152b1b1f83eb","source":{"kind":"arxiv","id":"2302.08432","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NPXX2CNCYXJ4QOSWVW5RWXN6C6","target":"record","payload":{"canonical_record":{"source":{"id":"2302.08432","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-16T17:10:18Z","cross_cats_sorted":[],"title_canon_sha256":"ee6cecd54504bfd17f36c8fe967f046a5cd664bdf44c195724add72d8ef46f13","abstract_canon_sha256":"dd417c1ee4e4ec80f4c571b0e1b5bcf8fbde6315a5e6efc7d5eebbc34bf919db"},"schema_version":"1.0"},"canonical_sha256":"6bef7d09a2c5d3c83a56adbb1b5dbe179ff511884eaedc620413152b1b1f83eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:03.897550Z","signature_b64":"fygfNrUoIs9MKwWhe4dxczIhEIjrUdjxiZCNDYjdnXzY1RbXo9i95CxwTfYhDWkYHtV9lEXhYYqDCGu9L9sRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bef7d09a2c5d3c83a56adbb1b5dbe179ff511884eaedc620413152b1b1f83eb","last_reissued_at":"2026-07-05T06:30:03.897097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:03.897097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.08432","source_version":2,"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-05T06:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drd5asw6htzNQ7UVS9PBZS3K/RU76th8INEkxgV+AbH3LDsSJwMwmF8Fc82J5gQfUwBk2fI+QQ12oavM+tYeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:26:14.425788Z"},"content_sha256":"51bef6404ef52f67a808a8988cdc10735819b9cc71c027195672e9a5005f8166","schema_version":"1.0","event_id":"sha256:51bef6404ef52f67a808a8988cdc10735819b9cc71c027195672e9a5005f8166"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NPXX2CNCYXJ4QOSWVW5RWXN6C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental $(1-\\epsilon)$-approximate dynamic matching in $O(poly(1/\\epsilon))$ update time","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joakim Blikstad, Peter Kiss","submitted_at":"2023-02-16T17:10:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08432","kind":"arxiv","version":2},"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/2302.08432/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-05T06:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvF78M4Go/HNJPzERF6Pba5yXuWVqurBzYYiq/nAiezeJOUA5rceZCvvFI0llMpyvnHcH/Fo8whP+4Igid4JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:26:14.426294Z"},"content_sha256":"31810a3f4a70b0994215eccf51b973608cce7c4e511c328734e70dd4d76df025","schema_version":"1.0","event_id":"sha256:31810a3f4a70b0994215eccf51b973608cce7c4e511c328734e70dd4d76df025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/bundle.json","state_url":"https://pith.science/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/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-24T03:26:14Z","links":{"resolver":"https://pith.science/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6","bundle":"https://pith.science/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/bundle.json","state":"https://pith.science/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPXX2CNCYXJ4QOSWVW5RWXN6C6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNXtixl6Hl2EZA9YotvHYUaNKKM2y/Btkkh01ueYJAqO0kFWGxgxcJsdtzs7PAUxTr6uuY2efMwyx1zk/WtWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:26:14.431478Z","bundle_sha256":"d6646a0ca9011be568924ec481dadd104b939addb4ca4a6889773874f1d649d1"}}