{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E2FN3D3TISLKLJZC2PE63UJ7UZ","short_pith_number":"pith:E2FN3D3T","schema_version":"1.0","canonical_sha256":"268add8f734496a5a722d3c9edd13fa6526a26883116a514e0e4cdad46cab2ed","source":{"kind":"arxiv","id":"1611.00198","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Monika Henzinger, Sayan Bhattacharya","submitted_at":"2016-11-01T12:18:55Z","abstract_excerpt":"We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized dynamic algorithm for this problem that has an approximation ratio of $2$ and an amortised update time of $O(1)$ with high probability. This algorithm requires the assump"},"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":"1611.00198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-01T12:18:55Z","cross_cats_sorted":[],"title_canon_sha256":"028f096c101d052cf8a81ced005508196e7b49df515cd1e35bc571cbacc6bc2e","abstract_canon_sha256":"b7196ad928d4c992f5dc47073175cc3b25c515646ec535f57d1ede2cc63f00e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:43.659613Z","signature_b64":"I53WXcFQVLdB2N+B3lCQSmbaBLqlPGw2kFZZ6A0cil2jcfSTVj51cd3HSBEIqoXYf9QR6Ie5sKh9f3P/kL1HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268add8f734496a5a722d3c9edd13fa6526a26883116a514e0e4cdad46cab2ed","last_reissued_at":"2026-05-18T00:57:43.659052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:43.659052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Monika Henzinger, Sayan Bhattacharya","submitted_at":"2016-11-01T12:18:55Z","abstract_excerpt":"We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized dynamic algorithm for this problem that has an approximation ratio of $2$ and an amortised update time of $O(1)$ with high probability. This algorithm requires the assump"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00198","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":"1611.00198","created_at":"2026-05-18T00:57:43.659145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00198v2","created_at":"2026-05-18T00:57:43.659145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00198","created_at":"2026-05-18T00:57:43.659145+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2FN3D3TISLK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2FN3D3TISLKLJZC","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2FN3D3T","created_at":"2026-05-18T12:30:12.583610+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/E2FN3D3TISLKLJZC2PE63UJ7UZ","json":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ.json","graph_json":"https://pith.science/api/pith-number/E2FN3D3TISLKLJZC2PE63UJ7UZ/graph.json","events_json":"https://pith.science/api/pith-number/E2FN3D3TISLKLJZC2PE63UJ7UZ/events.json","paper":"https://pith.science/paper/E2FN3D3T"},"agent_actions":{"view_html":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ","download_json":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ.json","view_paper":"https://pith.science/paper/E2FN3D3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00198&json=true","fetch_graph":"https://pith.science/api/pith-number/E2FN3D3TISLKLJZC2PE63UJ7UZ/graph.json","fetch_events":"https://pith.science/api/pith-number/E2FN3D3TISLKLJZC2PE63UJ7UZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ/action/storage_attestation","attest_author":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ/action/author_attestation","sign_citation":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ/action/citation_signature","submit_replication":"https://pith.science/pith/E2FN3D3TISLKLJZC2PE63UJ7UZ/action/replication_record"}},"created_at":"2026-05-18T00:57:43.659145+00:00","updated_at":"2026-05-18T00:57:43.659145+00:00"}