{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5FL5VWBNIK3JII4ACECV5XPTMH","short_pith_number":"pith:5FL5VWBN","schema_version":"1.0","canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","source":{"kind":"arxiv","id":"1608.03439","version":1},"attestation_state":"computed","paper":{"title":"Finding Large Set Covers Faster via the Representation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof","submitted_at":"2016-08-11T12:48:39Z","abstract_excerpt":"The worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^*(2^n)$-time dynamic programming algorithm, and no non-trivial consequences of an $O^*(1.01^n)$-time algorithm are known. Motivated by this chasm, we study the following natural question: Which instances of Set Cover can we solve faster than the simple dynamic programming algorithm? Specifically, we give a Monte Carlo algorithm that determines the existence of a set cover of size $\\sigma n$ in $O^*(2^{(1-\\Omega(\\sigma^4))n})$ time. Our approach is also applicable t"},"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":"1608.03439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9e7ebbf74ad22a18af5706419ee06db43935afda80d9a36e3144371e4aea2e43","abstract_canon_sha256":"d9b3b215e31d2d57408cf83f08e7940f91351c8ef203b3643a0660a4af986c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:28.921249Z","signature_b64":"qC00gxbDVapOixCiDlREt20pGcNurs/eAG5CjJ4JEZwSwbEXL//pjEA5S268EVMIGcjODrsZbJZOzL5JvnMJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","last_reissued_at":"2026-05-18T01:09:28.920759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:28.920759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Large Set Covers Faster via the Representation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof","submitted_at":"2016-08-11T12:48:39Z","abstract_excerpt":"The worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^*(2^n)$-time dynamic programming algorithm, and no non-trivial consequences of an $O^*(1.01^n)$-time algorithm are known. Motivated by this chasm, we study the following natural question: Which instances of Set Cover can we solve faster than the simple dynamic programming algorithm? Specifically, we give a Monte Carlo algorithm that determines the existence of a set cover of size $\\sigma n$ in $O^*(2^{(1-\\Omega(\\sigma^4))n})$ time. Our approach is also applicable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03439","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":"1608.03439","created_at":"2026-05-18T01:09:28.920837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03439v1","created_at":"2026-05-18T01:09:28.920837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03439","created_at":"2026-05-18T01:09:28.920837+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FL5VWBNIK3J","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FL5VWBNIK3JII4A","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FL5VWBN","created_at":"2026-05-18T12:30:01.593930+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/5FL5VWBNIK3JII4ACECV5XPTMH","json":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH.json","graph_json":"https://pith.science/api/pith-number/5FL5VWBNIK3JII4ACECV5XPTMH/graph.json","events_json":"https://pith.science/api/pith-number/5FL5VWBNIK3JII4ACECV5XPTMH/events.json","paper":"https://pith.science/paper/5FL5VWBN"},"agent_actions":{"view_html":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH","download_json":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH.json","view_paper":"https://pith.science/paper/5FL5VWBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03439&json=true","fetch_graph":"https://pith.science/api/pith-number/5FL5VWBNIK3JII4ACECV5XPTMH/graph.json","fetch_events":"https://pith.science/api/pith-number/5FL5VWBNIK3JII4ACECV5XPTMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/action/storage_attestation","attest_author":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/action/author_attestation","sign_citation":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/action/citation_signature","submit_replication":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/action/replication_record"}},"created_at":"2026-05-18T01:09:28.920837+00:00","updated_at":"2026-05-18T01:09:28.920837+00:00"}