{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JPCPRHFBLKGZITDCAJCAVKTNYB","short_pith_number":"pith:JPCPRHFB","schema_version":"1.0","canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","source":{"kind":"arxiv","id":"1406.3860","version":1},"attestation_state":"computed","paper":{"title":"The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Taylor Gordon","submitted_at":"2014-06-15T21:16:45Z","abstract_excerpt":"We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of $O(n^2)$ times. Our results show that this number of bends is optimal. In particular, we show that $\\Omega(n^2)$ total bends is required to form a polyline drawing on any set of fixed vertex locations f"},"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":"1406.3860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T21:16:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e5e5bbd8d0f87fd56733d4f8875e6394158be2709451b6d2030933e554a839ee","abstract_canon_sha256":"b4644134995b10c3a6b9aecee492d37e351acaf3eddcb378db5636633e9b6a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.600048Z","signature_b64":"4Nr5U6465AMuy8RLs6/CMQWtcQKEx9euKn+ox3W8IVDhfuTtxs7Z5HO7sXSo7kFxa+SRfDJc7+J3bNGGPbDMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","last_reissued_at":"2026-05-18T02:49:39.599731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.599731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Taylor Gordon","submitted_at":"2014-06-15T21:16:45Z","abstract_excerpt":"We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of $O(n^2)$ times. Our results show that this number of bends is optimal. In particular, we show that $\\Omega(n^2)$ total bends is required to form a polyline drawing on any set of fixed vertex locations f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3860","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":"1406.3860","created_at":"2026-05-18T02:49:39.599783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3860v1","created_at":"2026-05-18T02:49:39.599783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3860","created_at":"2026-05-18T02:49:39.599783+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPCPRHFBLKGZ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPCPRHFBLKGZITDC","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPCPRHFB","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/JPCPRHFBLKGZITDCAJCAVKTNYB","json":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB.json","graph_json":"https://pith.science/api/pith-number/JPCPRHFBLKGZITDCAJCAVKTNYB/graph.json","events_json":"https://pith.science/api/pith-number/JPCPRHFBLKGZITDCAJCAVKTNYB/events.json","paper":"https://pith.science/paper/JPCPRHFB"},"agent_actions":{"view_html":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB","download_json":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB.json","view_paper":"https://pith.science/paper/JPCPRHFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3860&json=true","fetch_graph":"https://pith.science/api/pith-number/JPCPRHFBLKGZITDCAJCAVKTNYB/graph.json","fetch_events":"https://pith.science/api/pith-number/JPCPRHFBLKGZITDCAJCAVKTNYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/action/storage_attestation","attest_author":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/action/author_attestation","sign_citation":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/action/citation_signature","submit_replication":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/action/replication_record"}},"created_at":"2026-05-18T02:49:39.599783+00:00","updated_at":"2026-05-18T02:49:39.599783+00:00"}