{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G6ZYMFR3U7FTEH4WJNRIMGOJHO","short_pith_number":"pith:G6ZYMFR3","canonical_record":{"source":{"id":"1608.02653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-08T23:16:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a4e0552eebf74939e298c1ea0891140c36c37561dd13382c90e096211e7db742","abstract_canon_sha256":"0acc2cd8e6f6f08c55ec4096fc63ea2f9186cbaeb2404aed2598a09cce19eba5"},"schema_version":"1.0"},"canonical_sha256":"37b386163ba7cb321f964b628619c93b9188305ff8f2ccdf67514f3487423bcf","source":{"kind":"arxiv","id":"1608.02653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02653","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02653v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02653","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"G6ZYMFR3U7FT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6ZYMFR3U7FTEH4W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6ZYMFR3","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G6ZYMFR3U7FTEH4WJNRIMGOJHO","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-08T23:16:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a4e0552eebf74939e298c1ea0891140c36c37561dd13382c90e096211e7db742","abstract_canon_sha256":"0acc2cd8e6f6f08c55ec4096fc63ea2f9186cbaeb2404aed2598a09cce19eba5"},"schema_version":"1.0"},"canonical_sha256":"37b386163ba7cb321f964b628619c93b9188305ff8f2ccdf67514f3487423bcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.544981Z","signature_b64":"Rrck1/tWxl2ABC8hoEUS05fIxeS0/OR+h4IjQE4hKa1ASOOuUQmzmBVLjqR/1+vb9pQbD2S3cQGGDmFqtkqQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b386163ba7cb321f964b628619c93b9188305ff8f2ccdf67514f3487423bcf","last_reissued_at":"2026-05-18T01:09:11.544519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.544519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02653","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlCruj6aKD5NHgipTf0rUyTS9DBfK9MM5yHXOXQF/5samwX4K+yNY3X430ZfrLqUtIezn5YNSMHJ+cHm4705Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:31.127189Z"},"content_sha256":"861b8066650da824b7e987f7d8c77f9efcf069879f56eb8e2ee2bd8032665191","schema_version":"1.0","event_id":"sha256:861b8066650da824b7e987f7d8c77f9efcf069879f56eb8e2ee2bd8032665191"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G6ZYMFR3U7FTEH4WJNRIMGOJHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Overlap Removal by Growing a Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alexander Holroyd, Arlind Nocaj, Leishi Zhang, Lev Nachmanson, Sergey Bereg","submitted_at":"2016-08-08T23:16:38Z","abstract_excerpt":"Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by \"growing\" the tree. The algorithm is simple to implement yet produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02653","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xutog66fie4MYDRkxZ1qIDJ6FO34FIFNMfFbLMLG82cFPlnVLW/iNcdOa0IAz2aN23Oct0lBzZdc7IgGZJ65BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:31.127548Z"},"content_sha256":"de98cef9429f5f982d89bedb600622dd76e36a02cb1b80b592de5c9c16aadbc4","schema_version":"1.0","event_id":"sha256:de98cef9429f5f982d89bedb600622dd76e36a02cb1b80b592de5c9c16aadbc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/bundle.json","state_url":"https://pith.science/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/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-02T22:59:31Z","links":{"resolver":"https://pith.science/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO","bundle":"https://pith.science/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/bundle.json","state":"https://pith.science/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6ZYMFR3U7FTEH4WJNRIMGOJHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G6ZYMFR3U7FTEH4WJNRIMGOJHO","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":"0acc2cd8e6f6f08c55ec4096fc63ea2f9186cbaeb2404aed2598a09cce19eba5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-08T23:16:38Z","title_canon_sha256":"a4e0552eebf74939e298c1ea0891140c36c37561dd13382c90e096211e7db742"},"schema_version":"1.0","source":{"id":"1608.02653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02653","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02653v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02653","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"G6ZYMFR3U7FT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6ZYMFR3U7FTEH4W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6ZYMFR3","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:de98cef9429f5f982d89bedb600622dd76e36a02cb1b80b592de5c9c16aadbc4","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by \"growing\" the tree. The algorithm is simple to implement yet produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods.","authors_text":"Alexander Holroyd, Arlind Nocaj, Leishi Zhang, Lev Nachmanson, Sergey Bereg","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-08T23:16:38Z","title":"Node Overlap Removal by Growing a Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02653","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:861b8066650da824b7e987f7d8c77f9efcf069879f56eb8e2ee2bd8032665191","target":"record","created_at":"2026-05-18T01:09:11Z","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":"0acc2cd8e6f6f08c55ec4096fc63ea2f9186cbaeb2404aed2598a09cce19eba5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-08T23:16:38Z","title_canon_sha256":"a4e0552eebf74939e298c1ea0891140c36c37561dd13382c90e096211e7db742"},"schema_version":"1.0","source":{"id":"1608.02653","kind":"arxiv","version":1}},"canonical_sha256":"37b386163ba7cb321f964b628619c93b9188305ff8f2ccdf67514f3487423bcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37b386163ba7cb321f964b628619c93b9188305ff8f2ccdf67514f3487423bcf","first_computed_at":"2026-05-18T01:09:11.544519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.544519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rrck1/tWxl2ABC8hoEUS05fIxeS0/OR+h4IjQE4hKa1ASOOuUQmzmBVLjqR/1+vb9pQbD2S3cQGGDmFqtkqQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.544981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:861b8066650da824b7e987f7d8c77f9efcf069879f56eb8e2ee2bd8032665191","sha256:de98cef9429f5f982d89bedb600622dd76e36a02cb1b80b592de5c9c16aadbc4"],"state_sha256":"a806f804bb423ef8c7cdae3e175cab948353417699185c221f4bf6f05b27f465"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nygtJJMQ4kB9z2SsxfQ+D1VV/hYae2VgEASVe72Y/cKM2QrMH9vI+XO+WzO4rn1LRu9/KndrPaAwd33STfMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:59:31.129510Z","bundle_sha256":"8bd4e0842ceb7fa6ec2764304a51983ff7f03e416d803e1aef7b257374a1d007"}}