{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5ZSRZQJ34B3KPFMGL34HR5GIAB","short_pith_number":"pith:5ZSRZQJ3","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"},"canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","source":{"kind":"arxiv","id":"1501.01320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01320","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01320v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01320","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"5ZSRZQJ34B3K","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZSRZQJ34B3KPFMG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZSRZQJ3","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5ZSRZQJ34B3KPFMGL34HR5GIAB","target":"record","payload":{"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"},"canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","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"},"source_kind":"arxiv","source_id":"1501.01320","source_version":2,"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeiJBInAfZVtziqk2iBD4Tauz7X8BvMZYhspY8S/L0DU8PoyWZUnC5y4k/RRMb1DFzAdjWSP9TxAR39EZpCZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:48:40.597476Z"},"content_sha256":"8c454b848bbdb430c7a09bd25e96191bf4f8da439a56023d1a893bb69db83c14","schema_version":"1.0","event_id":"sha256:8c454b848bbdb430c7a09bd25e96191bf4f8da439a56023d1a893bb69db83c14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5ZSRZQJ34B3KPFMGL34HR5GIAB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsbB4nLmX2pJk+sbSXBNSrNNGETdnVX2fXohZHfTAyn4epOSJzEDa/yUbnjgjSQaFfPxp7zCWIdyQZl6lx8NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:48:40.597828Z"},"content_sha256":"bc1ced58abefcfc19def0b902776d5bbedfa7a242bfd535f1feedb74e2aec6d0","schema_version":"1.0","event_id":"sha256:bc1ced58abefcfc19def0b902776d5bbedfa7a242bfd535f1feedb74e2aec6d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/bundle.json","state_url":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/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-06-03T06:48:40Z","links":{"resolver":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB","bundle":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/bundle.json","state":"https://pith.science/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZSRZQJ34B3KPFMGL34HR5GIAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5ZSRZQJ34B3KPFMGL34HR5GIAB","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":"1a3f8635e2fa04527841dd1d40019ba6a969b726b6c77705df868569f5fadeef","cross_cats_sorted":["math.FA","math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-06T21:19:46Z","title_canon_sha256":"a382c3f8dffff72333a9d6828247409236654412e501c7a93b4c44fd024ff6da"},"schema_version":"1.0","source":{"id":"1501.01320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01320","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01320v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01320","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"5ZSRZQJ34B3K","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZSRZQJ34B3KPFMG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZSRZQJ3","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:bc1ced58abefcfc19def0b902776d5bbedfa7a242bfd535f1feedb74e2aec6d0","target":"graph","created_at":"2026-05-18T02:19:42Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Adam M. Johansen, Florian Theil, Matthew Thorpe, Neil Cade","cross_cats":["math.FA","math.OC","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-06T21:19:46Z","title":"Convergence of the $k$-Means Minimization Problem using $\\Gamma$-Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01320","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c454b848bbdb430c7a09bd25e96191bf4f8da439a56023d1a893bb69db83c14","target":"record","created_at":"2026-05-18T02:19:42Z","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":"1a3f8635e2fa04527841dd1d40019ba6a969b726b6c77705df868569f5fadeef","cross_cats_sorted":["math.FA","math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-06T21:19:46Z","title_canon_sha256":"a382c3f8dffff72333a9d6828247409236654412e501c7a93b4c44fd024ff6da"},"schema_version":"1.0","source":{"id":"1501.01320","kind":"arxiv","version":2}},"canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee651cc13be076a795865ef878f4c8005cf39facbf374238bc0386792ba1628c","first_computed_at":"2026-05-18T02:19:42.363794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:42.363794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8EoRfQni4sGZ0zlKN8ZepUuXligQNMOX63Jm25W7mMohDscjjDFO6sEtVe51cvRc/5rFKL/XIOBu6N5e/ImYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:42.364459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c454b848bbdb430c7a09bd25e96191bf4f8da439a56023d1a893bb69db83c14","sha256:bc1ced58abefcfc19def0b902776d5bbedfa7a242bfd535f1feedb74e2aec6d0"],"state_sha256":"cf5f22182ee612e7eb5dbdfaa2ca6e639a8b8b32243f12817f37fb36f2a80bff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiqviLbw1TKSMjsQgU+Ha1nafc6cZ6FvKptG8NPrBLVW6dAcV8rWHyDYcP0pc2FBHO39pC+kMrlhZskdsfbHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:48:40.599845Z","bundle_sha256":"7d1f977fba088a9a2e49f1078275029afcb31c2d435d9778f8bc6632962e0296"}}