{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UUFSHWSQ5YZVHA3DZZ64KRBGSE","short_pith_number":"pith:UUFSHWSQ","schema_version":"1.0","canonical_sha256":"a50b23da50ee33538363ce7dc5442691397f801881eb6c1887dbbbe680dd85f8","source":{"kind":"arxiv","id":"1902.03702","version":2},"attestation_state":"computed","paper":{"title":"A Simple Gap-producing Reduction for the Parameterized Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin","submitted_at":"2019-02-11T01:50:23Z","abstract_excerpt":"Given an $n$-vertex bipartite graph $I=(S,U,E)$, the goal of set cover problem is to find a minimum sized subset of $S$ such that every vertex in $U$ is adjacent to some vertex of this subset. It is NP-hard to approximate set cover to within a $(1-o(1))\\ln n$ factor. If we use the size of the optimum solution $k$ as the parameter, then it can be solved in $n^{k+o(1)}$ time. A natural question is: can we approximate set cover to within an $o(\\ln n)$ factor in $n^{k-\\epsilon}$ time?\n  In a recent breakthrough result, Karthik, Laekhanukit and Manurangsi showed that assuming the Strong Exponential"},"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":"1902.03702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-11T01:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"f6d675790966110abd2393677b27be37c369ac21b3f8889f88380e50d173f387","abstract_canon_sha256":"5bd4675faab217688eef84569bee4a37e520666bd01ff2e5fafcb8530bde7179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:43.812446Z","signature_b64":"L6oNU2TwDXSKfb55hBIxKTe1TC3E5ndMLolJBGBY1+P63FU5cIq+FtW65B8b2qVeg4Slq1k2rPu3JSmF/diwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a50b23da50ee33538363ce7dc5442691397f801881eb6c1887dbbbe680dd85f8","last_reissued_at":"2026-05-17T23:47:43.811984Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:43.811984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Gap-producing Reduction for the Parameterized Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin","submitted_at":"2019-02-11T01:50:23Z","abstract_excerpt":"Given an $n$-vertex bipartite graph $I=(S,U,E)$, the goal of set cover problem is to find a minimum sized subset of $S$ such that every vertex in $U$ is adjacent to some vertex of this subset. It is NP-hard to approximate set cover to within a $(1-o(1))\\ln n$ factor. If we use the size of the optimum solution $k$ as the parameter, then it can be solved in $n^{k+o(1)}$ time. A natural question is: can we approximate set cover to within an $o(\\ln n)$ factor in $n^{k-\\epsilon}$ time?\n  In a recent breakthrough result, Karthik, Laekhanukit and Manurangsi showed that assuming the Strong Exponential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03702","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":"1902.03702","created_at":"2026-05-17T23:47:43.812047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03702v2","created_at":"2026-05-17T23:47:43.812047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03702","created_at":"2026-05-17T23:47:43.812047+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUFSHWSQ5YZV","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUFSHWSQ5YZVHA3D","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUFSHWSQ","created_at":"2026-05-18T12:33:30.264802+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/UUFSHWSQ5YZVHA3DZZ64KRBGSE","json":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE.json","graph_json":"https://pith.science/api/pith-number/UUFSHWSQ5YZVHA3DZZ64KRBGSE/graph.json","events_json":"https://pith.science/api/pith-number/UUFSHWSQ5YZVHA3DZZ64KRBGSE/events.json","paper":"https://pith.science/paper/UUFSHWSQ"},"agent_actions":{"view_html":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE","download_json":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE.json","view_paper":"https://pith.science/paper/UUFSHWSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03702&json=true","fetch_graph":"https://pith.science/api/pith-number/UUFSHWSQ5YZVHA3DZZ64KRBGSE/graph.json","fetch_events":"https://pith.science/api/pith-number/UUFSHWSQ5YZVHA3DZZ64KRBGSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE/action/storage_attestation","attest_author":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE/action/author_attestation","sign_citation":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE/action/citation_signature","submit_replication":"https://pith.science/pith/UUFSHWSQ5YZVHA3DZZ64KRBGSE/action/replication_record"}},"created_at":"2026-05-17T23:47:43.812047+00:00","updated_at":"2026-05-17T23:47:43.812047+00:00"}