{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4GUOJU7VJL3BZPF3F7J3FLLFSM","short_pith_number":"pith:4GUOJU7V","schema_version":"1.0","canonical_sha256":"e1a8e4d3f54af61cbcbb2fd3b2ad65932a69969a670322c3bf21eca70f8944fd","source":{"kind":"arxiv","id":"1703.01691","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.01691","created_at":"2026-05-18T00:06:20.967419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01691v4","created_at":"2026-05-18T00:06:20.967419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01691","created_at":"2026-05-18T00:06:20.967419+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GUOJU7VJL3B","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GUOJU7VJL3BZPF3","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GUOJU7V","created_at":"2026-05-18T12:30:58.224056+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/4GUOJU7VJL3BZPF3F7J3FLLFSM","json":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM.json","graph_json":"https://pith.science/api/pith-number/4GUOJU7VJL3BZPF3F7J3FLLFSM/graph.json","events_json":"https://pith.science/api/pith-number/4GUOJU7VJL3BZPF3F7J3FLLFSM/events.json","paper":"https://pith.science/paper/4GUOJU7V"},"agent_actions":{"view_html":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM","download_json":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM.json","view_paper":"https://pith.science/paper/4GUOJU7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01691&json=true","fetch_graph":"https://pith.science/api/pith-number/4GUOJU7VJL3BZPF3F7J3FLLFSM/graph.json","fetch_events":"https://pith.science/api/pith-number/4GUOJU7VJL3BZPF3F7J3FLLFSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/action/storage_attestation","attest_author":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/action/author_attestation","sign_citation":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/action/citation_signature","submit_replication":"https://pith.science/pith/4GUOJU7VJL3BZPF3F7J3FLLFSM/action/replication_record"}},"created_at":"2026-05-18T00:06:20.967419+00:00","updated_at":"2026-05-18T00:06:20.967419+00:00"}