{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BK2KODC2QB5D6N5AAXC6BIFCJP","short_pith_number":"pith:BK2KODC2","schema_version":"1.0","canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","source":{"kind":"arxiv","id":"1705.01414","version":1},"attestation_state":"computed","paper":{"title":"Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Meirav Zehavi, Roohani Sharma, Saket Saurabh","submitted_at":"2017-05-03T13:28:51Z","abstract_excerpt":"We present two new combinatorial tools for the design of parameterized algorithms. The first is a simple linear time randomized algorithm that given as input a $d$-degenerate graph $G$ and an integer $k$, outputs an independent set $Y$, such that for every independent set $X$ in $G$ of size at most $k$, the probability that $X$ is a subset of $Y$ is at least $\\left({(d+1)k \\choose k} \\cdot k(d+1)\\right)^{-1}$.The second is a new (deterministic) polynomial time graph sparsification procedure that given a graph $G$, a set $T = \\{\\{s_1, t_1\\}, \\{s_2, t_2\\}, \\ldots, \\{s_\\ell, t_\\ell\\}\\}$ of termin"},"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":"1705.01414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T13:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"14c959f418cf7f8b59c8f0e8fdd76dbcbcc2332b968d50d5e32f1cee41c62a64","abstract_canon_sha256":"552bf27d16faa41d2dad91a4a9d76fa4cbb1112c359f9126378eaef63382194c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.217330Z","signature_b64":"m306G9MkP90CiH1/OdzTv+lIpx1CqfgmIIpFgWTBaaV6/0ZU1qgh/r5wuwcPmrqgxUKRjF6DGyFaM6xUOwZTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","last_reissued_at":"2026-05-18T00:45:05.216955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.216955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Meirav Zehavi, Roohani Sharma, Saket Saurabh","submitted_at":"2017-05-03T13:28:51Z","abstract_excerpt":"We present two new combinatorial tools for the design of parameterized algorithms. The first is a simple linear time randomized algorithm that given as input a $d$-degenerate graph $G$ and an integer $k$, outputs an independent set $Y$, such that for every independent set $X$ in $G$ of size at most $k$, the probability that $X$ is a subset of $Y$ is at least $\\left({(d+1)k \\choose k} \\cdot k(d+1)\\right)^{-1}$.The second is a new (deterministic) polynomial time graph sparsification procedure that given a graph $G$, a set $T = \\{\\{s_1, t_1\\}, \\{s_2, t_2\\}, \\ldots, \\{s_\\ell, t_\\ell\\}\\}$ of termin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01414","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":"1705.01414","created_at":"2026-05-18T00:45:05.217017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01414v1","created_at":"2026-05-18T00:45:05.217017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01414","created_at":"2026-05-18T00:45:05.217017+00:00"},{"alias_kind":"pith_short_12","alias_value":"BK2KODC2QB5D","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BK2KODC2QB5D6N5A","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BK2KODC2","created_at":"2026-05-18T12:31:08.081275+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/BK2KODC2QB5D6N5AAXC6BIFCJP","json":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP.json","graph_json":"https://pith.science/api/pith-number/BK2KODC2QB5D6N5AAXC6BIFCJP/graph.json","events_json":"https://pith.science/api/pith-number/BK2KODC2QB5D6N5AAXC6BIFCJP/events.json","paper":"https://pith.science/paper/BK2KODC2"},"agent_actions":{"view_html":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP","download_json":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP.json","view_paper":"https://pith.science/paper/BK2KODC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01414&json=true","fetch_graph":"https://pith.science/api/pith-number/BK2KODC2QB5D6N5AAXC6BIFCJP/graph.json","fetch_events":"https://pith.science/api/pith-number/BK2KODC2QB5D6N5AAXC6BIFCJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/action/storage_attestation","attest_author":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/action/author_attestation","sign_citation":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/action/citation_signature","submit_replication":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/action/replication_record"}},"created_at":"2026-05-18T00:45:05.217017+00:00","updated_at":"2026-05-18T00:45:05.217017+00:00"}