{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:66YK3MBK2GICFXDZNM62I2HKTW","short_pith_number":"pith:66YK3MBK","schema_version":"1.0","canonical_sha256":"f7b0adb02ad19022dc796b3da468ea9da14b025602b68177fe47c55f37716853","source":{"kind":"arxiv","id":"1405.7092","version":4},"attestation_state":"computed","paper":{"title":"Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs","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","submitted_at":"2014-05-28T00:11:26Z","abstract_excerpt":"If a graph has no induced subgraph isomorphic to any graph in a finite family $\\{H_1,\\ldots,H_p\\}$, it is said to be $(H_1,\\ldots,H_p)$-free. The class of $H$-free graphs has bounded clique-width if and only if $H$ is an induced subgraph of the 4-vertex path $P_4$. We study the (un)boundedness of the clique-width of graph classes defined by two forbidden induced subgraphs $H_1$ and $H_2$. Prior to our study it was not known whether the number of open cases was finite. We provide a positive answer to this question. To reduce the number of open cases we determine new graph classes of bounded cli"},"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":"1405.7092","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-28T00:11:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c26f833cad340bdc6cf6396777e9a49c5ede80efab706e795c5edbd28a9ea82b","abstract_canon_sha256":"42b19c87a3da9c1adda1fe505b33f14c7b70f444602c5c27d20de5202dd0cc3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:32.125827Z","signature_b64":"elhYVJeVIOMcIaOQO7PaRqTOu6Rt09Ma+p+rOabJz9OTdFkiuCLOJLbZ/2AsHXVtjafLFFb63kjagG+FbXguDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b0adb02ad19022dc796b3da468ea9da14b025602b68177fe47c55f37716853","last_reissued_at":"2026-05-18T02:29:32.125420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:32.125420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs","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","submitted_at":"2014-05-28T00:11:26Z","abstract_excerpt":"If a graph has no induced subgraph isomorphic to any graph in a finite family $\\{H_1,\\ldots,H_p\\}$, it is said to be $(H_1,\\ldots,H_p)$-free. The class of $H$-free graphs has bounded clique-width if and only if $H$ is an induced subgraph of the 4-vertex path $P_4$. We study the (un)boundedness of the clique-width of graph classes defined by two forbidden induced subgraphs $H_1$ and $H_2$. Prior to our study it was not known whether the number of open cases was finite. We provide a positive answer to this question. To reduce the number of open cases we determine new graph classes of bounded cli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7092","kind":"arxiv","version":4},"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":"1405.7092","created_at":"2026-05-18T02:29:32.125489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7092v4","created_at":"2026-05-18T02:29:32.125489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7092","created_at":"2026-05-18T02:29:32.125489+00:00"},{"alias_kind":"pith_short_12","alias_value":"66YK3MBK2GIC","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"66YK3MBK2GICFXDZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"66YK3MBK","created_at":"2026-05-18T12:28:16.859392+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/66YK3MBK2GICFXDZNM62I2HKTW","json":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW.json","graph_json":"https://pith.science/api/pith-number/66YK3MBK2GICFXDZNM62I2HKTW/graph.json","events_json":"https://pith.science/api/pith-number/66YK3MBK2GICFXDZNM62I2HKTW/events.json","paper":"https://pith.science/paper/66YK3MBK"},"agent_actions":{"view_html":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW","download_json":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW.json","view_paper":"https://pith.science/paper/66YK3MBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7092&json=true","fetch_graph":"https://pith.science/api/pith-number/66YK3MBK2GICFXDZNM62I2HKTW/graph.json","fetch_events":"https://pith.science/api/pith-number/66YK3MBK2GICFXDZNM62I2HKTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW/action/storage_attestation","attest_author":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW/action/author_attestation","sign_citation":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW/action/citation_signature","submit_replication":"https://pith.science/pith/66YK3MBK2GICFXDZNM62I2HKTW/action/replication_record"}},"created_at":"2026-05-18T02:29:32.125489+00:00","updated_at":"2026-05-18T02:29:32.125489+00:00"}