{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DGQBRJPCWZELFSOOJGN4ZAVIBJ","short_pith_number":"pith:DGQBRJPC","schema_version":"1.0","canonical_sha256":"19a018a5e2b648b2c9ce499bcc82a80a511de42ed7eb6c60167e65b2db2f84a8","source":{"kind":"arxiv","id":"1605.00751","version":2},"attestation_state":"computed","paper":{"title":"Learning from Binary Labels with Instance-Dependent Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Krishna Menon, Brendan van Rooyen, Nagarajan Natarajan","submitted_at":"2016-05-03T04:47:02Z","abstract_excerpt":"Suppose we have a sample of instances paired with binary labels corrupted by arbitrary instance- and label-dependent noise. With sufficiently many such samples, can we optimally classify and rank instances with respect to the noise-free distribution? We provide a theoretical analysis of this question, with three main contributions. First, we prove that for instance-dependent noise, any algorithm that is consistent for classification on the noisy distribution is also consistent on the clean distribution. Second, we prove that for a broad class of instance- and label-dependent noise, a similar c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.00751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-03T04:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"936a5f1ddc9513c3e2b8cee4928457d6edf0848eaf3f8dd83ecfa7f573c74f7a","abstract_canon_sha256":"e1a1233b0937d4f48aabb938c96acdad9afe7e3432e95d02d138f3d75269b1c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.029150Z","signature_b64":"4KF9XZsAuFAg0R0j0KlyKDdYelJH6lTUocrIimGXNLv8G1K5NZTnyhEndwZ0Hb8uovwraxOXpIdx27kFhKQhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a018a5e2b648b2c9ce499bcc82a80a511de42ed7eb6c60167e65b2db2f84a8","last_reissued_at":"2026-05-18T01:15:38.028561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.028561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning from Binary Labels with Instance-Dependent Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Krishna Menon, Brendan van Rooyen, Nagarajan Natarajan","submitted_at":"2016-05-03T04:47:02Z","abstract_excerpt":"Suppose we have a sample of instances paired with binary labels corrupted by arbitrary instance- and label-dependent noise. With sufficiently many such samples, can we optimally classify and rank instances with respect to the noise-free distribution? We provide a theoretical analysis of this question, with three main contributions. First, we prove that for instance-dependent noise, any algorithm that is consistent for classification on the noisy distribution is also consistent on the clean distribution. Second, we prove that for a broad class of instance- and label-dependent noise, a similar c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00751","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.00751","created_at":"2026-05-18T01:15:38.028651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00751v2","created_at":"2026-05-18T01:15:38.028651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00751","created_at":"2026-05-18T01:15:38.028651+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGQBRJPCWZEL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGQBRJPCWZELFSOO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGQBRJPC","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ","json":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ.json","graph_json":"https://pith.science/api/pith-number/DGQBRJPCWZELFSOOJGN4ZAVIBJ/graph.json","events_json":"https://pith.science/api/pith-number/DGQBRJPCWZELFSOOJGN4ZAVIBJ/events.json","paper":"https://pith.science/paper/DGQBRJPC"},"agent_actions":{"view_html":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ","download_json":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ.json","view_paper":"https://pith.science/paper/DGQBRJPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00751&json=true","fetch_graph":"https://pith.science/api/pith-number/DGQBRJPCWZELFSOOJGN4ZAVIBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DGQBRJPCWZELFSOOJGN4ZAVIBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ/action/storage_attestation","attest_author":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ/action/author_attestation","sign_citation":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ/action/citation_signature","submit_replication":"https://pith.science/pith/DGQBRJPCWZELFSOOJGN4ZAVIBJ/action/replication_record"}},"created_at":"2026-05-18T01:15:38.028651+00:00","updated_at":"2026-05-18T01:15:38.028651+00:00"}