{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NMNKTA5CSXYIXQBAZZDWEYX3PV","short_pith_number":"pith:NMNKTA5C","schema_version":"1.0","canonical_sha256":"6b1aa983a295f08bc020ce476262fb7d67f54b207c60ef9bb33f2f9090ac66e6","source":{"kind":"arxiv","id":"1502.06948","version":2},"attestation_state":"computed","paper":{"title":"Bounding the Clique-Width of $H$-free Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Dani\\\"el Paulusma, Konrad K. Dabrowski, Shenwei Huang","submitted_at":"2015-02-24T20:42:49Z","abstract_excerpt":"A graph is $H$-free if it has no induced subgraph isomorphic to $H$. Brandst\\\"adt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandst\\\"adt, Le and Mosca erroneously claimed that the gem and the co-gem are the only two 1-vertex $P_4$-extensions $H$ for which the class of $H$-free chordal graphs has bounded clique-width. In fact we prove that bull-free chordal and co-chair-free chordal graphs have clique-width at most 3 and 4, respectively. In particular, we find four new classes of $H$-free chordal graphs of bo"},"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":"1502.06948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-24T20:42:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a65326470fde1c0ebbb2959ee791d58fc9d783923a2d2e365f81be2a21e38eb0","abstract_canon_sha256":"c4c0093a6ba9e5cf6d4dd9634eaec9f4e9cac96c30b1e1056a7c851bf3ccff15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:00.850554Z","signature_b64":"zQSKUX1+Qp1LD057GsthTdLgbunxVERx17PJgNXuOijTrj0NQKSnsSlUkxhGklZzTyd+3JNaXPpuIJ9SdoG6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b1aa983a295f08bc020ce476262fb7d67f54b207c60ef9bb33f2f9090ac66e6","last_reissued_at":"2026-05-18T01:32:00.849971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:00.849971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the Clique-Width of $H$-free Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Dani\\\"el Paulusma, Konrad K. Dabrowski, Shenwei Huang","submitted_at":"2015-02-24T20:42:49Z","abstract_excerpt":"A graph is $H$-free if it has no induced subgraph isomorphic to $H$. Brandst\\\"adt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandst\\\"adt, Le and Mosca erroneously claimed that the gem and the co-gem are the only two 1-vertex $P_4$-extensions $H$ for which the class of $H$-free chordal graphs has bounded clique-width. In fact we prove that bull-free chordal and co-chair-free chordal graphs have clique-width at most 3 and 4, respectively. In particular, we find four new classes of $H$-free chordal graphs of bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06948","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":"1502.06948","created_at":"2026-05-18T01:32:00.850073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06948v2","created_at":"2026-05-18T01:32:00.850073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06948","created_at":"2026-05-18T01:32:00.850073+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMNKTA5CSXYI","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMNKTA5CSXYIXQBA","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMNKTA5C","created_at":"2026-05-18T12:29:32.376354+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/NMNKTA5CSXYIXQBAZZDWEYX3PV","json":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV.json","graph_json":"https://pith.science/api/pith-number/NMNKTA5CSXYIXQBAZZDWEYX3PV/graph.json","events_json":"https://pith.science/api/pith-number/NMNKTA5CSXYIXQBAZZDWEYX3PV/events.json","paper":"https://pith.science/paper/NMNKTA5C"},"agent_actions":{"view_html":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV","download_json":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV.json","view_paper":"https://pith.science/paper/NMNKTA5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06948&json=true","fetch_graph":"https://pith.science/api/pith-number/NMNKTA5CSXYIXQBAZZDWEYX3PV/graph.json","fetch_events":"https://pith.science/api/pith-number/NMNKTA5CSXYIXQBAZZDWEYX3PV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV/action/storage_attestation","attest_author":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV/action/author_attestation","sign_citation":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV/action/citation_signature","submit_replication":"https://pith.science/pith/NMNKTA5CSXYIXQBAZZDWEYX3PV/action/replication_record"}},"created_at":"2026-05-18T01:32:00.850073+00:00","updated_at":"2026-05-18T01:32:00.850073+00:00"}