{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QZKW2PV322K4DQXTRGZE2WVD7R","short_pith_number":"pith:QZKW2PV3","canonical_record":{"source":{"id":"1205.4891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-22T12:25:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6f8fe100365bd55c532a48c34df78fae22f70e8c5736664b4100ebbaf40cf3a9","abstract_canon_sha256":"c4a3bf0839cf9cc02ca8ec31cacd7b5cd260c94b1cf2dd6afab13f4712eae111"},"schema_version":"1.0"},"canonical_sha256":"86556d3ebbd695c1c2f389b24d5aa3fc7192f956811c1769d44b6278f1f93337","source":{"kind":"arxiv","id":"1205.4891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4891","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4891v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4891","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"QZKW2PV322K4","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZKW2PV322K4DQXT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZKW2PV3","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QZKW2PV322K4DQXTRGZE2WVD7R","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-22T12:25:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6f8fe100365bd55c532a48c34df78fae22f70e8c5736664b4100ebbaf40cf3a9","abstract_canon_sha256":"c4a3bf0839cf9cc02ca8ec31cacd7b5cd260c94b1cf2dd6afab13f4712eae111"},"schema_version":"1.0"},"canonical_sha256":"86556d3ebbd695c1c2f389b24d5aa3fc7192f956811c1769d44b6278f1f93337","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.396259Z","signature_b64":"cOErWjSXRRLbeEH2NMJN5BBI9P0jMzMmIyvRqqP8TUgWQul69VScd3BIxpBlTH6i+HrISznDsx3TweODeXVeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86556d3ebbd695c1c2f389b24d5aa3fc7192f956811c1769d44b6278f1f93337","last_reissued_at":"2026-05-18T03:55:11.395708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.395708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4891","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdFriJ+ZSajd88fD2mZTS8SkHFMQO5RMRWcNUQw3F0JkAW7sK660cdo6tBi/fwUTmCrrXvW0A6b7ZSQ5PXzDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:33:11.480522Z"},"content_sha256":"342f2d468f4c41913f939cc23c37f3b57244b752190e96a026401d70a0b6c6a7","schema_version":"1.0","event_id":"sha256:342f2d468f4c41913f939cc23c37f3b57244b752190e96a026401d70a0b6c6a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QZKW2PV322K4DQXTRGZE2WVD7R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering is difficult only when it does not matter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Amit Daniely, Michael Saks, Nati Linial","submitted_at":"2012-05-22T12:25:01Z","abstract_excerpt":"Numerous papers ask how difficult it is to cluster data. We suggest that the more relevant and interesting question is how difficult it is to cluster data sets {\\em that can be clustered well}. More generally, despite the ubiquity and the great importance of clustering, we still do not have a satisfactory mathematical theory of clustering. In order to properly understand clustering, it is clearly necessary to develop a solid theoretical basis for the area. For example, from the perspective of computational complexity theory the clustering problem seems very hard. Numerous papers introduce vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4891","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KbT5LvPqZNDHsXm3sP2kwQkF/UzXJecMZorQaJJoLT8mHW189VZ4WJSeELXr+f2OgJfY2gIQQLU2d0Vv1MWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:33:11.480870Z"},"content_sha256":"e74ea5611bc0187cad2fbecd5380616c2f80efeb505c830dbdc124bca87272ea","schema_version":"1.0","event_id":"sha256:e74ea5611bc0187cad2fbecd5380616c2f80efeb505c830dbdc124bca87272ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZKW2PV322K4DQXTRGZE2WVD7R/bundle.json","state_url":"https://pith.science/pith/QZKW2PV322K4DQXTRGZE2WVD7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZKW2PV322K4DQXTRGZE2WVD7R/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-28T15:33:11Z","links":{"resolver":"https://pith.science/pith/QZKW2PV322K4DQXTRGZE2WVD7R","bundle":"https://pith.science/pith/QZKW2PV322K4DQXTRGZE2WVD7R/bundle.json","state":"https://pith.science/pith/QZKW2PV322K4DQXTRGZE2WVD7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZKW2PV322K4DQXTRGZE2WVD7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QZKW2PV322K4DQXTRGZE2WVD7R","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":"c4a3bf0839cf9cc02ca8ec31cacd7b5cd260c94b1cf2dd6afab13f4712eae111","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-22T12:25:01Z","title_canon_sha256":"6f8fe100365bd55c532a48c34df78fae22f70e8c5736664b4100ebbaf40cf3a9"},"schema_version":"1.0","source":{"id":"1205.4891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4891","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4891v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4891","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"QZKW2PV322K4","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZKW2PV322K4DQXT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZKW2PV3","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:e74ea5611bc0187cad2fbecd5380616c2f80efeb505c830dbdc124bca87272ea","target":"graph","created_at":"2026-05-18T03:55: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":"Numerous papers ask how difficult it is to cluster data. We suggest that the more relevant and interesting question is how difficult it is to cluster data sets {\\em that can be clustered well}. More generally, despite the ubiquity and the great importance of clustering, we still do not have a satisfactory mathematical theory of clustering. In order to properly understand clustering, it is clearly necessary to develop a solid theoretical basis for the area. For example, from the perspective of computational complexity theory the clustering problem seems very hard. Numerous papers introduce vari","authors_text":"Amit Daniely, Michael Saks, Nati Linial","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-22T12:25:01Z","title":"Clustering is difficult only when it does not matter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4891","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:342f2d468f4c41913f939cc23c37f3b57244b752190e96a026401d70a0b6c6a7","target":"record","created_at":"2026-05-18T03:55: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":"c4a3bf0839cf9cc02ca8ec31cacd7b5cd260c94b1cf2dd6afab13f4712eae111","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-22T12:25:01Z","title_canon_sha256":"6f8fe100365bd55c532a48c34df78fae22f70e8c5736664b4100ebbaf40cf3a9"},"schema_version":"1.0","source":{"id":"1205.4891","kind":"arxiv","version":1}},"canonical_sha256":"86556d3ebbd695c1c2f389b24d5aa3fc7192f956811c1769d44b6278f1f93337","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86556d3ebbd695c1c2f389b24d5aa3fc7192f956811c1769d44b6278f1f93337","first_computed_at":"2026-05-18T03:55:11.395708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.395708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOErWjSXRRLbeEH2NMJN5BBI9P0jMzMmIyvRqqP8TUgWQul69VScd3BIxpBlTH6i+HrISznDsx3TweODeXVeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.396259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:342f2d468f4c41913f939cc23c37f3b57244b752190e96a026401d70a0b6c6a7","sha256:e74ea5611bc0187cad2fbecd5380616c2f80efeb505c830dbdc124bca87272ea"],"state_sha256":"28da3e4d764298cdaf9a478127f4c7444932b578c4fe9b5bffbcc5d6e6dbd425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3G+k1hKHfYdFrVj4cIe5idrK//nbGbNu5SpK7tMhG0lM9U7au0Jj1HznOl146pkVgmBhMAIp8V+6POE+wpfICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T15:33:11.482707Z","bundle_sha256":"e498baa4aad517b88f3e4eadb0d93d250f8b78dae0e2e6b975197f06e3db880a"}}