{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KPDPZSQ6X6NVXIFRKK7FG54UV7","short_pith_number":"pith:KPDPZSQ6","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"},"canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","source":{"kind":"arxiv","id":"1311.0224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0224","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0224v2","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0224","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"KPDPZSQ6X6NV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KPDPZSQ6X6NVXIFR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KPDPZSQ6","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KPDPZSQ6X6NVXIFRKK7FG54UV7","target":"record","payload":{"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"},"canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","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"},"source_kind":"arxiv","source_id":"1311.0224","source_version":2,"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-18T02:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMPnO1J4WPkbPKkjXAzHXuQ9hi4C/88pfaCbDZNJlq689GTeyQOGr1a4CNYk6S5438vd3QVR9Dx5b0xfmusWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:17:45.756415Z"},"content_sha256":"ae1f989aeeacf3c780d18d2c80e10a40f8105391f804f57e72fef4f0317b6c79","schema_version":"1.0","event_id":"sha256:ae1f989aeeacf3c780d18d2c80e10a40f8105391f804f57e72fef4f0317b6c79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KPDPZSQ6X6NVXIFRKK7FG54UV7","target":"graph","payload":{"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"},"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-18T02:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXlUCmy2dX3geMzDU0IadSlZmbtzK7gC6rAgzBDAUOfXlOesXaMV+p84OAktErkwXXFgw8G2Qxke7EBqy6+PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:17:45.757070Z"},"content_sha256":"e76fe6a01bf38dd1d294a552b318c23088de799778d5d487b22b911221353c7a","schema_version":"1.0","event_id":"sha256:e76fe6a01bf38dd1d294a552b318c23088de799778d5d487b22b911221353c7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/bundle.json","state_url":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/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-30T14:17:45Z","links":{"resolver":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7","bundle":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/bundle.json","state":"https://pith.science/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPDPZSQ6X6NVXIFRKK7FG54UV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KPDPZSQ6X6NVXIFRKK7FG54UV7","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":"2a0e5f6f9bc2eb834fbf419a480946ec296560859f2fac5dab51f85b05c916c2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-01T17:03:09Z","title_canon_sha256":"947c740fa3edd4e636914710dd98907e8e440c872e9105d69cb760c20c64e5f4"},"schema_version":"1.0","source":{"id":"1311.0224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0224","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0224v2","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0224","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"KPDPZSQ6X6NV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KPDPZSQ6X6NVXIFR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KPDPZSQ6","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:e76fe6a01bf38dd1d294a552b318c23088de799778d5d487b22b911221353c7a","target":"graph","created_at":"2026-05-18T02:30:15Z","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":"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 ","authors_text":"Martin Vatshelle, Sang-il Oum, Sigve Hortemo S{\\ae}ther","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-01T17:03:09Z","title":"Faster Algorithms For Vertex Partitioning Problems Parameterized by Clique-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0224","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:ae1f989aeeacf3c780d18d2c80e10a40f8105391f804f57e72fef4f0317b6c79","target":"record","created_at":"2026-05-18T02:30:15Z","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":"2a0e5f6f9bc2eb834fbf419a480946ec296560859f2fac5dab51f85b05c916c2","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-01T17:03:09Z","title_canon_sha256":"947c740fa3edd4e636914710dd98907e8e440c872e9105d69cb760c20c64e5f4"},"schema_version":"1.0","source":{"id":"1311.0224","kind":"arxiv","version":2}},"canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53c6fcca1ebf9b5ba0b152be537794afcbe9ae0253e61a00ff456e2bde549c3f","first_computed_at":"2026-05-18T02:30:15.834583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:15.834583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gcz0Lt3/+OMPB7SDFXEtS7gd+vWU1msU5fPJlY7Y0KksiuTsgGX/wcsX+VsC49xeaWjOX8s5lSG6PnLsI31IDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:15.835166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1f989aeeacf3c780d18d2c80e10a40f8105391f804f57e72fef4f0317b6c79","sha256:e76fe6a01bf38dd1d294a552b318c23088de799778d5d487b22b911221353c7a"],"state_sha256":"6f13c89cb31f955f69c1f085f6082b0c745e8e113fe08425b7f8917b4d37568b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9eh8aElR42f63/3yszciiQbMuuxxkNbi8qKPd07pXlrhK0tWZ2AeaqlLZVosKyGyB0Mce9Tg7WQTcBN0oBrlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:17:45.760220Z","bundle_sha256":"58827bc2ccc355e9a6a03ec2a82354ab59152bec91a400f72e53f73b2cc835dc"}}