{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KPDPZSQ6X6NVXIFRKK7FG54UV7","short_pith_number":"pith:KPDPZSQ6","schema_version":"1.0","canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","source":{"kind":"arxiv","id":"1311.0224","version":2},"attestation_state":"computed","paper":{"title":"Faster Algorithms For Vertex Partitioning Problems Parameterized by Clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Vatshelle, Sang-il Oum, Sigve Hortemo S{\\ae}ther","submitted_at":"2013-11-01T17:03:09Z","abstract_excerpt":"Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width $k$ given with a $k$-expression, Dominating Set can be solved in $4^k n^{O(1)}$ time. However, no FPT algorithm is known for computing an optimal $k$-expression. For a graph of clique-width $k$, if we rely on known algorithms to compute a $(2^{3k}-1)$-expression via rank-width and then solving Dominating Set using the $(2^{3k}-1)$-expression, the above algorithm will only give a runtime of $4^{2^{3k}} n^{O(1)}$. There have been results which overcome this exponential jump; the best "},"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":"1311.0224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-01T17:03:09Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"947c740fa3edd4e636914710dd98907e8e440c872e9105d69cb760c20c64e5f4","abstract_canon_sha256":"2a0e5f6f9bc2eb834fbf419a480946ec296560859f2fac5dab51f85b05c916c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.835166Z","signature_b64":"Gcz0Lt3/+OMPB7SDFXEtS7gd+vWU1msU5fPJlY7Y0KksiuTsgGX/wcsX+VsC49xeaWjOX8s5lSG6PnLsI31IDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","last_reissued_at":"2026-05-18T02:30:15.834583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.834583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms For Vertex Partitioning Problems Parameterized by Clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Vatshelle, Sang-il Oum, Sigve Hortemo S{\\ae}ther","submitted_at":"2013-11-01T17:03:09Z","abstract_excerpt":"Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width $k$ given with a $k$-expression, Dominating Set can be solved in $4^k n^{O(1)}$ time. However, no FPT algorithm is known for computing an optimal $k$-expression. For a graph of clique-width $k$, if we rely on known algorithms to compute a $(2^{3k}-1)$-expression via rank-width and then solving Dominating Set using the $(2^{3k}-1)$-expression, the above algorithm will only give a runtime of $4^{2^{3k}} n^{O(1)}$. There have been results which overcome this exponential jump; the best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0224","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":"1311.0224","created_at":"2026-05-18T02:30:15.834668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0224v2","created_at":"2026-05-18T02:30:15.834668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0224","created_at":"2026-05-18T02:30:15.834668+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPDPZSQ6X6NV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPDPZSQ6X6NVXIFR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPDPZSQ6","created_at":"2026-05-18T12:27:51.066281+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/KPDPZSQ6X6NVXIFRKK7FG54UV7","json":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7.json","graph_json":"https://pith.science/api/pith-number/KPDPZSQ6X6NVXIFRKK7FG54UV7/graph.json","events_json":"https://pith.science/api/pith-number/KPDPZSQ6X6NVXIFRKK7FG54UV7/events.json","paper":"https://pith.science/paper/KPDPZSQ6"},"agent_actions":{"view_html":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7","download_json":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7.json","view_paper":"https://pith.science/paper/KPDPZSQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0224&json=true","fetch_graph":"https://pith.science/api/pith-number/KPDPZSQ6X6NVXIFRKK7FG54UV7/graph.json","fetch_events":"https://pith.science/api/pith-number/KPDPZSQ6X6NVXIFRKK7FG54UV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/action/storage_attestation","attest_author":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/action/author_attestation","sign_citation":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/action/citation_signature","submit_replication":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/action/replication_record"}},"created_at":"2026-05-18T02:30:15.834668+00:00","updated_at":"2026-05-18T02:30:15.834668+00:00"}