{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T4KF4URZGFKD7X47WYCXUOE5I4","short_pith_number":"pith:T4KF4URZ","schema_version":"1.0","canonical_sha256":"9f145e523931543fdf9fb6057a389d4724fcd879a67ead27f21c51b060377b92","source":{"kind":"arxiv","id":"2501.09851","version":1},"attestation_state":"computed","paper":{"title":"Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Gautam Chandrasekaran, Kevin Tian, Konstantinos Stavropoulos, Vasilis Kontonis","submitted_at":"2025-01-16T21:46:53Z","abstract_excerpt":"We study the problem of PAC learning $\\gamma$-margin halfspaces with Massart noise. We propose a simple proper learning algorithm, the Perspectron, that has sample complexity $\\widetilde{O}((\\epsilon\\gamma)^{-2})$ and achieves classification error at most $\\eta+\\epsilon$ where $\\eta$ is the Massart noise rate. Prior works [DGT19,CKMY20] came with worse sample complexity guarantees (in both $\\epsilon$ and $\\gamma$) or could only handle random classification noise [DDK+23,KIT+23] -- a much milder noise assumption. We also show that our results extend to the more challenging setting of learning g"},"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":"2501.09851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-16T21:46:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6e98e10faa6bbf9607cd80635c774b69108a4896dcc79dc6db5e6b9ccd07e731","abstract_canon_sha256":"36825c98699e8fd426faea18e8d5e77ef4c6f2b41685458e9b70eeb8ac18a922"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:12.325645Z","signature_b64":"gZKo3/Bi8GsW5528UUcq94u2F1iQC/3e7dAHVrrXGZ2A1nikbY2E/02TbnipLsZRgNLXkvhI4mX6pAHi1kMCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f145e523931543fdf9fb6057a389d4724fcd879a67ead27f21c51b060377b92","last_reissued_at":"2026-07-05T10:02:12.325194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:12.325194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Gautam Chandrasekaran, Kevin Tian, Konstantinos Stavropoulos, Vasilis Kontonis","submitted_at":"2025-01-16T21:46:53Z","abstract_excerpt":"We study the problem of PAC learning $\\gamma$-margin halfspaces with Massart noise. We propose a simple proper learning algorithm, the Perspectron, that has sample complexity $\\widetilde{O}((\\epsilon\\gamma)^{-2})$ and achieves classification error at most $\\eta+\\epsilon$ where $\\eta$ is the Massart noise rate. Prior works [DGT19,CKMY20] came with worse sample complexity guarantees (in both $\\epsilon$ and $\\gamma$) or could only handle random classification noise [DDK+23,KIT+23] -- a much milder noise assumption. We also show that our results extend to the more challenging setting of learning g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09851","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.09851/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.09851","created_at":"2026-07-05T10:02:12.325252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.09851v1","created_at":"2026-07-05T10:02:12.325252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09851","created_at":"2026-07-05T10:02:12.325252+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4KF4URZGFKD","created_at":"2026-07-05T10:02:12.325252+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4KF4URZGFKD7X47","created_at":"2026-07-05T10:02:12.325252+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4KF4URZ","created_at":"2026-07-05T10:02:12.325252+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/T4KF4URZGFKD7X47WYCXUOE5I4","json":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4.json","graph_json":"https://pith.science/api/pith-number/T4KF4URZGFKD7X47WYCXUOE5I4/graph.json","events_json":"https://pith.science/api/pith-number/T4KF4URZGFKD7X47WYCXUOE5I4/events.json","paper":"https://pith.science/paper/T4KF4URZ"},"agent_actions":{"view_html":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4","download_json":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4.json","view_paper":"https://pith.science/paper/T4KF4URZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.09851&json=true","fetch_graph":"https://pith.science/api/pith-number/T4KF4URZGFKD7X47WYCXUOE5I4/graph.json","fetch_events":"https://pith.science/api/pith-number/T4KF4URZGFKD7X47WYCXUOE5I4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4/action/storage_attestation","attest_author":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4/action/author_attestation","sign_citation":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4/action/citation_signature","submit_replication":"https://pith.science/pith/T4KF4URZGFKD7X47WYCXUOE5I4/action/replication_record"}},"created_at":"2026-07-05T10:02:12.325252+00:00","updated_at":"2026-07-05T10:02:12.325252+00:00"}