{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MO24ZETLLXWPOCL2IAYXWHEGF5","short_pith_number":"pith:MO24ZETL","schema_version":"1.0","canonical_sha256":"63b5cc926b5decf7097a40317b1c862f43f523dbc6a2ccd2c7945609237fc274","source":{"kind":"arxiv","id":"1608.01820","version":2},"attestation_state":"computed","paper":{"title":"Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca, Suhail Mahfud","submitted_at":"2016-08-05T09:59:24Z","abstract_excerpt":"If a graph has no induced subgraph isomorphic to $H_1$ or $H_2$ then it is said to be ($H_1,H_2$)-free. Dabrowski and Paulusma found 13 open cases for the question whether the clique-width of ($H_1,H_2$)-free graphs is bounded. One of them is the class of ($S_{1,2,2}$,triangle)-free graphs. In this paper we show that these graphs have bounded clique-width. Thus, also ($P_1+2P_2$,triangle)-free graphs have bounded clique-width which solves another open problem of Dabrowski and Paulusma. Meanwhile we were informed by Paulusma that in December 2015, Dabrowski, Dross and Paulusma showed that ($S_{"},"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":"1608.01820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T09:59:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2916cd7995c1579e5cb09d73c743c25466b14568d90e9734996b3d1ff98ae8e7","abstract_canon_sha256":"0dad8e60a42ceaf65ece082e20c389161f73ebd76d5b1aa0b70dbf0600dc752e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.077791Z","signature_b64":"686M2G9JgMEy/Q4DHXCgIwdC1u9BcNdigJodSebSCxNTnQu5BvdhakR52Ic2C863VYCP/fWVJ3A++T32I/QuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63b5cc926b5decf7097a40317b1c862f43f523dbc6a2ccd2c7945609237fc274","last_reissued_at":"2026-05-18T01:09:06.077205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.077205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca, Suhail Mahfud","submitted_at":"2016-08-05T09:59:24Z","abstract_excerpt":"If a graph has no induced subgraph isomorphic to $H_1$ or $H_2$ then it is said to be ($H_1,H_2$)-free. Dabrowski and Paulusma found 13 open cases for the question whether the clique-width of ($H_1,H_2$)-free graphs is bounded. One of them is the class of ($S_{1,2,2}$,triangle)-free graphs. In this paper we show that these graphs have bounded clique-width. Thus, also ($P_1+2P_2$,triangle)-free graphs have bounded clique-width which solves another open problem of Dabrowski and Paulusma. Meanwhile we were informed by Paulusma that in December 2015, Dabrowski, Dross and Paulusma showed that ($S_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01820","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":"1608.01820","created_at":"2026-05-18T01:09:06.077288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01820v2","created_at":"2026-05-18T01:09:06.077288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01820","created_at":"2026-05-18T01:09:06.077288+00:00"},{"alias_kind":"pith_short_12","alias_value":"MO24ZETLLXWP","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MO24ZETLLXWPOCL2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MO24ZETL","created_at":"2026-05-18T12:30:32.724797+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/MO24ZETLLXWPOCL2IAYXWHEGF5","json":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5.json","graph_json":"https://pith.science/api/pith-number/MO24ZETLLXWPOCL2IAYXWHEGF5/graph.json","events_json":"https://pith.science/api/pith-number/MO24ZETLLXWPOCL2IAYXWHEGF5/events.json","paper":"https://pith.science/paper/MO24ZETL"},"agent_actions":{"view_html":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5","download_json":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5.json","view_paper":"https://pith.science/paper/MO24ZETL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01820&json=true","fetch_graph":"https://pith.science/api/pith-number/MO24ZETLLXWPOCL2IAYXWHEGF5/graph.json","fetch_events":"https://pith.science/api/pith-number/MO24ZETLLXWPOCL2IAYXWHEGF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5/action/storage_attestation","attest_author":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5/action/author_attestation","sign_citation":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5/action/citation_signature","submit_replication":"https://pith.science/pith/MO24ZETLLXWPOCL2IAYXWHEGF5/action/replication_record"}},"created_at":"2026-05-18T01:09:06.077288+00:00","updated_at":"2026-05-18T01:09:06.077288+00:00"}