{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XH4XQSE7BNFCR2PF6KH7PRYUNO","short_pith_number":"pith:XH4XQSE7","schema_version":"1.0","canonical_sha256":"b9f978489f0b4a28e9e5f28ff7c7146ba0c3bc4b6d1840b15036bb4ad6c55dc4","source":{"kind":"arxiv","id":"2210.02713","version":2},"attestation_state":"computed","paper":{"title":"On Optimal Learning Under Targeted Data Poisoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Idan Mehalel, Mohammad Mahmoody, Shay Moran, Steve Hanneke","submitted_at":"2022-10-06T06:49:48Z","abstract_excerpt":"Consider the task of learning a hypothesis class $\\mathcal{H}$ in the presence of an adversary that can replace up to an $\\eta$ fraction of the examples in the training set with arbitrary adversarial examples. The adversary aims to fail the learner on a particular target test point $x$ which is known to the adversary but not to the learner. In this work we aim to characterize the smallest achievable error $\\epsilon=\\epsilon(\\eta)$ by the learner in the presence of such an adversary in both realizable and agnostic settings. We fully achieve this in the realizable setting, proving that $\\epsilon"},"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":"2210.02713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-06T06:49:48Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"5a87cd2ec5d7360b66ed91e8a4f03b0486c0e8bddad4ae11b391d65e0b7761b0","abstract_canon_sha256":"2a4cea871fdf3b9420ea26253c26d3214762272012901880dc07fb4d61344235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:51.064102Z","signature_b64":"G+43awGrBvBkXENQoGkTOZW9uaxcKWeae2qt8Q3ORB584Dj25giIzkWoRYTvFcGzlZwTpV9i7b3FjacoAUFCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f978489f0b4a28e9e5f28ff7c7146ba0c3bc4b6d1840b15036bb4ad6c55dc4","last_reissued_at":"2026-07-05T05:05:51.063702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:51.063702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Learning Under Targeted Data Poisoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Idan Mehalel, Mohammad Mahmoody, Shay Moran, Steve Hanneke","submitted_at":"2022-10-06T06:49:48Z","abstract_excerpt":"Consider the task of learning a hypothesis class $\\mathcal{H}$ in the presence of an adversary that can replace up to an $\\eta$ fraction of the examples in the training set with arbitrary adversarial examples. The adversary aims to fail the learner on a particular target test point $x$ which is known to the adversary but not to the learner. In this work we aim to characterize the smallest achievable error $\\epsilon=\\epsilon(\\eta)$ by the learner in the presence of such an adversary in both realizable and agnostic settings. We fully achieve this in the realizable setting, proving that $\\epsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.02713/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":"2210.02713","created_at":"2026-07-05T05:05:51.063757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02713v2","created_at":"2026-07-05T05:05:51.063757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02713","created_at":"2026-07-05T05:05:51.063757+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH4XQSE7BNFC","created_at":"2026-07-05T05:05:51.063757+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH4XQSE7BNFCR2PF","created_at":"2026-07-05T05:05:51.063757+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH4XQSE7","created_at":"2026-07-05T05:05:51.063757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16325","citing_title":"Phase Transitions in Driven Informational Systems: A Two-Field Perspective on Learning Theory and Non-Equilibrium Chemistry","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO","json":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO.json","graph_json":"https://pith.science/api/pith-number/XH4XQSE7BNFCR2PF6KH7PRYUNO/graph.json","events_json":"https://pith.science/api/pith-number/XH4XQSE7BNFCR2PF6KH7PRYUNO/events.json","paper":"https://pith.science/paper/XH4XQSE7"},"agent_actions":{"view_html":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO","download_json":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO.json","view_paper":"https://pith.science/paper/XH4XQSE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02713&json=true","fetch_graph":"https://pith.science/api/pith-number/XH4XQSE7BNFCR2PF6KH7PRYUNO/graph.json","fetch_events":"https://pith.science/api/pith-number/XH4XQSE7BNFCR2PF6KH7PRYUNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO/action/storage_attestation","attest_author":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO/action/author_attestation","sign_citation":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO/action/citation_signature","submit_replication":"https://pith.science/pith/XH4XQSE7BNFCR2PF6KH7PRYUNO/action/replication_record"}},"created_at":"2026-07-05T05:05:51.063757+00:00","updated_at":"2026-07-05T05:05:51.063757+00:00"}