{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BK2KODC2QB5D6N5AAXC6BIFCJP","short_pith_number":"pith:BK2KODC2","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"},"canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","source":{"kind":"arxiv","id":"1705.01414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01414","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01414v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01414","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"BK2KODC2QB5D","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BK2KODC2QB5D6N5A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BK2KODC2","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BK2KODC2QB5D6N5AAXC6BIFCJP","target":"record","payload":{"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"},"canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","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"},"source_kind":"arxiv","source_id":"1705.01414","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THDRMABNy3stDYIaNsA6ipaolCHlchmqJXxjUiPUUK5wIiA0vNoK72jYmXzPthySBuzRfwtrJ7hZ3T3x2WXvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:22:14.245792Z"},"content_sha256":"f815887834de5cdd18c772396b02cb1e49fa52089cc4a8f472775bf4f4211dbe","schema_version":"1.0","event_id":"sha256:f815887834de5cdd18c772396b02cb1e49fa52089cc4a8f472775bf4f4211dbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BK2KODC2QB5D6N5AAXC6BIFCJP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5KzJYirX4/Ust2+0w2y42lPvxzQqOWjLB+/IYzlckK7GWvq0t/Cxq35GQ2/dZsyMFFbmc5Ta9tu9HgF5sk7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:22:14.246279Z"},"content_sha256":"42f11ac4c19781692e8fa26c18f43b9a7804365f1cd108b0c95631fff7ada299","schema_version":"1.0","event_id":"sha256:42f11ac4c19781692e8fa26c18f43b9a7804365f1cd108b0c95631fff7ada299"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/bundle.json","state_url":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T13:22:14Z","links":{"resolver":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP","bundle":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/bundle.json","state":"https://pith.science/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BK2KODC2QB5D6N5AAXC6BIFCJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BK2KODC2QB5D6N5AAXC6BIFCJP","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":"552bf27d16faa41d2dad91a4a9d76fa4cbb1112c359f9126378eaef63382194c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T13:28:51Z","title_canon_sha256":"14c959f418cf7f8b59c8f0e8fdd76dbcbcc2332b968d50d5e32f1cee41c62a64"},"schema_version":"1.0","source":{"id":"1705.01414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01414","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01414v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01414","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"BK2KODC2QB5D","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BK2KODC2QB5D6N5A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BK2KODC2","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:42f11ac4c19781692e8fa26c18f43b9a7804365f1cd108b0c95631fff7ada299","target":"graph","created_at":"2026-05-18T00:45:05Z","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":"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","authors_text":"Daniel Lokshtanov, Fahad Panolan, Meirav Zehavi, Roohani Sharma, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T13:28:51Z","title":"Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01414","kind":"arxiv","version":1},"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:f815887834de5cdd18c772396b02cb1e49fa52089cc4a8f472775bf4f4211dbe","target":"record","created_at":"2026-05-18T00:45:05Z","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":"552bf27d16faa41d2dad91a4a9d76fa4cbb1112c359f9126378eaef63382194c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T13:28:51Z","title_canon_sha256":"14c959f418cf7f8b59c8f0e8fdd76dbcbcc2332b968d50d5e32f1cee41c62a64"},"schema_version":"1.0","source":{"id":"1705.01414","kind":"arxiv","version":1}},"canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ab4a70c5a807a3f37a005c5e0a0a24beee1735b6e7e6162ec9a622404a090a5","first_computed_at":"2026-05-18T00:45:05.216955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:05.216955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m306G9MkP90CiH1/OdzTv+lIpx1CqfgmIIpFgWTBaaV6/0ZU1qgh/r5wuwcPmrqgxUKRjF6DGyFaM6xUOwZTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:05.217330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f815887834de5cdd18c772396b02cb1e49fa52089cc4a8f472775bf4f4211dbe","sha256:42f11ac4c19781692e8fa26c18f43b9a7804365f1cd108b0c95631fff7ada299"],"state_sha256":"b3da0cdbab5aaf567bcfdd58ab67cdbdccb87da44f73c0e78c272f0016df57eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cdOAMYZeM2xjOzl2SPkax4vWVqfPVdtov64xd8PYYVN/YkxJTCAkGGOSYflpaZiic22k1Gr5CQnSpAF5lFYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:22:14.248644Z","bundle_sha256":"ef186f45c64bbda65fe549bd9ef38dbc6c78dd76d94f1fa920b3ab2e9d6c68f1"}}