{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PXXMSMQP524FOKRYX77FFQH2BC","short_pith_number":"pith:PXXMSMQP","schema_version":"1.0","canonical_sha256":"7deec9320feeb8572a38bffe52c0fa08b15d5b55a6b75207bccb7fd84e37bb7e","source":{"kind":"arxiv","id":"1612.01610","version":3},"attestation_state":"computed","paper":{"title":"Tighter inapproximability for set cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2016-12-06T00:53:00Z","abstract_excerpt":"Set Cover is a classic NP-hard problem; as shown by Slav\\'{i}k (1997) the greedy algorithm gives an approximation ratio of $\\ln n - \\ln \\ln n + \\Theta(1)$. A series of works by Lund \\& Yannakakis (1994), Feige (1998), Moshkovitz (2015) have shown that, under the assumption $P \\neq NP$, it is impossible to obtain a polynomial-time approximation ratio with approximation ratio $(1 - \\alpha) \\ln n$, for any constant $\\alpha > 0$.\n  In this note, we show that under the Exponential Time Hypothesis (a stronger complexity-theoretic assumptions than $P \\neq NP$), there are no polynomial-time algorithms"},"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":"1612.01610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T00:53:00Z","cross_cats_sorted":[],"title_canon_sha256":"cf69f3e945973a6fa335a92682e10b95947f39dfd599a4e0f6e060820d15ec0a","abstract_canon_sha256":"0b06037368fd8a60610cf211ab0af27d7357822e543472d07d4d9b42f170b430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.452020Z","signature_b64":"OBZtMpn2luwauQsSQXxEl62x7m4GIqEF2w9TAQ6ye57ai+qx5HbdcYzJGWLbCBo8LamX7szldYlnxnqix4CLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7deec9320feeb8572a38bffe52c0fa08b15d5b55a6b75207bccb7fd84e37bb7e","last_reissued_at":"2026-05-18T00:50:37.451548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.451548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter inapproximability for set cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2016-12-06T00:53:00Z","abstract_excerpt":"Set Cover is a classic NP-hard problem; as shown by Slav\\'{i}k (1997) the greedy algorithm gives an approximation ratio of $\\ln n - \\ln \\ln n + \\Theta(1)$. A series of works by Lund \\& Yannakakis (1994), Feige (1998), Moshkovitz (2015) have shown that, under the assumption $P \\neq NP$, it is impossible to obtain a polynomial-time approximation ratio with approximation ratio $(1 - \\alpha) \\ln n$, for any constant $\\alpha > 0$.\n  In this note, we show that under the Exponential Time Hypothesis (a stronger complexity-theoretic assumptions than $P \\neq NP$), there are no polynomial-time algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01610","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":"1612.01610","created_at":"2026-05-18T00:50:37.451623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01610v3","created_at":"2026-05-18T00:50:37.451623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01610","created_at":"2026-05-18T00:50:37.451623+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXXMSMQP524F","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXXMSMQP524FOKRY","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXXMSMQP","created_at":"2026-05-18T12:30:39.010887+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/PXXMSMQP524FOKRYX77FFQH2BC","json":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC.json","graph_json":"https://pith.science/api/pith-number/PXXMSMQP524FOKRYX77FFQH2BC/graph.json","events_json":"https://pith.science/api/pith-number/PXXMSMQP524FOKRYX77FFQH2BC/events.json","paper":"https://pith.science/paper/PXXMSMQP"},"agent_actions":{"view_html":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC","download_json":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC.json","view_paper":"https://pith.science/paper/PXXMSMQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01610&json=true","fetch_graph":"https://pith.science/api/pith-number/PXXMSMQP524FOKRYX77FFQH2BC/graph.json","fetch_events":"https://pith.science/api/pith-number/PXXMSMQP524FOKRYX77FFQH2BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC/action/storage_attestation","attest_author":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC/action/author_attestation","sign_citation":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC/action/citation_signature","submit_replication":"https://pith.science/pith/PXXMSMQP524FOKRYX77FFQH2BC/action/replication_record"}},"created_at":"2026-05-18T00:50:37.451623+00:00","updated_at":"2026-05-18T00:50:37.451623+00:00"}