{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MR2T77YZCUTO2YCQUHR53HMQJM","short_pith_number":"pith:MR2T77YZ","schema_version":"1.0","canonical_sha256":"64753fff191526ed6050a1e3dd9d904b1475b6f49eb71977f8cf2a65f9027a1d","source":{"kind":"arxiv","id":"1503.03594","version":1},"attestation_state":"computed","paper":{"title":"Efficient Learning of Linear Separators under Bounded Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Maria-Florina Balcan, Nika Haghtalab, Pranjal Awasthi, Ruth Urner","submitted_at":"2015-03-12T05:38:19Z","abstract_excerpt":"We study the learnability of linear separators in $\\Re^d$ in the presence of bounded (a.k.a Massart) noise. This is a realistic generalization of the random classification noise model, where the adversary can flip each example $x$ with probability $\\eta(x) \\leq \\eta$. We provide the first polynomial time algorithm that can learn linear separators to arbitrarily small excess error in this noise model under the uniform distribution over the unit ball in $\\Re^d$, for some constant value of $\\eta$. While widely studied in the statistical learning theory community in the context of getting faster 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":"1503.03594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T05:38:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a90e6b2e6d5e97a48eaf8e20168fcc01d7003a2f08e14bbf3415cc26157ecf11","abstract_canon_sha256":"c5a7f6ca9895bf84713433f40063eb51ce7e94ce8ca5f5cf6563cad801e16efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:27.969301Z","signature_b64":"JtTsxlch/PuSMydQP8QfZ3ZxS1ajLp/RMF5eNjxe54+ZwFCRamAESmBlrb8f98JK/4GOhPB+ul0zB3OY+ACCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64753fff191526ed6050a1e3dd9d904b1475b6f49eb71977f8cf2a65f9027a1d","last_reissued_at":"2026-05-18T02:24:27.968790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:27.968790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Learning of Linear Separators under Bounded Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Maria-Florina Balcan, Nika Haghtalab, Pranjal Awasthi, Ruth Urner","submitted_at":"2015-03-12T05:38:19Z","abstract_excerpt":"We study the learnability of linear separators in $\\Re^d$ in the presence of bounded (a.k.a Massart) noise. This is a realistic generalization of the random classification noise model, where the adversary can flip each example $x$ with probability $\\eta(x) \\leq \\eta$. We provide the first polynomial time algorithm that can learn linear separators to arbitrarily small excess error in this noise model under the uniform distribution over the unit ball in $\\Re^d$, for some constant value of $\\eta$. While widely studied in the statistical learning theory community in the context of getting faster c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03594","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.03594","created_at":"2026-05-18T02:24:27.968873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03594v1","created_at":"2026-05-18T02:24:27.968873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03594","created_at":"2026-05-18T02:24:27.968873+00:00"},{"alias_kind":"pith_short_12","alias_value":"MR2T77YZCUTO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MR2T77YZCUTO2YCQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MR2T77YZ","created_at":"2026-05-18T12:29:32.376354+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/MR2T77YZCUTO2YCQUHR53HMQJM","json":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM.json","graph_json":"https://pith.science/api/pith-number/MR2T77YZCUTO2YCQUHR53HMQJM/graph.json","events_json":"https://pith.science/api/pith-number/MR2T77YZCUTO2YCQUHR53HMQJM/events.json","paper":"https://pith.science/paper/MR2T77YZ"},"agent_actions":{"view_html":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM","download_json":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM.json","view_paper":"https://pith.science/paper/MR2T77YZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03594&json=true","fetch_graph":"https://pith.science/api/pith-number/MR2T77YZCUTO2YCQUHR53HMQJM/graph.json","fetch_events":"https://pith.science/api/pith-number/MR2T77YZCUTO2YCQUHR53HMQJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM/action/storage_attestation","attest_author":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM/action/author_attestation","sign_citation":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM/action/citation_signature","submit_replication":"https://pith.science/pith/MR2T77YZCUTO2YCQUHR53HMQJM/action/replication_record"}},"created_at":"2026-05-18T02:24:27.968873+00:00","updated_at":"2026-05-18T02:24:27.968873+00:00"}