{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TWFQ3AK3FCOCLLVDPI7S4F2XQQ","short_pith_number":"pith:TWFQ3AK3","schema_version":"1.0","canonical_sha256":"9d8b0d815b289c25aea37a3f2e175784326c8dc3f72012fe7cc6b0417894abcc","source":{"kind":"arxiv","id":"1608.08538","version":2},"attestation_state":"computed","paper":{"title":"Low Ply Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Symvonis, Jaroslav Han\\v{c}l Jr., Michael A. Bekos, Michael Kaufmann, Patrizio Angelini, Pavel Valtr, Stephen Kobourov, Till Bruckdorfer","submitted_at":"2016-08-30T16:14:42Z","abstract_excerpt":"We consider the recently introduced model of \\emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \\emph{ply-disk} of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the \\emph{ply-number} of the drawing.\n  We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, ev"},"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":"1608.08538","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T16:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"31a1f00eb8e6e381b186e3fa1f371a5eda69f300804562a1af2b07f24b4cbd58","abstract_canon_sha256":"d91380b8da8787fab0fffa493258ca8000ab9933c7e840db9257274b5f169457"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.998846Z","signature_b64":"unuEQnD0tgKmZ/oenrn362ZEEQ73U3SJGklgXu/ZJkLEDuklxpR9tM9RoQgF+NCFPrRzHVM/Lrkxw05hbQSHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d8b0d815b289c25aea37a3f2e175784326c8dc3f72012fe7cc6b0417894abcc","last_reissued_at":"2026-05-18T01:06:23.998335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.998335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Ply Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Symvonis, Jaroslav Han\\v{c}l Jr., Michael A. Bekos, Michael Kaufmann, Patrizio Angelini, Pavel Valtr, Stephen Kobourov, Till Bruckdorfer","submitted_at":"2016-08-30T16:14:42Z","abstract_excerpt":"We consider the recently introduced model of \\emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \\emph{ply-disk} of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the \\emph{ply-number} of the drawing.\n  We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08538","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":"1608.08538","created_at":"2026-05-18T01:06:23.998409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08538v2","created_at":"2026-05-18T01:06:23.998409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08538","created_at":"2026-05-18T01:06:23.998409+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWFQ3AK3FCOC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWFQ3AK3FCOCLLVD","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWFQ3AK3","created_at":"2026-05-18T12:30:46.583412+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/TWFQ3AK3FCOCLLVDPI7S4F2XQQ","json":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ.json","graph_json":"https://pith.science/api/pith-number/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/graph.json","events_json":"https://pith.science/api/pith-number/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/events.json","paper":"https://pith.science/paper/TWFQ3AK3"},"agent_actions":{"view_html":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ","download_json":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ.json","view_paper":"https://pith.science/paper/TWFQ3AK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08538&json=true","fetch_graph":"https://pith.science/api/pith-number/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/action/storage_attestation","attest_author":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/action/author_attestation","sign_citation":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/action/citation_signature","submit_replication":"https://pith.science/pith/TWFQ3AK3FCOCLLVDPI7S4F2XQQ/action/replication_record"}},"created_at":"2026-05-18T01:06:23.998409+00:00","updated_at":"2026-05-18T01:06:23.998409+00:00"}