{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E4LQU2RRAXUKRY2XPNP4RWKYKQ","short_pith_number":"pith:E4LQU2RR","schema_version":"1.0","canonical_sha256":"27170a6a3105e8a8e3577b5fc8d95854151c879d172e04ba07e0a4ed0b917ed2","source":{"kind":"arxiv","id":"2605.13214","version":1},"attestation_state":"computed","paper":{"title":"Backdoor Channels Hidden in Latent Space: Cryptographic Undetectability in Modern Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Neural networks can hide backdoors as statistically indistinguishable latent directions, reducing detection to an intractable hypothesis test on model parameters.","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Eirik Reiestad, Inga Str\\\"umke, Kristian Gj{\\o}steen, Marte Eggen","submitted_at":"2026-05-13T09:06:25Z","abstract_excerpt":"Recent cryptographic results establish that neural networks can be backdoored such that no efficient algorithm can distinguish them from a clean model. These guarantees, however, have been confined to stylised architectures of limited practical relevance, leaving open whether comparable undetectability extends to modern, end-to-end trained networks. We construct such an attack mechanism for state-of-the-art architectures, closely aligned to the cryptographic notion of undetectability, by identifying backdoor channels as learned latent directions, and show that the question of undetectability r"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-13T09:06:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e7b8335d6cd6ec80eabb3f99a2153738a0a57aaa2990561a545ac320a9df870f","abstract_canon_sha256":"ff1d52e33a35d77f68cff34a954b3ac8f8038e05c1445207f5618451866f2d88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:48.499137Z","signature_b64":"vxwFKe1xB827FWdzdS7rii6WF1YbrfsUTxzNm6VGTgiWTYeY6/ZqD4TmsiLs0YwDMsUG/e9xMEgBTA3l5paXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27170a6a3105e8a8e3577b5fc8d95854151c879d172e04ba07e0a4ed0b917ed2","last_reissued_at":"2026-05-18T03:08:48.498585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:48.498585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backdoor Channels Hidden in Latent Space: Cryptographic Undetectability in Modern Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Neural networks can hide backdoors as statistically indistinguishable latent directions, reducing detection to an intractable hypothesis test on model parameters.","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Eirik Reiestad, Inga Str\\\"umke, Kristian Gj{\\o}steen, Marte Eggen","submitted_at":"2026-05-13T09:06:25Z","abstract_excerpt":"Recent cryptographic results establish that neural networks can be backdoored such that no efficient algorithm can distinguish them from a clean model. These guarantees, however, have been confined to stylised architectures of limited practical relevance, leaving open whether comparable undetectability extends to modern, end-to-end trained networks. We construct such an attack mechanism for state-of-the-art architectures, closely aligned to the cryptographic notion of undetectability, by identifying backdoor channels as learned latent directions, and show that the question of undetectability r"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if exploitable channels within a network's latent space are statistically indistinguishable from naturally learned directions, an attacker need not introduce foreign structure but can instead exploit the geometry the network already possesses.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The hypothesis test between clean and backdoored parameter distributions is intractable in practice for state-of-the-art models; this is stated as a conjecture without a formal reduction or hardness proof.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Backdoors can be realized as statistically natural latent directions in modern neural networks, achieving high attack success with negligible clean accuracy loss and resisting existing defenses.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Neural networks can hide backdoors as statistically indistinguishable latent directions, reducing detection to an intractable hypothesis test on model parameters.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c2aa25b68bb6af23ecae77c67ebf294b48367790eab7a4a030685130825084c3"},"source":{"id":"2605.13214","kind":"arxiv","version":1},"verdict":{"id":"3f60653d-dec8-485b-9f8e-26f5dcf66494","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:33:33.963434Z","strongest_claim":"if exploitable channels within a network's latent space are statistically indistinguishable from naturally learned directions, an attacker need not introduce foreign structure but can instead exploit the geometry the network already possesses.","one_line_summary":"Backdoors can be realized as statistically natural latent directions in modern neural networks, achieving high attack success with negligible clean accuracy loss and resisting existing defenses.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The hypothesis test between clean and backdoored parameter distributions is intractable in practice for state-of-the-art models; this is stated as a conjecture without a formal reduction or hardness proof.","pith_extraction_headline":"Neural networks can hide backdoors as statistically indistinguishable latent directions, reducing detection to an intractable hypothesis test on model parameters."},"references":{"count":31,"sample":[{"doi":"","year":2025,"title":"Backdoor attacks and defenses in computer vision domain: A survey.arXiv preprint arXiv:2509.07504, 2025","work_id":"22a13bec-74e2-44d2-8484-6385db6a5ba7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Complexity theoretic lower bounds for sparse principal component detection","work_id":"8ace9111-4efc-425d-b55e-bd1030ac543d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Computational Lower Bounds for Sparse PCA","work_id":"c8902f8d-0de9-4766-b0d4-e00ae72c6596","ref_index":3,"cited_arxiv_id":"1304.0828","is_internal_anchor":true},{"doi":"","year":2019,"title":"Brennan and Guy Bresler","work_id":"a0e8a45c-e64c-46e6-a89b-916d0bcbe2c8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Data free backdoor attacks.Advances in Neural Information Processing Systems, 37:23881–23911, 2024","work_id":"052bbb93-8ee7-40ae-bc00-41a07f3cfd58","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"9f6fcd43dee3685a02c3078d870d16706801aa608511822ee66ded0fc2acf78d","internal_anchors":5},"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":"2605.13214","created_at":"2026-05-18T03:08:48.498678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13214v1","created_at":"2026-05-18T03:08:48.498678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13214","created_at":"2026-05-18T03:08:48.498678+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4LQU2RRAXUK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4LQU2RRAXUKRY2X","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4LQU2RR","created_at":"2026-05-18T12:33:37.589309+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/E4LQU2RRAXUKRY2XPNP4RWKYKQ","json":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ.json","graph_json":"https://pith.science/api/pith-number/E4LQU2RRAXUKRY2XPNP4RWKYKQ/graph.json","events_json":"https://pith.science/api/pith-number/E4LQU2RRAXUKRY2XPNP4RWKYKQ/events.json","paper":"https://pith.science/paper/E4LQU2RR"},"agent_actions":{"view_html":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ","download_json":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ.json","view_paper":"https://pith.science/paper/E4LQU2RR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13214&json=true","fetch_graph":"https://pith.science/api/pith-number/E4LQU2RRAXUKRY2XPNP4RWKYKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/E4LQU2RRAXUKRY2XPNP4RWKYKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ/action/storage_attestation","attest_author":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ/action/author_attestation","sign_citation":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ/action/citation_signature","submit_replication":"https://pith.science/pith/E4LQU2RRAXUKRY2XPNP4RWKYKQ/action/replication_record"}},"created_at":"2026-05-18T03:08:48.498678+00:00","updated_at":"2026-05-18T03:08:48.498678+00:00"}