{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JC4B7E6L7SRKMPXNXXFKRT44XQ","short_pith_number":"pith:JC4B7E6L","schema_version":"1.0","canonical_sha256":"48b81f93cbfca2a63eedbdcaa8cf9cbc130edcebe692acbf17e759d7038073d2","source":{"kind":"arxiv","id":"2204.06974","version":2},"attestation_state":"computed","paper":{"title":"Planting Undetectable Backdoors in Machine Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Michael P. Kim, Or Zamir, Shafi Goldwasser, Vinod Vaikuntanathan","submitted_at":"2022-04-14T13:55:21Z","abstract_excerpt":"Given the computational cost and technical expertise required to train machine learning models, users may delegate the task of learning to a service provider. We show how a malicious learner can plant an undetectable backdoor into a classifier. On the surface, such a backdoored classifier behaves normally, but in reality, the learner maintains a mechanism for changing the classification of any input, with only a slight perturbation. Importantly, without the appropriate \"backdoor key\", the mechanism is hidden and cannot be detected by any computationally-bounded observer. We demonstrate two fra"},"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":"2204.06974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-14T13:55:21Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"bdbf653750b695f82699f422d9675af40fa6fcf2ad026c6e6fd97850cc74fdde","abstract_canon_sha256":"82e8b1ce4e615f6cc6023fba425540dab5a614d34b6da51b7ed420d70e13f749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:22.769782Z","signature_b64":"UiexthfKmR5Pa1bVGtHPIK2AE3FiuXfIQ7LhuOTjqZfss0Bv36fRgNISc1WzK6ZGrsxZA/Shbgh70esA8thCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b81f93cbfca2a63eedbdcaa8cf9cbc130edcebe692acbf17e759d7038073d2","last_reissued_at":"2026-07-05T09:33:22.769245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:22.769245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planting Undetectable Backdoors in Machine Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Michael P. Kim, Or Zamir, Shafi Goldwasser, Vinod Vaikuntanathan","submitted_at":"2022-04-14T13:55:21Z","abstract_excerpt":"Given the computational cost and technical expertise required to train machine learning models, users may delegate the task of learning to a service provider. We show how a malicious learner can plant an undetectable backdoor into a classifier. On the surface, such a backdoored classifier behaves normally, but in reality, the learner maintains a mechanism for changing the classification of any input, with only a slight perturbation. Importantly, without the appropriate \"backdoor key\", the mechanism is hidden and cannot be detected by any computationally-bounded observer. We demonstrate two fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06974","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/2204.06974/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":"2204.06974","created_at":"2026-07-05T09:33:22.769305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.06974v2","created_at":"2026-07-05T09:33:22.769305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06974","created_at":"2026-07-05T09:33:22.769305+00:00"},{"alias_kind":"pith_short_12","alias_value":"JC4B7E6L7SRK","created_at":"2026-07-05T09:33:22.769305+00:00"},{"alias_kind":"pith_short_16","alias_value":"JC4B7E6L7SRKMPXN","created_at":"2026-07-05T09:33:22.769305+00:00"},{"alias_kind":"pith_short_8","alias_value":"JC4B7E6L","created_at":"2026-07-05T09:33:22.769305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13214","citing_title":"Backdoor Channels Hidden in Latent Space: Cryptographic Undetectability in Modern Neural Networks","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13214","citing_title":"Backdoor Channels Hidden in Latent Space: Cryptographic Undetectability in Modern Neural Networks","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ","json":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ.json","graph_json":"https://pith.science/api/pith-number/JC4B7E6L7SRKMPXNXXFKRT44XQ/graph.json","events_json":"https://pith.science/api/pith-number/JC4B7E6L7SRKMPXNXXFKRT44XQ/events.json","paper":"https://pith.science/paper/JC4B7E6L"},"agent_actions":{"view_html":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ","download_json":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ.json","view_paper":"https://pith.science/paper/JC4B7E6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.06974&json=true","fetch_graph":"https://pith.science/api/pith-number/JC4B7E6L7SRKMPXNXXFKRT44XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JC4B7E6L7SRKMPXNXXFKRT44XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ/action/storage_attestation","attest_author":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ/action/author_attestation","sign_citation":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ/action/citation_signature","submit_replication":"https://pith.science/pith/JC4B7E6L7SRKMPXNXXFKRT44XQ/action/replication_record"}},"created_at":"2026-07-05T09:33:22.769305+00:00","updated_at":"2026-07-05T09:33:22.769305+00:00"}