{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J27H2VRR4ROUWLALMCD6IJAXHA","short_pith_number":"pith:J27H2VRR","canonical_record":{"source":{"id":"1711.06883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T16:14:22Z","cross_cats_sorted":[],"title_canon_sha256":"469b44df08d613cc091574aa295bb67fe2eb124f89d08d209c2be8a3be056840","abstract_canon_sha256":"f384490efe85d993a8c609605bd55b26210a9d8e70ecb122777fc3abdfce4629"},"schema_version":"1.0"},"canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","source":{"kind":"arxiv","id":"1711.06883","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06883","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06883v2","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06883","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"J27H2VRR4ROU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J27H2VRR4ROUWLAL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J27H2VRR","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J27H2VRR4ROUWLALMCD6IJAXHA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T16:14:22Z","cross_cats_sorted":[],"title_canon_sha256":"469b44df08d613cc091574aa295bb67fe2eb124f89d08d209c2be8a3be056840","abstract_canon_sha256":"f384490efe85d993a8c609605bd55b26210a9d8e70ecb122777fc3abdfce4629"},"schema_version":"1.0"},"canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.995604Z","signature_b64":"jyakhAx0Fk18WABOZa8hzS+84SAD7yzbidghT8BQzwsMtJGqCaVlqJ1Wqv20ocWa4VDYlrTiPGNk6ys3SkGIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","last_reissued_at":"2026-05-18T00:20:55.995104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.995104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06883","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-05-18T00:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EH2dglAWEMVt3rXKWPi3GhwCR3hkiiAfe8DnGDdb8FEFhzMCyorJzXbdgdWYL+neEK72njw19F4Gvg8G/yexCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:29:53.103503Z"},"content_sha256":"11a00fdd3cfd9843fabe12d1b2c9d701e4e293289403d503bdbe29a171114593","schema_version":"1.0","event_id":"sha256:11a00fdd3cfd9843fabe12d1b2c9d701e4e293289403d503bdbe29a171114593"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J27H2VRR4ROUWLALMCD6IJAXHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moses Charikar, Shay Solomon","submitted_at":"2017-11-18T16:14:22Z","abstract_excerpt":"Despite significant research efforts, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial {worst-case} update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estimate of the maximum matching size, with polylogarithmic worst-case update time. Later (in SODA'17 Proc.) they improved the approximation factor all the way to $2+\\epsilon$. Nevertheless, the longstandin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06883","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":""},"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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50X/xKnaelocF2c5pjRAi/hd1jVN8y+r8uqj5KWh+mbyc8GpK8regxG0MgpScNSI7TIAt0EKnAX7E27Jl6a6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:29:53.103919Z"},"content_sha256":"95e31215e547eaec9f16169d8afe296e412bd088e9a8f56f5aaa74ca83219f35","schema_version":"1.0","event_id":"sha256:95e31215e547eaec9f16169d8afe296e412bd088e9a8f56f5aaa74ca83219f35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/bundle.json","state_url":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J27H2VRR4ROUWLALMCD6IJAXHA/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-27T05:29:53Z","links":{"resolver":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA","bundle":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/bundle.json","state":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J27H2VRR4ROUWLALMCD6IJAXHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J27H2VRR4ROUWLALMCD6IJAXHA","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":"f384490efe85d993a8c609605bd55b26210a9d8e70ecb122777fc3abdfce4629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T16:14:22Z","title_canon_sha256":"469b44df08d613cc091574aa295bb67fe2eb124f89d08d209c2be8a3be056840"},"schema_version":"1.0","source":{"id":"1711.06883","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06883","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06883v2","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06883","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"J27H2VRR4ROU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J27H2VRR4ROUWLAL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J27H2VRR","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:95e31215e547eaec9f16169d8afe296e412bd088e9a8f56f5aaa74ca83219f35","target":"graph","created_at":"2026-05-18T00:20:55Z","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":"Despite significant research efforts, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial {worst-case} update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estimate of the maximum matching size, with polylogarithmic worst-case update time. Later (in SODA'17 Proc.) they improved the approximation factor all the way to $2+\\epsilon$. Nevertheless, the longstandin","authors_text":"Moses Charikar, Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T16:14:22Z","title":"Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06883","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:11a00fdd3cfd9843fabe12d1b2c9d701e4e293289403d503bdbe29a171114593","target":"record","created_at":"2026-05-18T00:20:55Z","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":"f384490efe85d993a8c609605bd55b26210a9d8e70ecb122777fc3abdfce4629","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T16:14:22Z","title_canon_sha256":"469b44df08d613cc091574aa295bb67fe2eb124f89d08d209c2be8a3be056840"},"schema_version":"1.0","source":{"id":"1711.06883","kind":"arxiv","version":2}},"canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","first_computed_at":"2026-05-18T00:20:55.995104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:55.995104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jyakhAx0Fk18WABOZa8hzS+84SAD7yzbidghT8BQzwsMtJGqCaVlqJ1Wqv20ocWa4VDYlrTiPGNk6ys3SkGIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:55.995604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06883","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11a00fdd3cfd9843fabe12d1b2c9d701e4e293289403d503bdbe29a171114593","sha256:95e31215e547eaec9f16169d8afe296e412bd088e9a8f56f5aaa74ca83219f35"],"state_sha256":"a645708678cbda3f15ac744a6089c8b0adcbc087db38e26281b685f616b3f50f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4j+vY49js881msZzWOdWp7sC5Jsb86NHuxHW7sOh2e5JVSZDwk8/anDA4URjj+cmUC/Ne7c1O5t43puuT2ABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:29:53.106233Z","bundle_sha256":"244ad88c3b618bffbcfd19ee41363325fe3b3ce229328018ae35f9aad56371d3"}}