{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YN4ZTYNXGMQ332YYBOSNPNXAWM","short_pith_number":"pith:YN4ZTYNX","schema_version":"1.0","canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","source":{"kind":"arxiv","id":"1804.01308","version":3},"attestation_state":"computed","paper":{"title":"A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\\log n\\log\\Delta / \\log^2\\log\\Delta)$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-04-04T09:01:44Z","abstract_excerpt":"We present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\\log n \\log \\Delta / \\log^2 \\log \\Delta)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+\\epsilon)$-approximation algorithm of [BCS17], improving the dependency on $\\epsilon^{-1}$ from linear to logarithmic. In addition, for every $\\epsilon=(\\log \\Delta)^{-c}$, where $c\\geq 1$ is a constant, our algorithm computes a $(2+\\epsilon)$-approximation in $O(\\log "},"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":"1804.01308","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"debc6c2325d9c8833da13b76c824881d7c615dc93abe1122daf2e247f7f905d8","abstract_canon_sha256":"64f079c55610486b1fefcd12b02137e598b827b2abcaea9094a9aac4ce16b6c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:09.580298Z","signature_b64":"twE36T1vypQL1LlZYWVm89Q1ceIklBAkzPbdthqSx3QF6mQMtlivMM5WPCStfSh8nJ0M0seh7HNOVyPYLaB3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","last_reissued_at":"2026-05-18T00:15:09.579814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:09.579814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\\log n\\log\\Delta / \\log^2\\log\\Delta)$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-04-04T09:01:44Z","abstract_excerpt":"We present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\\log n \\log \\Delta / \\log^2 \\log \\Delta)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+\\epsilon)$-approximation algorithm of [BCS17], improving the dependency on $\\epsilon^{-1}$ from linear to logarithmic. In addition, for every $\\epsilon=(\\log \\Delta)^{-c}$, where $c\\geq 1$ is a constant, our algorithm computes a $(2+\\epsilon)$-approximation in $O(\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01308","kind":"arxiv","version":3},"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":"1804.01308","created_at":"2026-05-18T00:15:09.579879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01308v3","created_at":"2026-05-18T00:15:09.579879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01308","created_at":"2026-05-18T00:15:09.579879+00:00"},{"alias_kind":"pith_short_12","alias_value":"YN4ZTYNXGMQ3","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YN4ZTYNXGMQ332YY","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YN4ZTYNX","created_at":"2026-05-18T12:33:04.347982+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/YN4ZTYNXGMQ332YYBOSNPNXAWM","json":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM.json","graph_json":"https://pith.science/api/pith-number/YN4ZTYNXGMQ332YYBOSNPNXAWM/graph.json","events_json":"https://pith.science/api/pith-number/YN4ZTYNXGMQ332YYBOSNPNXAWM/events.json","paper":"https://pith.science/paper/YN4ZTYNX"},"agent_actions":{"view_html":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM","download_json":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM.json","view_paper":"https://pith.science/paper/YN4ZTYNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01308&json=true","fetch_graph":"https://pith.science/api/pith-number/YN4ZTYNXGMQ332YYBOSNPNXAWM/graph.json","fetch_events":"https://pith.science/api/pith-number/YN4ZTYNXGMQ332YYBOSNPNXAWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/action/storage_attestation","attest_author":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/action/author_attestation","sign_citation":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/action/citation_signature","submit_replication":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/action/replication_record"}},"created_at":"2026-05-18T00:15:09.579879+00:00","updated_at":"2026-05-18T00:15:09.579879+00:00"}