{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XDCPXNTRTQ3W3HUVHQC2FE33FR","short_pith_number":"pith:XDCPXNTR","schema_version":"1.0","canonical_sha256":"b8c4fbb6719c376d9e953c05a2937b2c59df03a4ed2fa7802ac0d1a6e7e6da2a","source":{"kind":"arxiv","id":"1408.5920","version":1},"attestation_state":"computed","paper":{"title":"Planar Octilinear Drawings with One Bend Per Edge","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Robert Krug","submitted_at":"2014-08-25T20:26:34Z","abstract_excerpt":"In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A $k$-planar graph is a planar graph in which each vertex has degree less or equal to $k$. In particular, we prove that every 4-planar graph admits a planar octilinear drawing with at most one bend per edge on an integer grid of size $O(n^2) \\times O(n)$. For 5-planar graphs, we prove that one bend per edge still suffices in order to construct pl"},"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":"1408.5920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2014-08-25T20:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"21fd270eefbbc36c545a2e401e0c0bd64d2271f631632e5c65f207eb44faf954","abstract_canon_sha256":"2ac09d3728f4823f1ec7ee3176e5516f420e1ca8150bdba9229f049b21ff79b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.866228Z","signature_b64":"tsAcHzmbCGLwNVC9MivOhQy9Wv4ioEBpzizhRv30z8ZgC/uwDJguYUyaSMXu4/3oSw+eW7axNO6jkBsaEOrgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c4fbb6719c376d9e953c05a2937b2c59df03a4ed2fa7802ac0d1a6e7e6da2a","last_reissued_at":"2026-05-18T02:44:15.865630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.865630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Octilinear Drawings with One Bend Per Edge","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Robert Krug","submitted_at":"2014-08-25T20:26:34Z","abstract_excerpt":"In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A $k$-planar graph is a planar graph in which each vertex has degree less or equal to $k$. In particular, we prove that every 4-planar graph admits a planar octilinear drawing with at most one bend per edge on an integer grid of size $O(n^2) \\times O(n)$. For 5-planar graphs, we prove that one bend per edge still suffices in order to construct pl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5920","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":"1408.5920","created_at":"2026-05-18T02:44:15.865721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5920v1","created_at":"2026-05-18T02:44:15.865721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5920","created_at":"2026-05-18T02:44:15.865721+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDCPXNTRTQ3W","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDCPXNTRTQ3W3HUV","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDCPXNTR","created_at":"2026-05-18T12:28:57.508820+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/XDCPXNTRTQ3W3HUVHQC2FE33FR","json":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR.json","graph_json":"https://pith.science/api/pith-number/XDCPXNTRTQ3W3HUVHQC2FE33FR/graph.json","events_json":"https://pith.science/api/pith-number/XDCPXNTRTQ3W3HUVHQC2FE33FR/events.json","paper":"https://pith.science/paper/XDCPXNTR"},"agent_actions":{"view_html":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR","download_json":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR.json","view_paper":"https://pith.science/paper/XDCPXNTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5920&json=true","fetch_graph":"https://pith.science/api/pith-number/XDCPXNTRTQ3W3HUVHQC2FE33FR/graph.json","fetch_events":"https://pith.science/api/pith-number/XDCPXNTRTQ3W3HUVHQC2FE33FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR/action/storage_attestation","attest_author":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR/action/author_attestation","sign_citation":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR/action/citation_signature","submit_replication":"https://pith.science/pith/XDCPXNTRTQ3W3HUVHQC2FE33FR/action/replication_record"}},"created_at":"2026-05-18T02:44:15.865721+00:00","updated_at":"2026-05-18T02:44:15.865721+00:00"}