{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PXXMSMQP524FOKRYX77FFQH2BC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b06037368fd8a60610cf211ab0af27d7357822e543472d07d4d9b42f170b430","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T00:53:00Z","title_canon_sha256":"cf69f3e945973a6fa335a92682e10b95947f39dfd599a4e0f6e060820d15ec0a"},"schema_version":"1.0","source":{"id":"1612.01610","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01610","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01610v3","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01610","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"PXXMSMQP524F","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PXXMSMQP524FOKRY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PXXMSMQP","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:ba4a3cc28e17f057738d3d6974b963c4cc387f6d8376bc2809ee6606b5c91f0f","target":"graph","created_at":"2026-05-18T00:50:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David G. Harris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T00:53:00Z","title":"Tighter inapproximability for set cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01610","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e4428b5c3b368dd0986b71e4bbee8f70d5dfb67a636ca72079b058fe985d465","target":"record","created_at":"2026-05-18T00:50:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b06037368fd8a60610cf211ab0af27d7357822e543472d07d4d9b42f170b430","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T00:53:00Z","title_canon_sha256":"cf69f3e945973a6fa335a92682e10b95947f39dfd599a4e0f6e060820d15ec0a"},"schema_version":"1.0","source":{"id":"1612.01610","kind":"arxiv","version":3}},"canonical_sha256":"7deec9320feeb8572a38bffe52c0fa08b15d5b55a6b75207bccb7fd84e37bb7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7deec9320feeb8572a38bffe52c0fa08b15d5b55a6b75207bccb7fd84e37bb7e","first_computed_at":"2026-05-18T00:50:37.451548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.451548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OBZtMpn2luwauQsSQXxEl62x7m4GIqEF2w9TAQ6ye57ai+qx5HbdcYzJGWLbCBo8LamX7szldYlnxnqix4CLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.452020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01610","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e4428b5c3b368dd0986b71e4bbee8f70d5dfb67a636ca72079b058fe985d465","sha256:ba4a3cc28e17f057738d3d6974b963c4cc387f6d8376bc2809ee6606b5c91f0f"],"state_sha256":"b35e8c1461723daaa2e695ef8480937853bf18fc634a3fe2e6f76cc33ebcce3e"}