{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KYA3HT4DHHMJ6FBJIJVIN7ZDEE","short_pith_number":"pith:KYA3HT4D","schema_version":"1.0","canonical_sha256":"5601b3cf8339d89f1429426a86ff2321100eb0b76ca86446a185e8e82fc43ccc","source":{"kind":"arxiv","id":"1409.5816","version":1},"attestation_state":"computed","paper":{"title":"1-String CZ-Representation of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2014-09-19T21:01:03Z","abstract_excerpt":"In this paper, we prove that every planar 4-connected graph has a CZ-representation---a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$. The required size of the grid is $n \\times 2n$."},"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":"1409.5816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-19T21:01:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0ceaae1178fb357f58147698decd836ed6b6bcc2a5ad43a4fb965e407223d094","abstract_canon_sha256":"a38442d3416402d54b44e3ac5585cf2926f4ce2a9bfeb639f159dfd6f8d923ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:15.972617Z","signature_b64":"u9QypCkSIShhyyZdsb+a/r+VMul4+MV9zj9LR0dCn9S2SHyTzJtJWR/LYLsAQc/JP/CZ7PeUOLzxUI+ts0CfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5601b3cf8339d89f1429426a86ff2321100eb0b76ca86446a185e8e82fc43ccc","last_reissued_at":"2026-05-18T02:42:15.971718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:15.971718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-String CZ-Representation of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2014-09-19T21:01:03Z","abstract_excerpt":"In this paper, we prove that every planar 4-connected graph has a CZ-representation---a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$. The required size of the grid is $n \\times 2n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5816","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":"1409.5816","created_at":"2026-05-18T02:42:15.971890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5816v1","created_at":"2026-05-18T02:42:15.971890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5816","created_at":"2026-05-18T02:42:15.971890+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYA3HT4DHHMJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYA3HT4DHHMJ6FBJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYA3HT4D","created_at":"2026-05-18T12:28:35.611951+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/KYA3HT4DHHMJ6FBJIJVIN7ZDEE","json":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE.json","graph_json":"https://pith.science/api/pith-number/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/graph.json","events_json":"https://pith.science/api/pith-number/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/events.json","paper":"https://pith.science/paper/KYA3HT4D"},"agent_actions":{"view_html":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE","download_json":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE.json","view_paper":"https://pith.science/paper/KYA3HT4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5816&json=true","fetch_graph":"https://pith.science/api/pith-number/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/graph.json","fetch_events":"https://pith.science/api/pith-number/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/action/storage_attestation","attest_author":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/action/author_attestation","sign_citation":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/action/citation_signature","submit_replication":"https://pith.science/pith/KYA3HT4DHHMJ6FBJIJVIN7ZDEE/action/replication_record"}},"created_at":"2026-05-18T02:42:15.971890+00:00","updated_at":"2026-05-18T02:42:15.971890+00:00"}