{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KXLY7E7F6GO6O4FBPFM7NXJKHP","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":"07dfbdfc5dca826dd15af59dec7acafb48e8eb99a105040cb1c38590ad4a1a3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:09:53Z","title_canon_sha256":"25c76a8887d3c8b1e3debb511ee7dc216839814ac1302b738fd8cb8617cec86e"},"schema_version":"1.0","source":{"id":"1712.02849","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02849","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02849v3","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02849","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"KXLY7E7F6GO6","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KXLY7E7F6GO6O4FB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KXLY7E7F","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:2a09e09465fe04872cbe1c3c0cae94255b458c668af026ece26d923bc6cea4be","target":"graph","created_at":"2026-05-17T23:45:53Z","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":"In sketched clustering, a dataset of $T$ samples is first sketched down to a vector of modest size, from which the centroids are subsequently extracted. Advantages include i) reduced storage complexity and ii) centroid extraction complexity independent of $T$. For the sketching methodology recently proposed by Keriven, et al., which can be interpreted as a random sampling of the empirical characteristic function, we propose a sketched clustering algorithm based on approximate message passing. Numerical experiments suggest that our approach is more efficient than the state-of-the-art sketched c","authors_text":"Antoine Chatalic, Evan Byrne, Philip Schniter, Remi Gribonval","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:09:53Z","title":"Sketched Clustering via Hybrid Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02849","kind":"arxiv","version":3},"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:9702a8f2c12aff6e840b3e2f403505b9d43c8a71aa84f552a2dad3ec4cc7f62a","target":"record","created_at":"2026-05-17T23:45:53Z","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":"07dfbdfc5dca826dd15af59dec7acafb48e8eb99a105040cb1c38590ad4a1a3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:09:53Z","title_canon_sha256":"25c76a8887d3c8b1e3debb511ee7dc216839814ac1302b738fd8cb8617cec86e"},"schema_version":"1.0","source":{"id":"1712.02849","kind":"arxiv","version":3}},"canonical_sha256":"55d78f93e5f19de770a17959f6dd2a3bc596d8f71cb3e1f741d9f66cbf61f9ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55d78f93e5f19de770a17959f6dd2a3bc596d8f71cb3e1f741d9f66cbf61f9ae","first_computed_at":"2026-05-17T23:45:53.322904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:53.322904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hqsiKjt2Fxbvz+OqPE0vKY76OnNirqqi/ut4NU/lNHUyC4IZI91G2Vclf4q+REQuKqdmOM3NAyYWuWnIYQ/PBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:53.323270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02849","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9702a8f2c12aff6e840b3e2f403505b9d43c8a71aa84f552a2dad3ec4cc7f62a","sha256:2a09e09465fe04872cbe1c3c0cae94255b458c668af026ece26d923bc6cea4be"],"state_sha256":"0f98409881795555208e790450d4690276ad304fdf8504cc895646ee77df9039"}