{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QNFOPPNCR35D2IQ3YLS4LEQU7M","short_pith_number":"pith:QNFOPPNC","schema_version":"1.0","canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","source":{"kind":"arxiv","id":"1212.4942","version":4},"attestation_state":"computed","paper":{"title":"Strong Consistency of Reduced K-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Yoshikazu Terada","submitted_at":"2012-12-20T07:46:35Z","abstract_excerpt":"Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously obtained. In this paper, the relationship between conventional k-means clustering and reduced k-means clustering is discussed. Conditions ensuring almost sure convergence of the estimator of reduced k-means clustering as unboundedly increasing sample size have been presented. The results for a more general model considering conventional k-means clustering and "},"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":"1212.4942","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-12-20T07:46:35Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"a53e1ea4bd5fbb93c07bf3afbd1c716b996a2402069a6bab65df2cc5a5c9343f","abstract_canon_sha256":"e20972775f445a2b0f1415e828b0ab280977af20469d13e507f6a559a72ce7ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.835461Z","signature_b64":"xWJ8DhmWDHz+SLW+eTvVvBy1uAPLZEkfpmOxXr1NoTvkhRU6moY6ygwVrdWbYLP7EoVKgTExA2ehmMOw9ejPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","last_reissued_at":"2026-05-18T02:59:08.835017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.835017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Consistency of Reduced K-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Yoshikazu Terada","submitted_at":"2012-12-20T07:46:35Z","abstract_excerpt":"Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously obtained. In this paper, the relationship between conventional k-means clustering and reduced k-means clustering is discussed. Conditions ensuring almost sure convergence of the estimator of reduced k-means clustering as unboundedly increasing sample size have been presented. The results for a more general model considering conventional k-means clustering and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4942","kind":"arxiv","version":4},"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":"1212.4942","created_at":"2026-05-18T02:59:08.835069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4942v4","created_at":"2026-05-18T02:59:08.835069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4942","created_at":"2026-05-18T02:59:08.835069+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNFOPPNCR35D","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNFOPPNCR35D2IQ3","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNFOPPNC","created_at":"2026-05-18T12:27:18.751474+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/QNFOPPNCR35D2IQ3YLS4LEQU7M","json":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M.json","graph_json":"https://pith.science/api/pith-number/QNFOPPNCR35D2IQ3YLS4LEQU7M/graph.json","events_json":"https://pith.science/api/pith-number/QNFOPPNCR35D2IQ3YLS4LEQU7M/events.json","paper":"https://pith.science/paper/QNFOPPNC"},"agent_actions":{"view_html":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M","download_json":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M.json","view_paper":"https://pith.science/paper/QNFOPPNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4942&json=true","fetch_graph":"https://pith.science/api/pith-number/QNFOPPNCR35D2IQ3YLS4LEQU7M/graph.json","fetch_events":"https://pith.science/api/pith-number/QNFOPPNCR35D2IQ3YLS4LEQU7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/action/storage_attestation","attest_author":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/action/author_attestation","sign_citation":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/action/citation_signature","submit_replication":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/action/replication_record"}},"created_at":"2026-05-18T02:59:08.835069+00:00","updated_at":"2026-05-18T02:59:08.835069+00:00"}