{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZWNAWCYM4MY6YRLGIEIUKBX5QP","short_pith_number":"pith:ZWNAWCYM","schema_version":"1.0","canonical_sha256":"cd9a0b0b0ce331ec456641114506fd83e2c6e9cff1a5fa3a5d8302c669422136","source":{"kind":"arxiv","id":"2103.00671","version":4},"attestation_state":"computed","paper":{"title":"Robust learning under clean-label attack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Avrim Blum, Han Shao, Jian Qian, Steve Hanneke","submitted_at":"2021-03-01T00:21:15Z","abstract_excerpt":"We study the problem of robust learning under clean-label data-poisoning attacks, where the attacker injects (an arbitrary set of) correctly-labeled examples to the training set to fool the algorithm into making mistakes on specific test instances at test time. The learning goal is to minimize the attackable rate (the probability mass of attackable test instances), which is more difficult than optimal PAC learning. As we show, any robust algorithm with diminishing attackable rate can achieve the optimal dependence on $\\epsilon$ in its PAC sample complexity, i.e., $O(1/\\epsilon)$. On the other "},"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":"2103.00671","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-01T00:21:15Z","cross_cats_sorted":[],"title_canon_sha256":"b262cdcfe94df09ff0968b3f0022efe16ef65c6e927fd1a28599ff30a8aec59a","abstract_canon_sha256":"f4ebf50484e4e922f98ce60a1922458a9db7e28d32790d598e399fcf6678857f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:54.224560Z","signature_b64":"UakJO+1TyDmjtjld8gVNJBPv4v/jMoR1BtxCtwDN682YXaXK5IMLkI+y3Ab5YoMahUw9rF2KjfAaFV3EBHQ9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd9a0b0b0ce331ec456641114506fd83e2c6e9cff1a5fa3a5d8302c669422136","last_reissued_at":"2026-07-05T02:55:54.224181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:54.224181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust learning under clean-label attack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Avrim Blum, Han Shao, Jian Qian, Steve Hanneke","submitted_at":"2021-03-01T00:21:15Z","abstract_excerpt":"We study the problem of robust learning under clean-label data-poisoning attacks, where the attacker injects (an arbitrary set of) correctly-labeled examples to the training set to fool the algorithm into making mistakes on specific test instances at test time. The learning goal is to minimize the attackable rate (the probability mass of attackable test instances), which is more difficult than optimal PAC learning. As we show, any robust algorithm with diminishing attackable rate can achieve the optimal dependence on $\\epsilon$ in its PAC sample complexity, i.e., $O(1/\\epsilon)$. On the other "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.00671","kind":"arxiv","version":4},"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/2103.00671/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":"2103.00671","created_at":"2026-07-05T02:55:54.224248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.00671v4","created_at":"2026-07-05T02:55:54.224248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.00671","created_at":"2026-07-05T02:55:54.224248+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWNAWCYM4MY6","created_at":"2026-07-05T02:55:54.224248+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWNAWCYM4MY6YRLG","created_at":"2026-07-05T02:55:54.224248+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWNAWCYM","created_at":"2026-07-05T02:55:54.224248+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/ZWNAWCYM4MY6YRLGIEIUKBX5QP","json":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP.json","graph_json":"https://pith.science/api/pith-number/ZWNAWCYM4MY6YRLGIEIUKBX5QP/graph.json","events_json":"https://pith.science/api/pith-number/ZWNAWCYM4MY6YRLGIEIUKBX5QP/events.json","paper":"https://pith.science/paper/ZWNAWCYM"},"agent_actions":{"view_html":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP","download_json":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP.json","view_paper":"https://pith.science/paper/ZWNAWCYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.00671&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWNAWCYM4MY6YRLGIEIUKBX5QP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWNAWCYM4MY6YRLGIEIUKBX5QP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP/action/storage_attestation","attest_author":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP/action/author_attestation","sign_citation":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP/action/citation_signature","submit_replication":"https://pith.science/pith/ZWNAWCYM4MY6YRLGIEIUKBX5QP/action/replication_record"}},"created_at":"2026-07-05T02:55:54.224248+00:00","updated_at":"2026-07-05T02:55:54.224248+00:00"}