{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H5IJS6UU64HQGMSKLM7SVRUSL4","short_pith_number":"pith:H5IJS6UU","schema_version":"1.0","canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","source":{"kind":"arxiv","id":"2407.12208","version":3},"attestation_state":"computed","paper":{"title":"Computing k-means in mixed precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Lloyd's k-means remains stable when distance computations drop to lower precision.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Erin Carson, Xiaobo Liu, Xinye Chen","submitted_at":"2024-07-16T22:48:35Z","abstract_excerpt":"Motivated by the increasing availability of low- and mixed-precision arithmetic on modern hardware, we develop mixed-precision variants of Lloyd's algorithm for k-means clustering. The main ingredient is a family of mixed-precision kernels for Euclidean distance computation. These kernels are guided by rounding-error analysis and use a simple reliability test to decide whether the expanded distance formula can be evaluated safely with low precision or a higher-precision correction by the direct distance formula is required. Thus, most distance computations can be carried out with low precision"},"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":"2407.12208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T22:48:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d531839e4ef0286488fab95813b30f748cc00a964c7a5d5ae66d67bbe4aa08d9","abstract_canon_sha256":"e3dfddfb633750079e163782644a8cfe51de1e6260ba83f569301e629a67c1fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:46.395198Z","signature_b64":"4fFmq+pp9Lpsinxi+0BbT6Pxj9ujmqHcUDmOSD2+Joa6bHNSX0adzLD5/MZrxB+dpslttykKcvTj2vPgnaQ4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","last_reissued_at":"2026-05-26T02:03:46.394219Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:46.394219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing k-means in mixed precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Lloyd's k-means remains stable when distance computations drop to lower precision.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Erin Carson, Xiaobo Liu, Xinye Chen","submitted_at":"2024-07-16T22:48:35Z","abstract_excerpt":"Motivated by the increasing availability of low- and mixed-precision arithmetic on modern hardware, we develop mixed-precision variants of Lloyd's algorithm for k-means clustering. The main ingredient is a family of mixed-precision kernels for Euclidean distance computation. These kernels are guided by rounding-error analysis and use a simple reliability test to decide whether the expanded distance formula can be evaluated safely with low precision or a higher-precision correction by the direct distance formula is required. Thus, most distance computations can be carried out with low precision"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We confirm the stability of the widely used distance computation formula. We propose a mixed-precision framework for k-means computation and investigate the effects of low-precision distance computation within the framework. Through extensive simulations on various data clustering and image segmentation tasks, we verify the applicability and robustness of the mixed precision k-means method.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The simulations on the chosen datasets and tasks are representative of the numerical behavior that will occur in other k-means workloads; the paper does not provide a general proof that low-precision distance computation remains stable for arbitrary data distributions or cluster counts.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Mixed-precision Lloyd's k-means remains stable and effective for normalized data in clustering and image segmentation tasks, with care needed for unnormalized data to avoid overflow.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Lloyd's k-means remains stable when distance computations drop to lower precision.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8d04226398625274e9377981d426770eb9761ee4ada44c981b8a934f50c5a71c"},"source":{"id":"2407.12208","kind":"arxiv","version":3},"verdict":{"id":"167991de-a756-4ab3-9378-af608c13f217","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T22:31:09.317633Z","strongest_claim":"We confirm the stability of the widely used distance computation formula. We propose a mixed-precision framework for k-means computation and investigate the effects of low-precision distance computation within the framework. Through extensive simulations on various data clustering and image segmentation tasks, we verify the applicability and robustness of the mixed precision k-means method.","one_line_summary":"Mixed-precision Lloyd's k-means remains stable and effective for normalized data in clustering and image segmentation tasks, with care needed for unnormalized data to avoid overflow.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The simulations on the chosen datasets and tasks are representative of the numerical behavior that will occur in other k-means workloads; the paper does not provide a general proof that low-precision distance computation remains stable for arbitrary data distributions or cluster counts.","pith_extraction_headline":"Lloyd's k-means remains stable when distance computations drop to lower precision."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.12208/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.12208","created_at":"2026-05-26T02:03:46.394359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12208v3","created_at":"2026-05-26T02:03:46.394359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12208","created_at":"2026-05-26T02:03:46.394359+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5IJS6UU64HQ","created_at":"2026-05-26T02:03:46.394359+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5IJS6UU64HQGMSK","created_at":"2026-05-26T02:03:46.394359+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5IJS6UU","created_at":"2026-05-26T02:03:46.394359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4","json":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4.json","graph_json":"https://pith.science/api/pith-number/H5IJS6UU64HQGMSKLM7SVRUSL4/graph.json","events_json":"https://pith.science/api/pith-number/H5IJS6UU64HQGMSKLM7SVRUSL4/events.json","paper":"https://pith.science/paper/H5IJS6UU"},"agent_actions":{"view_html":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4","download_json":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4.json","view_paper":"https://pith.science/paper/H5IJS6UU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12208&json=true","fetch_graph":"https://pith.science/api/pith-number/H5IJS6UU64HQGMSKLM7SVRUSL4/graph.json","fetch_events":"https://pith.science/api/pith-number/H5IJS6UU64HQGMSKLM7SVRUSL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/action/storage_attestation","attest_author":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/action/author_attestation","sign_citation":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/action/citation_signature","submit_replication":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/action/replication_record"}},"created_at":"2026-05-26T02:03:46.394359+00:00","updated_at":"2026-05-26T02:03:46.394359+00:00"}