{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AI2ESVZGLKBXWXPNKMA6ZMACS7","short_pith_number":"pith:AI2ESVZG","schema_version":"1.0","canonical_sha256":"02344957265a837b5ded5301ecb00297ebe627d5b12cfcada8833fa97fb6f41b","source":{"kind":"arxiv","id":"2008.05374","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Magn\\'us M. Halld\\'orsson, Marek Cygan","submitted_at":"2020-08-12T15:14:57Z","abstract_excerpt":"We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\\gamma)\\ln N$-factor in time exp($N^{\\gamma-\\delta})$, for any $0 < \\gamma < 1$ and any $\\delta > 0$, assuming the Exponential Time Hypothesis. This essentially matches the best upper bound known by Cygan et al.\\ (IPL, 2009) of $(1-\\gamma)\\ln N$-factor in time $exp(O(N^\\gamma))$.\n  The lower bound is obtained by extracting a standalone reduction from Label Cover to Set Cover from the work of Moshkovitz (Theory of Computing, 2015), and applying it to a different PCP theorem than done there. We also obtain a "},"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":"2008.05374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:14:57Z","cross_cats_sorted":[],"title_canon_sha256":"6cb3e8392c1766c5008b3ec697e34b3010c9d816db4316172bacaefee84f096c","abstract_canon_sha256":"f686e24d3549eb47a952df56218a1d564aa808c9a393cf992d2d9f1ed6552234"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:46.107980Z","signature_b64":"PT09aabHgTAVe59+lWvLYC8TNxGeAZXKSrP2eUnuAk2dOpLTOxIPPZ/DxG1NDcoBpu636d3q38LMSKisKWW1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02344957265a837b5ded5301ecb00297ebe627d5b12cfcada8833fa97fb6f41b","last_reissued_at":"2026-07-05T01:26:46.107581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:46.107581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Magn\\'us M. Halld\\'orsson, Marek Cygan","submitted_at":"2020-08-12T15:14:57Z","abstract_excerpt":"We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\\gamma)\\ln N$-factor in time exp($N^{\\gamma-\\delta})$, for any $0 < \\gamma < 1$ and any $\\delta > 0$, assuming the Exponential Time Hypothesis. This essentially matches the best upper bound known by Cygan et al.\\ (IPL, 2009) of $(1-\\gamma)\\ln N$-factor in time $exp(O(N^\\gamma))$.\n  The lower bound is obtained by extracting a standalone reduction from Label Cover to Set Cover from the work of Moshkovitz (Theory of Computing, 2015), and applying it to a different PCP theorem than done there. We also obtain a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05374","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.05374/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.05374","created_at":"2026-07-05T01:26:46.107643+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05374v1","created_at":"2026-07-05T01:26:46.107643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05374","created_at":"2026-07-05T01:26:46.107643+00:00"},{"alias_kind":"pith_short_12","alias_value":"AI2ESVZGLKBX","created_at":"2026-07-05T01:26:46.107643+00:00"},{"alias_kind":"pith_short_16","alias_value":"AI2ESVZGLKBXWXPN","created_at":"2026-07-05T01:26:46.107643+00:00"},{"alias_kind":"pith_short_8","alias_value":"AI2ESVZG","created_at":"2026-07-05T01:26:46.107643+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/AI2ESVZGLKBXWXPNKMA6ZMACS7","json":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7.json","graph_json":"https://pith.science/api/pith-number/AI2ESVZGLKBXWXPNKMA6ZMACS7/graph.json","events_json":"https://pith.science/api/pith-number/AI2ESVZGLKBXWXPNKMA6ZMACS7/events.json","paper":"https://pith.science/paper/AI2ESVZG"},"agent_actions":{"view_html":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7","download_json":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7.json","view_paper":"https://pith.science/paper/AI2ESVZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05374&json=true","fetch_graph":"https://pith.science/api/pith-number/AI2ESVZGLKBXWXPNKMA6ZMACS7/graph.json","fetch_events":"https://pith.science/api/pith-number/AI2ESVZGLKBXWXPNKMA6ZMACS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7/action/storage_attestation","attest_author":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7/action/author_attestation","sign_citation":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7/action/citation_signature","submit_replication":"https://pith.science/pith/AI2ESVZGLKBXWXPNKMA6ZMACS7/action/replication_record"}},"created_at":"2026-07-05T01:26:46.107643+00:00","updated_at":"2026-07-05T01:26:46.107643+00:00"}