{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZY6BYSO2POMAWJ4PPVXTKSNIQD","short_pith_number":"pith:ZY6BYSO2","canonical_record":{"source":{"id":"1404.7758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T15:13:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ab3170246f8b4db3d447cd2c935f79f369edce691688164f99098d2e4bf47b13","abstract_canon_sha256":"13a4a1ce26a3a50efb4b684e0e2d6ed9c6b4d8f95b4483e1287920d5d6c21381"},"schema_version":"1.0"},"canonical_sha256":"ce3c1c49da7b980b278f7d6f3549a880c4b7cfa8f5554c82d23f5bc13f9189f6","source":{"kind":"arxiv","id":"1404.7758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7758","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7758v1","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7758","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZY6BYSO2POMA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZY6BYSO2POMAWJ4P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZY6BYSO2","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZY6BYSO2POMAWJ4PPVXTKSNIQD","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T15:13:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ab3170246f8b4db3d447cd2c935f79f369edce691688164f99098d2e4bf47b13","abstract_canon_sha256":"13a4a1ce26a3a50efb4b684e0e2d6ed9c6b4d8f95b4483e1287920d5d6c21381"},"schema_version":"1.0"},"canonical_sha256":"ce3c1c49da7b980b278f7d6f3549a880c4b7cfa8f5554c82d23f5bc13f9189f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:50.034026Z","signature_b64":"MOYkBL1ThWjVkaACeBRD1uWebiNMPYBtFqwi6CfloUQyK3kPwKBr6eOKJ45MlFBPwO/5uw1V2+ZRuD86rUL2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce3c1c49da7b980b278f7d6f3549a880c4b7cfa8f5554c82d23f5bc13f9189f6","last_reissued_at":"2026-05-18T02:52:50.033663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:50.033663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7758","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-18T02:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5voh+5hd2052/YLg4hZ0OqZz7gtFtul69Ci1plklCxNFwToDm7a/OG1zs+uOAksopxNgxRQqDYAax5D6YCSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:03:56.315127Z"},"content_sha256":"727c4ad123e027051818a93b6e210bf0becc3a66e70419feb9a19c2a838babe7","schema_version":"1.0","event_id":"sha256:727c4ad123e027051818a93b6e210bf0becc3a66e70419feb9a19c2a838babe7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZY6BYSO2POMAWJ4PPVXTKSNIQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Between Treewidth and Clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jan Arne Telle, Sigve Hortemo S{\\ae}ther","submitted_at":"2014-04-30T15:13:45Z","abstract_excerpt":"Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified by the four problems MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set that are all FPT parameterized by treewidth but none of which can be FPT parameterized by clique-width unless FPT = W[1], as shown by Fomin et al [7, 8]. We therefore seek a structural graph parameter that shares some of the generality of clique-width without paying this price. Based on splits,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7758","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-18T02:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfXhjA40mm3f3kF8lmML1sUn8doOCZI6Dt8fd1vpq3YTuob3E4DtBUx+50PRYW/zkQhbrpamcZOREVAkdJjBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:03:56.315788Z"},"content_sha256":"5cdf95ecba94f09a0450082b8e4300ff7b8f81968b0dde3a64cf542734f28e43","schema_version":"1.0","event_id":"sha256:5cdf95ecba94f09a0450082b8e4300ff7b8f81968b0dde3a64cf542734f28e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/bundle.json","state_url":"https://pith.science/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/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-06-09T12:03:56Z","links":{"resolver":"https://pith.science/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD","bundle":"https://pith.science/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/bundle.json","state":"https://pith.science/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZY6BYSO2POMAWJ4PPVXTKSNIQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZY6BYSO2POMAWJ4PPVXTKSNIQD","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":"13a4a1ce26a3a50efb4b684e0e2d6ed9c6b4d8f95b4483e1287920d5d6c21381","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T15:13:45Z","title_canon_sha256":"ab3170246f8b4db3d447cd2c935f79f369edce691688164f99098d2e4bf47b13"},"schema_version":"1.0","source":{"id":"1404.7758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7758","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7758v1","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7758","created_at":"2026-05-18T02:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZY6BYSO2POMA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZY6BYSO2POMAWJ4P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZY6BYSO2","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:5cdf95ecba94f09a0450082b8e4300ff7b8f81968b0dde3a64cf542734f28e43","target":"graph","created_at":"2026-05-18T02:52:50Z","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 hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified by the four problems MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set that are all FPT parameterized by treewidth but none of which can be FPT parameterized by clique-width unless FPT = W[1], as shown by Fomin et al [7, 8]. We therefore seek a structural graph parameter that shares some of the generality of clique-width without paying this price. Based on splits,","authors_text":"Jan Arne Telle, Sigve Hortemo S{\\ae}ther","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T15:13:45Z","title":"Between Treewidth and Clique-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7758","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:727c4ad123e027051818a93b6e210bf0becc3a66e70419feb9a19c2a838babe7","target":"record","created_at":"2026-05-18T02:52:50Z","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":"13a4a1ce26a3a50efb4b684e0e2d6ed9c6b4d8f95b4483e1287920d5d6c21381","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T15:13:45Z","title_canon_sha256":"ab3170246f8b4db3d447cd2c935f79f369edce691688164f99098d2e4bf47b13"},"schema_version":"1.0","source":{"id":"1404.7758","kind":"arxiv","version":1}},"canonical_sha256":"ce3c1c49da7b980b278f7d6f3549a880c4b7cfa8f5554c82d23f5bc13f9189f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce3c1c49da7b980b278f7d6f3549a880c4b7cfa8f5554c82d23f5bc13f9189f6","first_computed_at":"2026-05-18T02:52:50.033663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:50.033663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MOYkBL1ThWjVkaACeBRD1uWebiNMPYBtFqwi6CfloUQyK3kPwKBr6eOKJ45MlFBPwO/5uw1V2+ZRuD86rUL2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:50.034026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:727c4ad123e027051818a93b6e210bf0becc3a66e70419feb9a19c2a838babe7","sha256:5cdf95ecba94f09a0450082b8e4300ff7b8f81968b0dde3a64cf542734f28e43"],"state_sha256":"8c74ff89626914fc6cc9360073a7dbbc117f80fca5ad29405fcb9bc1641e950e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEpCIXccNp8TI0hY3nPjs5/5Lh8uiUWnkIwIgL/z6rs6dh56KqQHwNxTbNbMn7Fh+dBD6tPpEyBaK5bRSOn6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:03:56.319801Z","bundle_sha256":"ea145fb3943e25c57257ecd4fe9cf9453a363848376eb0cf055c15ccce17e368"}}