{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NMT75JBCRMPSHRBJLSS3Z4UYMR","short_pith_number":"pith:NMT75JBC","schema_version":"1.0","canonical_sha256":"6b27fea4228b1f23c4295ca5bcf298647976f492f583fe68ae719e4ff5f7615b","source":{"kind":"arxiv","id":"1506.02096","version":2},"attestation_state":"computed","paper":{"title":"Optimum-width upward drawings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Therese Biedl","submitted_at":"2015-06-06T01:10:35Z","abstract_excerpt":"An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each node. Chan showed that any tree has an upward order-preserving drawing with width O(log n). In this paper, we present linear-time algorithms that finds upward with instance-optimal width, i.e., the width is the minimum-possible for the input tree.\n  We study two different models. In the first model, the drawings need not be order-preserving; a very simple algorithm then finds straight-line drawings of optimal width. In th"},"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":"1506.02096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-06T01:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"642822960e286920b61eafbb9bcc548552daf3b65438a7b885695d7f2257842e","abstract_canon_sha256":"16a1e1612512d2dece0b6ae9ec456ba0d8c321569651eb2b5ea633a34b634427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:53.995160Z","signature_b64":"HgIiuytOQM2LIoR5P65ffeQPW0xOezMP2qS1gTw/UUbl1XpdOpsNo1shuy4g9nEz3cbTKIzYMqDaLJgBHGXyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b27fea4228b1f23c4295ca5bcf298647976f492f583fe68ae719e4ff5f7615b","last_reissued_at":"2026-05-18T01:27:53.994402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:53.994402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum-width upward drawings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Therese Biedl","submitted_at":"2015-06-06T01:10:35Z","abstract_excerpt":"An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each node. Chan showed that any tree has an upward order-preserving drawing with width O(log n). In this paper, we present linear-time algorithms that finds upward with instance-optimal width, i.e., the width is the minimum-possible for the input tree.\n  We study two different models. In the first model, the drawings need not be order-preserving; a very simple algorithm then finds straight-line drawings of optimal width. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02096","kind":"arxiv","version":2},"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":"1506.02096","created_at":"2026-05-18T01:27:53.994532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02096v2","created_at":"2026-05-18T01:27:53.994532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02096","created_at":"2026-05-18T01:27:53.994532+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMT75JBCRMPS","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMT75JBCRMPSHRBJ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMT75JBC","created_at":"2026-05-18T12:29:32.376354+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/NMT75JBCRMPSHRBJLSS3Z4UYMR","json":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR.json","graph_json":"https://pith.science/api/pith-number/NMT75JBCRMPSHRBJLSS3Z4UYMR/graph.json","events_json":"https://pith.science/api/pith-number/NMT75JBCRMPSHRBJLSS3Z4UYMR/events.json","paper":"https://pith.science/paper/NMT75JBC"},"agent_actions":{"view_html":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR","download_json":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR.json","view_paper":"https://pith.science/paper/NMT75JBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02096&json=true","fetch_graph":"https://pith.science/api/pith-number/NMT75JBCRMPSHRBJLSS3Z4UYMR/graph.json","fetch_events":"https://pith.science/api/pith-number/NMT75JBCRMPSHRBJLSS3Z4UYMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR/action/storage_attestation","attest_author":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR/action/author_attestation","sign_citation":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR/action/citation_signature","submit_replication":"https://pith.science/pith/NMT75JBCRMPSHRBJLSS3Z4UYMR/action/replication_record"}},"created_at":"2026-05-18T01:27:53.994532+00:00","updated_at":"2026-05-18T01:27:53.994532+00:00"}