{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TVTJXWT2DBOAWQP7B44LSUOMMR","short_pith_number":"pith:TVTJXWT2","schema_version":"1.0","canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","source":{"kind":"arxiv","id":"1204.5489","version":2},"attestation_state":"computed","paper":{"title":"Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Eden Chlamtac, Konstantinos Georgiou, Zac Friggstad","submitted_at":"2012-04-24T20:12:25Z","abstract_excerpt":"Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such improvements can be achieved using lift-and-project methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algorithm of Cygan et al., and which lends itself naturally to a lift-and-project based approach.\n  At a high level, our approach is similar to the recent work of Karlin, Mathieu, and Nguyen [IPCO 2011], "},"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":"1204.5489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bb34533a70548c72258e93f743a993fb800006d92817dbfd2a0bf97575e03be1","abstract_canon_sha256":"eba3338e642d5d86a31b1fc14cc6b08fe83c79b8a7d09ad2c7d7cd0b3431d14a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.821987Z","signature_b64":"91EGZHNh70Q3f/t7qHNhRTW2VTRKFHRI5ykAqBexkPnunlwI7EC9BFdJa4VH99PBSLvA41p15O6pY2sD1NfdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","last_reissued_at":"2026-05-18T03:42:23.821124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.821124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Eden Chlamtac, Konstantinos Georgiou, Zac Friggstad","submitted_at":"2012-04-24T20:12:25Z","abstract_excerpt":"Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such improvements can be achieved using lift-and-project methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algorithm of Cygan et al., and which lends itself naturally to a lift-and-project based approach.\n  At a high level, our approach is similar to the recent work of Karlin, Mathieu, and Nguyen [IPCO 2011], "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5489","kind":"arxiv","version":2},"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":"1204.5489","created_at":"2026-05-18T03:42:23.821253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5489v2","created_at":"2026-05-18T03:42:23.821253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5489","created_at":"2026-05-18T03:42:23.821253+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVTJXWT2DBOA","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVTJXWT2DBOAWQP7","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVTJXWT2","created_at":"2026-05-18T12:27:23.164592+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/TVTJXWT2DBOAWQP7B44LSUOMMR","json":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR.json","graph_json":"https://pith.science/api/pith-number/TVTJXWT2DBOAWQP7B44LSUOMMR/graph.json","events_json":"https://pith.science/api/pith-number/TVTJXWT2DBOAWQP7B44LSUOMMR/events.json","paper":"https://pith.science/paper/TVTJXWT2"},"agent_actions":{"view_html":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR","download_json":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR.json","view_paper":"https://pith.science/paper/TVTJXWT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5489&json=true","fetch_graph":"https://pith.science/api/pith-number/TVTJXWT2DBOAWQP7B44LSUOMMR/graph.json","fetch_events":"https://pith.science/api/pith-number/TVTJXWT2DBOAWQP7B44LSUOMMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/action/storage_attestation","attest_author":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/action/author_attestation","sign_citation":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/action/citation_signature","submit_replication":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/action/replication_record"}},"created_at":"2026-05-18T03:42:23.821253+00:00","updated_at":"2026-05-18T03:42:23.821253+00:00"}