{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CQVAPOUJUIQ7MEWHVRKFAP25M2","short_pith_number":"pith:CQVAPOUJ","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"},"canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","source":{"kind":"arxiv","id":"1502.02753","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02753","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02753v4","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02753","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"CQVAPOUJUIQ7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CQVAPOUJUIQ7MEWH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CQVAPOUJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CQVAPOUJUIQ7MEWHVRKFAP25M2","target":"record","payload":{"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"},"canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","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"},"source_kind":"arxiv","source_id":"1502.02753","source_version":4,"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:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9JwTAzMnuhvyZjA2L/XUCoeb4v01BAGezJFTz6c4w2wJ32KA2ODM92CE7kW4Z6xUYyafAURR4/GduJ+6bzkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:22.095846Z"},"content_sha256":"dd02b773ab4f51beb6d2d50ed7c0795d03bdf545af2dd8d1640cd42808016fcf","schema_version":"1.0","event_id":"sha256:dd02b773ab4f51beb6d2d50ed7c0795d03bdf545af2dd8d1640cd42808016fcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CQVAPOUJUIQ7MEWHVRKFAP25M2","target":"graph","payload":{"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"},"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:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCyI0ZTfgS9Fs+8v07m80cLOVw5omDN3+NufDB/eafQUOxzSBCWUMdk3pn2vFpgvrwJs7gNQPtcd847Kgic/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:22.096502Z"},"content_sha256":"da3854fb2e284f4f2e1f6ca8baf4fe576ae3f3d6f156c5f4b1a0b4cce9d76bc0","schema_version":"1.0","event_id":"sha256:da3854fb2e284f4f2e1f6ca8baf4fe576ae3f3d6f156c5f4b1a0b4cce9d76bc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/bundle.json","state_url":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/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-31T00:41:22Z","links":{"resolver":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2","bundle":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/bundle.json","state":"https://pith.science/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQVAPOUJUIQ7MEWHVRKFAP25M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CQVAPOUJUIQ7MEWHVRKFAP25M2","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":"85ab9ca8348d30ae2a2d168587dc852ce3e19a8055ee789824239eb54fdfcb0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-10T01:29:52Z","title_canon_sha256":"c6bd2837a69083bd33a2e7c7f779f862a1d281424b243f52967df98f28b00c82"},"schema_version":"1.0","source":{"id":"1502.02753","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02753","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02753v4","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02753","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"CQVAPOUJUIQ7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CQVAPOUJUIQ7MEWH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CQVAPOUJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:da3854fb2e284f4f2e1f6ca8baf4fe576ae3f3d6f156c5f4b1a0b4cce9d76bc0","target":"graph","created_at":"2026-05-18T01:10:55Z","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":"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.","authors_text":"Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-10T01:29:52Z","title":"Ideal Tree-drawings of Approximately Optimal Width (And Small Height)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02753","kind":"arxiv","version":4},"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:dd02b773ab4f51beb6d2d50ed7c0795d03bdf545af2dd8d1640cd42808016fcf","target":"record","created_at":"2026-05-18T01:10:55Z","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":"85ab9ca8348d30ae2a2d168587dc852ce3e19a8055ee789824239eb54fdfcb0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-10T01:29:52Z","title_canon_sha256":"c6bd2837a69083bd33a2e7c7f779f862a1d281424b243f52967df98f28b00c82"},"schema_version":"1.0","source":{"id":"1502.02753","kind":"arxiv","version":4}},"canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142a07ba89a221f612c7ac54503f5d669d83ce95fa3a36c270e91f556d1e9453","first_computed_at":"2026-05-18T01:10:55.518180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:55.518180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zd1d0kL5oygtnsGHISwvD4D3M/94mmLxVC4+BERPRoi9oabWYWiGni+UCx9qSmYGtG+bq6sgEwalAH/3OcuRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:55.518748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02753","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd02b773ab4f51beb6d2d50ed7c0795d03bdf545af2dd8d1640cd42808016fcf","sha256:da3854fb2e284f4f2e1f6ca8baf4fe576ae3f3d6f156c5f4b1a0b4cce9d76bc0"],"state_sha256":"0c181abf213bbfac21b533eaff4c606e8099793ca3c76bfe6a1054ddc47a7c4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkWipk41K4FPfHL/uwOKREXrmYlNsZqCZElKhIiKyqkMYJvrx2/xfiDl8PjHwbnUoGxQFfr3Tp3nNVURP6osCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:41:22.100004Z","bundle_sha256":"3c244d4f57359ca67ece486fdc97803cbe11bbb7f7928e90c16fd73ec782629a"}}