{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XHK3OY5MDTHDPB2GIN4JK2QJGL","short_pith_number":"pith:XHK3OY5M","canonical_record":{"source":{"id":"1406.6298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-24T16:39:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d81854fa41070b02ac056a39d4c82993e2700b00a27c2d803c164ad3419ab59f","abstract_canon_sha256":"06ab93811e5c39b445000db4ec61fd5a57a15aa084a1633f43286a8203ae38ac"},"schema_version":"1.0"},"canonical_sha256":"b9d5b763ac1cce3787464378956a0932f4eae0a4371c995412cb0313289587eb","source":{"kind":"arxiv","id":"1406.6298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6298","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6298v2","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6298","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"XHK3OY5MDTHD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XHK3OY5MDTHDPB2G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XHK3OY5M","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XHK3OY5MDTHDPB2GIN4JK2QJGL","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-24T16:39:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d81854fa41070b02ac056a39d4c82993e2700b00a27c2d803c164ad3419ab59f","abstract_canon_sha256":"06ab93811e5c39b445000db4ec61fd5a57a15aa084a1633f43286a8203ae38ac"},"schema_version":"1.0"},"canonical_sha256":"b9d5b763ac1cce3787464378956a0932f4eae0a4371c995412cb0313289587eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:32.070226Z","signature_b64":"6ZMLzDGx2asSXmnq3PbPXqP3tJf2dke6WgGRrJb5VBKY+sOg6qf3IFmfU67hU8lxJ0oblsaHAFOZbXDzyJvcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d5b763ac1cce3787464378956a0932f4eae0a4371c995412cb0313289587eb","last_reissued_at":"2026-05-18T02:29:32.069730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:32.069730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6298","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:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/v1in9h60AgcvWypvmvWB7s9BStLpzSLh1Q+L/qdutYWn/jEQuYbeF8VyQ9QpU3YYC8iTSd17uoDilWNA8oSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:12:21.063971Z"},"content_sha256":"64fa065797fad676fde202f05724201ae87997468c474030dd05c98496a07ee5","schema_version":"1.0","event_id":"sha256:64fa065797fad676fde202f05724201ae87997468c474030dd05c98496a07ee5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XHK3OY5MDTHDPB2GIN4JK2QJGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Clique-Width via Perfect Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Shenwei Huang","submitted_at":"2014-06-24T16:39:56Z","abstract_excerpt":"Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of $(H_1,H_2)$-free graphs of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their two forbidden induced subgraphs is the diamond (the graph obtained from a clique on four vertices by deleting one edge). To prove boundedness of clique-width for the first three cases we develop a technique based on bounding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6298","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:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hQeIuWr5Da1P3hLlhU5W33fTwG97iUKXD6TFSdyfVOmno6Jo8scq5lIjv8E9MMlyRSvHpcs3plhBSvypxgkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:12:21.064328Z"},"content_sha256":"f28865361d9c5868fdc90b1a0543c411f383aa16b210f7592360597ee2967f71","schema_version":"1.0","event_id":"sha256:f28865361d9c5868fdc90b1a0543c411f383aa16b210f7592360597ee2967f71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/bundle.json","state_url":"https://pith.science/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/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-29T18:12:21Z","links":{"resolver":"https://pith.science/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL","bundle":"https://pith.science/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/bundle.json","state":"https://pith.science/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHK3OY5MDTHDPB2GIN4JK2QJGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XHK3OY5MDTHDPB2GIN4JK2QJGL","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":"06ab93811e5c39b445000db4ec61fd5a57a15aa084a1633f43286a8203ae38ac","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-24T16:39:56Z","title_canon_sha256":"d81854fa41070b02ac056a39d4c82993e2700b00a27c2d803c164ad3419ab59f"},"schema_version":"1.0","source":{"id":"1406.6298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6298","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6298v2","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6298","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"XHK3OY5MDTHD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XHK3OY5MDTHDPB2G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XHK3OY5M","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:f28865361d9c5868fdc90b1a0543c411f383aa16b210f7592360597ee2967f71","target":"graph","created_at":"2026-05-18T02:29:32Z","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":"Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of $(H_1,H_2)$-free graphs of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their two forbidden induced subgraphs is the diamond (the graph obtained from a clique on four vertices by deleting one edge). To prove boundedness of clique-width for the first three cases we develop a technique based on bounding ","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Shenwei Huang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-24T16:39:56Z","title":"Bounding Clique-Width via Perfect Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6298","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:64fa065797fad676fde202f05724201ae87997468c474030dd05c98496a07ee5","target":"record","created_at":"2026-05-18T02:29:32Z","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":"06ab93811e5c39b445000db4ec61fd5a57a15aa084a1633f43286a8203ae38ac","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-24T16:39:56Z","title_canon_sha256":"d81854fa41070b02ac056a39d4c82993e2700b00a27c2d803c164ad3419ab59f"},"schema_version":"1.0","source":{"id":"1406.6298","kind":"arxiv","version":2}},"canonical_sha256":"b9d5b763ac1cce3787464378956a0932f4eae0a4371c995412cb0313289587eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9d5b763ac1cce3787464378956a0932f4eae0a4371c995412cb0313289587eb","first_computed_at":"2026-05-18T02:29:32.069730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:32.069730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ZMLzDGx2asSXmnq3PbPXqP3tJf2dke6WgGRrJb5VBKY+sOg6qf3IFmfU67hU8lxJ0oblsaHAFOZbXDzyJvcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:32.070226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64fa065797fad676fde202f05724201ae87997468c474030dd05c98496a07ee5","sha256:f28865361d9c5868fdc90b1a0543c411f383aa16b210f7592360597ee2967f71"],"state_sha256":"00d1442d163797a9613831798e985769f66d73e9af99abc47c6d2a4956e8e1bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cp+ZTxq/QRWaUVDwSgV005zhTJv+vI+EwABHdnBMU2xLfwefZGVFOpBY913BMlGAUZ4md3SPX5wDvB9K5BRuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:12:21.066247Z","bundle_sha256":"120efcf70989c7d2b49a8ce1a67fe901e1cd13cee52f96d997782de2e696c82c"}}