{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7YBKQCI47Y2YFCKDKKVCNAHD5I","short_pith_number":"pith:7YBKQCI4","canonical_record":{"source":{"id":"1501.00437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-02T17:10:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"132fb5fa945aee42510e719840f756cf9ac2e60ea07d5cc972bb6e7ffadde489","abstract_canon_sha256":"3443f3e8e82e0f0b06843920f72a2df0320b96450c89a29012a10c7622d6e82c"},"schema_version":"1.0"},"canonical_sha256":"fe02a8091cfe3582894352aa2680e3ea1cb2da09e89a343d28173015a35bf514","source":{"kind":"arxiv","id":"1501.00437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00437","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00437v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00437","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"7YBKQCI47Y2Y","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YBKQCI47Y2YFCKD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YBKQCI4","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7YBKQCI47Y2YFCKDKKVCNAHD5I","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-02T17:10:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"132fb5fa945aee42510e719840f756cf9ac2e60ea07d5cc972bb6e7ffadde489","abstract_canon_sha256":"3443f3e8e82e0f0b06843920f72a2df0320b96450c89a29012a10c7622d6e82c"},"schema_version":"1.0"},"canonical_sha256":"fe02a8091cfe3582894352aa2680e3ea1cb2da09e89a343d28173015a35bf514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.183070Z","signature_b64":"cSqETd/uD6hGy0n0Ryr5p1Q7T+r35Hm7ti7erJYfmpMpJCWu4Atg6iA5Sc5EJalx5k/NkipkbYMfWVn2TPZUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe02a8091cfe3582894352aa2680e3ea1cb2da09e89a343d28173015a35bf514","last_reissued_at":"2026-05-18T02:30:09.182419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.182419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00437","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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTBh83kjJT5TZH7Gi+bqggkuXc7OpHT1LPEFQVIlYWSgIrULZ96ZuoxhQwDdKyJPgsSDEI20Uwn7iABKEJDdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:43:13.881231Z"},"content_sha256":"5351124d5e5438f61889e5ed721189001725b2bfcd7efe48778238632afdd01c","schema_version":"1.0","event_id":"sha256:5351124d5e5438f61889e5ed721189001725b2bfcd7efe48778238632afdd01c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7YBKQCI47Y2YFCKDKKVCNAHD5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Feasibility of Clustering under Clusterability Assumptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Shai Ben-David","submitted_at":"2015-01-02T17:10:52Z","abstract_excerpt":"It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being routinely carried out. One approach for providing theoretical understanding of this seeming discrepancy is to come up with notions of clusterability that distinguish realistically interesting input data from worst-case data sets. The hope is that there will be clustering algorithms that are provably efficient on such 'clusterable' instances. In other words, hope that \"Clustering is difficult only when it does not matter\" (CDNM thesis, for short).\n  We believe that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00437","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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ls3EieewcCqmaIe8PRS8VSyldQ/JeB+8VHJetLjE9ABYsvTVsHx/6M85EhFuIV77f+bXwP1wQ1kyzp314ZXGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:43:13.881994Z"},"content_sha256":"c7877bc20d89ceaec4b4023fc50ea464de3990c41f1be6be04693d047912e215","schema_version":"1.0","event_id":"sha256:c7877bc20d89ceaec4b4023fc50ea464de3990c41f1be6be04693d047912e215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/bundle.json","state_url":"https://pith.science/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/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-05-25T17:43:13Z","links":{"resolver":"https://pith.science/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I","bundle":"https://pith.science/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/bundle.json","state":"https://pith.science/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YBKQCI47Y2YFCKDKKVCNAHD5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7YBKQCI47Y2YFCKDKKVCNAHD5I","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":"3443f3e8e82e0f0b06843920f72a2df0320b96450c89a29012a10c7622d6e82c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-02T17:10:52Z","title_canon_sha256":"132fb5fa945aee42510e719840f756cf9ac2e60ea07d5cc972bb6e7ffadde489"},"schema_version":"1.0","source":{"id":"1501.00437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00437","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00437v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00437","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"7YBKQCI47Y2Y","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YBKQCI47Y2YFCKD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YBKQCI4","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c7877bc20d89ceaec4b4023fc50ea464de3990c41f1be6be04693d047912e215","target":"graph","created_at":"2026-05-18T02:30:09Z","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":"It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being routinely carried out. One approach for providing theoretical understanding of this seeming discrepancy is to come up with notions of clusterability that distinguish realistically interesting input data from worst-case data sets. The hope is that there will be clustering algorithms that are provably efficient on such 'clusterable' instances. In other words, hope that \"Clustering is difficult only when it does not matter\" (CDNM thesis, for short).\n  We believe that t","authors_text":"Shai Ben-David","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-02T17:10:52Z","title":"Computational Feasibility of Clustering under Clusterability Assumptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00437","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:5351124d5e5438f61889e5ed721189001725b2bfcd7efe48778238632afdd01c","target":"record","created_at":"2026-05-18T02:30:09Z","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":"3443f3e8e82e0f0b06843920f72a2df0320b96450c89a29012a10c7622d6e82c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-02T17:10:52Z","title_canon_sha256":"132fb5fa945aee42510e719840f756cf9ac2e60ea07d5cc972bb6e7ffadde489"},"schema_version":"1.0","source":{"id":"1501.00437","kind":"arxiv","version":1}},"canonical_sha256":"fe02a8091cfe3582894352aa2680e3ea1cb2da09e89a343d28173015a35bf514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe02a8091cfe3582894352aa2680e3ea1cb2da09e89a343d28173015a35bf514","first_computed_at":"2026-05-18T02:30:09.182419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:09.182419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSqETd/uD6hGy0n0Ryr5p1Q7T+r35Hm7ti7erJYfmpMpJCWu4Atg6iA5Sc5EJalx5k/NkipkbYMfWVn2TPZUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:09.183070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5351124d5e5438f61889e5ed721189001725b2bfcd7efe48778238632afdd01c","sha256:c7877bc20d89ceaec4b4023fc50ea464de3990c41f1be6be04693d047912e215"],"state_sha256":"3be6060a6dabe9d4d83837d5174fbf2ce150ed999f4139c3136969b2e1381b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgIC6Q6/f1gJNca906Zt1Uo3alskKsIp25h2dl7r5AY/yUlvHOmjnuY2Ka66e/DskGtV+ezXYNiK7VpEatwsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:43:13.885915Z","bundle_sha256":"4db9d97b61694a5dcb5a47d090e8ff4dd54b8beffa1a4add31a520cd388a326c"}}