{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YMJQ2DWW4H56HHSXYV7LWDIDOL","short_pith_number":"pith:YMJQ2DWW","schema_version":"1.0","canonical_sha256":"c3130d0ed6e1fbe39e57c57ebb0d0372d68ba106903305f9919d19d273c0ab55","source":{"kind":"arxiv","id":"2307.04628","version":1},"attestation_state":"computed","paper":{"title":"Tight Algorithmic Applications of Clique-Width Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Stefan Kratsch, Vera Chekan","submitted_at":"2023-07-10T15:14:13Z","abstract_excerpt":"In this work, we study two natural generalizations of clique-width introduced by Martin F\\\"urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while for fusion-width (fw) we have a possibility to merge all vertices of a certain label [LATIN 2014]. F\\\"urer has shown that both parameters are upper-bounded by treewidth thus making them more appealing from an algorithmic perspective than clique-width and asked for applications of these parameters for problem solving. First, we determine the relation between these two parameters by showing that $\\operatorname{mcw"},"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":"2307.04628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-10T15:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"5efa884c6f7da1e9a3b94f2dc5df0330f36d4c0594e19de3764558718ccb1ea7","abstract_canon_sha256":"7c5386cc8c05215809cd8b9f2ebd04b0e0ba1639eb1970f639aad84ff53639fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:15.621755Z","signature_b64":"ipZ7r+S0DTSbKays2HG1RDxFFFsZRqnpRu/DjVd4iar/0zU8FGHvjw0Kxd4FogikrppcBW/xrrJbWD8Chq6GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3130d0ed6e1fbe39e57c57ebb0d0372d68ba106903305f9919d19d273c0ab55","last_reissued_at":"2026-07-05T06:29:15.621281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:15.621281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Algorithmic Applications of Clique-Width Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Stefan Kratsch, Vera Chekan","submitted_at":"2023-07-10T15:14:13Z","abstract_excerpt":"In this work, we study two natural generalizations of clique-width introduced by Martin F\\\"urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while for fusion-width (fw) we have a possibility to merge all vertices of a certain label [LATIN 2014]. F\\\"urer has shown that both parameters are upper-bounded by treewidth thus making them more appealing from an algorithmic perspective than clique-width and asked for applications of these parameters for problem solving. First, we determine the relation between these two parameters by showing that $\\operatorname{mcw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04628","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.04628/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.04628","created_at":"2026-07-05T06:29:15.621342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04628v1","created_at":"2026-07-05T06:29:15.621342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04628","created_at":"2026-07-05T06:29:15.621342+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMJQ2DWW4H56","created_at":"2026-07-05T06:29:15.621342+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMJQ2DWW4H56HHSX","created_at":"2026-07-05T06:29:15.621342+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMJQ2DWW","created_at":"2026-07-05T06:29:15.621342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25841","citing_title":"Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL","json":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL.json","graph_json":"https://pith.science/api/pith-number/YMJQ2DWW4H56HHSXYV7LWDIDOL/graph.json","events_json":"https://pith.science/api/pith-number/YMJQ2DWW4H56HHSXYV7LWDIDOL/events.json","paper":"https://pith.science/paper/YMJQ2DWW"},"agent_actions":{"view_html":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL","download_json":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL.json","view_paper":"https://pith.science/paper/YMJQ2DWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04628&json=true","fetch_graph":"https://pith.science/api/pith-number/YMJQ2DWW4H56HHSXYV7LWDIDOL/graph.json","fetch_events":"https://pith.science/api/pith-number/YMJQ2DWW4H56HHSXYV7LWDIDOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL/action/storage_attestation","attest_author":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL/action/author_attestation","sign_citation":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL/action/citation_signature","submit_replication":"https://pith.science/pith/YMJQ2DWW4H56HHSXYV7LWDIDOL/action/replication_record"}},"created_at":"2026-07-05T06:29:15.621342+00:00","updated_at":"2026-07-05T06:29:15.621342+00:00"}