{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PU7NTUH3AWME2ATTN7QZAS74ZE","short_pith_number":"pith:PU7NTUH3","schema_version":"1.0","canonical_sha256":"7d3ed9d0fb05984d02736fe1904bfcc90e7c52e26875edeb3a4de2a6f1973e0b","source":{"kind":"arxiv","id":"2404.00529","version":1},"attestation_state":"computed","paper":{"title":"Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Nikos Zarifis, Sihan Liu, Vasilis Kontonis","submitted_at":"2024-03-31T02:03:35Z","abstract_excerpt":"We study the efficient learnability of low-degree polynomial threshold functions (PTFs) in the presence of a constant fraction of adversarial corruptions. Our main algorithmic result is a polynomial-time PAC learning algorithm for this concept class in the strong contamination model under the Gaussian distribution with error guarantee $O_{d, c}(\\text{opt}^{1-c})$, for any desired constant $c>0$, where $\\text{opt}$ is the fraction of corruptions. In the strong contamination model, an omniscient adversary can arbitrarily corrupt an $\\text{opt}$-fraction of the data points and their labels. This "},"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":"2404.00529","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-31T02:03:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bb8c2fc5153886441be4dd0a70f30729d524815a999283bab9df8dffc8ad25f6","abstract_canon_sha256":"0778c7de6d5eec53864d51d7bff326dc6185fffe0be65f6104acf781f5bf6ce1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:34.628266Z","signature_b64":"kdzIup5oP+LUKzB5eXnKmuGCNiUUbmQpwsdUEKKhqzOwhBwiXO5WSDso+EffaY3Ukzhm/zdndueZT+/Eni9xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d3ed9d0fb05984d02736fe1904bfcc90e7c52e26875edeb3a4de2a6f1973e0b","last_reissued_at":"2026-07-05T08:02:34.627775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:34.627775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Nikos Zarifis, Sihan Liu, Vasilis Kontonis","submitted_at":"2024-03-31T02:03:35Z","abstract_excerpt":"We study the efficient learnability of low-degree polynomial threshold functions (PTFs) in the presence of a constant fraction of adversarial corruptions. Our main algorithmic result is a polynomial-time PAC learning algorithm for this concept class in the strong contamination model under the Gaussian distribution with error guarantee $O_{d, c}(\\text{opt}^{1-c})$, for any desired constant $c>0$, where $\\text{opt}$ is the fraction of corruptions. In the strong contamination model, an omniscient adversary can arbitrarily corrupt an $\\text{opt}$-fraction of the data points and their labels. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00529","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/2404.00529/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":"2404.00529","created_at":"2026-07-05T08:02:34.627830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00529v1","created_at":"2026-07-05T08:02:34.627830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00529","created_at":"2026-07-05T08:02:34.627830+00:00"},{"alias_kind":"pith_short_12","alias_value":"PU7NTUH3AWME","created_at":"2026-07-05T08:02:34.627830+00:00"},{"alias_kind":"pith_short_16","alias_value":"PU7NTUH3AWME2ATT","created_at":"2026-07-05T08:02:34.627830+00:00"},{"alias_kind":"pith_short_8","alias_value":"PU7NTUH3","created_at":"2026-07-05T08:02:34.627830+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/PU7NTUH3AWME2ATTN7QZAS74ZE","json":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE.json","graph_json":"https://pith.science/api/pith-number/PU7NTUH3AWME2ATTN7QZAS74ZE/graph.json","events_json":"https://pith.science/api/pith-number/PU7NTUH3AWME2ATTN7QZAS74ZE/events.json","paper":"https://pith.science/paper/PU7NTUH3"},"agent_actions":{"view_html":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE","download_json":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE.json","view_paper":"https://pith.science/paper/PU7NTUH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00529&json=true","fetch_graph":"https://pith.science/api/pith-number/PU7NTUH3AWME2ATTN7QZAS74ZE/graph.json","fetch_events":"https://pith.science/api/pith-number/PU7NTUH3AWME2ATTN7QZAS74ZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE/action/storage_attestation","attest_author":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE/action/author_attestation","sign_citation":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE/action/citation_signature","submit_replication":"https://pith.science/pith/PU7NTUH3AWME2ATTN7QZAS74ZE/action/replication_record"}},"created_at":"2026-07-05T08:02:34.627830+00:00","updated_at":"2026-07-05T08:02:34.627830+00:00"}