{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UKN7CHWIS3F5PLXUTKJZJMD54T","short_pith_number":"pith:UKN7CHWI","schema_version":"1.0","canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","source":{"kind":"arxiv","id":"1808.05809","version":1},"attestation_state":"computed","paper":{"title":"Optimal Distributed Weighted Set Cover Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-08-17T09:50:30Z","abstract_excerpt":"We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every element is bounded by $f$. The approximation factor of our algorithm is $(f+\\epsilon)$. Let $\\Delta$ denote the maximum degree in the hypergraph. Our algorithm runs in the CONGEST model and requires $O(\\log{\\Delta} / \\log \\log \\Delta)$ rounds, for constants $\\epsilon \\in (0,1]$ and $f\\in\\mathbb N^+$. This is the first distributed algorithm for this problem whos"},"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":"1808.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"102d1e6521a947691dd6a828c3cd82958ac07fddd3a4f20f1ef6c0f92e19507a","abstract_canon_sha256":"61176368ad878368ba016f647af9ba45e777d01137d69a15d12986e30ceb435c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:52.047082Z","signature_b64":"LtD9BzL9+rf/NOqS9VK09907OQL/ht7q/2uLTeQM9gNqGKrbLT5x0l9CR5Iy6qdIIlO4/AwHMvNKE3OP0kpjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","last_reissued_at":"2026-05-18T00:07:52.046449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:52.046449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Distributed Weighted Set Cover Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-08-17T09:50:30Z","abstract_excerpt":"We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every element is bounded by $f$. The approximation factor of our algorithm is $(f+\\epsilon)$. Let $\\Delta$ denote the maximum degree in the hypergraph. Our algorithm runs in the CONGEST model and requires $O(\\log{\\Delta} / \\log \\log \\Delta)$ rounds, for constants $\\epsilon \\in (0,1]$ and $f\\in\\mathbb N^+$. This is the first distributed algorithm for this problem whos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05809","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.05809","created_at":"2026-05-18T00:07:52.046532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05809v1","created_at":"2026-05-18T00:07:52.046532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05809","created_at":"2026-05-18T00:07:52.046532+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKN7CHWIS3F5","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKN7CHWIS3F5PLXU","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKN7CHWI","created_at":"2026-05-18T12:32:56.356000+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/UKN7CHWIS3F5PLXUTKJZJMD54T","json":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T.json","graph_json":"https://pith.science/api/pith-number/UKN7CHWIS3F5PLXUTKJZJMD54T/graph.json","events_json":"https://pith.science/api/pith-number/UKN7CHWIS3F5PLXUTKJZJMD54T/events.json","paper":"https://pith.science/paper/UKN7CHWI"},"agent_actions":{"view_html":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T","download_json":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T.json","view_paper":"https://pith.science/paper/UKN7CHWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05809&json=true","fetch_graph":"https://pith.science/api/pith-number/UKN7CHWIS3F5PLXUTKJZJMD54T/graph.json","fetch_events":"https://pith.science/api/pith-number/UKN7CHWIS3F5PLXUTKJZJMD54T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/action/storage_attestation","attest_author":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/action/author_attestation","sign_citation":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/action/citation_signature","submit_replication":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/action/replication_record"}},"created_at":"2026-05-18T00:07:52.046532+00:00","updated_at":"2026-05-18T00:07:52.046532+00:00"}