{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ELEVRRYPPVLJJTKOR6TAFYFPUR","short_pith_number":"pith:ELEVRRYP","schema_version":"1.0","canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","source":{"kind":"arxiv","id":"1008.3193","version":1},"attestation_state":"computed","paper":{"title":"Proximity Drawings of High-Degree Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"David R. Wood, Ferran Hurtado, Giuseppe Liotta","submitted_at":"2010-08-19T01:21:07Z","abstract_excerpt":"A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the partition or covering satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex set."},"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":"1008.3193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-08-19T01:21:07Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"7c4903ddcf2089ddb9802ad3510cc7e41cd36b599549066a9118e63b4550bc89","abstract_canon_sha256":"f61a9ba4119ef3f05af749eef224b491fdc34d768c6b64d7aadba68a51912fa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.804364Z","signature_b64":"SiF6TmAsu08axTsmLK8QWpyoxfFh/BHszEEz5G+pP3eLwbFV/99lxNPJZGWho8Gr/dBpVrQL0u1w7Z1hMe2+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","last_reissued_at":"2026-05-18T01:26:58.803845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.803845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximity Drawings of High-Degree Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"David R. Wood, Ferran Hurtado, Giuseppe Liotta","submitted_at":"2010-08-19T01:21:07Z","abstract_excerpt":"A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the partition or covering satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3193","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":"1008.3193","created_at":"2026-05-18T01:26:58.803921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3193v1","created_at":"2026-05-18T01:26:58.803921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3193","created_at":"2026-05-18T01:26:58.803921+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELEVRRYPPVLJ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELEVRRYPPVLJJTKO","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELEVRRYP","created_at":"2026-05-18T12:26:06.534383+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/ELEVRRYPPVLJJTKOR6TAFYFPUR","json":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR.json","graph_json":"https://pith.science/api/pith-number/ELEVRRYPPVLJJTKOR6TAFYFPUR/graph.json","events_json":"https://pith.science/api/pith-number/ELEVRRYPPVLJJTKOR6TAFYFPUR/events.json","paper":"https://pith.science/paper/ELEVRRYP"},"agent_actions":{"view_html":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR","download_json":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR.json","view_paper":"https://pith.science/paper/ELEVRRYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3193&json=true","fetch_graph":"https://pith.science/api/pith-number/ELEVRRYPPVLJJTKOR6TAFYFPUR/graph.json","fetch_events":"https://pith.science/api/pith-number/ELEVRRYPPVLJJTKOR6TAFYFPUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/action/storage_attestation","attest_author":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/action/author_attestation","sign_citation":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/action/citation_signature","submit_replication":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/action/replication_record"}},"created_at":"2026-05-18T01:26:58.803921+00:00","updated_at":"2026-05-18T01:26:58.803921+00:00"}