{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AT6EVTLNLJRVM35B67UXSMQPCN","short_pith_number":"pith:AT6EVTLN","canonical_record":{"source":{"id":"1804.10109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-26T15:24:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"90318703e091a0b4485d4880ffe609e71df409ebe5d4000665b9dec90a755ba9","abstract_canon_sha256":"a03f21a96dae67a4dcd32fd0af08ff608df09190b4f7bfe07938c4ec9049708c"},"schema_version":"1.0"},"canonical_sha256":"04fc4acd6d5a63566fa1f7e979320f13550697885435e313b420f72bc0805c94","source":{"kind":"arxiv","id":"1804.10109","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10109","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10109v2","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10109","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"AT6EVTLNLJRV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AT6EVTLNLJRVM35B","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AT6EVTLN","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AT6EVTLNLJRVM35B67UXSMQPCN","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-26T15:24:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"90318703e091a0b4485d4880ffe609e71df409ebe5d4000665b9dec90a755ba9","abstract_canon_sha256":"a03f21a96dae67a4dcd32fd0af08ff608df09190b4f7bfe07938c4ec9049708c"},"schema_version":"1.0"},"canonical_sha256":"04fc4acd6d5a63566fa1f7e979320f13550697885435e313b420f72bc0805c94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:25.017967Z","signature_b64":"l6IqqncYtWcVRSFwhKioV7duzcjOBPk7KB1igLRMAN9aLOxNry+KAbf/QgTAni5nOQS+ssI//ReHk4R5P6gDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04fc4acd6d5a63566fa1f7e979320f13550697885435e313b420f72bc0805c94","last_reissued_at":"2026-05-18T00:09:25.017335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:25.017335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10109","source_version":2,"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:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SnyHKb4WQmOnwfang9Ik3PPL/w94GZDU+Da1EGe+SJ9NRiXMzvIV2mrmHoO+E5QmJJ7waHXyxrkIpCwpEEfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:25:33.962304Z"},"content_sha256":"b21e03ff37a0c86a2b2a0e9d7cca0288fb5399a8dbe6ffc2c1a51aeb3c29e081","schema_version":"1.0","event_id":"sha256:b21e03ff37a0c86a2b2a0e9d7cca0288fb5399a8dbe6ffc2c1a51aeb3c29e081"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AT6EVTLNLJRVM35B67UXSMQPCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantized Compressive K-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Jacques, Vincent Schellekens","submitted_at":"2018-04-26T15:24:42Z","abstract_excerpt":"The recent framework of compressive statistical learning aims at designing tractable learning algorithms that use only a heavily compressed representation-or sketch-of massive datasets. Compressive K-Means (CKM) is such a method: it estimates the centroids of data clusters from pooled, non-linear, random signatures of the learning examples. While this approach significantly reduces computational time on very large datasets, its digital implementation wastes acquisition resources because the learning examples are compressed only after the sensing stage. The present work generalizes the sketchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10109","kind":"arxiv","version":2},"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:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3U4dNwjkzC05k3XzgmTnK/TyUaeKD0oXprVRpqvpqtqMG5pBGGxXlPuxgN5I4YFTnL4qD51r9DGxxZ1xSfMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:25:33.962945Z"},"content_sha256":"0e45016d38b38707f023a0adf25154ea4ad60c1025bf16564ef99a6b160589c6","schema_version":"1.0","event_id":"sha256:0e45016d38b38707f023a0adf25154ea4ad60c1025bf16564ef99a6b160589c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AT6EVTLNLJRVM35B67UXSMQPCN/bundle.json","state_url":"https://pith.science/pith/AT6EVTLNLJRVM35B67UXSMQPCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AT6EVTLNLJRVM35B67UXSMQPCN/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-18T20:25:33Z","links":{"resolver":"https://pith.science/pith/AT6EVTLNLJRVM35B67UXSMQPCN","bundle":"https://pith.science/pith/AT6EVTLNLJRVM35B67UXSMQPCN/bundle.json","state":"https://pith.science/pith/AT6EVTLNLJRVM35B67UXSMQPCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AT6EVTLNLJRVM35B67UXSMQPCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AT6EVTLNLJRVM35B67UXSMQPCN","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":"a03f21a96dae67a4dcd32fd0af08ff608df09190b4f7bfe07938c4ec9049708c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-26T15:24:42Z","title_canon_sha256":"90318703e091a0b4485d4880ffe609e71df409ebe5d4000665b9dec90a755ba9"},"schema_version":"1.0","source":{"id":"1804.10109","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10109","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10109v2","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10109","created_at":"2026-05-18T00:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"AT6EVTLNLJRV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AT6EVTLNLJRVM35B","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AT6EVTLN","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:0e45016d38b38707f023a0adf25154ea4ad60c1025bf16564ef99a6b160589c6","target":"graph","created_at":"2026-05-18T00:09:25Z","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 recent framework of compressive statistical learning aims at designing tractable learning algorithms that use only a heavily compressed representation-or sketch-of massive datasets. Compressive K-Means (CKM) is such a method: it estimates the centroids of data clusters from pooled, non-linear, random signatures of the learning examples. While this approach significantly reduces computational time on very large datasets, its digital implementation wastes acquisition resources because the learning examples are compressed only after the sensing stage. The present work generalizes the sketchin","authors_text":"Laurent Jacques, Vincent Schellekens","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-26T15:24:42Z","title":"Quantized Compressive K-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10109","kind":"arxiv","version":2},"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:b21e03ff37a0c86a2b2a0e9d7cca0288fb5399a8dbe6ffc2c1a51aeb3c29e081","target":"record","created_at":"2026-05-18T00:09:25Z","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":"a03f21a96dae67a4dcd32fd0af08ff608df09190b4f7bfe07938c4ec9049708c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-26T15:24:42Z","title_canon_sha256":"90318703e091a0b4485d4880ffe609e71df409ebe5d4000665b9dec90a755ba9"},"schema_version":"1.0","source":{"id":"1804.10109","kind":"arxiv","version":2}},"canonical_sha256":"04fc4acd6d5a63566fa1f7e979320f13550697885435e313b420f72bc0805c94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04fc4acd6d5a63566fa1f7e979320f13550697885435e313b420f72bc0805c94","first_computed_at":"2026-05-18T00:09:25.017335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:25.017335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l6IqqncYtWcVRSFwhKioV7duzcjOBPk7KB1igLRMAN9aLOxNry+KAbf/QgTAni5nOQS+ssI//ReHk4R5P6gDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:25.017967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10109","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b21e03ff37a0c86a2b2a0e9d7cca0288fb5399a8dbe6ffc2c1a51aeb3c29e081","sha256:0e45016d38b38707f023a0adf25154ea4ad60c1025bf16564ef99a6b160589c6"],"state_sha256":"ddbc4c3ab5ad8b215a409577c9614808cfcc0a1c23c78f89293475cc21a396c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arNvrhXipy5NIzA50+ldbDdaSPJk8GK/cBs4rdHC6CQLxB3blh1nO9HeIvsxIfxLNRijsPyVtZ443fFZW4QTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:25:33.965158Z","bundle_sha256":"f077ccf52e1155f8ff603e2961413907d04e3a1e461bfe624a88f8beed31bb65"}}