{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7SE3SKCB5JXEMORUWO6NDS75I2","short_pith_number":"pith:7SE3SKCB","canonical_record":{"source":{"id":"1308.3314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T06:15:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f5df694edfe9717672b57e8389d974409bd7c781daf5bb16fe7406e423fff73f","abstract_canon_sha256":"9fc398ddda79f7b04bd1a267f73a9c629a531be2326faea9671301e8ac97e223"},"schema_version":"1.0"},"canonical_sha256":"fc89b92841ea6e463a34b3bcd1cbfd46b1f0e6c50664531b57c7e952f832ac22","source":{"kind":"arxiv","id":"1308.3314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3314","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3314v1","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3314","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"7SE3SKCB5JXE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SE3SKCB5JXEMORU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SE3SKCB","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7SE3SKCB5JXEMORUWO6NDS75I2","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T06:15:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f5df694edfe9717672b57e8389d974409bd7c781daf5bb16fe7406e423fff73f","abstract_canon_sha256":"9fc398ddda79f7b04bd1a267f73a9c629a531be2326faea9671301e8ac97e223"},"schema_version":"1.0"},"canonical_sha256":"fc89b92841ea6e463a34b3bcd1cbfd46b1f0e6c50664531b57c7e952f832ac22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.074509Z","signature_b64":"ajv118liQWfX3wsiIKOPMR8Fy2tAxMoH4fzDFl35/CSjGZpEfGAgibIwdmsXlT6MpIOOjOgiuqGSVLlpqCe9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc89b92841ea6e463a34b3bcd1cbfd46b1f0e6c50664531b57c7e952f832ac22","last_reissued_at":"2026-05-18T03:15:55.073696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.073696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3314","source_version":1,"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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZyL9xlFq6glFG3oarA/ma1EXCLBCYoxsGaVs+vmt5v2NLi3r1Qk9SJWptS3QG6h95pt2/9DIJSEfEjPEDcJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:23.222169Z"},"content_sha256":"a8b9f2587415af04edf93fcaa76a2f7577809c7bfbb87d6e39ed01d3cc825150","schema_version":"1.0","event_id":"sha256:a8b9f2587415af04edf93fcaa76a2f7577809c7bfbb87d6e39ed01d3cc825150"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7SE3SKCB5JXEMORUWO6NDS75I2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The algorithm of noisy k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Camille Brunet (LAREMA), S\\'ebastien Loustau (LAREMA)","submitted_at":"2013-08-15T06:15:21Z","abstract_excerpt":"In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different tools from the inverse problem literature and the machine learning community. Coarsely, it is based on a two-step procedure: (1) a deconvolution step to deal with noisy inputs and (2) Newton's iterations as the popular k-means."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3314","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"},"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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+/IIMXZ3xxl/DavFYKvclU5CPLzI6r0svYu+MQcB9n5HpIoBsw74bGAv2KUYg6dgE4WtVzaTyyfZtayNeH4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:23.222881Z"},"content_sha256":"ddc9f3931c10edb4d9baa9ef5db51eeabeb60051ddc4ad2db1be8988c37c5c7d","schema_version":"1.0","event_id":"sha256:ddc9f3931c10edb4d9baa9ef5db51eeabeb60051ddc4ad2db1be8988c37c5c7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SE3SKCB5JXEMORUWO6NDS75I2/bundle.json","state_url":"https://pith.science/pith/7SE3SKCB5JXEMORUWO6NDS75I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SE3SKCB5JXEMORUWO6NDS75I2/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-09T07:50:23Z","links":{"resolver":"https://pith.science/pith/7SE3SKCB5JXEMORUWO6NDS75I2","bundle":"https://pith.science/pith/7SE3SKCB5JXEMORUWO6NDS75I2/bundle.json","state":"https://pith.science/pith/7SE3SKCB5JXEMORUWO6NDS75I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SE3SKCB5JXEMORUWO6NDS75I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7SE3SKCB5JXEMORUWO6NDS75I2","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":"9fc398ddda79f7b04bd1a267f73a9c629a531be2326faea9671301e8ac97e223","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T06:15:21Z","title_canon_sha256":"f5df694edfe9717672b57e8389d974409bd7c781daf5bb16fe7406e423fff73f"},"schema_version":"1.0","source":{"id":"1308.3314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3314","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3314v1","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3314","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"7SE3SKCB5JXE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SE3SKCB5JXEMORU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SE3SKCB","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:ddc9f3931c10edb4d9baa9ef5db51eeabeb60051ddc4ad2db1be8988c37c5c7d","target":"graph","created_at":"2026-05-18T03:15:55Z","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":"In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different tools from the inverse problem literature and the machine learning community. Coarsely, it is based on a two-step procedure: (1) a deconvolution step to deal with noisy inputs and (2) Newton's iterations as the popular k-means.","authors_text":"Camille Brunet (LAREMA), S\\'ebastien Loustau (LAREMA)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T06:15:21Z","title":"The algorithm of noisy k-means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3314","kind":"arxiv","version":1},"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:a8b9f2587415af04edf93fcaa76a2f7577809c7bfbb87d6e39ed01d3cc825150","target":"record","created_at":"2026-05-18T03:15:55Z","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":"9fc398ddda79f7b04bd1a267f73a9c629a531be2326faea9671301e8ac97e223","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T06:15:21Z","title_canon_sha256":"f5df694edfe9717672b57e8389d974409bd7c781daf5bb16fe7406e423fff73f"},"schema_version":"1.0","source":{"id":"1308.3314","kind":"arxiv","version":1}},"canonical_sha256":"fc89b92841ea6e463a34b3bcd1cbfd46b1f0e6c50664531b57c7e952f832ac22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc89b92841ea6e463a34b3bcd1cbfd46b1f0e6c50664531b57c7e952f832ac22","first_computed_at":"2026-05-18T03:15:55.073696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:55.073696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajv118liQWfX3wsiIKOPMR8Fy2tAxMoH4fzDFl35/CSjGZpEfGAgibIwdmsXlT6MpIOOjOgiuqGSVLlpqCe9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:55.074509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8b9f2587415af04edf93fcaa76a2f7577809c7bfbb87d6e39ed01d3cc825150","sha256:ddc9f3931c10edb4d9baa9ef5db51eeabeb60051ddc4ad2db1be8988c37c5c7d"],"state_sha256":"b328cb89f9686a35a15bf734e6c7470ca79944652aac1c18691c2eae627a42ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7Id5dBBo0Gxs4P2HtE9WlHHmKgYKw5LC+W48Z0w+4oHDNFJ1zlH189e5/hFUhOm/DmmJ7iMzpfGnvGgHHEuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:50:23.226693Z","bundle_sha256":"50de067c5d77b3fdd7dc205f12fccdd5a5a6c7e2799473d2713ebb569f6ebb20"}}