{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ELEVRRYPPVLJJTKOR6TAFYFPUR","short_pith_number":"pith:ELEVRRYP","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"},"canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","source":{"kind":"arxiv","id":"1008.3193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3193","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3193v1","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3193","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"ELEVRRYPPVLJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ELEVRRYPPVLJJTKO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ELEVRRYP","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ELEVRRYPPVLJJTKOR6TAFYFPUR","target":"record","payload":{"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"},"canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","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"},"source_kind":"arxiv","source_id":"1008.3193","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-18T01:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MI65l7Xnj8kjpzO5EUKZ0bMtYIHHCsoOLTSr/blyG6HojoOoSAxcAKQ7wvwKmb2BrZiIqOi47vAcDJRJowpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:17:33.267005Z"},"content_sha256":"920d53f7ce3a608cf018ef9308d34daaf97ddfa6f3fd47277e00d8e0aa0ce359","schema_version":"1.0","event_id":"sha256:920d53f7ce3a608cf018ef9308d34daaf97ddfa6f3fd47277e00d8e0aa0ce359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ELEVRRYPPVLJJTKOR6TAFYFPUR","target":"graph","payload":{"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"},"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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sn8BR9JiJbmMnDc1/ELrGDF7hoCvu6lOT05CloZx/gbbAkp7ukkdnSb52tDz+c6uazvpghhayf6PAMqENl1tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:17:33.267760Z"},"content_sha256":"0d1da4f332dd1d17094fef2140219a8347113aa23a4d3a9ed0e2b6311ff0a021","schema_version":"1.0","event_id":"sha256:0d1da4f332dd1d17094fef2140219a8347113aa23a4d3a9ed0e2b6311ff0a021"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/bundle.json","state_url":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/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-11T04:17:33Z","links":{"resolver":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR","bundle":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/bundle.json","state":"https://pith.science/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELEVRRYPPVLJJTKOR6TAFYFPUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ELEVRRYPPVLJJTKOR6TAFYFPUR","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":"f61a9ba4119ef3f05af749eef224b491fdc34d768c6b64d7aadba68a51912fa8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-08-19T01:21:07Z","title_canon_sha256":"7c4903ddcf2089ddb9802ad3510cc7e41cd36b599549066a9118e63b4550bc89"},"schema_version":"1.0","source":{"id":"1008.3193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3193","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3193v1","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3193","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"ELEVRRYPPVLJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ELEVRRYPPVLJJTKO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ELEVRRYP","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:0d1da4f332dd1d17094fef2140219a8347113aa23a4d3a9ed0e2b6311ff0a021","target":"graph","created_at":"2026-05-18T01:26:58Z","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":"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.","authors_text":"David R. Wood, Ferran Hurtado, Giuseppe Liotta","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-08-19T01:21:07Z","title":"Proximity Drawings of High-Degree Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3193","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:920d53f7ce3a608cf018ef9308d34daaf97ddfa6f3fd47277e00d8e0aa0ce359","target":"record","created_at":"2026-05-18T01:26:58Z","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":"f61a9ba4119ef3f05af749eef224b491fdc34d768c6b64d7aadba68a51912fa8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-08-19T01:21:07Z","title_canon_sha256":"7c4903ddcf2089ddb9802ad3510cc7e41cd36b599549066a9118e63b4550bc89"},"schema_version":"1.0","source":{"id":"1008.3193","kind":"arxiv","version":1}},"canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22c958c70f7d5694cd4e8fa602e0afa45f98b73bdbac462568ab34854b57cb43","first_computed_at":"2026-05-18T01:26:58.803845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.803845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SiF6TmAsu08axTsmLK8QWpyoxfFh/BHszEEz5G+pP3eLwbFV/99lxNPJZGWho8Gr/dBpVrQL0u1w7Z1hMe2+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.804364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:920d53f7ce3a608cf018ef9308d34daaf97ddfa6f3fd47277e00d8e0aa0ce359","sha256:0d1da4f332dd1d17094fef2140219a8347113aa23a4d3a9ed0e2b6311ff0a021"],"state_sha256":"83943f257ce596315f8f35de5b535a8e49e0313ea5afd003fe2c52e299d7152f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUzeHU6QgeIxDAtFTxKahHhfxsuzxxXmY3KS/vYeRCP3VEP8J8UtLVTTL3UjBncSg1jMIgcXkePn4JhKE7CBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:17:33.271816Z","bundle_sha256":"3726a485a59ec21f5c1e2da425e403380d82050be6e77370dc81c4ad31a781cb"}}