{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:EJZU3E2IQQQMKVK2L72H2QYKGC","short_pith_number":"pith:EJZU3E2I","canonical_record":{"source":{"id":"math/0507180","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2005-07-08T15:11:44Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8d2a07c01626c9eaa17ef3634f7db3609df5297081bb9d1ba243bce68413794f","abstract_canon_sha256":"4430450d1b83981d7b014b09f29b754c5992ccf337392cb8538bcb3d33043f86"},"schema_version":"1.0"},"canonical_sha256":"22734d93488420c5555a5ff47d430a30bfbdcb05e0be7e3d36dd3b24a6136ad6","source":{"kind":"arxiv","id":"math/0507180","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0507180","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"math/0507180v3","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507180","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"EJZU3E2IQQQM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"EJZU3E2IQQQMKVK2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"EJZU3E2I","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:EJZU3E2IQQQMKVK2L72H2QYKGC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0507180","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2005-07-08T15:11:44Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8d2a07c01626c9eaa17ef3634f7db3609df5297081bb9d1ba243bce68413794f","abstract_canon_sha256":"4430450d1b83981d7b014b09f29b754c5992ccf337392cb8538bcb3d33043f86"},"schema_version":"1.0"},"canonical_sha256":"22734d93488420c5555a5ff47d430a30bfbdcb05e0be7e3d36dd3b24a6136ad6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:59.607537Z","signature_b64":"R0UudydFAXlcFbrUqJyb6ctSB+KGBs8GMKTtcQD4BjkmtCb605TUe6V//7RH0pmUXsfQn0W/DqGc9OmGPUIhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22734d93488420c5555a5ff47d430a30bfbdcb05e0be7e3d36dd3b24a6136ad6","last_reissued_at":"2026-05-18T04:20:59.607079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:59.607079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0507180","source_version":3,"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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XK0A+a0U6KE5tVDOriHIHi9pDRPtRAsZabQhsVWQ72w8i6hf7ar6iyP7LEwJtmY/9ot9BNj2Y2Ft4N7ap9dfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:59:41.852538Z"},"content_sha256":"518d6791f446349b46247f9346ae4bb203ba74cdfcc013916a1dfeada8778a57","schema_version":"1.0","event_id":"sha256:518d6791f446349b46247f9346ae4bb203ba74cdfcc013916a1dfeada8778a57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:EJZU3E2IQQQMKVK2L72H2QYKGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast learning rates for plug-in classifiers under the margin condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre B. Tsybakov (LPMA), Jean-Yves Audibert (CERTIS)","submitted_at":"2005-07-08T15:11:44Z","abstract_excerpt":"It has been recently shown that, under the margin (or low noise) assumption, there exist classifiers attaining fast rates of convergence of the excess Bayes risk, i.e., the rates faster than $n^{-1/2}$. The works on this subject suggested the following two conjectures: (i) the best achievable fast rate is of the order $n^{-1}$, and (ii) the plug-in classifiers generally converge slower than the classifiers based on empirical risk minimization. We show that both conjectures are not correct. In particular, we construct plug-in classifiers that can achieve not only the fast, but also the {\\it sup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507180","kind":"arxiv","version":3},"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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXdpcRfTxEW6UF/bLP7vV25RauGpBsiuGlr/DMbIiP1B2J0riqetCfH14lZhtejt07Xb37g/Ece41+cKf+d1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:59:41.852900Z"},"content_sha256":"c0d4726d19c51420c7f9f563b5e0b02405ce6faaf0df6e155465c367e06ca885","schema_version":"1.0","event_id":"sha256:c0d4726d19c51420c7f9f563b5e0b02405ce6faaf0df6e155465c367e06ca885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/bundle.json","state_url":"https://pith.science/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/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-09T13:59:41Z","links":{"resolver":"https://pith.science/pith/EJZU3E2IQQQMKVK2L72H2QYKGC","bundle":"https://pith.science/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/bundle.json","state":"https://pith.science/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJZU3E2IQQQMKVK2L72H2QYKGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:EJZU3E2IQQQMKVK2L72H2QYKGC","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":"4430450d1b83981d7b014b09f29b754c5992ccf337392cb8538bcb3d33043f86","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2005-07-08T15:11:44Z","title_canon_sha256":"8d2a07c01626c9eaa17ef3634f7db3609df5297081bb9d1ba243bce68413794f"},"schema_version":"1.0","source":{"id":"math/0507180","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0507180","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"math/0507180v3","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507180","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"EJZU3E2IQQQM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"EJZU3E2IQQQMKVK2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"EJZU3E2I","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:c0d4726d19c51420c7f9f563b5e0b02405ce6faaf0df6e155465c367e06ca885","target":"graph","created_at":"2026-05-18T04:20:59Z","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":"It has been recently shown that, under the margin (or low noise) assumption, there exist classifiers attaining fast rates of convergence of the excess Bayes risk, i.e., the rates faster than $n^{-1/2}$. The works on this subject suggested the following two conjectures: (i) the best achievable fast rate is of the order $n^{-1}$, and (ii) the plug-in classifiers generally converge slower than the classifiers based on empirical risk minimization. We show that both conjectures are not correct. In particular, we construct plug-in classifiers that can achieve not only the fast, but also the {\\it sup","authors_text":"Alexandre B. Tsybakov (LPMA), Jean-Yves Audibert (CERTIS)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2005-07-08T15:11:44Z","title":"Fast learning rates for plug-in classifiers under the margin condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507180","kind":"arxiv","version":3},"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:518d6791f446349b46247f9346ae4bb203ba74cdfcc013916a1dfeada8778a57","target":"record","created_at":"2026-05-18T04:20:59Z","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":"4430450d1b83981d7b014b09f29b754c5992ccf337392cb8538bcb3d33043f86","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2005-07-08T15:11:44Z","title_canon_sha256":"8d2a07c01626c9eaa17ef3634f7db3609df5297081bb9d1ba243bce68413794f"},"schema_version":"1.0","source":{"id":"math/0507180","kind":"arxiv","version":3}},"canonical_sha256":"22734d93488420c5555a5ff47d430a30bfbdcb05e0be7e3d36dd3b24a6136ad6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22734d93488420c5555a5ff47d430a30bfbdcb05e0be7e3d36dd3b24a6136ad6","first_computed_at":"2026-05-18T04:20:59.607079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:59.607079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0UudydFAXlcFbrUqJyb6ctSB+KGBs8GMKTtcQD4BjkmtCb605TUe6V//7RH0pmUXsfQn0W/DqGc9OmGPUIhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:59.607537Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0507180","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518d6791f446349b46247f9346ae4bb203ba74cdfcc013916a1dfeada8778a57","sha256:c0d4726d19c51420c7f9f563b5e0b02405ce6faaf0df6e155465c367e06ca885"],"state_sha256":"9309b08d58ebe14c5744f19a91a57ec132ace2a28ce6dd3e3f7e07bb0a7e8b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKNJ+ynY/W+8qCPpSGIZziwzcr9NcnZPclP/TQ8ymRF2I/D60Degw0nnXb2J4u3zHNhM18akYO31Xe1KGs1RBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:59:41.855103Z","bundle_sha256":"22005ed2133b35d8728106dcd4b720eb8d9658771560cd0e049cd03c8abc2b35"}}