{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JPCPRHFBLKGZITDCAJCAVKTNYB","short_pith_number":"pith:JPCPRHFB","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"},"canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","source":{"kind":"arxiv","id":"1406.3860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3860","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3860v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3860","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"JPCPRHFBLKGZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JPCPRHFBLKGZITDC","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JPCPRHFB","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JPCPRHFBLKGZITDCAJCAVKTNYB","target":"record","payload":{"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"},"canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","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"},"source_kind":"arxiv","source_id":"1406.3860","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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Makca8bjAkD97n/smDNPByHgKP1q/AtE+qBopQ+nM7MTe12dm5fyYitk0zREGCPL9pyIYGiu2iA4XkPdw1xjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:36.460244Z"},"content_sha256":"20da8465aee0ef5ea84a7a20dbca9bffbc8c4016dcf592f43cbbdbba3d69adad","schema_version":"1.0","event_id":"sha256:20da8465aee0ef5ea84a7a20dbca9bffbc8c4016dcf592f43cbbdbba3d69adad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JPCPRHFBLKGZITDCAJCAVKTNYB","target":"graph","payload":{"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"},"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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5IntqKMpgKZ8S7qg8QCWzYUxMq0siYux/Gd0JrVfYNf1rnspp0gJ8vabNQUwlJDfKXOfdui4pjRLvwYMg8uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:36.460959Z"},"content_sha256":"d39e3970b69e3817c25480e090213fb737fdb3ea6361f4bf8f57e9d1249468c0","schema_version":"1.0","event_id":"sha256:d39e3970b69e3817c25480e090213fb737fdb3ea6361f4bf8f57e9d1249468c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/bundle.json","state_url":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/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-05-28T18:28:36Z","links":{"resolver":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB","bundle":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/bundle.json","state":"https://pith.science/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPCPRHFBLKGZITDCAJCAVKTNYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JPCPRHFBLKGZITDCAJCAVKTNYB","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":"b4644134995b10c3a6b9aecee492d37e351acaf3eddcb378db5636633e9b6a1f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T21:16:45Z","title_canon_sha256":"e5e5bbd8d0f87fd56733d4f8875e6394158be2709451b6d2030933e554a839ee"},"schema_version":"1.0","source":{"id":"1406.3860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3860","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3860v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3860","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"JPCPRHFBLKGZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JPCPRHFBLKGZITDC","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JPCPRHFB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:d39e3970b69e3817c25480e090213fb737fdb3ea6361f4bf8f57e9d1249468c0","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"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","authors_text":"Taylor Gordon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T21:16:45Z","title":"The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3860","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:20da8465aee0ef5ea84a7a20dbca9bffbc8c4016dcf592f43cbbdbba3d69adad","target":"record","created_at":"2026-05-18T02:49:39Z","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":"b4644134995b10c3a6b9aecee492d37e351acaf3eddcb378db5636633e9b6a1f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T21:16:45Z","title_canon_sha256":"e5e5bbd8d0f87fd56733d4f8875e6394158be2709451b6d2030933e554a839ee"},"schema_version":"1.0","source":{"id":"1406.3860","kind":"arxiv","version":1}},"canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bc4f89ca15a8d944c6202440aaa6dc069972ab443a93e00f467c33e26773307","first_computed_at":"2026-05-18T02:49:39.599731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.599731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Nr5U6465AMuy8RLs6/CMQWtcQKEx9euKn+ox3W8IVDhfuTtxs7Z5HO7sXSo7kFxa+SRfDJc7+J3bNGGPbDMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.600048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20da8465aee0ef5ea84a7a20dbca9bffbc8c4016dcf592f43cbbdbba3d69adad","sha256:d39e3970b69e3817c25480e090213fb737fdb3ea6361f4bf8f57e9d1249468c0"],"state_sha256":"92d2b37bf454961df74d3fcb325bf222dacc5f2fc306a05944135dcd642a3655"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXDvPUnSgSGoYLuJnoaBNvy3CfPKBek2inmSM5uKWVw1eDMo3qBgkVlqe7yIM8YJ7s11QR2Dzv94nfbr9wqCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:28:36.464811Z","bundle_sha256":"988a5cc037f01eb211d168f9a38ab7483f9026d6557ea377a35aca7a09cb599c"}}