{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VVBFTWPTWMWJRQ2GEXHDN6FMDJ","short_pith_number":"pith:VVBFTWPT","canonical_record":{"source":{"id":"1908.07792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T10:57:30Z","cross_cats_sorted":["cs.HC","cs.SI"],"title_canon_sha256":"19c00dd97e80eb56535639842e6add56ebb3c011907fcc1af5ccb61b0b58062d","abstract_canon_sha256":"33ed80fd0d1076a69fc38d7f72f6e0842bc66c599618c1644d13ff3b9a68fa3b"},"schema_version":"1.0"},"canonical_sha256":"ad4259d9f3b32c98c34625ce36f8ac1a649cea9f569b01775b31bcb3e7c0f564","source":{"kind":"arxiv","id":"1908.07792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07792","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07792v1","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07792","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"VVBFTWPTWMWJ","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"VVBFTWPTWMWJRQ2G","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"VVBFTWPT","created_at":"2026-07-04T23:59:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VVBFTWPTWMWJRQ2GEXHDN6FMDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T10:57:30Z","cross_cats_sorted":["cs.HC","cs.SI"],"title_canon_sha256":"19c00dd97e80eb56535639842e6add56ebb3c011907fcc1af5ccb61b0b58062d","abstract_canon_sha256":"33ed80fd0d1076a69fc38d7f72f6e0842bc66c599618c1644d13ff3b9a68fa3b"},"schema_version":"1.0"},"canonical_sha256":"ad4259d9f3b32c98c34625ce36f8ac1a649cea9f569b01775b31bcb3e7c0f564","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:01.221718Z","signature_b64":"dwJem1E71ssttL0te9XBuRXkiic0f2SpGt/pDgQjqNfTXWAR3mRwktwbEkQ4K2VA48RAOfglYgG+ZwBvgwA2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad4259d9f3b32c98c34625ce36f8ac1a649cea9f569b01775b31bcb3e7c0f564","last_reissued_at":"2026-07-04T23:59:01.221338Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:01.221338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07792","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-04T23:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMBBuQZxIVn2MDsSqqGezyp7mBJwxVksqnFZOV27+iwk0EvLx/pyMQsmy+ZOMdxOGP0TIXX4Qei6BCXlvxElAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:37:10.236857Z"},"content_sha256":"48a8c66d114bbae2bad28b57c8cd59754b4fee8657b49f1bf5cab176264ab0d3","schema_version":"1.0","event_id":"sha256:48a8c66d114bbae2bad28b57c8cd59754b4fee8657b49f1bf5cab176264ab0d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VVBFTWPTWMWJRQ2GEXHDN6FMDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quality Metric for Visualization of Clusters in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Amyra Meidiana, Daniel Keim, Peter Eades, Seok-Hee Hong","submitted_at":"2019-08-21T10:57:30Z","abstract_excerpt":"Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is no metric yet explicitly quantifying how well a drawing of a graph represents its cluster structure. We define a clustering quality metric measuring how well a node-link drawing of a graph represents the clusters contained in the graph. Experiments with deforming graph drawings verify that our metric effectively captures variations in the visual cluster quali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07792","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/1908.07792/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-04T23:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOUBlUnxqqIZbztisVWym3zYAQ8AeXrnFbUsZlBvBAaJTQ9IhYTtP0rkJQ//djbZKAdOBP21UOvLGzcn4loHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:37:10.237369Z"},"content_sha256":"f10ece2bf9e50087428116b0bd39b6bc33548b1eeb2fe180f38483db74264de2","schema_version":"1.0","event_id":"sha256:f10ece2bf9e50087428116b0bd39b6bc33548b1eeb2fe180f38483db74264de2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/bundle.json","state_url":"https://pith.science/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/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-04T05:37:10Z","links":{"resolver":"https://pith.science/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ","bundle":"https://pith.science/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/bundle.json","state":"https://pith.science/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVBFTWPTWMWJRQ2GEXHDN6FMDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VVBFTWPTWMWJRQ2GEXHDN6FMDJ","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":"33ed80fd0d1076a69fc38d7f72f6e0842bc66c599618c1644d13ff3b9a68fa3b","cross_cats_sorted":["cs.HC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T10:57:30Z","title_canon_sha256":"19c00dd97e80eb56535639842e6add56ebb3c011907fcc1af5ccb61b0b58062d"},"schema_version":"1.0","source":{"id":"1908.07792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07792","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07792v1","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07792","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"VVBFTWPTWMWJ","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"VVBFTWPTWMWJRQ2G","created_at":"2026-07-04T23:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"VVBFTWPT","created_at":"2026-07-04T23:59:01Z"}],"graph_snapshots":[{"event_id":"sha256:f10ece2bf9e50087428116b0bd39b6bc33548b1eeb2fe180f38483db74264de2","target":"graph","created_at":"2026-07-04T23:59:01Z","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.07792/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is no metric yet explicitly quantifying how well a drawing of a graph represents its cluster structure. We define a clustering quality metric measuring how well a node-link drawing of a graph represents the clusters contained in the graph. Experiments with deforming graph drawings verify that our metric effectively captures variations in the visual cluster quali","authors_text":"Amyra Meidiana, Daniel Keim, Peter Eades, Seok-Hee Hong","cross_cats":["cs.HC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T10:57:30Z","title":"A Quality Metric for Visualization of Clusters in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07792","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:48a8c66d114bbae2bad28b57c8cd59754b4fee8657b49f1bf5cab176264ab0d3","target":"record","created_at":"2026-07-04T23:59:01Z","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":"33ed80fd0d1076a69fc38d7f72f6e0842bc66c599618c1644d13ff3b9a68fa3b","cross_cats_sorted":["cs.HC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T10:57:30Z","title_canon_sha256":"19c00dd97e80eb56535639842e6add56ebb3c011907fcc1af5ccb61b0b58062d"},"schema_version":"1.0","source":{"id":"1908.07792","kind":"arxiv","version":1}},"canonical_sha256":"ad4259d9f3b32c98c34625ce36f8ac1a649cea9f569b01775b31bcb3e7c0f564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad4259d9f3b32c98c34625ce36f8ac1a649cea9f569b01775b31bcb3e7c0f564","first_computed_at":"2026-07-04T23:59:01.221338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:01.221338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dwJem1E71ssttL0te9XBuRXkiic0f2SpGt/pDgQjqNfTXWAR3mRwktwbEkQ4K2VA48RAOfglYgG+ZwBvgwA2BA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:01.221718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a8c66d114bbae2bad28b57c8cd59754b4fee8657b49f1bf5cab176264ab0d3","sha256:f10ece2bf9e50087428116b0bd39b6bc33548b1eeb2fe180f38483db74264de2"],"state_sha256":"95e83e2ea9fa6574f3b90b8b619cecdd9d47a1c34894b43f32678b8d3db0a82a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8IYAjqJZv7RuGi+zUlnyzlFKxLqfHuHwlp2qpthZpZERyZ2V2uSKaFh0O6M4/pLUCmtAmwJvHnA530nUuwMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:37:10.242541Z","bundle_sha256":"82f11c0768f0ac26f18885c30015ca1fb9ddf1df4a3ea961877617adf2e7da17"}}