{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H3M6U7KQVW5K6WX7RG6OU3Z5GT","short_pith_number":"pith:H3M6U7KQ","schema_version":"1.0","canonical_sha256":"3ed9ea7d50adbaaf5aff89bcea6f3d34dd43426233ba3298603d356847bf358b","source":{"kind":"arxiv","id":"1705.07681","version":2},"attestation_state":"computed","paper":{"title":"Clique-Width for Graph Classes Closed under Complementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Blanch\\'e, Dani\\\"el Paulusma, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Viktor Zamaraev","submitted_at":"2017-05-22T11:38:41Z","abstract_excerpt":"Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set ${\\cal H}$ of forbidden induced subgraphs. We initiate a systematic study into the boundedness of clique-width of hereditary graph classes closed under complementation. First, we extend the known classification for the $|{\\cal H}|=1$ case by classifying the boundedness of clique-width for every set ${\\cal H}$ of self-complementary graphs. We then completely settle the $|{\\cal H}|=2$ case. In particular, we determ"},"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":"1705.07681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:38:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b3d8bb57af0799d596838f601ede0e2aec0ac9c1382fe85c8b9382d1d505496","abstract_canon_sha256":"6a39a37c1135340f07d045e14482838643b6d7ea31674cf0e9c2be5b6b9ba278"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:45.878304Z","signature_b64":"9ArxQpx+zQpMbfzcaBZl3o+8DAPi+CrbibIf+Z+5aEE3fmL5Iy7bgJKHd5+vjf7QPY4tH3xFr3DXr9NWgkUbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed9ea7d50adbaaf5aff89bcea6f3d34dd43426233ba3298603d356847bf358b","last_reissued_at":"2026-05-18T00:42:45.877678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:45.877678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique-Width for Graph Classes Closed under Complementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Blanch\\'e, Dani\\\"el Paulusma, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Viktor Zamaraev","submitted_at":"2017-05-22T11:38:41Z","abstract_excerpt":"Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set ${\\cal H}$ of forbidden induced subgraphs. We initiate a systematic study into the boundedness of clique-width of hereditary graph classes closed under complementation. First, we extend the known classification for the $|{\\cal H}|=1$ case by classifying the boundedness of clique-width for every set ${\\cal H}$ of self-complementary graphs. We then completely settle the $|{\\cal H}|=2$ case. In particular, we determ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07681","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":"1705.07681","created_at":"2026-05-18T00:42:45.877775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07681v2","created_at":"2026-05-18T00:42:45.877775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07681","created_at":"2026-05-18T00:42:45.877775+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3M6U7KQVW5K","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3M6U7KQVW5K6WX7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3M6U7KQ","created_at":"2026-05-18T12:31:18.294218+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/H3M6U7KQVW5K6WX7RG6OU3Z5GT","json":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT.json","graph_json":"https://pith.science/api/pith-number/H3M6U7KQVW5K6WX7RG6OU3Z5GT/graph.json","events_json":"https://pith.science/api/pith-number/H3M6U7KQVW5K6WX7RG6OU3Z5GT/events.json","paper":"https://pith.science/paper/H3M6U7KQ"},"agent_actions":{"view_html":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT","download_json":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT.json","view_paper":"https://pith.science/paper/H3M6U7KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07681&json=true","fetch_graph":"https://pith.science/api/pith-number/H3M6U7KQVW5K6WX7RG6OU3Z5GT/graph.json","fetch_events":"https://pith.science/api/pith-number/H3M6U7KQVW5K6WX7RG6OU3Z5GT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT/action/storage_attestation","attest_author":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT/action/author_attestation","sign_citation":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT/action/citation_signature","submit_replication":"https://pith.science/pith/H3M6U7KQVW5K6WX7RG6OU3Z5GT/action/replication_record"}},"created_at":"2026-05-18T00:42:45.877775+00:00","updated_at":"2026-05-18T00:42:45.877775+00:00"}