{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CNTCMVX52RRKBMZKDQH5EXZL6N","short_pith_number":"pith:CNTCMVX5","canonical_record":{"source":{"id":"1708.09515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T00:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"691128e2f77ee3c0546db8a2b93f37d585422d97e6c612b16252e9a549b19703","abstract_canon_sha256":"c6c01a8871475ebbb6596debd79c0b74623f331f840aae4b54105a9294de1065"},"schema_version":"1.0"},"canonical_sha256":"13662656fdd462a0b32a1c0fd25f2bf3579c6546906945917d4dbf03a06b9354","source":{"kind":"arxiv","id":"1708.09515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09515","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09515v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09515","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"CNTCMVX52RRK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CNTCMVX52RRKBMZK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CNTCMVX5","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CNTCMVX52RRKBMZKDQH5EXZL6N","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T00:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"691128e2f77ee3c0546db8a2b93f37d585422d97e6c612b16252e9a549b19703","abstract_canon_sha256":"c6c01a8871475ebbb6596debd79c0b74623f331f840aae4b54105a9294de1065"},"schema_version":"1.0"},"canonical_sha256":"13662656fdd462a0b32a1c0fd25f2bf3579c6546906945917d4dbf03a06b9354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:18.546879Z","signature_b64":"WMJGV8K1sjqapUejsD7ZnNkfS57whzrw60S4zO2S6lmnKLclMbHacGqewLfgH0juyD+yKPjdx87E17jjxUMWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13662656fdd462a0b32a1c0fd25f2bf3579c6546906945917d4dbf03a06b9354","last_reissued_at":"2026-05-18T00:36:18.546238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:18.546238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09515","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHR+ksHdslcj6dOj77mpxKB2peKIn1GuLwGIuO/ZGeNL7vDlC9U5V+C9iwGsMYLzL38F4QDZX7O8GXyVhnnKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:04:28.435956Z"},"content_sha256":"f1e0fa2e24220ab57914a3d2a5752cd1c90070ab1ae0bc8eb23a40d837697af3","schema_version":"1.0","event_id":"sha256:f1e0fa2e24220ab57914a3d2a5752cd1c90070ab1ae0bc8eb23a40d837697af3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CNTCMVX52RRKBMZKDQH5EXZL6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Upward Drawings of Trees on a Given Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, Therese Biedl","submitted_at":"2017-08-31T00:59:02Z","abstract_excerpt":"Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algorithms for computing minimum-width (resp., minimum-height) upward drawings of trees, where the height (resp., width) is unbounded.\n  In this paper we take a major step in understanding the complexity of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09515","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oj6f3Kr6UayrL0YnCjR2+m2G5w/ATo6t2/acRhttkqnF0IxKf88IIYbPqhyZBFPwVngDoRPZwm6/b+d1LKlCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:04:28.436680Z"},"content_sha256":"4a3695999ff7f78135c4358de0bbaabab0d4b8f6efa394c294b4e968b0093700","schema_version":"1.0","event_id":"sha256:4a3695999ff7f78135c4358de0bbaabab0d4b8f6efa394c294b4e968b0093700"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/bundle.json","state_url":"https://pith.science/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/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-06-05T23:04:28Z","links":{"resolver":"https://pith.science/pith/CNTCMVX52RRKBMZKDQH5EXZL6N","bundle":"https://pith.science/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/bundle.json","state":"https://pith.science/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNTCMVX52RRKBMZKDQH5EXZL6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CNTCMVX52RRKBMZKDQH5EXZL6N","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":"c6c01a8871475ebbb6596debd79c0b74623f331f840aae4b54105a9294de1065","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T00:59:02Z","title_canon_sha256":"691128e2f77ee3c0546db8a2b93f37d585422d97e6c612b16252e9a549b19703"},"schema_version":"1.0","source":{"id":"1708.09515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09515","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09515v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09515","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"CNTCMVX52RRK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CNTCMVX52RRKBMZK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CNTCMVX5","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4a3695999ff7f78135c4358de0bbaabab0d4b8f6efa394c294b4e968b0093700","target":"graph","created_at":"2026-05-18T00:36:18Z","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":"Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algorithms for computing minimum-width (resp., minimum-height) upward drawings of trees, where the height (resp., width) is unbounded.\n  In this paper we take a major step in understanding the complexity of ","authors_text":"Debajyoti Mondal, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T00:59:02Z","title":"On Upward Drawings of Trees on a Given Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09515","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:f1e0fa2e24220ab57914a3d2a5752cd1c90070ab1ae0bc8eb23a40d837697af3","target":"record","created_at":"2026-05-18T00:36:18Z","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":"c6c01a8871475ebbb6596debd79c0b74623f331f840aae4b54105a9294de1065","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T00:59:02Z","title_canon_sha256":"691128e2f77ee3c0546db8a2b93f37d585422d97e6c612b16252e9a549b19703"},"schema_version":"1.0","source":{"id":"1708.09515","kind":"arxiv","version":1}},"canonical_sha256":"13662656fdd462a0b32a1c0fd25f2bf3579c6546906945917d4dbf03a06b9354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13662656fdd462a0b32a1c0fd25f2bf3579c6546906945917d4dbf03a06b9354","first_computed_at":"2026-05-18T00:36:18.546238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:18.546238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WMJGV8K1sjqapUejsD7ZnNkfS57whzrw60S4zO2S6lmnKLclMbHacGqewLfgH0juyD+yKPjdx87E17jjxUMWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:18.546879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1e0fa2e24220ab57914a3d2a5752cd1c90070ab1ae0bc8eb23a40d837697af3","sha256:4a3695999ff7f78135c4358de0bbaabab0d4b8f6efa394c294b4e968b0093700"],"state_sha256":"9b2b1b8bb031945f1f82ffd03e12c653c698355a398951d01b2bd819e8d1569a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQzAAZ0cCxPo0/srBvCRyourgx0lnKhWHKSb2XaFxzOYcbUtRbGgjtRsxgymxxVnKFXP3pW2O0tLY6oUma06CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:04:28.440918Z","bundle_sha256":"3e1bfb2af4afae58446405ecf396adbcd2e80c672d6554d15aab01e174b45dd7"}}