{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RVSZZML63KAECXTNN4QRWXYEKW","short_pith_number":"pith:RVSZZML6","schema_version":"1.0","canonical_sha256":"8d659cb17eda80415e6d6f211b5f045596a2e46fec28caecb1dd119bdccf6186","source":{"kind":"arxiv","id":"2405.20744","version":5},"attestation_state":"computed","paper":{"title":"On the sequential convergence of Lloyd's algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edouard Pauwels, Elsa Cazelles, L\\'eo Portales","submitted_at":"2024-05-31T10:15:14Z","abstract_excerpt":"Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as a gradient method on a certain quantization functional which is given by optimal transport. We study the sequential convergence (to a single accumulation point) for two variants of Lloyd's method: (i) optimal quantization with an arbitrary discrete measure and (ii) uniform quantization with a uniform discrete measure. For both cases, we prove sequential conv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.20744","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-31T10:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"9a41c3bedfb0c4d7a9a20ec3f5af93046b45a303e59fa6c1bb435e388298bae0","abstract_canon_sha256":"ed797500fd8fd9329ee1a2273122705f095380e04da6cab3855f0ac46ed68286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:39.691500Z","signature_b64":"/SRexaBco7fGAWmcshZnSMUcI2ScEIdgxQ3v5iZqvCZQ2pRP/wQo4uNvRTdMAL7q1nEwC60MVnNDLcM0/uy7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d659cb17eda80415e6d6f211b5f045596a2e46fec28caecb1dd119bdccf6186","last_reissued_at":"2026-05-18T02:44:39.690846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:39.690846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sequential convergence of Lloyd's algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edouard Pauwels, Elsa Cazelles, L\\'eo Portales","submitted_at":"2024-05-31T10:15:14Z","abstract_excerpt":"Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as a gradient method on a certain quantization functional which is given by optimal transport. We study the sequential convergence (to a single accumulation point) for two variants of Lloyd's method: (i) optimal quantization with an arbitrary discrete measure and (ii) uniform quantization with a uniform discrete measure. For both cases, we prove sequential conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20744","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.20744","created_at":"2026-05-18T02:44:39.690945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20744v5","created_at":"2026-05-18T02:44:39.690945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20744","created_at":"2026-05-18T02:44:39.690945+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVSZZML63KAE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVSZZML63KAECXTN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVSZZML6","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10600","citing_title":"Weighted quantization using MMD: From mean field to mean shift via gradient flows","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW","json":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW.json","graph_json":"https://pith.science/api/pith-number/RVSZZML63KAECXTNN4QRWXYEKW/graph.json","events_json":"https://pith.science/api/pith-number/RVSZZML63KAECXTNN4QRWXYEKW/events.json","paper":"https://pith.science/paper/RVSZZML6"},"agent_actions":{"view_html":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW","download_json":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW.json","view_paper":"https://pith.science/paper/RVSZZML6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20744&json=true","fetch_graph":"https://pith.science/api/pith-number/RVSZZML63KAECXTNN4QRWXYEKW/graph.json","fetch_events":"https://pith.science/api/pith-number/RVSZZML63KAECXTNN4QRWXYEKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW/action/storage_attestation","attest_author":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW/action/author_attestation","sign_citation":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW/action/citation_signature","submit_replication":"https://pith.science/pith/RVSZZML63KAECXTNN4QRWXYEKW/action/replication_record"}},"created_at":"2026-05-18T02:44:39.690945+00:00","updated_at":"2026-05-18T02:44:39.690945+00:00"}