{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6TNSV4ZPDRKPTFUHANHNEIJRLS","short_pith_number":"pith:6TNSV4ZP","schema_version":"1.0","canonical_sha256":"f4db2af32f1c54f99687034ed221315ca639a694d825802b2d8fed66a79e68d8","source":{"kind":"arxiv","id":"2308.09701","version":3},"attestation_state":"computed","paper":{"title":"Do you know what q-means?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Alessandro Luongo, Arjan Cornelissen, Ewin Tang, Joao F. Doriguello","submitted_at":"2023-08-18T17:52:12Z","abstract_excerpt":"Clustering is one of the most important tools for analysis of large datasets, and perhaps the most popular clustering algorithm is Lloyd's algorithm for $k$-means. This algorithm takes $n$ vectors $V=[v_1,\\dots,v_n]\\in\\mathbb{R}^{d\\times n}$ and outputs $k$ centroids $c_1,\\dots,c_k\\in\\mathbb{R}^d$; these partition the vectors into clusters based on which centroid is closest to a particular vector. We present a classical $\\varepsilon$-$k$-means algorithm that performs an approximate version of one iteration of Lloyd's algorithm with time complexity $\\tilde{O}\\big(\\frac{\\|V\\|_F^2}{n}\\frac{k^{2}d"},"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":"2308.09701","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T17:52:12Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"ed232c7487b1d4bceda76464ff55b9fe57fead12212aaed0c4f03ecbf4f1504b","abstract_canon_sha256":"e4e56fd45391df6fe58b1495d08453d05db49c3596ba8add7cb0b9db41e4bb08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:47.645392Z","signature_b64":"ARMlRTxeRrQPYNIAoQ3SzMegPhLPUZV6z63bfqiGdhcJwH1YWgF29SEhLp+foqyrPK4f7UXNIeiTQa4pgjiHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4db2af32f1c54f99687034ed221315ca639a694d825802b2d8fed66a79e68d8","last_reissued_at":"2026-07-05T11:38:47.644721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:47.644721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Do you know what q-means?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Alessandro Luongo, Arjan Cornelissen, Ewin Tang, Joao F. Doriguello","submitted_at":"2023-08-18T17:52:12Z","abstract_excerpt":"Clustering is one of the most important tools for analysis of large datasets, and perhaps the most popular clustering algorithm is Lloyd's algorithm for $k$-means. This algorithm takes $n$ vectors $V=[v_1,\\dots,v_n]\\in\\mathbb{R}^{d\\times n}$ and outputs $k$ centroids $c_1,\\dots,c_k\\in\\mathbb{R}^d$; these partition the vectors into clusters based on which centroid is closest to a particular vector. We present a classical $\\varepsilon$-$k$-means algorithm that performs an approximate version of one iteration of Lloyd's algorithm with time complexity $\\tilde{O}\\big(\\frac{\\|V\\|_F^2}{n}\\frac{k^{2}d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09701","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.09701/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":"2308.09701","created_at":"2026-07-05T11:38:47.644795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09701v3","created_at":"2026-07-05T11:38:47.644795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09701","created_at":"2026-07-05T11:38:47.644795+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TNSV4ZPDRKP","created_at":"2026-07-05T11:38:47.644795+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TNSV4ZPDRKPTFUH","created_at":"2026-07-05T11:38:47.644795+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TNSV4ZP","created_at":"2026-07-05T11:38:47.644795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.02826","citing_title":"Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS","json":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS.json","graph_json":"https://pith.science/api/pith-number/6TNSV4ZPDRKPTFUHANHNEIJRLS/graph.json","events_json":"https://pith.science/api/pith-number/6TNSV4ZPDRKPTFUHANHNEIJRLS/events.json","paper":"https://pith.science/paper/6TNSV4ZP"},"agent_actions":{"view_html":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS","download_json":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS.json","view_paper":"https://pith.science/paper/6TNSV4ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09701&json=true","fetch_graph":"https://pith.science/api/pith-number/6TNSV4ZPDRKPTFUHANHNEIJRLS/graph.json","fetch_events":"https://pith.science/api/pith-number/6TNSV4ZPDRKPTFUHANHNEIJRLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS/action/storage_attestation","attest_author":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS/action/author_attestation","sign_citation":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS/action/citation_signature","submit_replication":"https://pith.science/pith/6TNSV4ZPDRKPTFUHANHNEIJRLS/action/replication_record"}},"created_at":"2026-07-05T11:38:47.644795+00:00","updated_at":"2026-07-05T11:38:47.644795+00:00"}