{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IHU5TCCSZQ2A3EBB3PYS73TM4D","short_pith_number":"pith:IHU5TCCS","schema_version":"1.0","canonical_sha256":"41e9d98852cc340d9021dbf12fee6ce0d3c3c09d03cfb5dcfd668c8cb09b784f","source":{"kind":"arxiv","id":"1908.03586","version":3},"attestation_state":"computed","paper":{"title":"On the Planar Edge-Length Ratio of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Manuel Borrazzo","submitted_at":"2019-08-09T18:05:49Z","abstract_excerpt":"The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph.\n  In this paper, we study the planar edge-length ratio of planar graphs. We prove that there exist $n$-vertex planar graphs whose planar edge-length ratio is in $\\Omega(n)$; this bound is tight. We also prove upper bounds on the planar edge-length ratio of several families of planar graphs, including series-parallel gra"},"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":"1908.03586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T18:05:49Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"d4e8bdce57d7ee6c4d6d4c97d3960b34e3a3da816f5a442b9fc8062e48b82faa","abstract_canon_sha256":"07032406f645805577b3675e8c29388ab59002f286c42794230f6cb3d3372300"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:29.954217Z","signature_b64":"eYQ+Owt285Kr3uvuyf86yt5cHzXvy0DJWf99cW8ph3+UsqywaiRh57SVDx6455EWGT6oI+erK01PRlFgvbwyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e9d98852cc340d9021dbf12fee6ce0d3c3c09d03cfb5dcfd668c8cb09b784f","last_reissued_at":"2026-07-05T00:54:29.953872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:29.953872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Planar Edge-Length Ratio of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Manuel Borrazzo","submitted_at":"2019-08-09T18:05:49Z","abstract_excerpt":"The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph.\n  In this paper, we study the planar edge-length ratio of planar graphs. We prove that there exist $n$-vertex planar graphs whose planar edge-length ratio is in $\\Omega(n)$; this bound is tight. We also prove upper bounds on the planar edge-length ratio of several families of planar graphs, including series-parallel gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03586","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03586/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.03586","created_at":"2026-07-05T00:54:29.953934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03586v3","created_at":"2026-07-05T00:54:29.953934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03586","created_at":"2026-07-05T00:54:29.953934+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHU5TCCSZQ2A","created_at":"2026-07-05T00:54:29.953934+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHU5TCCSZQ2A3EBB","created_at":"2026-07-05T00:54:29.953934+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHU5TCCS","created_at":"2026-07-05T00:54:29.953934+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/IHU5TCCSZQ2A3EBB3PYS73TM4D","json":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D.json","graph_json":"https://pith.science/api/pith-number/IHU5TCCSZQ2A3EBB3PYS73TM4D/graph.json","events_json":"https://pith.science/api/pith-number/IHU5TCCSZQ2A3EBB3PYS73TM4D/events.json","paper":"https://pith.science/paper/IHU5TCCS"},"agent_actions":{"view_html":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D","download_json":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D.json","view_paper":"https://pith.science/paper/IHU5TCCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03586&json=true","fetch_graph":"https://pith.science/api/pith-number/IHU5TCCSZQ2A3EBB3PYS73TM4D/graph.json","fetch_events":"https://pith.science/api/pith-number/IHU5TCCSZQ2A3EBB3PYS73TM4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D/action/storage_attestation","attest_author":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D/action/author_attestation","sign_citation":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D/action/citation_signature","submit_replication":"https://pith.science/pith/IHU5TCCSZQ2A3EBB3PYS73TM4D/action/replication_record"}},"created_at":"2026-07-05T00:54:29.953934+00:00","updated_at":"2026-07-05T00:54:29.953934+00:00"}