{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4GUOJU7VJL3BZPF3F7J3FLLFSM","short_pith_number":"pith:4GUOJU7V","canonical_record":{"source":{"id":"1703.01691","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T23:29:51Z","cross_cats_sorted":[],"title_canon_sha256":"354245235e606d404caf3e3855ef63686c8fc563ffb0168c087686d33dac9c29","abstract_canon_sha256":"7aa089992fb70276405ac52aeb8ff2568bd346fa5fafce9d1e2d33acf08d0a8f"},"schema_version":"1.0"},"canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","source":{"kind":"arxiv","id":"1703.01691","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01691","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01691v4","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01691","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"4GUOJU7VJL3B","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GUOJU7VJL3BZPF3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GUOJU7V","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4GUOJU7VJL3BZPF3F7J3FLLFSM","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01691","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T23:29:51Z","cross_cats_sorted":[],"title_canon_sha256":"354245235e606d404caf3e3855ef63686c8fc563ffb0168c087686d33dac9c29","abstract_canon_sha256":"7aa089992fb70276405ac52aeb8ff2568bd346fa5fafce9d1e2d33acf08d0a8f"},"schema_version":"1.0"},"canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.967837Z","signature_b64":"8p1jl/xMGcUTxltqs1k3eP/5346ErY+p/OZx/N7hjvkUK7nRWPlfcMH1npNC/S4ztnJ7Q9fwnH7WUU4qPP82Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","last_reissued_at":"2026-05-18T00:06:20.967334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.967334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01691","source_version":4,"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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR41aqT/eDWVpyZzAmKAY7r9X7se7sfu4EgLWeVXefbEGKVD859e2Juw9pGmzbon2P22ljUZNz4+PL22bMLDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:36.544218Z"},"content_sha256":"000225c6a2f5163e4ad1bc592b9cbbc0d0839300dca39aaa4db0dc3f56b51e47","schema_version":"1.0","event_id":"sha256:000225c6a2f5163e4ad1bc592b9cbbc0d0839300dca39aaa4db0dc3f56b51e47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4GUOJU7VJL3BZPF3F7J3FLLFSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing Planar Graphs with Few Geometric Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Gregor H\\\"ultenschmidt, Philipp Kindermann, Wouter Meulemans","submitted_at":"2017-03-05T23:29:51Z","abstract_excerpt":"We define the \\emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path with an arbitrary number of edges). Let $n$ denote the number of vertices of a graph. We show that trees can be drawn with $3n/4$ straight-line segments on a polynomial grid, and with $n/2$ straight-line segments on a quasi-polynomial grid. Further, we present an algorithm for drawing planar 3-trees with $(8n-17)/3$ segments on an $O(n)\\times O(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01691","kind":"arxiv","version":4},"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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/b8nom3dMFbCnPDd1fAqD+BXuMFZ8z9KfKqBBoxXqzor0RluxfM5eL66mdPKjH1gKixCx/iDcu73awwxPonBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:36.544579Z"},"content_sha256":"97b5ff9712ec807150bac2627b97ba94d63017cd349175a6b14726fafec96530","schema_version":"1.0","event_id":"sha256:97b5ff9712ec807150bac2627b97ba94d63017cd349175a6b14726fafec96530"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/bundle.json","state_url":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/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-06-02T19:52:36Z","links":{"resolver":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM","bundle":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/bundle.json","state":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4GUOJU7VJL3BZPF3F7J3FLLFSM","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":"7aa089992fb70276405ac52aeb8ff2568bd346fa5fafce9d1e2d33acf08d0a8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T23:29:51Z","title_canon_sha256":"354245235e606d404caf3e3855ef63686c8fc563ffb0168c087686d33dac9c29"},"schema_version":"1.0","source":{"id":"1703.01691","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01691","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01691v4","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01691","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"4GUOJU7VJL3B","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GUOJU7VJL3BZPF3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GUOJU7V","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:97b5ff9712ec807150bac2627b97ba94d63017cd349175a6b14726fafec96530","target":"graph","created_at":"2026-05-18T00:06:20Z","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 define the \\emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path with an arbitrary number of edges). Let $n$ denote the number of vertices of a graph. We show that trees can be drawn with $3n/4$ straight-line segments on a polynomial grid, and with $n/2$ straight-line segments on a quasi-polynomial grid. Further, we present an algorithm for drawing planar 3-trees with $(8n-17)/3$ segments on an $O(n)\\times O(n","authors_text":"Andr\\'e Schulz, Gregor H\\\"ultenschmidt, Philipp Kindermann, Wouter Meulemans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T23:29:51Z","title":"Drawing Planar Graphs with Few Geometric Primitives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01691","kind":"arxiv","version":4},"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:000225c6a2f5163e4ad1bc592b9cbbc0d0839300dca39aaa4db0dc3f56b51e47","target":"record","created_at":"2026-05-18T00:06:20Z","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":"7aa089992fb70276405ac52aeb8ff2568bd346fa5fafce9d1e2d33acf08d0a8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T23:29:51Z","title_canon_sha256":"354245235e606d404caf3e3855ef63686c8fc563ffb0168c087686d33dac9c29"},"schema_version":"1.0","source":{"id":"1703.01691","kind":"arxiv","version":4}},"canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","first_computed_at":"2026-05-18T00:06:20.967334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.967334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8p1jl/xMGcUTxltqs1k3eP/5346ErY+p/OZx/N7hjvkUK7nRWPlfcMH1npNC/S4ztnJ7Q9fwnH7WUU4qPP82Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.967837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01691","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:000225c6a2f5163e4ad1bc592b9cbbc0d0839300dca39aaa4db0dc3f56b51e47","sha256:97b5ff9712ec807150bac2627b97ba94d63017cd349175a6b14726fafec96530"],"state_sha256":"04d64f82e7f8e4111511358a64476c99d7405b4e6282a27b979772002ad21674"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0RtRjHUiHe9UFLT7NyWsWJUfN8FXq04V7rA4iWsR9T87ZaDYwUvTnQaZJs70q18cEgLEoMOf2NVRtaxmN/8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:52:36.546667Z","bundle_sha256":"8f85797aca9dbe3375137723bde5f7ea7a26bce6b4c15c77ef2eeb112b5f1cee"}}