{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UAN5CHUNURJT4RZIRRB34V2MEY","short_pith_number":"pith:UAN5CHUN","schema_version":"1.0","canonical_sha256":"a01bd11e8da4533e47288c43be574c26190a7e8932aec25c47048ecd32239136","source":{"kind":"arxiv","id":"1808.10572","version":1},"attestation_state":"computed","paper":{"title":"How to Fit a Tree in a Box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hugo A. Akitaya, Irene Parada, Maarten L\\\"offler","submitted_at":"2018-08-31T02:39:02Z","abstract_excerpt":"We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\\sqrt n$ by $\\sqrt n$ grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard."},"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":"1808.10572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-31T02:39:02Z","cross_cats_sorted":[],"title_canon_sha256":"617dda0ebbef604d8b99205f527b8007b297c7e2f7ea7b90fd9cdcd6b8474dc8","abstract_canon_sha256":"1b61080f8f8a5d41ac07a6b705a3e134b380b1c86db4fe9e4a0f6ac33f03100a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:45.319733Z","signature_b64":"DUQGVwkDbE5urc8vgScnYPyHDvyeYtx+JNxscK7NffADWcvx3/P7t5ENSpCLecI3k6mlUp4KY4yCTw3BgO1UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a01bd11e8da4533e47288c43be574c26190a7e8932aec25c47048ecd32239136","last_reissued_at":"2026-05-18T00:06:45.319246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:45.319246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Fit a Tree in a Box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hugo A. Akitaya, Irene Parada, Maarten L\\\"offler","submitted_at":"2018-08-31T02:39:02Z","abstract_excerpt":"We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\\sqrt n$ by $\\sqrt n$ grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10572","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":"1808.10572","created_at":"2026-05-18T00:06:45.319326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10572v1","created_at":"2026-05-18T00:06:45.319326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10572","created_at":"2026-05-18T00:06:45.319326+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAN5CHUNURJT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAN5CHUNURJT4RZI","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAN5CHUN","created_at":"2026-05-18T12:32:56.356000+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/UAN5CHUNURJT4RZIRRB34V2MEY","json":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY.json","graph_json":"https://pith.science/api/pith-number/UAN5CHUNURJT4RZIRRB34V2MEY/graph.json","events_json":"https://pith.science/api/pith-number/UAN5CHUNURJT4RZIRRB34V2MEY/events.json","paper":"https://pith.science/paper/UAN5CHUN"},"agent_actions":{"view_html":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY","download_json":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY.json","view_paper":"https://pith.science/paper/UAN5CHUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10572&json=true","fetch_graph":"https://pith.science/api/pith-number/UAN5CHUNURJT4RZIRRB34V2MEY/graph.json","fetch_events":"https://pith.science/api/pith-number/UAN5CHUNURJT4RZIRRB34V2MEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY/action/storage_attestation","attest_author":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY/action/author_attestation","sign_citation":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY/action/citation_signature","submit_replication":"https://pith.science/pith/UAN5CHUNURJT4RZIRRB34V2MEY/action/replication_record"}},"created_at":"2026-05-18T00:06:45.319326+00:00","updated_at":"2026-05-18T00:06:45.319326+00:00"}