{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EDAKREQ6NUYIVO4H7UNNICJW4O","short_pith_number":"pith:EDAKREQ6","schema_version":"1.0","canonical_sha256":"20c0a8921e6d308abb87fd1ad40936e3b5ab9dd33f6f66c456c4eba98394c934","source":{"kind":"arxiv","id":"1511.04479","version":1},"attestation_state":"computed","paper":{"title":"Multi-Clique-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Martin F\\\"urer","submitted_at":"2015-11-13T23:25:44Z","abstract_excerpt":"Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width. Efficient algorithms based on multi-clique-width are still possible for interesting tasks like computing the independent set polynomial or testing $c$-colorability. In particular, $c$-colorability can be tested in time linear in $n$ and singly exponential in $c$ and the width $k$ of a given multi-$k$-expression. For these tasks, the running time as a function"},"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":"1511.04479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-13T23:25:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"93ba38c1de87e67d12f06087137bafb640458f83e635d9d5ba58c1e300303a72","abstract_canon_sha256":"84fbd07c2641ad9893d5178ef8c0c322d1a66cc70da65ef7c1acdc340340705a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:52.549107Z","signature_b64":"d0HRCoFa2L1u0SFjcBF4+j3y/gbuIzMgq0B16Vux3b8N3Zi2kz43ncwic4fpMfI8wJrdSc2Dqk5XHyGcGL2FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c0a8921e6d308abb87fd1ad40936e3b5ab9dd33f6f66c456c4eba98394c934","last_reissued_at":"2026-05-18T01:26:52.548492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:52.548492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Clique-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Martin F\\\"urer","submitted_at":"2015-11-13T23:25:44Z","abstract_excerpt":"Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width. Efficient algorithms based on multi-clique-width are still possible for interesting tasks like computing the independent set polynomial or testing $c$-colorability. In particular, $c$-colorability can be tested in time linear in $n$ and singly exponential in $c$ and the width $k$ of a given multi-$k$-expression. For these tasks, the running time as a function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04479","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":""},"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":"1511.04479","created_at":"2026-05-18T01:26:52.548603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04479v1","created_at":"2026-05-18T01:26:52.548603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04479","created_at":"2026-05-18T01:26:52.548603+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDAKREQ6NUYI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDAKREQ6NUYIVO4H","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDAKREQ6","created_at":"2026-05-18T12:29:19.899920+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/EDAKREQ6NUYIVO4H7UNNICJW4O","json":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O.json","graph_json":"https://pith.science/api/pith-number/EDAKREQ6NUYIVO4H7UNNICJW4O/graph.json","events_json":"https://pith.science/api/pith-number/EDAKREQ6NUYIVO4H7UNNICJW4O/events.json","paper":"https://pith.science/paper/EDAKREQ6"},"agent_actions":{"view_html":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O","download_json":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O.json","view_paper":"https://pith.science/paper/EDAKREQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04479&json=true","fetch_graph":"https://pith.science/api/pith-number/EDAKREQ6NUYIVO4H7UNNICJW4O/graph.json","fetch_events":"https://pith.science/api/pith-number/EDAKREQ6NUYIVO4H7UNNICJW4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O/action/storage_attestation","attest_author":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O/action/author_attestation","sign_citation":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O/action/citation_signature","submit_replication":"https://pith.science/pith/EDAKREQ6NUYIVO4H7UNNICJW4O/action/replication_record"}},"created_at":"2026-05-18T01:26:52.548603+00:00","updated_at":"2026-05-18T01:26:52.548603+00:00"}