{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UUFSHWSQ5YZVHA3DZZ64KRBGSE","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":"5bd4675faab217688eef84569bee4a37e520666bd01ff2e5fafcb8530bde7179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-11T01:50:23Z","title_canon_sha256":"f6d675790966110abd2393677b27be37c369ac21b3f8889f88380e50d173f387"},"schema_version":"1.0","source":{"id":"1902.03702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03702","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03702v2","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03702","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"UUFSHWSQ5YZV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UUFSHWSQ5YZVHA3D","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UUFSHWSQ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:e9f42cf5345865fd03eb1ca7bcc35014403bab696c7bd804f7e32d56934e0bcf","target":"graph","created_at":"2026-05-17T23:47:43Z","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":"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","authors_text":"Bingkai Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-11T01:50:23Z","title":"A Simple Gap-producing Reduction for the Parameterized Set Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03702","kind":"arxiv","version":2},"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:82aa20d8db60dbf34992edeaac3aaa341cd4f77c009d8b507816848ee219f38d","target":"record","created_at":"2026-05-17T23:47:43Z","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":"5bd4675faab217688eef84569bee4a37e520666bd01ff2e5fafcb8530bde7179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-11T01:50:23Z","title_canon_sha256":"f6d675790966110abd2393677b27be37c369ac21b3f8889f88380e50d173f387"},"schema_version":"1.0","source":{"id":"1902.03702","kind":"arxiv","version":2}},"canonical_sha256":"a50b23da50ee33538363ce7dc5442691397f801881eb6c1887dbbbe680dd85f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a50b23da50ee33538363ce7dc5442691397f801881eb6c1887dbbbe680dd85f8","first_computed_at":"2026-05-17T23:47:43.811984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:43.811984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6oNU2TwDXSKfb55hBIxKTe1TC3E5ndMLolJBGBY1+P63FU5cIq+FtW65B8b2qVeg4Slq1k2rPu3JSmF/diwAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:43.812446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82aa20d8db60dbf34992edeaac3aaa341cd4f77c009d8b507816848ee219f38d","sha256:e9f42cf5345865fd03eb1ca7bcc35014403bab696c7bd804f7e32d56934e0bcf"],"state_sha256":"002480fbf1d2293914b0932a6a26ac2ff69f1628dd795e8385e3a65f539311b6"}