{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2TXE424OKFMF3JA6H6YHKN5HTY","short_pith_number":"pith:2TXE424O","schema_version":"1.0","canonical_sha256":"d4ee4e6b8e51585da41e3fb07537a79e27829ba63ae36f86a862387eb3efcb97","source":{"kind":"arxiv","id":"1803.07185","version":1},"attestation_state":"computed","paper":{"title":"Tree Drawings Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Timothy M. Chan","submitted_at":"2018-03-19T22:40:08Z","abstract_excerpt":"We make progress on a number of open problems concerning the area requirement for drawing trees on a grid. We prove that\n  1. every tree of size $n$ (with arbitrarily large degree) has a straight-line drawing with area $n2^{O(\\sqrt{\\log\\log n\\log\\log\\log n})}$, improving the longstanding $O(n\\log n)$ bound;\n  2. every tree of size $n$ (with arbitrarily large degree) has a straight-line upward drawing with area $n\\sqrt{\\log n}(\\log\\log n)^{O(1)}$, improving the longstanding $O(n\\log n)$ bound;\n  3. every binary tree of size $n$ has a straight-line orthogonal drawing with area $n2^{O(\\log^*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":"1803.07185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T22:40:08Z","cross_cats_sorted":[],"title_canon_sha256":"ccb50e712ffceaa5ec92e203ef617cd4507abdc724a123fd6c68188a702df818","abstract_canon_sha256":"4d1ade4e8ecc62ede7e9f35397d6a8e410ac87b9cb3a4d73a9a9762734cd15be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:34.031127Z","signature_b64":"g7xoJpgWj78/HHlXv/rJwZHJuo8Z1wS/7+KvnPo6cmmiGUpLx7IS7NLRdxMVek1niZp5ul0C4evFrIo1cab3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4ee4e6b8e51585da41e3fb07537a79e27829ba63ae36f86a862387eb3efcb97","last_reissued_at":"2026-05-18T00:20:34.030563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:34.030563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Drawings Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Timothy M. Chan","submitted_at":"2018-03-19T22:40:08Z","abstract_excerpt":"We make progress on a number of open problems concerning the area requirement for drawing trees on a grid. We prove that\n  1. every tree of size $n$ (with arbitrarily large degree) has a straight-line drawing with area $n2^{O(\\sqrt{\\log\\log n\\log\\log\\log n})}$, improving the longstanding $O(n\\log n)$ bound;\n  2. every tree of size $n$ (with arbitrarily large degree) has a straight-line upward drawing with area $n\\sqrt{\\log n}(\\log\\log n)^{O(1)}$, improving the longstanding $O(n\\log n)$ bound;\n  3. every binary tree of size $n$ has a straight-line orthogonal drawing with area $n2^{O(\\log^*n)}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07185","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.07185","created_at":"2026-05-18T00:20:34.030643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07185v1","created_at":"2026-05-18T00:20:34.030643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07185","created_at":"2026-05-18T00:20:34.030643+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TXE424OKFMF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TXE424OKFMF3JA6","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TXE424O","created_at":"2026-05-18T12:32:02.567920+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/2TXE424OKFMF3JA6H6YHKN5HTY","json":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY.json","graph_json":"https://pith.science/api/pith-number/2TXE424OKFMF3JA6H6YHKN5HTY/graph.json","events_json":"https://pith.science/api/pith-number/2TXE424OKFMF3JA6H6YHKN5HTY/events.json","paper":"https://pith.science/paper/2TXE424O"},"agent_actions":{"view_html":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY","download_json":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY.json","view_paper":"https://pith.science/paper/2TXE424O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07185&json=true","fetch_graph":"https://pith.science/api/pith-number/2TXE424OKFMF3JA6H6YHKN5HTY/graph.json","fetch_events":"https://pith.science/api/pith-number/2TXE424OKFMF3JA6H6YHKN5HTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY/action/storage_attestation","attest_author":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY/action/author_attestation","sign_citation":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY/action/citation_signature","submit_replication":"https://pith.science/pith/2TXE424OKFMF3JA6H6YHKN5HTY/action/replication_record"}},"created_at":"2026-05-18T00:20:34.030643+00:00","updated_at":"2026-05-18T00:20:34.030643+00:00"}