{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V3K5XM5MIVNXFFRO7SKIHRYVEP","short_pith_number":"pith:V3K5XM5M","schema_version":"1.0","canonical_sha256":"aed5dbb3ac455b72962efc9483c71523eb37cf8f0ea161a0d572a8d3919e68aa","source":{"kind":"arxiv","id":"1707.01242","version":1},"attestation_state":"computed","paper":{"title":"Learning Geometric Concepts with Nasty Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2017-07-05T07:41:40Z","abstract_excerpt":"We study the efficient learnability of geometric concept classes - specifically, low-degree polynomial threshold functions (PTFs) and intersections of halfspaces - when a fraction of the data is adversarially corrupted. We give the first polynomial-time PAC learning algorithms for these concept classes with dimension-independent error guarantees in the presence of nasty noise under the Gaussian distribution. In the nasty noise model, an omniscient adversary can arbitrarily corrupt a small fraction of both the unlabeled data points and their labels. This model generalizes well-studied noise mod"},"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":"1707.01242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T07:41:40Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"8fbfcbc4f9b760d6ded99670fd5065af8189be2e4c96060281775e0ab5ccccc4","abstract_canon_sha256":"2b11d01ff4f97cf3d56efc88d414e76f7630b73a40facfb342809def6aa45001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:53.339768Z","signature_b64":"OjsH0/LTnqHu9SsijiIKMjWOk4gVDo1ChQXMVdtvavmsGmEwgS7+siDVxGft3bXjRcgfhrLPVT0ZsLHBZUKSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed5dbb3ac455b72962efc9483c71523eb37cf8f0ea161a0d572a8d3919e68aa","last_reissued_at":"2026-05-18T00:40:53.339352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:53.339352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Geometric Concepts with Nasty Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2017-07-05T07:41:40Z","abstract_excerpt":"We study the efficient learnability of geometric concept classes - specifically, low-degree polynomial threshold functions (PTFs) and intersections of halfspaces - when a fraction of the data is adversarially corrupted. We give the first polynomial-time PAC learning algorithms for these concept classes with dimension-independent error guarantees in the presence of nasty noise under the Gaussian distribution. In the nasty noise model, an omniscient adversary can arbitrarily corrupt a small fraction of both the unlabeled data points and their labels. This model generalizes well-studied noise mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01242","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":"1707.01242","created_at":"2026-05-18T00:40:53.339416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01242v1","created_at":"2026-05-18T00:40:53.339416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01242","created_at":"2026-05-18T00:40:53.339416+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3K5XM5MIVNX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3K5XM5MIVNXFFRO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3K5XM5M","created_at":"2026-05-18T12:31:49.984773+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/V3K5XM5MIVNXFFRO7SKIHRYVEP","json":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP.json","graph_json":"https://pith.science/api/pith-number/V3K5XM5MIVNXFFRO7SKIHRYVEP/graph.json","events_json":"https://pith.science/api/pith-number/V3K5XM5MIVNXFFRO7SKIHRYVEP/events.json","paper":"https://pith.science/paper/V3K5XM5M"},"agent_actions":{"view_html":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP","download_json":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP.json","view_paper":"https://pith.science/paper/V3K5XM5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/V3K5XM5MIVNXFFRO7SKIHRYVEP/graph.json","fetch_events":"https://pith.science/api/pith-number/V3K5XM5MIVNXFFRO7SKIHRYVEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP/action/storage_attestation","attest_author":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP/action/author_attestation","sign_citation":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP/action/citation_signature","submit_replication":"https://pith.science/pith/V3K5XM5MIVNXFFRO7SKIHRYVEP/action/replication_record"}},"created_at":"2026-05-18T00:40:53.339416+00:00","updated_at":"2026-05-18T00:40:53.339416+00:00"}