{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BI5OXWLNP4IEN6JAGBOV2YUSUJ","short_pith_number":"pith:BI5OXWLN","canonical_record":{"source":{"id":"1704.02844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T13:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"be317d7c8aad4b9bcbfb7ebea9365a36a75a18f13631563f5a840611cf3c5873","abstract_canon_sha256":"cafba9df431a34b435a808e0c5a06ad27a020a0e81c24f24abcdfe505bfa23e9"},"schema_version":"1.0"},"canonical_sha256":"0a3aebd96d7f1046f920305d5d6292a254e80d1246f1be1cef4d46f68f41410c","source":{"kind":"arxiv","id":"1704.02844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02844","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02844v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02844","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"BI5OXWLNP4IE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BI5OXWLNP4IEN6JA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BI5OXWLN","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BI5OXWLNP4IEN6JAGBOV2YUSUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T13:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"be317d7c8aad4b9bcbfb7ebea9365a36a75a18f13631563f5a840611cf3c5873","abstract_canon_sha256":"cafba9df431a34b435a808e0c5a06ad27a020a0e81c24f24abcdfe505bfa23e9"},"schema_version":"1.0"},"canonical_sha256":"0a3aebd96d7f1046f920305d5d6292a254e80d1246f1be1cef4d46f68f41410c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.244144Z","signature_b64":"i09YUyV6XzhLr61uAsQ0IbhlRVS3cDW0YN5vgnxVlP3Q270T2thGvZAgk6oj2JEydugJdCvcyVTalsLtgWRTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a3aebd96d7f1046f920305d5d6292a254e80d1246f1be1cef4d46f68f41410c","last_reissued_at":"2026-05-18T00:46:44.243519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.243519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02844","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-05-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzlBo0ZajE0spiMni4QZbbbUJLABTrTguBIvDDV/oF/oe413rlPPWlStSOdhk1VPFULzGMzPOIiX37HRXCxmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:07:54.464500Z"},"content_sha256":"905ff3a5ee60ca9c1238b99df397b1a3297ebc9861efc1229cde4a0e6bae71df","schema_version":"1.0","event_id":"sha256:905ff3a5ee60ca9c1238b99df397b1a3297ebc9861efc1229cde4a0e6bae71df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BI5OXWLNP4IEN6JAGBOV2YUSUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in $O(\\log^3 n)$ Worst Case Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sayan Bhattacharya","submitted_at":"2017-04-10T13:10:43Z","abstract_excerpt":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02844","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":""},"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-05-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nYCdms377TZp+4A+uV4aSyoESs4E6l/L2kopwSZoiLUAMapLi1Xp18M002PwB75x86fWjlmCbLSKuRrCIOFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:07:54.464880Z"},"content_sha256":"dc0b7461e82279dba1e1f1a136b0b10d13df3ed1b311dcdf4a541a0d77c67c28","schema_version":"1.0","event_id":"sha256:dc0b7461e82279dba1e1f1a136b0b10d13df3ed1b311dcdf4a541a0d77c67c28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/bundle.json","state_url":"https://pith.science/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/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-05-28T10:07:54Z","links":{"resolver":"https://pith.science/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ","bundle":"https://pith.science/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/bundle.json","state":"https://pith.science/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BI5OXWLNP4IEN6JAGBOV2YUSUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BI5OXWLNP4IEN6JAGBOV2YUSUJ","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":"cafba9df431a34b435a808e0c5a06ad27a020a0e81c24f24abcdfe505bfa23e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T13:10:43Z","title_canon_sha256":"be317d7c8aad4b9bcbfb7ebea9365a36a75a18f13631563f5a840611cf3c5873"},"schema_version":"1.0","source":{"id":"1704.02844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02844","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02844v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02844","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"BI5OXWLNP4IE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BI5OXWLNP4IEN6JA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BI5OXWLN","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:dc0b7461e82279dba1e1f1a136b0b10d13df3ed1b311dcdf4a541a0d77c67c28","target":"graph","created_at":"2026-05-18T00:46:44Z","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"},"paper":{"abstract_excerpt":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data","authors_text":"Danupon Nanongkai, Monika Henzinger, Sayan Bhattacharya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T13:10:43Z","title":"Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in $O(\\log^3 n)$ Worst Case Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02844","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:905ff3a5ee60ca9c1238b99df397b1a3297ebc9861efc1229cde4a0e6bae71df","target":"record","created_at":"2026-05-18T00:46:44Z","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":"cafba9df431a34b435a808e0c5a06ad27a020a0e81c24f24abcdfe505bfa23e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T13:10:43Z","title_canon_sha256":"be317d7c8aad4b9bcbfb7ebea9365a36a75a18f13631563f5a840611cf3c5873"},"schema_version":"1.0","source":{"id":"1704.02844","kind":"arxiv","version":1}},"canonical_sha256":"0a3aebd96d7f1046f920305d5d6292a254e80d1246f1be1cef4d46f68f41410c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a3aebd96d7f1046f920305d5d6292a254e80d1246f1be1cef4d46f68f41410c","first_computed_at":"2026-05-18T00:46:44.243519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:44.243519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i09YUyV6XzhLr61uAsQ0IbhlRVS3cDW0YN5vgnxVlP3Q270T2thGvZAgk6oj2JEydugJdCvcyVTalsLtgWRTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:44.244144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905ff3a5ee60ca9c1238b99df397b1a3297ebc9861efc1229cde4a0e6bae71df","sha256:dc0b7461e82279dba1e1f1a136b0b10d13df3ed1b311dcdf4a541a0d77c67c28"],"state_sha256":"a9bf695c13c167634ed6e288487309e6e7f0585a7c39307c8b99496715cbe1f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgkIHVv8OIqOo7yi3mrSIn/m1xetux9OrtSOh9nmCcB23zfwg9aZYPQJlMEaDGqv2YvkS1+9J8HkUH23JUsxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:07:54.466896Z","bundle_sha256":"ceceac65bf8deba66c9e1016ff51f9b64bf3cea362e4e62198bfcef39b848af0"}}