{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J27H2VRR4ROUWLALMCD6IJAXHA","short_pith_number":"pith:J27H2VRR","schema_version":"1.0","canonical_sha256":"4ebe7d5631e45d4b2c0b6087e4241738374daed8f4fe8ae01be696978f762d5d","source":{"kind":"arxiv","id":"1711.06883","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06883","created_at":"2026-05-18T00:20:55.995178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06883v2","created_at":"2026-05-18T00:20:55.995178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06883","created_at":"2026-05-18T00:20:55.995178+00:00"},{"alias_kind":"pith_short_12","alias_value":"J27H2VRR4ROU","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J27H2VRR4ROUWLAL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J27H2VRR","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA","json":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA.json","graph_json":"https://pith.science/api/pith-number/J27H2VRR4ROUWLALMCD6IJAXHA/graph.json","events_json":"https://pith.science/api/pith-number/J27H2VRR4ROUWLALMCD6IJAXHA/events.json","paper":"https://pith.science/paper/J27H2VRR"},"agent_actions":{"view_html":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA","download_json":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA.json","view_paper":"https://pith.science/paper/J27H2VRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06883&json=true","fetch_graph":"https://pith.science/api/pith-number/J27H2VRR4ROUWLALMCD6IJAXHA/graph.json","fetch_events":"https://pith.science/api/pith-number/J27H2VRR4ROUWLALMCD6IJAXHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/action/storage_attestation","attest_author":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/action/author_attestation","sign_citation":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/action/citation_signature","submit_replication":"https://pith.science/pith/J27H2VRR4ROUWLALMCD6IJAXHA/action/replication_record"}},"created_at":"2026-05-18T00:20:55.995178+00:00","updated_at":"2026-05-18T00:20:55.995178+00:00"}