{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YVHRVIRAJC56ZO5GKDQYBHW4N4","short_pith_number":"pith:YVHRVIRA","canonical_record":{"source":{"id":"1602.06687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T09:01:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a83b27ccb81fdb983775f70c8feff91ad712936cdbdc957c0d9621f630534eed","abstract_canon_sha256":"32cb90bb527f5c9da9b329cabb802643a7deafad4b5ab99f6f9ea47859ce2fef"},"schema_version":"1.0"},"canonical_sha256":"c54f1aa22048bbecbba650e1809edc6f394ddb0310c79edfe66ad9ab5e816cd2","source":{"kind":"arxiv","id":"1602.06687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06687","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06687v1","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06687","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"YVHRVIRAJC56","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVHRVIRAJC56ZO5G","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVHRVIRA","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YVHRVIRAJC56ZO5GKDQYBHW4N4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T09:01:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a83b27ccb81fdb983775f70c8feff91ad712936cdbdc957c0d9621f630534eed","abstract_canon_sha256":"32cb90bb527f5c9da9b329cabb802643a7deafad4b5ab99f6f9ea47859ce2fef"},"schema_version":"1.0"},"canonical_sha256":"c54f1aa22048bbecbba650e1809edc6f394ddb0310c79edfe66ad9ab5e816cd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:07.678357Z","signature_b64":"KtqlYk16chmH9swr83gbwmLtSOimAC4hRizYF3rvkefDU+FhS9YxbixKt/ei3315c+1Tj473k4whNU3grS0PDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c54f1aa22048bbecbba650e1809edc6f394ddb0310c79edfe66ad9ab5e816cd2","last_reissued_at":"2026-05-18T01:20:07.677666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:07.677666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06687","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:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFX98cJMeMaE4g+GD6t+TZg/HSQKtdAG6ixb7mCE6ZOXXu/TS2d8dq+h2vl1BHOe2XC+Ig9bcaJ64bLdrNW2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:58:32.340684Z"},"content_sha256":"dad49b9eec073948b5bc7567d8d222f63a5b7c9c9ea64059168b46abf99e4612","schema_version":"1.0","event_id":"sha256:dad49b9eec073948b5bc7567d8d222f63a5b7c9c9ea64059168b46abf99e4612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YVHRVIRAJC56ZO5GKDQYBHW4N4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective and Efficient Approach for Clusterability Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Adolfsson, Margareta Ackerman, Naomi Brownstein","submitted_at":"2016-02-22T09:01:10Z","abstract_excerpt":"Clustering is an essential data mining tool that aims to discover inherent cluster structure in data. As such, the study of clusterability, which evaluates whether data possesses such structure, is an integral part of cluster analysis. Yet, despite their central role in the theory and application of clustering, current notions of clusterability fall short in two crucial aspects that render them impractical; most are computationally infeasible and others fail to classify the structure of real datasets.\n  In this paper, we propose a novel approach to clusterability evaluation that is both comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06687","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:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu3ANBFXnGeRgyuOR6i6093rkJmW4sNdfbq6+PYfusYA51cnQa/wGhrCjAEpsjnPVOlXnJwjBUfSw/S8IJS0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:58:32.341391Z"},"content_sha256":"b716356f26851c75c8539bb98d6fde07d58a3d7ec48dcb72394c703db60e48e7","schema_version":"1.0","event_id":"sha256:b716356f26851c75c8539bb98d6fde07d58a3d7ec48dcb72394c703db60e48e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/bundle.json","state_url":"https://pith.science/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/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-06T19:58:32Z","links":{"resolver":"https://pith.science/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4","bundle":"https://pith.science/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/bundle.json","state":"https://pith.science/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVHRVIRAJC56ZO5GKDQYBHW4N4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YVHRVIRAJC56ZO5GKDQYBHW4N4","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":"32cb90bb527f5c9da9b329cabb802643a7deafad4b5ab99f6f9ea47859ce2fef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T09:01:10Z","title_canon_sha256":"a83b27ccb81fdb983775f70c8feff91ad712936cdbdc957c0d9621f630534eed"},"schema_version":"1.0","source":{"id":"1602.06687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06687","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06687v1","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06687","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"YVHRVIRAJC56","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVHRVIRAJC56ZO5G","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVHRVIRA","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b716356f26851c75c8539bb98d6fde07d58a3d7ec48dcb72394c703db60e48e7","target":"graph","created_at":"2026-05-18T01:20: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"},"paper":{"abstract_excerpt":"Clustering is an essential data mining tool that aims to discover inherent cluster structure in data. As such, the study of clusterability, which evaluates whether data possesses such structure, is an integral part of cluster analysis. Yet, despite their central role in the theory and application of clustering, current notions of clusterability fall short in two crucial aspects that render them impractical; most are computationally infeasible and others fail to classify the structure of real datasets.\n  In this paper, we propose a novel approach to clusterability evaluation that is both comput","authors_text":"Andreas Adolfsson, Margareta Ackerman, Naomi Brownstein","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T09:01:10Z","title":"An Effective and Efficient Approach for Clusterability Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06687","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:dad49b9eec073948b5bc7567d8d222f63a5b7c9c9ea64059168b46abf99e4612","target":"record","created_at":"2026-05-18T01:20: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":"32cb90bb527f5c9da9b329cabb802643a7deafad4b5ab99f6f9ea47859ce2fef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T09:01:10Z","title_canon_sha256":"a83b27ccb81fdb983775f70c8feff91ad712936cdbdc957c0d9621f630534eed"},"schema_version":"1.0","source":{"id":"1602.06687","kind":"arxiv","version":1}},"canonical_sha256":"c54f1aa22048bbecbba650e1809edc6f394ddb0310c79edfe66ad9ab5e816cd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c54f1aa22048bbecbba650e1809edc6f394ddb0310c79edfe66ad9ab5e816cd2","first_computed_at":"2026-05-18T01:20:07.677666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:07.677666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtqlYk16chmH9swr83gbwmLtSOimAC4hRizYF3rvkefDU+FhS9YxbixKt/ei3315c+1Tj473k4whNU3grS0PDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:07.678357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dad49b9eec073948b5bc7567d8d222f63a5b7c9c9ea64059168b46abf99e4612","sha256:b716356f26851c75c8539bb98d6fde07d58a3d7ec48dcb72394c703db60e48e7"],"state_sha256":"5cf84521ec45abf9a36d7adc80ec9753e4e40fe5fd7119141559636298b46f2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Te5w/Ik9xjx4frHx3uu1gvI2z1UJFxqeb2nKF5dAP84se80tYEyKteroggu1wj3hBkR+exyX7LHSqul2LOUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:58:32.345295Z","bundle_sha256":"5526fe9a0e014e25d6e5a99f7ae328b44ee08f64c4ae1cad2c6c164f7991463d"}}