{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2DXU5T4ZZMG7BEQHIBWGDNT73K","short_pith_number":"pith:2DXU5T4Z","canonical_record":{"source":{"id":"1205.1417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6340e51b3ac58718fad245e8a4c9d980a250521382f23e7ef6760334b02728d2","abstract_canon_sha256":"f11a03dea0496ec0e6e0eb137a755c28b49b437c5be421fd7607364b2f1c2060"},"schema_version":"1.0"},"canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","source":{"kind":"arxiv","id":"1205.1417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1417","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1417v1","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1417","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"2DXU5T4ZZMG7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2DXU5T4ZZMG7BEQH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2DXU5T4Z","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2DXU5T4ZZMG7BEQHIBWGDNT73K","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6340e51b3ac58718fad245e8a4c9d980a250521382f23e7ef6760334b02728d2","abstract_canon_sha256":"f11a03dea0496ec0e6e0eb137a755c28b49b437c5be421fd7607364b2f1c2060"},"schema_version":"1.0"},"canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:10.073943Z","signature_b64":"ruafe/79cElatUapS8ZUe5j9m9136+EgV81EfCRvicM15P7rJSeV9vFmHPDD3LMzWO9cByhL10ZX84VMP2VPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","last_reissued_at":"2026-05-18T03:56:10.073265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:10.073265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1417","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:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1W96M6Xnayfkz5RNzCfcnPvFJReIUUjoxJFMEhgSusnqlcT/2q/LE70KtoVtlj5OIWuIFGFbl+sGyN/r7HcpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:20:16.666397Z"},"content_sha256":"d00f30f11db0def01ea45219084e854ee856cc88ce37f1492d0bfb772d2b50e7","schema_version":"1.0","event_id":"sha256:d00f30f11db0def01ea45219084e854ee856cc88ce37f1492d0bfb772d2b50e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2DXU5T4ZZMG7BEQHIBWGDNT73K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast rates for noisy clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"S\\'ebastien Loustau (LAREMA)","submitted_at":"2012-05-07T14:57:06Z","abstract_excerpt":"The effect of errors in variables in empirical minimization is investigated. Given a loss $l$ and a set of decision rules $\\mathcal{G}$, we prove a general upper bound for an empirical minimization based on a deconvolution kernel and a noisy sample $Z_i=X_i+\\epsilon_i,i=1,...,n$. We apply this general upper bound to give the rate of convergence for the expected excess risk in noisy clustering. A recent bound from \\citet{levrard} proves that this rate is $\\mathcal{O}(1/n)$ in the direct case, under Pollard's regularity assumptions. Here the effect of noisy measurements gives a rate of the form "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1417","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:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xVJkw2qhj1GQIY3BeaH7T0Fv19WtAkYh//pNezg9BuwIbCBDr1y639+u0/tneAhaMPjXKOzoOnqjrecuo3sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:20:16.667237Z"},"content_sha256":"46e63dec9524d9df0b92958e0097078547c9233451c672275f2bd2c312968f7c","schema_version":"1.0","event_id":"sha256:46e63dec9524d9df0b92958e0097078547c9233451c672275f2bd2c312968f7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/bundle.json","state_url":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/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-09T02:20:16Z","links":{"resolver":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K","bundle":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/bundle.json","state":"https://pith.science/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DXU5T4ZZMG7BEQHIBWGDNT73K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2DXU5T4ZZMG7BEQHIBWGDNT73K","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":"f11a03dea0496ec0e6e0eb137a755c28b49b437c5be421fd7607364b2f1c2060","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","title_canon_sha256":"6340e51b3ac58718fad245e8a4c9d980a250521382f23e7ef6760334b02728d2"},"schema_version":"1.0","source":{"id":"1205.1417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1417","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1417v1","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1417","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"2DXU5T4ZZMG7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2DXU5T4ZZMG7BEQH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2DXU5T4Z","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:46e63dec9524d9df0b92958e0097078547c9233451c672275f2bd2c312968f7c","target":"graph","created_at":"2026-05-18T03:56:10Z","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 effect of errors in variables in empirical minimization is investigated. Given a loss $l$ and a set of decision rules $\\mathcal{G}$, we prove a general upper bound for an empirical minimization based on a deconvolution kernel and a noisy sample $Z_i=X_i+\\epsilon_i,i=1,...,n$. We apply this general upper bound to give the rate of convergence for the expected excess risk in noisy clustering. A recent bound from \\citet{levrard} proves that this rate is $\\mathcal{O}(1/n)$ in the direct case, under Pollard's regularity assumptions. Here the effect of noisy measurements gives a rate of the form ","authors_text":"S\\'ebastien Loustau (LAREMA)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","title":"Fast rates for noisy clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1417","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:d00f30f11db0def01ea45219084e854ee856cc88ce37f1492d0bfb772d2b50e7","target":"record","created_at":"2026-05-18T03:56:10Z","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":"f11a03dea0496ec0e6e0eb137a755c28b49b437c5be421fd7607364b2f1c2060","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-07T14:57:06Z","title_canon_sha256":"6340e51b3ac58718fad245e8a4c9d980a250521382f23e7ef6760334b02728d2"},"schema_version":"1.0","source":{"id":"1205.1417","kind":"arxiv","version":1}},"canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0ef4ecf99cb0df09207406c61b67fdab90d9941d3e0241b76cef28e090a0b7b","first_computed_at":"2026-05-18T03:56:10.073265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:10.073265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ruafe/79cElatUapS8ZUe5j9m9136+EgV81EfCRvicM15P7rJSeV9vFmHPDD3LMzWO9cByhL10ZX84VMP2VPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:10.073943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00f30f11db0def01ea45219084e854ee856cc88ce37f1492d0bfb772d2b50e7","sha256:46e63dec9524d9df0b92958e0097078547c9233451c672275f2bd2c312968f7c"],"state_sha256":"959fcdce510974bce237a1548d5df380450f0db999fc95c5d5c8cfee12e6ccd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDpKLM9CdJoprnFVyXraB/CgtI4Mezc5Z6/ehliyolVsr9TcUwTupmmmon2urJhbNc8AnSwPz4lnxhJQlPsTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:20:16.671409Z","bundle_sha256":"ad25dfc796b82bd70fde9aa1a8c7201247eab6f377f33a40e3aa15912142d189"}}