{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:H5IJS6UU64HQGMSKLM7SVRUSL4","short_pith_number":"pith:H5IJS6UU","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"},"canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","source":{"kind":"arxiv","id":"2407.12208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.12208","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"2407.12208v3","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12208","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"H5IJS6UU64HQ","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_16","alias_value":"H5IJS6UU64HQGMSK","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_8","alias_value":"H5IJS6UU","created_at":"2026-05-26T02:03:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:H5IJS6UU64HQGMSKLM7SVRUSL4","target":"record","payload":{"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"},"canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","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"},"source_kind":"arxiv","source_id":"2407.12208","source_version":3,"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-26T02:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiU64mlOwJDDkpN8Jbzlo6BslH6YsQMwFJA3RFWX8DClQCIGIBF+y1sW0Zf1blz5AFIzvZkDqorMJ8SpAE1ODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:42:04.785126Z"},"content_sha256":"28431c0f5e985ab77791b8dabef5ed5d98fae9a0b7b93e5719f968b22afef64d","schema_version":"1.0","event_id":"sha256:28431c0f5e985ab77791b8dabef5ed5d98fae9a0b7b93e5719f968b22afef64d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:H5IJS6UU64HQGMSKLM7SVRUSL4","target":"graph","payload":{"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"},"verdict_id":"167991de-a756-4ab3-9378-af608c13f217"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T02:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDFaf06kc7i5Qo/LQwslcUL7PYZMSiRjoqTGm2K3puEaLOWYYi3znlBD85f386CEoYuDEIeBRtDnflzeR6kOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:42:04.786046Z"},"content_sha256":"f82d15381045e3321c83e6e44b901f3ab1c9f56d64e3a0c09dac5f51c56bcad0","schema_version":"1.0","event_id":"sha256:f82d15381045e3321c83e6e44b901f3ab1c9f56d64e3a0c09dac5f51c56bcad0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/bundle.json","state_url":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/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-08-03T08:42:04Z","links":{"resolver":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4","bundle":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/bundle.json","state":"https://pith.science/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5IJS6UU64HQGMSKLM7SVRUSL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:H5IJS6UU64HQGMSKLM7SVRUSL4","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":"e3dfddfb633750079e163782644a8cfe51de1e6260ba83f569301e629a67c1fb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T22:48:35Z","title_canon_sha256":"d531839e4ef0286488fab95813b30f748cc00a964c7a5d5ae66d67bbe4aa08d9"},"schema_version":"1.0","source":{"id":"2407.12208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.12208","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"2407.12208v3","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12208","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"H5IJS6UU64HQ","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_16","alias_value":"H5IJS6UU64HQGMSK","created_at":"2026-05-26T02:03:46Z"},{"alias_kind":"pith_short_8","alias_value":"H5IJS6UU","created_at":"2026-05-26T02:03:46Z"}],"graph_snapshots":[{"event_id":"sha256:f82d15381045e3321c83e6e44b901f3ab1c9f56d64e3a0c09dac5f51c56bcad0","target":"graph","created_at":"2026-05-26T02:03:46Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Lloyd's k-means remains stable when distance computations drop to lower precision."}],"snapshot_sha256":"8d04226398625274e9377981d426770eb9761ee4ada44c981b8a934f50c5a71c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.12208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Erin Carson, Xiaobo Liu, Xinye Chen","cross_cats":["cs.NA"],"headline":"Lloyd's k-means remains stable when distance computations drop to lower precision.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T22:48:35Z","title":"Computing k-means in mixed precision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12208","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-23T22:31:09.317633Z","id":"167991de-a756-4ab3-9378-af608c13f217","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Lloyd's k-means remains stable when distance computations drop to lower precision.","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.","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."}},"verdict_id":"167991de-a756-4ab3-9378-af608c13f217"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28431c0f5e985ab77791b8dabef5ed5d98fae9a0b7b93e5719f968b22afef64d","target":"record","created_at":"2026-05-26T02:03:46Z","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":"e3dfddfb633750079e163782644a8cfe51de1e6260ba83f569301e629a67c1fb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-07-16T22:48:35Z","title_canon_sha256":"d531839e4ef0286488fab95813b30f748cc00a964c7a5d5ae66d67bbe4aa08d9"},"schema_version":"1.0","source":{"id":"2407.12208","kind":"arxiv","version":3}},"canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f50997a94f70f03324a5b3f2ac6925f237ac0804722d273fbd0010392da7d5c","first_computed_at":"2026-05-26T02:03:46.394219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:03:46.394219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4fFmq+pp9Lpsinxi+0BbT6Pxj9ujmqHcUDmOSD2+Joa6bHNSX0adzLD5/MZrxB+dpslttykKcvTj2vPgnaQ4AQ==","signature_status":"signed_v1","signed_at":"2026-05-26T02:03:46.395198Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.12208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28431c0f5e985ab77791b8dabef5ed5d98fae9a0b7b93e5719f968b22afef64d","sha256:f82d15381045e3321c83e6e44b901f3ab1c9f56d64e3a0c09dac5f51c56bcad0"],"state_sha256":"00004123cf6c3394c7674625fd9bfdac851250ec7b25a4e25ecec489035bd83d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0a6tIeb8T0/RBZJ8dp5EnoCXqrdb1805GBAlKv4smNaWNAwvNDiqNX67ysvGwZY/n8spRgbLSCWDrXew4ehbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T08:42:04.793439Z","bundle_sha256":"903a2e67be5a29138ca05de02126a07bcc302baa82a882b5cd794bdc37f58458"}}