{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BMCSZII6Q6SBOXMRLU7S45H5XZ","short_pith_number":"pith:BMCSZII6","canonical_record":{"source":{"id":"1109.5231","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T04:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"3cd7e0cbd092cd1f2e3c9ed8027fcc9ee40c02c343ac345e70ae974d8cbc08a4","abstract_canon_sha256":"6178bdc7be2d107f3bbbc3c215cd64f63993d442fa3b0e11c5153f23350842c3"},"schema_version":"1.0"},"canonical_sha256":"0b052ca11e87a4175d915d3f2e74fdbe7611dc9eac021935a0790239b7069c40","source":{"kind":"arxiv","id":"1109.5231","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5231","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5231v4","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5231","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"BMCSZII6Q6SB","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BMCSZII6Q6SBOXMR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BMCSZII6","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BMCSZII6Q6SBOXMRLU7S45H5XZ","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5231","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T04:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"3cd7e0cbd092cd1f2e3c9ed8027fcc9ee40c02c343ac345e70ae974d8cbc08a4","abstract_canon_sha256":"6178bdc7be2d107f3bbbc3c215cd64f63993d442fa3b0e11c5153f23350842c3"},"schema_version":"1.0"},"canonical_sha256":"0b052ca11e87a4175d915d3f2e74fdbe7611dc9eac021935a0790239b7069c40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.851956Z","signature_b64":"qvH/tW8m2AkW8soULXl5wj43hQ8/qFwjhWZgpd/LNkidbE9JFJZkDXHdBL/hU1TrSAjaSob6KdlJQ6yVt8vcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b052ca11e87a4175d915d3f2e74fdbe7611dc9eac021935a0790239b7069c40","last_reissued_at":"2026-05-18T03:06:13.851293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.851293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5231","source_version":4,"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:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVf0vvqTqhkbgLk15k6uI1Tpa9Q+26RubMG9EFgiEMjvRuDmCEJpVjmD7hFr09eBjQGMRf2comr2KjuBAB3rAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:19.205740Z"},"content_sha256":"f7a5c965fe62357f00c409c8c07583d9b2e8138c644655e326bc7c692bfebf5a","schema_version":"1.0","event_id":"sha256:f7a5c965fe62357f00c409c8c07583d9b2e8138c644655e326bc7c692bfebf5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BMCSZII6Q6SBOXMRLU7S45H5XZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noise Tolerance under Risk Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Naresh Manwani, P. S. Sastry","submitted_at":"2011-09-24T04:50:55Z","abstract_excerpt":"In this paper we explore noise tolerant learning of classifiers. We formulate the problem as follows. We assume that there is an ${\\bf unobservable}$ training set which is noise-free. The actual training set given to the learning algorithm is obtained from this ideal data set by corrupting the class label of each example. The probability that the class label of an example is corrupted is a function of the feature vector of the example. This would account for most kinds of noisy data one encounters in practice. We say that a learning method is noise tolerant if the classifiers learnt with the i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5231","kind":"arxiv","version":4},"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:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMEB6jR6/7KK9YRHJp0RKquwOKNtMWErmqBdOiff7tU9rWLD3j5h2yWDdaVXvl/dFfS8NFTI2b33Zn63hgr6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:19.206622Z"},"content_sha256":"a2c689e16d9e7acf082d28506939ef044a1c624e2fc2c01a59d99dab25257321","schema_version":"1.0","event_id":"sha256:a2c689e16d9e7acf082d28506939ef044a1c624e2fc2c01a59d99dab25257321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/bundle.json","state_url":"https://pith.science/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/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-11T06:01:19Z","links":{"resolver":"https://pith.science/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ","bundle":"https://pith.science/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/bundle.json","state":"https://pith.science/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMCSZII6Q6SBOXMRLU7S45H5XZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BMCSZII6Q6SBOXMRLU7S45H5XZ","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":"6178bdc7be2d107f3bbbc3c215cd64f63993d442fa3b0e11c5153f23350842c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T04:50:55Z","title_canon_sha256":"3cd7e0cbd092cd1f2e3c9ed8027fcc9ee40c02c343ac345e70ae974d8cbc08a4"},"schema_version":"1.0","source":{"id":"1109.5231","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5231","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5231v4","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5231","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"BMCSZII6Q6SB","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BMCSZII6Q6SBOXMR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BMCSZII6","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a2c689e16d9e7acf082d28506939ef044a1c624e2fc2c01a59d99dab25257321","target":"graph","created_at":"2026-05-18T03:06:13Z","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 paper we explore noise tolerant learning of classifiers. We formulate the problem as follows. We assume that there is an ${\\bf unobservable}$ training set which is noise-free. The actual training set given to the learning algorithm is obtained from this ideal data set by corrupting the class label of each example. The probability that the class label of an example is corrupted is a function of the feature vector of the example. This would account for most kinds of noisy data one encounters in practice. We say that a learning method is noise tolerant if the classifiers learnt with the i","authors_text":"Naresh Manwani, P. S. Sastry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T04:50:55Z","title":"Noise Tolerance under Risk Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5231","kind":"arxiv","version":4},"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:f7a5c965fe62357f00c409c8c07583d9b2e8138c644655e326bc7c692bfebf5a","target":"record","created_at":"2026-05-18T03:06:13Z","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":"6178bdc7be2d107f3bbbc3c215cd64f63993d442fa3b0e11c5153f23350842c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T04:50:55Z","title_canon_sha256":"3cd7e0cbd092cd1f2e3c9ed8027fcc9ee40c02c343ac345e70ae974d8cbc08a4"},"schema_version":"1.0","source":{"id":"1109.5231","kind":"arxiv","version":4}},"canonical_sha256":"0b052ca11e87a4175d915d3f2e74fdbe7611dc9eac021935a0790239b7069c40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b052ca11e87a4175d915d3f2e74fdbe7611dc9eac021935a0790239b7069c40","first_computed_at":"2026-05-18T03:06:13.851293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:13.851293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvH/tW8m2AkW8soULXl5wj43hQ8/qFwjhWZgpd/LNkidbE9JFJZkDXHdBL/hU1TrSAjaSob6KdlJQ6yVt8vcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:13.851956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5231","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a5c965fe62357f00c409c8c07583d9b2e8138c644655e326bc7c692bfebf5a","sha256:a2c689e16d9e7acf082d28506939ef044a1c624e2fc2c01a59d99dab25257321"],"state_sha256":"3de36ebb76d8c5fc5e4c62be5b7016e87d6f029efd7b42bbbd745d1982cf8305"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3vFo3Mrlty7/hfzToIQg8uZIo9XrS8gYRcR7gY6z1ywgHoyqb5jh+tPVZDs05q2lRb2peST9wn0WJ+96unWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:01:19.210854Z","bundle_sha256":"4a708fb1d15c696fbd655c154ad8e30d7ef00df2cb951ba7216cae21e8279c77"}}