{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CPV756PGVPLXKRXW46BSGC7ZVN","short_pith_number":"pith:CPV756PG","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"},"canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","source":{"kind":"arxiv","id":"1502.06175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06175","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06175v1","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06175","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"CPV756PGVPLX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPV756PGVPLXKRXW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPV756PG","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CPV756PGVPLXKRXW46BSGC7ZVN","target":"record","payload":{"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"},"canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","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"},"source_kind":"arxiv","source_id":"1502.06175","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVmk5bVGNnTZR2n0uBHYtEc7xQcyLGA7luO7rw+XgMha8OhtGa+2h/9Y0YxXvTM7RojAxhw06dSh1E0M2nWuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:30:16.756746Z"},"content_sha256":"8a38ab462984f92655c5803257c3c0a096c4bef0ad651bcfe687fa0108ab319b","schema_version":"1.0","event_id":"sha256:8a38ab462984f92655c5803257c3c0a096c4bef0ad651bcfe687fa0108ab319b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CPV756PGVPLXKRXW46BSGC7ZVN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUOTrLZdNgBVpmGhRLOTyoYt22JUrMx55CsZ9ai8lc4Cm/EI3dPHSqH41DSR5i5AOukeY2w+KFF+SdHiWV+0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:30:16.757297Z"},"content_sha256":"a7cdf367acf2c67bf41988cd25235c86300e935f7a338c311c7cbedbb589e28d","schema_version":"1.0","event_id":"sha256:a7cdf367acf2c67bf41988cd25235c86300e935f7a338c311c7cbedbb589e28d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/bundle.json","state_url":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPV756PGVPLXKRXW46BSGC7ZVN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T14:30:16Z","links":{"resolver":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN","bundle":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/bundle.json","state":"https://pith.science/pith/CPV756PGVPLXKRXW46BSGC7ZVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPV756PGVPLXKRXW46BSGC7ZVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CPV756PGVPLXKRXW46BSGC7ZVN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e3ade7caa8362aefb4f4502af5ac816370ddf0c591a1912d03165e3475529561","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-22T04:03:14Z","title_canon_sha256":"78668221b5932c3e42d799ce6ab243c3297909783edd64141799c25d093bb9c0"},"schema_version":"1.0","source":{"id":"1502.06175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06175","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06175v1","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06175","created_at":"2026-05-18T02:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"CPV756PGVPLX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPV756PGVPLXKRXW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPV756PG","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:a7cdf367acf2c67bf41988cd25235c86300e935f7a338c311c7cbedbb589e28d","target":"graph","created_at":"2026-05-18T02:18:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Farhad Shahrokhi","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-22T04:03:14Z","title":"New representation results for planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06175","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a38ab462984f92655c5803257c3c0a096c4bef0ad651bcfe687fa0108ab319b","target":"record","created_at":"2026-05-18T02:18:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e3ade7caa8362aefb4f4502af5ac816370ddf0c591a1912d03165e3475529561","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-22T04:03:14Z","title_canon_sha256":"78668221b5932c3e42d799ce6ab243c3297909783edd64141799c25d093bb9c0"},"schema_version":"1.0","source":{"id":"1502.06175","kind":"arxiv","version":1}},"canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ebfef9e6abd77546f6e783230bf9ab7899fa93f6da0a1270a97d914cf56800","first_computed_at":"2026-05-18T02:18:31.140331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:31.140331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0QojVT0iwMbBgN/AZiwYC9O62tv4OtIgADKmsAiVlH1zxpbLq1Wl1MVdmKhgzuDchyFm9vZr0y/g1oP8Fu2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:31.140975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a38ab462984f92655c5803257c3c0a096c4bef0ad651bcfe687fa0108ab319b","sha256:a7cdf367acf2c67bf41988cd25235c86300e935f7a338c311c7cbedbb589e28d"],"state_sha256":"4acac5406babe452e8b0256b2968e2c8281b92340c5ae198ed47537ee48011d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C63VFE6D+5lnEpoNariwQodrqw/NZ2URoAeLXFpJtAC2l2HqLZBcmhe5cLMys+EMBn5BDhmqhXB/nvVE/37JDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T14:30:16.765469Z","bundle_sha256":"51c6fd1f3576bde01535406b98338b08a85d16e6b16f5cc97445e05cd4dd8f3c"}}