{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TWKDOJD455F4JI75KAOMYFPCBN","short_pith_number":"pith:TWKDOJD4","canonical_record":{"source":{"id":"1908.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T14:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb0f02f031d5629c71586be13a6f95c34b78739865ad34e11576301511fb2a38","abstract_canon_sha256":"6da1d4ab6407b84400ed873259949f8a4365223bb9b944f52f57ab7b153c973e"},"schema_version":"1.0"},"canonical_sha256":"9d9437247cef4bc4a3fd501ccc15e20b6cfc401ffcd2d4bc9d3b941a18415ccc","source":{"kind":"arxiv","id":"1908.07363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07363","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07363v2","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07363","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"TWKDOJD455F4","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_16","alias_value":"TWKDOJD455F4JI75","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_8","alias_value":"TWKDOJD4","created_at":"2026-07-05T00:02:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TWKDOJD455F4JI75KAOMYFPCBN","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T14:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb0f02f031d5629c71586be13a6f95c34b78739865ad34e11576301511fb2a38","abstract_canon_sha256":"6da1d4ab6407b84400ed873259949f8a4365223bb9b944f52f57ab7b153c973e"},"schema_version":"1.0"},"canonical_sha256":"9d9437247cef4bc4a3fd501ccc15e20b6cfc401ffcd2d4bc9d3b941a18415ccc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:39.916978Z","signature_b64":"PFZ1/Th7X4cBX0cL57Xga7cM0pWtPJlIWjJNbrG4ySMTqpUoMk+3PO+8EovHBFgWxpS1zBe/IplNIC7kUBAHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9437247cef4bc4a3fd501ccc15e20b6cfc401ffcd2d4bc9d3b941a18415ccc","last_reissued_at":"2026-07-05T00:02:39.916596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:39.916596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07363","source_version":2,"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-05T00:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tHn7h05hpImQ7LhswM7TJsLfL/JANsfJYvoXkCUaXS/5r3J0E+bgUcQRGMzvEhLqxrqbT27x/dwMW3Mabp1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:29:40.589894Z"},"content_sha256":"b46630ee544dad092ff4e86891570afb421ea9b29aa1b22f7d3db3b740517e7b","schema_version":"1.0","event_id":"sha256:b46630ee544dad092ff4e86891570afb421ea9b29aa1b22f7d3db3b740517e7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TWKDOJD455F4JI75KAOMYFPCBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Overlap Removal Algorithms: A Comparative Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arnaud Sallaberry, Fati Chen, Laurent Piccinini, Pascal Poncelet","submitted_at":"2019-08-20T14:01:39Z","abstract_excerpt":"Many algorithms have been designed to remove node overlapping, and many quality criteria and associated metrics have been proposed to evaluate those algorithms. Unfortunately, a complete comparison of the algorithms based on some metrics that evaluate the quality has never been provided and it is thus difficult for a visualization designer to select the algorithm that best suits his needs. In this paper, we review 21 metrics available in the literature, classify them according to the quality criteria they try to capture, and select a representative one for each class. Based on the selected met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07363","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07363/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-05T00:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b76gw8Bbhwmm4DsUS54mEA50aWafWzs+eC/5KyvgZYKmpEJYn0dUdPIjyIyO1j2D+bzMPmQcacq3TqnuXILcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:29:40.590801Z"},"content_sha256":"a61882f1d45cf3be2415b818d2346407b80042218c1e0175eca42e13690780ce","schema_version":"1.0","event_id":"sha256:a61882f1d45cf3be2415b818d2346407b80042218c1e0175eca42e13690780ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWKDOJD455F4JI75KAOMYFPCBN/bundle.json","state_url":"https://pith.science/pith/TWKDOJD455F4JI75KAOMYFPCBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWKDOJD455F4JI75KAOMYFPCBN/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-08-16T12:29:40Z","links":{"resolver":"https://pith.science/pith/TWKDOJD455F4JI75KAOMYFPCBN","bundle":"https://pith.science/pith/TWKDOJD455F4JI75KAOMYFPCBN/bundle.json","state":"https://pith.science/pith/TWKDOJD455F4JI75KAOMYFPCBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWKDOJD455F4JI75KAOMYFPCBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TWKDOJD455F4JI75KAOMYFPCBN","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":"6da1d4ab6407b84400ed873259949f8a4365223bb9b944f52f57ab7b153c973e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T14:01:39Z","title_canon_sha256":"bb0f02f031d5629c71586be13a6f95c34b78739865ad34e11576301511fb2a38"},"schema_version":"1.0","source":{"id":"1908.07363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07363","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07363v2","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07363","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"TWKDOJD455F4","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_16","alias_value":"TWKDOJD455F4JI75","created_at":"2026-07-05T00:02:39Z"},{"alias_kind":"pith_short_8","alias_value":"TWKDOJD4","created_at":"2026-07-05T00:02:39Z"}],"graph_snapshots":[{"event_id":"sha256:a61882f1d45cf3be2415b818d2346407b80042218c1e0175eca42e13690780ce","target":"graph","created_at":"2026-07-05T00:02:39Z","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/1908.07363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many algorithms have been designed to remove node overlapping, and many quality criteria and associated metrics have been proposed to evaluate those algorithms. Unfortunately, a complete comparison of the algorithms based on some metrics that evaluate the quality has never been provided and it is thus difficult for a visualization designer to select the algorithm that best suits his needs. In this paper, we review 21 metrics available in the literature, classify them according to the quality criteria they try to capture, and select a representative one for each class. Based on the selected met","authors_text":"Arnaud Sallaberry, Fati Chen, Laurent Piccinini, Pascal Poncelet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07363","kind":"arxiv","version":2},"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:b46630ee544dad092ff4e86891570afb421ea9b29aa1b22f7d3db3b740517e7b","target":"record","created_at":"2026-07-05T00:02:39Z","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":"6da1d4ab6407b84400ed873259949f8a4365223bb9b944f52f57ab7b153c973e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T14:01:39Z","title_canon_sha256":"bb0f02f031d5629c71586be13a6f95c34b78739865ad34e11576301511fb2a38"},"schema_version":"1.0","source":{"id":"1908.07363","kind":"arxiv","version":2}},"canonical_sha256":"9d9437247cef4bc4a3fd501ccc15e20b6cfc401ffcd2d4bc9d3b941a18415ccc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d9437247cef4bc4a3fd501ccc15e20b6cfc401ffcd2d4bc9d3b941a18415ccc","first_computed_at":"2026-07-05T00:02:39.916596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:39.916596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PFZ1/Th7X4cBX0cL57Xga7cM0pWtPJlIWjJNbrG4ySMTqpUoMk+3PO+8EovHBFgWxpS1zBe/IplNIC7kUBAHCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:39.916978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b46630ee544dad092ff4e86891570afb421ea9b29aa1b22f7d3db3b740517e7b","sha256:a61882f1d45cf3be2415b818d2346407b80042218c1e0175eca42e13690780ce"],"state_sha256":"c29067f76b639572db57200c53d04cf3f04c80b51f79950f130d417613e3bcdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3t+T2reixF3AD9fR8pKoRBx4OkzzfYlQQoqGF9XlCpI+ICLfBm8QTtIyMexOl92kKvi6tXlN6HERCmPog5fCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:29:40.594806Z","bundle_sha256":"d3efa39d2b0949eaa16926000410ac609a127d938eaa6fb615c7f39c9d0f62e0"}}