{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YUCPXYBXIW5KSCMF43PALU2X2L","short_pith_number":"pith:YUCPXYBX","schema_version":"1.0","canonical_sha256":"c504fbe03745baa90985e6de05d357d2e187f2fd37052d2c0f1dfb4fa92ee828","source":{"kind":"arxiv","id":"1909.11152","version":3},"attestation_state":"computed","paper":{"title":"On the edge-length ratio of 2-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Giuseppe Liotta, Ji\\v{r}\\'i Fiala, V\\'aclav Bla\\v{z}ej","submitted_at":"2019-09-24T19:42:59Z","abstract_excerpt":"We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comput. Sci. 770 (2019), 88--94] and, for any given constant $r$, we provide a $2$-tree which does not admit a planar straight-line drawing with a ratio bounded by $r$. When the ratio is restricted to adjacent edges only, we prove that any $2$-tree admits a planar straight-line drawing whose edge-length ratio is at most $4 + \\varepsilon$ for any arbitrarily small $\\varepsilon > 0$, hence the upper bound on the local edge"},"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":"1909.11152","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-09-24T19:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"f47c67148ff164018fb23c4b5c4fda62e9e95c9a9f08fc6136c22afa608f7cdd","abstract_canon_sha256":"2bcb8e7fc4a8f4763c44bd1c3e953d1ff56288213ecf5d9fd91fcb2247039fb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:28.813190Z","signature_b64":"ZYgqDnR2c/M+s+64lCjGTdwQ9waYa1O26JDIP2r0070+cPiSLzQCofBJZHlpTuh+NaZTvnxRVbCJYzaYnNDwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c504fbe03745baa90985e6de05d357d2e187f2fd37052d2c0f1dfb4fa92ee828","last_reissued_at":"2026-07-05T01:28:28.812801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:28.812801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the edge-length ratio of 2-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Giuseppe Liotta, Ji\\v{r}\\'i Fiala, V\\'aclav Bla\\v{z}ej","submitted_at":"2019-09-24T19:42:59Z","abstract_excerpt":"We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comput. Sci. 770 (2019), 88--94] and, for any given constant $r$, we provide a $2$-tree which does not admit a planar straight-line drawing with a ratio bounded by $r$. When the ratio is restricted to adjacent edges only, we prove that any $2$-tree admits a planar straight-line drawing whose edge-length ratio is at most $4 + \\varepsilon$ for any arbitrarily small $\\varepsilon > 0$, hence the upper bound on the local edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11152","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/1909.11152/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":"1909.11152","created_at":"2026-07-05T01:28:28.812856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11152v3","created_at":"2026-07-05T01:28:28.812856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11152","created_at":"2026-07-05T01:28:28.812856+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUCPXYBXIW5K","created_at":"2026-07-05T01:28:28.812856+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUCPXYBXIW5KSCMF","created_at":"2026-07-05T01:28:28.812856+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUCPXYBX","created_at":"2026-07-05T01:28:28.812856+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03586","citing_title":"On the Planar Edge-Length Ratio of Planar Graphs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L","json":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L.json","graph_json":"https://pith.science/api/pith-number/YUCPXYBXIW5KSCMF43PALU2X2L/graph.json","events_json":"https://pith.science/api/pith-number/YUCPXYBXIW5KSCMF43PALU2X2L/events.json","paper":"https://pith.science/paper/YUCPXYBX"},"agent_actions":{"view_html":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L","download_json":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L.json","view_paper":"https://pith.science/paper/YUCPXYBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11152&json=true","fetch_graph":"https://pith.science/api/pith-number/YUCPXYBXIW5KSCMF43PALU2X2L/graph.json","fetch_events":"https://pith.science/api/pith-number/YUCPXYBXIW5KSCMF43PALU2X2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L/action/storage_attestation","attest_author":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L/action/author_attestation","sign_citation":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L/action/citation_signature","submit_replication":"https://pith.science/pith/YUCPXYBXIW5KSCMF43PALU2X2L/action/replication_record"}},"created_at":"2026-07-05T01:28:28.812856+00:00","updated_at":"2026-07-05T01:28:28.812856+00:00"}