{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QXL6WBYI5EOWBNGXLYYY2IPUQM","short_pith_number":"pith:QXL6WBYI","schema_version":"1.0","canonical_sha256":"85d7eb0708e91d60b4d75e318d21f4832121cd880f05a5344c89bf65a1ef04d0","source":{"kind":"arxiv","id":"1512.07548","version":1},"attestation_state":"computed","paper":{"title":"k-Means Clustering Is Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Christian Bauckhage","submitted_at":"2015-12-23T17:12:06Z","abstract_excerpt":"We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is a matrix factorization problem. These notes are meant as a reference and intended to provide a guided tour towards a result that is often mentioned but seldom made explicit in the literature."},"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":"1512.07548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-23T17:12:06Z","cross_cats_sorted":[],"title_canon_sha256":"40d9d8d87366d05847de40b9946a1a8a08a41cf15cf44c5eb3cc44980919521e","abstract_canon_sha256":"5a0a540e49aab8d5e26a23fb0c38304b6123fb63a42b9605822d47e362d08d28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.415305Z","signature_b64":"dNKBGH8TU5Gc48MTG911wcbNpjuSVJm8eF+DV5wBNT5Y0m4Mdrfx1GwPNKnmNjQizGuCs1o1sACPbOespa9BCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d7eb0708e91d60b4d75e318d21f4832121cd880f05a5344c89bf65a1ef04d0","last_reissued_at":"2026-05-18T01:23:49.414626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.414626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Means Clustering Is Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Christian Bauckhage","submitted_at":"2015-12-23T17:12:06Z","abstract_excerpt":"We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is a matrix factorization problem. These notes are meant as a reference and intended to provide a guided tour towards a result that is often mentioned but seldom made explicit in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07548","kind":"arxiv","version":1},"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":"1512.07548","created_at":"2026-05-18T01:23:49.414724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07548v1","created_at":"2026-05-18T01:23:49.414724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07548","created_at":"2026-05-18T01:23:49.414724+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXL6WBYI5EOW","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXL6WBYI5EOWBNGX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXL6WBYI","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2401.11258","citing_title":"Adaptive Quantum Optimized Centroid Initialization","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM","json":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM.json","graph_json":"https://pith.science/api/pith-number/QXL6WBYI5EOWBNGXLYYY2IPUQM/graph.json","events_json":"https://pith.science/api/pith-number/QXL6WBYI5EOWBNGXLYYY2IPUQM/events.json","paper":"https://pith.science/paper/QXL6WBYI"},"agent_actions":{"view_html":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM","download_json":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM.json","view_paper":"https://pith.science/paper/QXL6WBYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07548&json=true","fetch_graph":"https://pith.science/api/pith-number/QXL6WBYI5EOWBNGXLYYY2IPUQM/graph.json","fetch_events":"https://pith.science/api/pith-number/QXL6WBYI5EOWBNGXLYYY2IPUQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM/action/storage_attestation","attest_author":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM/action/author_attestation","sign_citation":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM/action/citation_signature","submit_replication":"https://pith.science/pith/QXL6WBYI5EOWBNGXLYYY2IPUQM/action/replication_record"}},"created_at":"2026-05-18T01:23:49.414724+00:00","updated_at":"2026-05-18T01:23:49.414724+00:00"}