{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CPV756PGVPLXKRXW46BSGC7ZVN","short_pith_number":"pith:CPV756PG","schema_version":"1.0","canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","source":{"kind":"arxiv","id":"1502.06175","version":1},"attestation_state":"computed","paper":{"title":"New representation results for planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Farhad Shahrokhi","submitted_at":"2015-02-22T04:03:14Z","abstract_excerpt":"A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover width which is a generalization of the bandwidth parameter. Specifically, we show that any planar graph is the intersection graph of one chordal graph, four co-bipartite graphs, and one unit interval graph. Equivalently, any planar graph is the intersection graph of a chordal graph and a graph that has {clique cover width} of at most seven. We further describe "},"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":"1502.06175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-22T04:03:14Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"78668221b5932c3e42d799ce6ab243c3297909783edd64141799c25d093bb9c0","abstract_canon_sha256":"e3ade7caa8362aefb4f4502af5ac816370ddf0c591a1912d03165e3475529561"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:31.140975Z","signature_b64":"p0QojVT0iwMbBgN/AZiwYC9O62tv4OtIgADKmsAiVlH1zxpbLq1Wl1MVdmKhgzuDchyFm9vZr0y/g1oP8Fu2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","last_reissued_at":"2026-05-18T02:18:31.140331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:31.140331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New representation results for planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Farhad Shahrokhi","submitted_at":"2015-02-22T04:03:14Z","abstract_excerpt":"A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover width which is a generalization of the bandwidth parameter. Specifically, we show that any planar graph is the intersection graph of one chordal graph, four co-bipartite graphs, and one unit interval graph. Equivalently, any planar graph is the intersection graph of a chordal graph and a graph that has {clique cover width} of at most seven. We further describe "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06175","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":"1502.06175","created_at":"2026-05-18T02:18:31.140420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06175v1","created_at":"2026-05-18T02:18:31.140420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06175","created_at":"2026-05-18T02:18:31.140420+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPV756PGVPLX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPV756PGVPLXKRXW","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPV756PG","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01927","citing_title":"Short Paths in the Planar Graph Product Structure Theorem","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN","json":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN.json","graph_json":"https://pith.science/api/pith-number/CPV756PGVPLXKRXW46BSGC7ZVN/graph.json","events_json":"https://pith.science/api/pith-number/CPV756PGVPLXKRXW46BSGC7ZVN/events.json","paper":"https://pith.science/paper/CPV756PG"},"agent_actions":{"view_html":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN","download_json":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN.json","view_paper":"https://pith.science/paper/CPV756PG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06175&json=true","fetch_graph":"https://pith.science/api/pith-number/CPV756PGVPLXKRXW46BSGC7ZVN/graph.json","fetch_events":"https://pith.science/api/pith-number/CPV756PGVPLXKRXW46BSGC7ZVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/action/storage_attestation","attest_author":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/action/author_attestation","sign_citation":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/action/citation_signature","submit_replication":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/action/replication_record"}},"created_at":"2026-05-18T02:18:31.140420+00:00","updated_at":"2026-05-18T02:18:31.140420+00:00"}