{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QNFOPPNCR35D2IQ3YLS4LEQU7M","short_pith_number":"pith:QNFOPPNC","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"},"canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","source":{"kind":"arxiv","id":"1212.4942","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4942","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4942v4","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4942","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNFOPPNCR35D","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QNFOPPNCR35D2IQ3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QNFOPPNC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QNFOPPNCR35D2IQ3YLS4LEQU7M","target":"record","payload":{"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"},"canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","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"},"source_kind":"arxiv","source_id":"1212.4942","source_version":4,"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:59:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxjHN6uSAwyeAk837vo+uYiNWhKtN1TR1jIWps0bWLIinwISUXPwn8XpoWGNAiJtX8OUYrarlymFCci6AxXyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:12:13.997000Z"},"content_sha256":"1e2b663f3117d69cf03c45c9030faa9be08d136fbbf2bec902654a74eb3d3b9f","schema_version":"1.0","event_id":"sha256:1e2b663f3117d69cf03c45c9030faa9be08d136fbbf2bec902654a74eb3d3b9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QNFOPPNCR35D2IQ3YLS4LEQU7M","target":"graph","payload":{"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"},"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:59:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZ1UrMlBqq4bG8l+VDN8dT3Nxr++aiBKFd+V7mgfZVY0vs3adH8qUnNFYR4t+7kiBS5Ik/t+EY2j4F4TA35qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:12:13.997693Z"},"content_sha256":"c55c196fd0a3443c15cc0aec2d2a207ff1ae6eafecaaf40aedddd47cd3555cb9","schema_version":"1.0","event_id":"sha256:c55c196fd0a3443c15cc0aec2d2a207ff1ae6eafecaaf40aedddd47cd3555cb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/bundle.json","state_url":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/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-05T21:12:13Z","links":{"resolver":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M","bundle":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/bundle.json","state":"https://pith.science/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNFOPPNCR35D2IQ3YLS4LEQU7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QNFOPPNCR35D2IQ3YLS4LEQU7M","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":"e20972775f445a2b0f1415e828b0ab280977af20469d13e507f6a559a72ce7ad","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-12-20T07:46:35Z","title_canon_sha256":"a53e1ea4bd5fbb93c07bf3afbd1c716b996a2402069a6bab65df2cc5a5c9343f"},"schema_version":"1.0","source":{"id":"1212.4942","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4942","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4942v4","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4942","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNFOPPNCR35D","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QNFOPPNCR35D2IQ3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QNFOPPNC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:c55c196fd0a3443c15cc0aec2d2a207ff1ae6eafecaaf40aedddd47cd3555cb9","target":"graph","created_at":"2026-05-18T02:59:08Z","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":"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 ","authors_text":"Yoshikazu Terada","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-12-20T07:46:35Z","title":"Strong Consistency of Reduced K-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4942","kind":"arxiv","version":4},"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:1e2b663f3117d69cf03c45c9030faa9be08d136fbbf2bec902654a74eb3d3b9f","target":"record","created_at":"2026-05-18T02:59:08Z","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":"e20972775f445a2b0f1415e828b0ab280977af20469d13e507f6a559a72ce7ad","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-12-20T07:46:35Z","title_canon_sha256":"a53e1ea4bd5fbb93c07bf3afbd1c716b996a2402069a6bab65df2cc5a5c9343f"},"schema_version":"1.0","source":{"id":"1212.4942","kind":"arxiv","version":4}},"canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"834ae7bda28efa3d221bc2e5c59214fb2678cd025a2b9968a01cd9b18717b332","first_computed_at":"2026-05-18T02:59:08.835017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:08.835017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWJ8DhmWDHz+SLW+eTvVvBy1uAPLZEkfpmOxXr1NoTvkhRU6moY6ygwVrdWbYLP7EoVKgTExA2ehmMOw9ejPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:08.835461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4942","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e2b663f3117d69cf03c45c9030faa9be08d136fbbf2bec902654a74eb3d3b9f","sha256:c55c196fd0a3443c15cc0aec2d2a207ff1ae6eafecaaf40aedddd47cd3555cb9"],"state_sha256":"250d7aa4027e7212e229c303c95fab915bc559ab70b802b5251c4ae27348032a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/L+UpvHlZBIZgpoSii8wzQc7bV8gwAGLKtmOKzATuwj31hXon8x3WREh58EUZf/GVbRfRSgFuwaqTfsMomhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:12:14.001395Z","bundle_sha256":"dc46013c2cc7e7e6f7763b0fe30426f795dd3fb2559970d5b935fb7a59fb0d6f"}}