{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:POLNIOKO4ABD3N7O6HEDYAA2US","short_pith_number":"pith:POLNIOKO","schema_version":"1.0","canonical_sha256":"7b96d4394ee0023db7eef1c83c001aa4ac07eba2489788aff3143658aeb42fbd","source":{"kind":"arxiv","id":"2406.00588","version":1},"attestation_state":"computed","paper":{"title":"Generalization Bound and New Algorithm for Clean-Label Backdoor Attack","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Lijia Yu, Lijun Zhang, Shuang Liu, Xiao-Shan Gao, Yibo Miao","submitted_at":"2024-06-02T01:46:58Z","abstract_excerpt":"The generalization bound is a crucial theoretical tool for assessing the generalizability of learning methods and there exist vast literatures on generalizability of normal learning, adversarial learning, and data poisoning. Unlike other data poison attacks, the backdoor attack has the special property that the poisoned triggers are contained in both the training set and the test set and the purpose of the attack is two-fold. To our knowledge, the generalization bound for the backdoor attack has not been established. In this paper, we fill this gap by deriving algorithm-independent generalizat"},"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":"2406.00588","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-02T01:46:58Z","cross_cats_sorted":["cs.CR","math.ST","stat.TH"],"title_canon_sha256":"b8c62d82c49799ceea0c3cfa6a7e8904bc92d72a45e5ccddfdd4228ff290536d","abstract_canon_sha256":"77d55930cd6173a735f8fe1a94c71433f3029f94e9f7cf05c8b0fb8fb9e95735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:10.072822Z","signature_b64":"u+4DQweMzQp8Lc52pjqdkyK9CbrkuAierBB/HGDyaYN+RAFSTXKb2nwkhSPu7D444Izf5jFPaaqf9QkU2ozpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b96d4394ee0023db7eef1c83c001aa4ac07eba2489788aff3143658aeb42fbd","last_reissued_at":"2026-07-05T08:27:10.072390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:10.072390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization Bound and New Algorithm for Clean-Label Backdoor Attack","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Lijia Yu, Lijun Zhang, Shuang Liu, Xiao-Shan Gao, Yibo Miao","submitted_at":"2024-06-02T01:46:58Z","abstract_excerpt":"The generalization bound is a crucial theoretical tool for assessing the generalizability of learning methods and there exist vast literatures on generalizability of normal learning, adversarial learning, and data poisoning. Unlike other data poison attacks, the backdoor attack has the special property that the poisoned triggers are contained in both the training set and the test set and the purpose of the attack is two-fold. To our knowledge, the generalization bound for the backdoor attack has not been established. In this paper, we fill this gap by deriving algorithm-independent generalizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00588","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/2406.00588/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":"2406.00588","created_at":"2026-07-05T08:27:10.072450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.00588v1","created_at":"2026-07-05T08:27:10.072450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00588","created_at":"2026-07-05T08:27:10.072450+00:00"},{"alias_kind":"pith_short_12","alias_value":"POLNIOKO4ABD","created_at":"2026-07-05T08:27:10.072450+00:00"},{"alias_kind":"pith_short_16","alias_value":"POLNIOKO4ABD3N7O","created_at":"2026-07-05T08:27:10.072450+00:00"},{"alias_kind":"pith_short_8","alias_value":"POLNIOKO","created_at":"2026-07-05T08:27:10.072450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15308","citing_title":"BadSR: Stealthy Label Backdoor Attacks on Image Super-Resolution","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US","json":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US.json","graph_json":"https://pith.science/api/pith-number/POLNIOKO4ABD3N7O6HEDYAA2US/graph.json","events_json":"https://pith.science/api/pith-number/POLNIOKO4ABD3N7O6HEDYAA2US/events.json","paper":"https://pith.science/paper/POLNIOKO"},"agent_actions":{"view_html":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US","download_json":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US.json","view_paper":"https://pith.science/paper/POLNIOKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.00588&json=true","fetch_graph":"https://pith.science/api/pith-number/POLNIOKO4ABD3N7O6HEDYAA2US/graph.json","fetch_events":"https://pith.science/api/pith-number/POLNIOKO4ABD3N7O6HEDYAA2US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US/action/storage_attestation","attest_author":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US/action/author_attestation","sign_citation":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US/action/citation_signature","submit_replication":"https://pith.science/pith/POLNIOKO4ABD3N7O6HEDYAA2US/action/replication_record"}},"created_at":"2026-07-05T08:27:10.072450+00:00","updated_at":"2026-07-05T08:27:10.072450+00:00"}