{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:WKTNIBDPPSIKLJBNEXIXDU5RIU","short_pith_number":"pith:WKTNIBDP","schema_version":"1.0","canonical_sha256":"b2a6d4046f7c90a5a42d25d171d3b1453e1a7fadb59482ef6a666ef2f526681d","source":{"kind":"arxiv","id":"0709.1433","version":5},"attestation_state":"computed","paper":{"title":"The Rank-Width of Edge-Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mamadou Moustapha Kante, Michael Rao","submitted_at":"2007-09-10T16:17:20Z","abstract_excerpt":"Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss an extension of the notion of rank-width to edge-colored graphs. A C-colored graph is a graph where the arcs are colored with colors from the set C. There is not a natural notion of rank-width for C-colored graphs. We define two notions of rank-width for them, both based on a coding of C-colored graphs by edge-colored graphs wher"},"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":"0709.1433","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2007-09-10T16:17:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6e2a44bc8a637fb45023720da4dcdd366ce73eb8d1af0dcbbc6cd5daae10872f","abstract_canon_sha256":"7df46a16c307dc764f36f3bf321b27d9f37c4913e0c89c631cd9750ff255529b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.306459Z","signature_b64":"xPCXKOozJM6B8+dQG75szzs+tfDKzZzBrI34ZiDPy6AJlmsR5razUY8VwXNeSGaF4vHdjRE/YVcqYNiSeF/lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a6d4046f7c90a5a42d25d171d3b1453e1a7fadb59482ef6a666ef2f526681d","last_reissued_at":"2026-05-18T02:48:10.305803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.305803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rank-Width of Edge-Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mamadou Moustapha Kante, Michael Rao","submitted_at":"2007-09-10T16:17:20Z","abstract_excerpt":"Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss an extension of the notion of rank-width to edge-colored graphs. A C-colored graph is a graph where the arcs are colored with colors from the set C. There is not a natural notion of rank-width for C-colored graphs. We define two notions of rank-width for them, both based on a coding of C-colored graphs by edge-colored graphs wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.1433","kind":"arxiv","version":5},"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":"0709.1433","created_at":"2026-05-18T02:48:10.305895+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.1433v5","created_at":"2026-05-18T02:48:10.305895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.1433","created_at":"2026-05-18T02:48:10.305895+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKTNIBDPPSIK","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKTNIBDPPSIKLJBN","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKTNIBDP","created_at":"2026-05-18T12:25:56.245647+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/WKTNIBDPPSIKLJBNEXIXDU5RIU","json":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU.json","graph_json":"https://pith.science/api/pith-number/WKTNIBDPPSIKLJBNEXIXDU5RIU/graph.json","events_json":"https://pith.science/api/pith-number/WKTNIBDPPSIKLJBNEXIXDU5RIU/events.json","paper":"https://pith.science/paper/WKTNIBDP"},"agent_actions":{"view_html":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU","download_json":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU.json","view_paper":"https://pith.science/paper/WKTNIBDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.1433&json=true","fetch_graph":"https://pith.science/api/pith-number/WKTNIBDPPSIKLJBNEXIXDU5RIU/graph.json","fetch_events":"https://pith.science/api/pith-number/WKTNIBDPPSIKLJBNEXIXDU5RIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU/action/storage_attestation","attest_author":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU/action/author_attestation","sign_citation":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU/action/citation_signature","submit_replication":"https://pith.science/pith/WKTNIBDPPSIKLJBNEXIXDU5RIU/action/replication_record"}},"created_at":"2026-05-18T02:48:10.305895+00:00","updated_at":"2026-05-18T02:48:10.305895+00:00"}