{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CQVAPOUJUIQ7MEWHVRKFAP25M2","short_pith_number":"pith:CQVAPOUJ","schema_version":"1.0","canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","source":{"kind":"arxiv","id":"1502.02753","version":4},"attestation_state":"computed","paper":{"title":"Ideal Tree-drawings of Approximately Optimal Width (And Small Height)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Therese Biedl","submitted_at":"2015-02-10T01:29:52Z","abstract_excerpt":"For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether finding the minimum-possible width is NP-hard or polynomial. This paper gives a 2-approximation for this problem, and a $2\\Delta$-approximation (for $\\Delta$-ary trees) where additionally the height is $O(n)$. For trees with $\\Delta\\leq 3$, the former algorithm finds ideal drawings with minimum-possible width."},"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":"1502.02753","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-10T01:29:52Z","cross_cats_sorted":[],"title_canon_sha256":"c6bd2837a69083bd33a2e7c7f779f862a1d281424b243f52967df98f28b00c82","abstract_canon_sha256":"85ab9ca8348d30ae2a2d168587dc852ce3e19a8055ee789824239eb54fdfcb0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.518748Z","signature_b64":"zd1d0kL5oygtnsGHISwvD4D3M/94mmLxVC4+BERPRoi9oabWYWiGni+UCx9qSmYGtG+bq6sgEwalAH/3OcuRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","last_reissued_at":"2026-05-18T01:10:55.518180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.518180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ideal Tree-drawings of Approximately Optimal Width (And Small Height)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Therese Biedl","submitted_at":"2015-02-10T01:29:52Z","abstract_excerpt":"For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether finding the minimum-possible width is NP-hard or polynomial. This paper gives a 2-approximation for this problem, and a $2\\Delta$-approximation (for $\\Delta$-ary trees) where additionally the height is $O(n)$. For trees with $\\Delta\\leq 3$, the former algorithm finds ideal drawings with minimum-possible width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02753","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":"1502.02753","created_at":"2026-05-18T01:10:55.518257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02753v4","created_at":"2026-05-18T01:10:55.518257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02753","created_at":"2026-05-18T01:10:55.518257+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQVAPOUJUIQ7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQVAPOUJUIQ7MEWH","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQVAPOUJ","created_at":"2026-05-18T12:29:17.054201+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/CQVAPOUJUIQ7MEWHVRKFAP25M2","json":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2.json","graph_json":"https://pith.science/api/pith-number/CQVAPOUJUIQ7MEWHVRKFAP25M2/graph.json","events_json":"https://pith.science/api/pith-number/CQVAPOUJUIQ7MEWHVRKFAP25M2/events.json","paper":"https://pith.science/paper/CQVAPOUJ"},"agent_actions":{"view_html":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2","download_json":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2.json","view_paper":"https://pith.science/paper/CQVAPOUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02753&json=true","fetch_graph":"https://pith.science/api/pith-number/CQVAPOUJUIQ7MEWHVRKFAP25M2/graph.json","fetch_events":"https://pith.science/api/pith-number/CQVAPOUJUIQ7MEWHVRKFAP25M2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/action/storage_attestation","attest_author":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/action/author_attestation","sign_citation":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/action/citation_signature","submit_replication":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/action/replication_record"}},"created_at":"2026-05-18T01:10:55.518257+00:00","updated_at":"2026-05-18T01:10:55.518257+00:00"}