{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JV5OKTD2QSKTDQUYGYSFTQTLXU","short_pith_number":"pith:JV5OKTD2","canonical_record":{"source":{"id":"1403.3610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T15:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"6e454e1c140b8a455608f6f6781e0c05735c0140b717b844d0fb83a74bb63e7c","abstract_canon_sha256":"045eced3e18d300baefabacc44df68b888bed4c7784539d73fc1737d01328e13"},"schema_version":"1.0"},"canonical_sha256":"4d7ae54c7a849531c298362459c26bbd150819ec2da8336ea91b1998a8521562","source":{"kind":"arxiv","id":"1403.3610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3610","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3610v2","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3610","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"JV5OKTD2QSKT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JV5OKTD2QSKTDQUY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JV5OKTD2","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JV5OKTD2QSKTDQUYGYSFTQTLXU","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T15:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"6e454e1c140b8a455608f6f6781e0c05735c0140b717b844d0fb83a74bb63e7c","abstract_canon_sha256":"045eced3e18d300baefabacc44df68b888bed4c7784539d73fc1737d01328e13"},"schema_version":"1.0"},"canonical_sha256":"4d7ae54c7a849531c298362459c26bbd150819ec2da8336ea91b1998a8521562","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.713046Z","signature_b64":"mnPm9wSleULtGNgeOtWpx1+Th4FeYEX+1cRt2IfxYnZB77SCnQSwWy+Q17DI8gKwX778FDSnz2DL+AkCiPFFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d7ae54c7a849531c298362459c26bbd150819ec2da8336ea91b1998a8521562","last_reissued_at":"2026-05-18T01:33:32.712432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.712432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3610","source_version":2,"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-18T01:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkmcOeIL22J9qeeb9zooLQkSZJ2qtNk8H3JiTBrsp0Q07tGNYfUl98p81JpLQR710L0bfOabreG5A3q/y5fFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:39:09.763657Z"},"content_sha256":"807c5ecdab11cfee8aae1e01ff8e1e633396360f9b0b28316e72052d9597500a","schema_version":"1.0","event_id":"sha256:807c5ecdab11cfee8aae1e01ff8e1e633396360f9b0b28316e72052d9597500a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JV5OKTD2QSKTDQUYGYSFTQTLXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making Risk Minimization Tolerant to Label Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aritra Ghosh, Naresh Manwani, P. S. Sastry","submitted_at":"2014-03-14T15:30:23Z","abstract_excerpt":"In many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in presence of label noise. In this paper we investigate the robustness of risk minimization to label noise. We prove a sufficient condition on a loss function for the risk minimization under that loss to be tolerant to uniform label noise. We show that the $0-1$ loss, sigmoid loss, ramp loss and probit loss satisfy this condition though none of the standard convex loss functions satisfy it. We also prove that, by choosing a suf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3610","kind":"arxiv","version":2},"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-18T01:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWlbeX4eHKDZmqo78UeRmiwMoE4pgwJEW+R8f428WDpfn7eRqPwr5Nnbv2+ulp88DFxBhF2oG+Cqwvsc10F6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:39:09.763989Z"},"content_sha256":"cc7577191fcfb6e45c5e128531a01910e488a4f7e06de6aebe3da88067b87609","schema_version":"1.0","event_id":"sha256:cc7577191fcfb6e45c5e128531a01910e488a4f7e06de6aebe3da88067b87609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/bundle.json","state_url":"https://pith.science/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/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-23T20:39:09Z","links":{"resolver":"https://pith.science/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU","bundle":"https://pith.science/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/bundle.json","state":"https://pith.science/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JV5OKTD2QSKTDQUYGYSFTQTLXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JV5OKTD2QSKTDQUYGYSFTQTLXU","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":"045eced3e18d300baefabacc44df68b888bed4c7784539d73fc1737d01328e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T15:30:23Z","title_canon_sha256":"6e454e1c140b8a455608f6f6781e0c05735c0140b717b844d0fb83a74bb63e7c"},"schema_version":"1.0","source":{"id":"1403.3610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3610","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3610v2","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3610","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"JV5OKTD2QSKT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JV5OKTD2QSKTDQUY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JV5OKTD2","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:cc7577191fcfb6e45c5e128531a01910e488a4f7e06de6aebe3da88067b87609","target":"graph","created_at":"2026-05-18T01:33:32Z","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 many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in presence of label noise. In this paper we investigate the robustness of risk minimization to label noise. We prove a sufficient condition on a loss function for the risk minimization under that loss to be tolerant to uniform label noise. We show that the $0-1$ loss, sigmoid loss, ramp loss and probit loss satisfy this condition though none of the standard convex loss functions satisfy it. We also prove that, by choosing a suf","authors_text":"Aritra Ghosh, Naresh Manwani, P. S. Sastry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T15:30:23Z","title":"Making Risk Minimization Tolerant to Label Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3610","kind":"arxiv","version":2},"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:807c5ecdab11cfee8aae1e01ff8e1e633396360f9b0b28316e72052d9597500a","target":"record","created_at":"2026-05-18T01:33:32Z","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":"045eced3e18d300baefabacc44df68b888bed4c7784539d73fc1737d01328e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T15:30:23Z","title_canon_sha256":"6e454e1c140b8a455608f6f6781e0c05735c0140b717b844d0fb83a74bb63e7c"},"schema_version":"1.0","source":{"id":"1403.3610","kind":"arxiv","version":2}},"canonical_sha256":"4d7ae54c7a849531c298362459c26bbd150819ec2da8336ea91b1998a8521562","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d7ae54c7a849531c298362459c26bbd150819ec2da8336ea91b1998a8521562","first_computed_at":"2026-05-18T01:33:32.712432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:32.712432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mnPm9wSleULtGNgeOtWpx1+Th4FeYEX+1cRt2IfxYnZB77SCnQSwWy+Q17DI8gKwX778FDSnz2DL+AkCiPFFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:32.713046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:807c5ecdab11cfee8aae1e01ff8e1e633396360f9b0b28316e72052d9597500a","sha256:cc7577191fcfb6e45c5e128531a01910e488a4f7e06de6aebe3da88067b87609"],"state_sha256":"982cea3895b97cfaf7debe2a4b2b272bb28a47e84d4947e9585ba84ab0f118d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPJnMLmE03AuKZA1SvtbBBd0bTMtj9H+XJhByNHeTEC717Wjtd8dURLGkz+4G6oCwB7UR/Y89ZvYM2v1Q7/sBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:39:09.765990Z","bundle_sha256":"d6485af019ea76566c470c4ab5da531cbe0ad0a7cee99f3c11e47f9a5525e857"}}