{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KNXVB7TNUBX4PHVM6DZWNES5CR","short_pith_number":"pith:KNXVB7TN","canonical_record":{"source":{"id":"2305.09925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-05-17T03:19:31Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"28abaaacc4395089c02fc88bb025c127bc92baac518c518bf74b5add97c27918","abstract_canon_sha256":"6a73e32cf6f7ef31c9b8af590bc8368910e98708acf13ebe034d1b441061db19"},"schema_version":"1.0"},"canonical_sha256":"536f50fe6da06fc79eacf0f366925d144c28f64a24f6d3305b872f959ab06f46","source":{"kind":"arxiv","id":"2305.09925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09925","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09925v1","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09925","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"KNXVB7TNUBX4","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_16","alias_value":"KNXVB7TNUBX4PHVM","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_8","alias_value":"KNXVB7TN","created_at":"2026-07-05T06:11:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KNXVB7TNUBX4PHVM6DZWNES5CR","target":"record","payload":{"canonical_record":{"source":{"id":"2305.09925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-05-17T03:19:31Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"28abaaacc4395089c02fc88bb025c127bc92baac518c518bf74b5add97c27918","abstract_canon_sha256":"6a73e32cf6f7ef31c9b8af590bc8368910e98708acf13ebe034d1b441061db19"},"schema_version":"1.0"},"canonical_sha256":"536f50fe6da06fc79eacf0f366925d144c28f64a24f6d3305b872f959ab06f46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:07.388715Z","signature_b64":"qOb/Ok5fd9mM0YXfy34bO409LfYS3EjpR+77EJdmOetb1CNimsKc0yAZpmRC1uMvcyfU1Br4PrBKjtTtUV30CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"536f50fe6da06fc79eacf0f366925d144c28f64a24f6d3305b872f959ab06f46","last_reissued_at":"2026-07-05T06:11:07.388241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:07.388241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.09925","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-07-05T06:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xkG5EKkk8C2TZQ9seb8RbsX/j9zBPEjV418YcaOXEL4ln5QEmN5PSBhix7Fr1HNqVv9cAZgJoJxpwMGV+ZNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:39.069839Z"},"content_sha256":"4bcd181a603e81d263c309e4e4857baf07578be2848a5bf8f2b48866e31693ca","schema_version":"1.0","event_id":"sha256:4bcd181a603e81d263c309e4e4857baf07578be2848a5bf8f2b48866e31693ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KNXVB7TNUBX4PHVM6DZWNES5CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Method for Readable Tree Layouts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CG","authors_text":"Ariful Azad, Kathryn Gray, Katy B\\\"orner, Md. Khaledur Rahman, Mingwei Li, Reyan Ahmed, Stephen Kobourov","submitted_at":"2023-05-17T03:19:31Z","abstract_excerpt":"Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet, scalable, easy to read tree layouts are difficult to achieve. We consider tree layouts to be readable if they meet some basic requirements: node labels should not overlap, edges should not cross, edge lengths should be preserved, and the output should be compact. There are many algorithms for drawing trees, although very few take node labels or edge lengths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09925","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.09925/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x00b5MUaXPSXwLnjzQYK4jo6zTVYR9Fw7F3EtJ+JlmiDTodmA6VPWs9mIzsmr+7EwEZucTawvapySaE1WLbfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:39.070220Z"},"content_sha256":"3e07905ef05a821f730f19b4137220e8c2a5639e82cf2a59267271f8e3e4e044","schema_version":"1.0","event_id":"sha256:3e07905ef05a821f730f19b4137220e8c2a5639e82cf2a59267271f8e3e4e044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/bundle.json","state_url":"https://pith.science/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/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-07-07T04:55:39Z","links":{"resolver":"https://pith.science/pith/KNXVB7TNUBX4PHVM6DZWNES5CR","bundle":"https://pith.science/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/bundle.json","state":"https://pith.science/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNXVB7TNUBX4PHVM6DZWNES5CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KNXVB7TNUBX4PHVM6DZWNES5CR","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":"6a73e32cf6f7ef31c9b8af590bc8368910e98708acf13ebe034d1b441061db19","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-05-17T03:19:31Z","title_canon_sha256":"28abaaacc4395089c02fc88bb025c127bc92baac518c518bf74b5add97c27918"},"schema_version":"1.0","source":{"id":"2305.09925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09925","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09925v1","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09925","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"KNXVB7TNUBX4","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_16","alias_value":"KNXVB7TNUBX4PHVM","created_at":"2026-07-05T06:11:07Z"},{"alias_kind":"pith_short_8","alias_value":"KNXVB7TN","created_at":"2026-07-05T06:11:07Z"}],"graph_snapshots":[{"event_id":"sha256:3e07905ef05a821f730f19b4137220e8c2a5639e82cf2a59267271f8e3e4e044","target":"graph","created_at":"2026-07-05T06:11:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.09925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet, scalable, easy to read tree layouts are difficult to achieve. We consider tree layouts to be readable if they meet some basic requirements: node labels should not overlap, edges should not cross, edge lengths should be preserved, and the output should be compact. There are many algorithms for drawing trees, although very few take node labels or edge lengths","authors_text":"Ariful Azad, Kathryn Gray, Katy B\\\"orner, Md. Khaledur Rahman, Mingwei Li, Reyan Ahmed, Stephen Kobourov","cross_cats":["cs.DB"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-05-17T03:19:31Z","title":"A Scalable Method for Readable Tree Layouts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09925","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:4bcd181a603e81d263c309e4e4857baf07578be2848a5bf8f2b48866e31693ca","target":"record","created_at":"2026-07-05T06:11:07Z","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":"6a73e32cf6f7ef31c9b8af590bc8368910e98708acf13ebe034d1b441061db19","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-05-17T03:19:31Z","title_canon_sha256":"28abaaacc4395089c02fc88bb025c127bc92baac518c518bf74b5add97c27918"},"schema_version":"1.0","source":{"id":"2305.09925","kind":"arxiv","version":1}},"canonical_sha256":"536f50fe6da06fc79eacf0f366925d144c28f64a24f6d3305b872f959ab06f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"536f50fe6da06fc79eacf0f366925d144c28f64a24f6d3305b872f959ab06f46","first_computed_at":"2026-07-05T06:11:07.388241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:07.388241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOb/Ok5fd9mM0YXfy34bO409LfYS3EjpR+77EJdmOetb1CNimsKc0yAZpmRC1uMvcyfU1Br4PrBKjtTtUV30CA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:07.388715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.09925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bcd181a603e81d263c309e4e4857baf07578be2848a5bf8f2b48866e31693ca","sha256:3e07905ef05a821f730f19b4137220e8c2a5639e82cf2a59267271f8e3e4e044"],"state_sha256":"197c81ebb639512ec6f3a3835d17774694105cfdf3c9e6f9f49a57492b0714a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKNts/y0YTs1zTzA1nxn3ZpCJf5YFCIfdoaWrmxk9SoN7bLGdZavgCMt/apBs2BSXSqwYAhQDwbQMH4Mq1YzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:55:39.073122Z","bundle_sha256":"d6ed95ded5061c9886e69e9be53e8b56d5ccaf4dc3d59fa001b5589edf547962"}}