{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MTOUR5OVZFHUSC3SDSEQQHNGF4","short_pith_number":"pith:MTOUR5OV","schema_version":"1.0","canonical_sha256":"64dd48f5d5c94f490b721c89081da62f050d408b388f2653d62009d1941212e4","source":{"kind":"arxiv","id":"2210.02117","version":2},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds for Problems Parameterized by Rank-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Jesper Nederlof, Tuukka Korhonen","submitted_at":"2022-10-05T09:37:46Z","abstract_excerpt":"We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm given by Bui-Xuan, Telle, and Vatshelle [Discret. Appl. Math., 2010] and it answers the open question of Bergougnoux and Kant\\'{e} [SIAM J. Discret. Math., 2021]. We also show that the known $2^{O(k^2)} n^{O(1)}$ time algorithms for Weighted Dominating Set, Maximum Induced Matching and Feedback Vertex Set parameterized by rank-width $k$ are optimal assuming"},"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":"2210.02117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-10-05T09:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"a5a036ce81463113cd6df79828358c8a076529136716680d41cff26bcfb364f0","abstract_canon_sha256":"fed083c2d7a2fde067c4634e0a40a4a61c9ffc889f012a748cee92460df0fec7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:33.662308Z","signature_b64":"6+ewONETGGaDV3tEtVwfStczvMQqJ4Ba/kBKMBiYNe7T/LsQLhAfcscHQB4tErCQv4MV3EFARepS4Uyh18daCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64dd48f5d5c94f490b721c89081da62f050d408b388f2653d62009d1941212e4","last_reissued_at":"2026-07-05T05:23:33.661891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:33.661891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Problems Parameterized by Rank-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Jesper Nederlof, Tuukka Korhonen","submitted_at":"2022-10-05T09:37:46Z","abstract_excerpt":"We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm given by Bui-Xuan, Telle, and Vatshelle [Discret. Appl. Math., 2010] and it answers the open question of Bergougnoux and Kant\\'{e} [SIAM J. Discret. Math., 2021]. We also show that the known $2^{O(k^2)} n^{O(1)}$ time algorithms for Weighted Dominating Set, Maximum Induced Matching and Feedback Vertex Set parameterized by rank-width $k$ are optimal assuming"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02117","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.02117/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.02117","created_at":"2026-07-05T05:23:33.661949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02117v2","created_at":"2026-07-05T05:23:33.661949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02117","created_at":"2026-07-05T05:23:33.661949+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTOUR5OVZFHU","created_at":"2026-07-05T05:23:33.661949+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTOUR5OVZFHUSC3S","created_at":"2026-07-05T05:23:33.661949+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTOUR5OV","created_at":"2026-07-05T05:23:33.661949+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/MTOUR5OVZFHUSC3SDSEQQHNGF4","json":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4.json","graph_json":"https://pith.science/api/pith-number/MTOUR5OVZFHUSC3SDSEQQHNGF4/graph.json","events_json":"https://pith.science/api/pith-number/MTOUR5OVZFHUSC3SDSEQQHNGF4/events.json","paper":"https://pith.science/paper/MTOUR5OV"},"agent_actions":{"view_html":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4","download_json":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4.json","view_paper":"https://pith.science/paper/MTOUR5OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02117&json=true","fetch_graph":"https://pith.science/api/pith-number/MTOUR5OVZFHUSC3SDSEQQHNGF4/graph.json","fetch_events":"https://pith.science/api/pith-number/MTOUR5OVZFHUSC3SDSEQQHNGF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4/action/storage_attestation","attest_author":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4/action/author_attestation","sign_citation":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4/action/citation_signature","submit_replication":"https://pith.science/pith/MTOUR5OVZFHUSC3SDSEQQHNGF4/action/replication_record"}},"created_at":"2026-07-05T05:23:33.661949+00:00","updated_at":"2026-07-05T05:23:33.661949+00:00"}