{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OBTXEYMXLZLIYPBY3JXW2X5B7H","short_pith_number":"pith:OBTXEYMX","canonical_record":{"source":{"id":"1606.02233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"2a30d6645c1ecc1300998af75beee349d30832bc4928feaa83dc399b0e4ab10c","abstract_canon_sha256":"70c497d05dca58313c0e03c5c2239bbd0880fbb0bc85b4d0ca2a767a5e8df77d"},"schema_version":"1.0"},"canonical_sha256":"70677261975e568c3c38da6f6d5fa1f9cd07c49d0a3713bd7507e2cdb5c237a4","source":{"kind":"arxiv","id":"1606.02233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02233","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02233v1","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02233","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"OBTXEYMXLZLI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OBTXEYMXLZLIYPBY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OBTXEYMX","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OBTXEYMXLZLIYPBY3JXW2X5B7H","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"2a30d6645c1ecc1300998af75beee349d30832bc4928feaa83dc399b0e4ab10c","abstract_canon_sha256":"70c497d05dca58313c0e03c5c2239bbd0880fbb0bc85b4d0ca2a767a5e8df77d"},"schema_version":"1.0"},"canonical_sha256":"70677261975e568c3c38da6f6d5fa1f9cd07c49d0a3713bd7507e2cdb5c237a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.420363Z","signature_b64":"/ggVPjq8omGiWRk9h3+p6Wwlgv4u8tZe2ACRoG6vK5sWPFtHdxlI0RBdhD3qZhTlCFYOJmUpdGWWJbiuLZVdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70677261975e568c3c38da6f6d5fa1f9cd07c49d0a3713bd7507e2cdb5c237a4","last_reissued_at":"2026-05-18T01:12:44.419956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.419956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02233","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5G+iYG1mlA0tkzx0z4B1yLHAX827W89zn2i4goY4xVPqzlKW/XSAg4i2MidYD2U6TZFidjHmW9z5nArU4LHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:01.684237Z"},"content_sha256":"1d39e5b5482ebdd9db31ebb1e66f6d646d6dd1c448289ba891cbc70196355a04","schema_version":"1.0","event_id":"sha256:1d39e5b5482ebdd9db31ebb1e66f6d646d6dd1c448289ba891cbc70196355a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OBTXEYMXLZLIYPBY3JXW2X5B7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Order-preserving drawings of trees with approximately optimal height (and small width)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Johannes Batzill, Therese Biedl","submitted_at":"2016-06-07T17:52:57Z","abstract_excerpt":"In this paper, we study how to draw trees so that they are planar, straight-line and respect a given order of edges around each node. We focus on minimizing the height, and show that we can always achieve a height of at most 2pw(T)+1, where pw(T) (the so-called pathwidth) is a known lower bound on the height. Hence we give an asymptotic 2-approximation algorithm. We also create a drawing whose height is at most 3pw(T ), but where the width can be bounded by the number of nodes. Finally we construct trees that require height 2pw(T)+1 in all planar order-preserving straight-line drawings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02233","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUYuBr8GgpbCws807puyl+lQfeUZKc5hXkiosqeqWQCgLQei0skqsuj5ta7GTE+s74MfNUbGP8gmz4H6wWRCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:01.684622Z"},"content_sha256":"830b0565a260d676703713ed280551805b43a6cf28c8b834c07348f4e5bc3322","schema_version":"1.0","event_id":"sha256:830b0565a260d676703713ed280551805b43a6cf28c8b834c07348f4e5bc3322"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/bundle.json","state_url":"https://pith.science/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:54:01Z","links":{"resolver":"https://pith.science/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H","bundle":"https://pith.science/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/bundle.json","state":"https://pith.science/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBTXEYMXLZLIYPBY3JXW2X5B7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OBTXEYMXLZLIYPBY3JXW2X5B7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"70c497d05dca58313c0e03c5c2239bbd0880fbb0bc85b4d0ca2a767a5e8df77d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:52:57Z","title_canon_sha256":"2a30d6645c1ecc1300998af75beee349d30832bc4928feaa83dc399b0e4ab10c"},"schema_version":"1.0","source":{"id":"1606.02233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02233","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02233v1","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02233","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"OBTXEYMXLZLI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OBTXEYMXLZLIYPBY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OBTXEYMX","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:830b0565a260d676703713ed280551805b43a6cf28c8b834c07348f4e5bc3322","target":"graph","created_at":"2026-05-18T01:12:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we study how to draw trees so that they are planar, straight-line and respect a given order of edges around each node. We focus on minimizing the height, and show that we can always achieve a height of at most 2pw(T)+1, where pw(T) (the so-called pathwidth) is a known lower bound on the height. Hence we give an asymptotic 2-approximation algorithm. We also create a drawing whose height is at most 3pw(T ), but where the width can be bounded by the number of nodes. Finally we construct trees that require height 2pw(T)+1 in all planar order-preserving straight-line drawings.","authors_text":"Johannes Batzill, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:52:57Z","title":"Order-preserving drawings of trees with approximately optimal height (and small width)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02233","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d39e5b5482ebdd9db31ebb1e66f6d646d6dd1c448289ba891cbc70196355a04","target":"record","created_at":"2026-05-18T01:12:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"70c497d05dca58313c0e03c5c2239bbd0880fbb0bc85b4d0ca2a767a5e8df77d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:52:57Z","title_canon_sha256":"2a30d6645c1ecc1300998af75beee349d30832bc4928feaa83dc399b0e4ab10c"},"schema_version":"1.0","source":{"id":"1606.02233","kind":"arxiv","version":1}},"canonical_sha256":"70677261975e568c3c38da6f6d5fa1f9cd07c49d0a3713bd7507e2cdb5c237a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70677261975e568c3c38da6f6d5fa1f9cd07c49d0a3713bd7507e2cdb5c237a4","first_computed_at":"2026-05-18T01:12:44.419956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:44.419956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ggVPjq8omGiWRk9h3+p6Wwlgv4u8tZe2ACRoG6vK5sWPFtHdxlI0RBdhD3qZhTlCFYOJmUpdGWWJbiuLZVdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:44.420363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d39e5b5482ebdd9db31ebb1e66f6d646d6dd1c448289ba891cbc70196355a04","sha256:830b0565a260d676703713ed280551805b43a6cf28c8b834c07348f4e5bc3322"],"state_sha256":"3580e1173f26b3bf1fa5349d36fa9889980205b4425f72fe382e5e4c9519e1b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0YRtWmHyQUxe32exAZGVk6gdogAWq4/a/Sfn49ge7AR85QCv/SSgYaY5asUAl1N3e2xbmDRUh9uRCmqfXzACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:54:01.686784Z","bundle_sha256":"e8dec23b8a05f82a4209a795ca9003a0ec431de9e09380eb9a4f3ad8821df388"}}