{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5ZSRZQJ34B3KPFMGL34HR5GIAB","short_pith_number":"pith:5ZSRZQJ3","schema_version":"1.0","canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","source":{"kind":"arxiv","id":"1501.01320","version":2},"attestation_state":"computed","paper":{"title":"Convergence of the $k$-Means Minimization Problem using $\\Gamma$-Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Adam M. Johansen, Florian Theil, Matthew Thorpe, Neil Cade","submitted_at":"2015-01-06T21:19:46Z","abstract_excerpt":"The $k$-means method is an iterative clustering algorithm which associates each observation with one of $k$ clusters. It traditionally employs cluster centers in the same space as the observed data. By relaxing this requirement, it is possible to apply the $k$-means method to infinite dimensional problems, for example multiple target tracking and smoothing problems in the presence of unknown data association. Via a $\\Gamma$-convergence argument, the associated optimization problem is shown to converge in the sense that both the $k$-means minimum and minimizers converge in the large data limit "},"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":"1501.01320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-06T21:19:46Z","cross_cats_sorted":["math.FA","math.OC","stat.TH"],"title_canon_sha256":"a382c3f8dffff72333a9d6828247409236654412e501c7a93b4c44fd024ff6da","abstract_canon_sha256":"1a3f8635e2fa04527841dd1d40019ba6a969b726b6c77705df868569f5fadeef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.364459Z","signature_b64":"8EoRfQni4sGZ0zlKN8ZepUuXligQNMOX63Jm25W7mMohDscjjDFO6sEtVe51cvRc/5rFKL/XIOBu6N5e/ImYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","last_reissued_at":"2026-05-18T02:19:42.363794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.363794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of the $k$-Means Minimization Problem using $\\Gamma$-Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Adam M. Johansen, Florian Theil, Matthew Thorpe, Neil Cade","submitted_at":"2015-01-06T21:19:46Z","abstract_excerpt":"The $k$-means method is an iterative clustering algorithm which associates each observation with one of $k$ clusters. It traditionally employs cluster centers in the same space as the observed data. By relaxing this requirement, it is possible to apply the $k$-means method to infinite dimensional problems, for example multiple target tracking and smoothing problems in the presence of unknown data association. Via a $\\Gamma$-convergence argument, the associated optimization problem is shown to converge in the sense that both the $k$-means minimum and minimizers converge in the large data limit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01320","kind":"arxiv","version":2},"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":"1501.01320","created_at":"2026-05-18T02:19:42.363890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01320v2","created_at":"2026-05-18T02:19:42.363890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01320","created_at":"2026-05-18T02:19:42.363890+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZSRZQJ34B3K","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZSRZQJ34B3KPFMG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZSRZQJ3","created_at":"2026-05-18T12:29:07.941421+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/5ZSRZQJ34B3KPFMGL34HR5GIAB","json":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB.json","graph_json":"https://pith.science/api/pith-number/5ZSRZQJ34B3KPFMGL34HR5GIAB/graph.json","events_json":"https://pith.science/api/pith-number/5ZSRZQJ34B3KPFMGL34HR5GIAB/events.json","paper":"https://pith.science/paper/5ZSRZQJ3"},"agent_actions":{"view_html":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB","download_json":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB.json","view_paper":"https://pith.science/paper/5ZSRZQJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01320&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZSRZQJ34B3KPFMGL34HR5GIAB/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZSRZQJ34B3KPFMGL34HR5GIAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/action/storage_attestation","attest_author":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/action/author_attestation","sign_citation":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/action/citation_signature","submit_replication":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/action/replication_record"}},"created_at":"2026-05-18T02:19:42.363890+00:00","updated_at":"2026-05-18T02:19:42.363890+00:00"}