{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:37QRJHDKOXOFVZOYJNQ6PQY2DW","short_pith_number":"pith:37QRJHDK","canonical_record":{"source":{"id":"1610.08738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-27T12:13:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"211b4f26113c3728d4ec908e63ece16c093c6fc7ae84f7e34c224080be09b59d","abstract_canon_sha256":"ba809aa057cf3e5d2f2395e45e1f9d3e812c93af4851569b41280cab7f9ad2f2"},"schema_version":"1.0"},"canonical_sha256":"dfe1149c6a75dc5ae5d84b61e7c31a1d8b1e2db53d08f423bb619141f4e152a9","source":{"kind":"arxiv","id":"1610.08738","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08738","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08738v4","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08738","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"37QRJHDKOXOF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37QRJHDKOXOFVZOY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37QRJHDK","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:37QRJHDKOXOFVZOYJNQ6PQY2DW","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-27T12:13:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"211b4f26113c3728d4ec908e63ece16c093c6fc7ae84f7e34c224080be09b59d","abstract_canon_sha256":"ba809aa057cf3e5d2f2395e45e1f9d3e812c93af4851569b41280cab7f9ad2f2"},"schema_version":"1.0"},"canonical_sha256":"dfe1149c6a75dc5ae5d84b61e7c31a1d8b1e2db53d08f423bb619141f4e152a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:59.330143Z","signature_b64":"XHlC5QIcS3IsN2feZyWyux5OH1Ib0999VsgSQbCFMQC/uCTp9vBUq/XYyVnPCMUcodYb7EqIiJQH3bb8TGTWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe1149c6a75dc5ae5d84b61e7c31a1d8b1e2db53d08f423bb619141f4e152a9","last_reissued_at":"2026-05-18T00:50:59.329581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:59.329581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08738","source_version":4,"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-18T00:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi1oLXpFeyCalYuuGvlKoW3twFkJIOcZt/li2gmxNT18AOJFjft/rFlJUF4ZgM9U8nxGKyOTcWldezQYElPWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:58:24.275959Z"},"content_sha256":"e2d5793f1b1eec3534a5d3bce9abda3fe85313769ad1afd46cb4ca86ca7e4cad","schema_version":"1.0","event_id":"sha256:e2d5793f1b1eec3534a5d3bce9abda3fe85313769ad1afd46cb4ca86ca7e4cad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:37QRJHDKOXOFVZOYJNQ6PQY2DW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive K-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nicolas Keriven (PANAMA), Nicolas Tremblay (GIPSA-CICS), R\\'emi Gribonval (PANAMA), Yann Traonmilin (PANAMA)","submitted_at":"2016-10-27T12:13:05Z","abstract_excerpt":"The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the training dataset. We demonstrate empirically that CKM performs similarly to Lloyd-Max, for a sketch size proportional to the number of cen-troids times the ambient dimension, and independent of the size of the original dataset. Given the sketch, the computational complexity of CKM is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08738","kind":"arxiv","version":4},"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-18T00:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IGMerm05qbSY/6sNSUX6ZjH71fCw+aKrL++dxgF8xcHuVhqULShRjfhLgpQBBRHi/3ct2rrCiAOMOkNc+HaKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:58:24.276298Z"},"content_sha256":"cecb438a3e6f56107886d9d88401f8f23d55a1e795688d236ecd618b08c1b4e2","schema_version":"1.0","event_id":"sha256:cecb438a3e6f56107886d9d88401f8f23d55a1e795688d236ecd618b08c1b4e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/bundle.json","state_url":"https://pith.science/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/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-03T08:58:24Z","links":{"resolver":"https://pith.science/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW","bundle":"https://pith.science/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/bundle.json","state":"https://pith.science/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37QRJHDKOXOFVZOYJNQ6PQY2DW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:37QRJHDKOXOFVZOYJNQ6PQY2DW","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":"ba809aa057cf3e5d2f2395e45e1f9d3e812c93af4851569b41280cab7f9ad2f2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-27T12:13:05Z","title_canon_sha256":"211b4f26113c3728d4ec908e63ece16c093c6fc7ae84f7e34c224080be09b59d"},"schema_version":"1.0","source":{"id":"1610.08738","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08738","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08738v4","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08738","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"37QRJHDKOXOF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37QRJHDKOXOFVZOY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37QRJHDK","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:cecb438a3e6f56107886d9d88401f8f23d55a1e795688d236ecd618b08c1b4e2","target":"graph","created_at":"2026-05-18T00:50:59Z","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":"The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the training dataset. We demonstrate empirically that CKM performs similarly to Lloyd-Max, for a sketch size proportional to the number of cen-troids times the ambient dimension, and independent of the size of the original dataset. Given the sketch, the computational complexity of CKM is a","authors_text":"Nicolas Keriven (PANAMA), Nicolas Tremblay (GIPSA-CICS), R\\'emi Gribonval (PANAMA), Yann Traonmilin (PANAMA)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-27T12:13:05Z","title":"Compressive K-means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08738","kind":"arxiv","version":4},"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:e2d5793f1b1eec3534a5d3bce9abda3fe85313769ad1afd46cb4ca86ca7e4cad","target":"record","created_at":"2026-05-18T00:50:59Z","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":"ba809aa057cf3e5d2f2395e45e1f9d3e812c93af4851569b41280cab7f9ad2f2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-27T12:13:05Z","title_canon_sha256":"211b4f26113c3728d4ec908e63ece16c093c6fc7ae84f7e34c224080be09b59d"},"schema_version":"1.0","source":{"id":"1610.08738","kind":"arxiv","version":4}},"canonical_sha256":"dfe1149c6a75dc5ae5d84b61e7c31a1d8b1e2db53d08f423bb619141f4e152a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfe1149c6a75dc5ae5d84b61e7c31a1d8b1e2db53d08f423bb619141f4e152a9","first_computed_at":"2026-05-18T00:50:59.329581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:59.329581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XHlC5QIcS3IsN2feZyWyux5OH1Ib0999VsgSQbCFMQC/uCTp9vBUq/XYyVnPCMUcodYb7EqIiJQH3bb8TGTWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:59.330143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08738","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2d5793f1b1eec3534a5d3bce9abda3fe85313769ad1afd46cb4ca86ca7e4cad","sha256:cecb438a3e6f56107886d9d88401f8f23d55a1e795688d236ecd618b08c1b4e2"],"state_sha256":"13368e1923f6b87bd39c1a8ea051ce71791aaeecb41fec31065df342a633fd9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEG2CFKJScQGIBoILQy0uJt6NI3Aq2n9BRLzqxu2hic2w/08D2fp2vDz3A1Voj+ek4kdVIi3IkYg6icvRFWODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:58:24.278271Z","bundle_sha256":"4d3b4a49d3be1ebf17ad4e8c3fb20856be7516907f74483858056c9bef010e07"}}