{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZZQ77OXULTIST33JQ7IZYR3YR3","short_pith_number":"pith:ZZQ77OXU","canonical_record":{"source":{"id":"1306.2194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-10T13:15:25Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"a198aae45dc4543e359bbaed9efa9d0419235445ae2674d9d3fe7484d79d98b9","abstract_canon_sha256":"a783fc359bca94928c86b8b4e8bf36d1dfc3c9c0403692851bf4ab7a248179b9"},"schema_version":"1.0"},"canonical_sha256":"ce61ffbaf45cd129ef6987d19c47788ec5dcba3e866091c59133104b69fbaaa2","source":{"kind":"arxiv","id":"1306.2194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2194","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2194v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2194","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZZQ77OXULTIS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZQ77OXULTIST33J","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZQ77OXU","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZZQ77OXULTIST33JQ7IZYR3YR3","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-10T13:15:25Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"a198aae45dc4543e359bbaed9efa9d0419235445ae2674d9d3fe7484d79d98b9","abstract_canon_sha256":"a783fc359bca94928c86b8b4e8bf36d1dfc3c9c0403692851bf4ab7a248179b9"},"schema_version":"1.0"},"canonical_sha256":"ce61ffbaf45cd129ef6987d19c47788ec5dcba3e866091c59133104b69fbaaa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.088597Z","signature_b64":"hueeXixUe/qcd5gtFcbpaTVCc/8k9ahoUqGIxUMTovTSpjmde7j6EoI9I42AyTQ8iAEwBdeYRjeU9A3Yk4ZXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce61ffbaf45cd129ef6987d19c47788ec5dcba3e866091c59133104b69fbaaa2","last_reissued_at":"2026-05-18T03:21:22.088189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.088189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2194","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTwUULpJ4JOxThJ5jYo88M1UXe888LW2x9I1NK5mhMNzO6vTov8FYZO0G1QHaJ0k+kYmRWvXIXIfuPZfSGjKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:15:17.680141Z"},"content_sha256":"59d87214700671292f486548a104e4cc74da752f1a10bc631d04dc0c04a3b247","schema_version":"1.0","event_id":"sha256:59d87214700671292f486548a104e4cc74da752f1a10bc631d04dc0c04a3b247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZZQ77OXULTIST33JQ7IZYR3YR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Noisy Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Michael Chichignoud, S\\'ebastien Loustau","submitted_at":"2013-06-10T13:15:25Z","abstract_excerpt":"The problem of adaptive noisy clustering is investigated. Given a set of noisy observations $Z_i=X_i+\\epsilon_i$, $i=1,...,n$, the goal is to design clusters associated with the law of $X_i$'s, with unknown density $f$ with respect to the Lebesgue measure. Since we observe a corrupted sample, a direct approach as the popular {\\it $k$-means} is not suitable in this case. In this paper, we propose a noisy $k$-means minimization, which is based on the $k$-means loss function and a deconvolution estimator of the density $f$. In particular, this approach suffers from the dependence on a bandwidth i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2194","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zXYv4SwvuL9dLl+SBEjPsshhtBAnAMiYUqp6RgQuB6Y4n0kPysU6j6wgF0Rab/X1fPLkeq1pcYmIMTVJztbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:15:17.680485Z"},"content_sha256":"a28a85b0e623a2d6dbf051732a6ab0c24489d30c04ea153b15c34e911944a2dc","schema_version":"1.0","event_id":"sha256:a28a85b0e623a2d6dbf051732a6ab0c24489d30c04ea153b15c34e911944a2dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/bundle.json","state_url":"https://pith.science/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/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-27T13:15:17Z","links":{"resolver":"https://pith.science/pith/ZZQ77OXULTIST33JQ7IZYR3YR3","bundle":"https://pith.science/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/bundle.json","state":"https://pith.science/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZQ77OXULTIST33JQ7IZYR3YR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZZQ77OXULTIST33JQ7IZYR3YR3","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":"a783fc359bca94928c86b8b4e8bf36d1dfc3c9c0403692851bf4ab7a248179b9","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-10T13:15:25Z","title_canon_sha256":"a198aae45dc4543e359bbaed9efa9d0419235445ae2674d9d3fe7484d79d98b9"},"schema_version":"1.0","source":{"id":"1306.2194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2194","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2194v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2194","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZZQ77OXULTIS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZQ77OXULTIST33J","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZQ77OXU","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:a28a85b0e623a2d6dbf051732a6ab0c24489d30c04ea153b15c34e911944a2dc","target":"graph","created_at":"2026-05-18T03:21:22Z","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 problem of adaptive noisy clustering is investigated. Given a set of noisy observations $Z_i=X_i+\\epsilon_i$, $i=1,...,n$, the goal is to design clusters associated with the law of $X_i$'s, with unknown density $f$ with respect to the Lebesgue measure. Since we observe a corrupted sample, a direct approach as the popular {\\it $k$-means} is not suitable in this case. In this paper, we propose a noisy $k$-means minimization, which is based on the $k$-means loss function and a deconvolution estimator of the density $f$. In particular, this approach suffers from the dependence on a bandwidth i","authors_text":"Michael Chichignoud, S\\'ebastien Loustau","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-10T13:15:25Z","title":"Adaptive Noisy Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2194","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:59d87214700671292f486548a104e4cc74da752f1a10bc631d04dc0c04a3b247","target":"record","created_at":"2026-05-18T03:21:22Z","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":"a783fc359bca94928c86b8b4e8bf36d1dfc3c9c0403692851bf4ab7a248179b9","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-10T13:15:25Z","title_canon_sha256":"a198aae45dc4543e359bbaed9efa9d0419235445ae2674d9d3fe7484d79d98b9"},"schema_version":"1.0","source":{"id":"1306.2194","kind":"arxiv","version":1}},"canonical_sha256":"ce61ffbaf45cd129ef6987d19c47788ec5dcba3e866091c59133104b69fbaaa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce61ffbaf45cd129ef6987d19c47788ec5dcba3e866091c59133104b69fbaaa2","first_computed_at":"2026-05-18T03:21:22.088189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.088189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hueeXixUe/qcd5gtFcbpaTVCc/8k9ahoUqGIxUMTovTSpjmde7j6EoI9I42AyTQ8iAEwBdeYRjeU9A3Yk4ZXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.088597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59d87214700671292f486548a104e4cc74da752f1a10bc631d04dc0c04a3b247","sha256:a28a85b0e623a2d6dbf051732a6ab0c24489d30c04ea153b15c34e911944a2dc"],"state_sha256":"505526564286186cd0f594d7c990d72d7e71061b82499191b9b1faa5d1e8ab12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqJQ1PYWrS5BJFhBQnCQaka5ymuIvZwalHsiQpBSwJO8Uwjf06hjtcHCk7UpNQ3gBLB9sQYS11i25VbS7k+PCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:15:17.682367Z","bundle_sha256":"a229452d1f15a75ae8d5f30bb54fe71de253a5fe6e75da6dbb0c68f16241ea56"}}