{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XGYKGKELLB27GWS6QI64VWFZST","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be79287cd0b4835d87a4ea0069326fbe1bcf2588d839ce266ab0d2c61886c46d","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-05T18:48:09Z","title_canon_sha256":"0fa9e7dc09eafd9c787eb6c712b03eb3824dfafa953e4cac6c0d93b4ed0489b0"},"schema_version":"1.0","source":{"id":"2605.04209","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04209","created_at":"2026-07-07T02:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04209v2","created_at":"2026-07-07T02:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04209","created_at":"2026-07-07T02:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"XGYKGKELLB27","created_at":"2026-07-07T02:17:26Z"},{"alias_kind":"pith_short_16","alias_value":"XGYKGKELLB27GWS6","created_at":"2026-07-07T02:17:26Z"},{"alias_kind":"pith_short_8","alias_value":"XGYKGKEL","created_at":"2026-07-07T02:17:26Z"}],"graph_snapshots":[{"event_id":"sha256:a9215aa3175b0bb22ba9a41b3827029033a3d7c91e42c424213546fb89b43905","target":"graph","created_at":"2026-07-07T02:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that distinguishing the backdoor-injected model from this reference is at least as hard as Sparse PCA detection, which is computationally infeasible under standard hardness assumptions. The guarantee holds against any probabilistic polynomial-time distinguisher with white-box access to the parameters."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Under a mild margin condition on the pre-trained classifier, we show that the dithered reference is functionally equivalent to the original classifier."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Sparse Backdoor plants a provably undetectable backdoor in neural network weights via structured sparse perturbations and isotropic Gaussian dithering, with detection hardness reduced to Sparse PCA."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A sparse perturbation masked by Gaussian dither embeds backdoors whose detection reduces to the hard Sparse PCA problem."}],"snapshot_sha256":"4abf5a0048e9af099c8f815670b13a585c52cba3679462b0359f0ec9967571ba"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"2da0535982af8a43209d79cace1004967f5ad8af61d552cf59704771c860b437"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T12:36:29.502660Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:21.106278Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:42:12.068385Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.04209/integrity.json","findings":[],"snapshot_sha256":"8bfe0ea30b0c8efd3dea90410b7bf352ab53d4d5b4b3b87a22774ab37e819647","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present Sparse Backdoor, a supply-chain attack that plants a provably undetectable backdoor in pre-trained image classifiers, including convolutional networks and Vision Transformers. The attack injects a structured sparse perturbation along a randomly chosen direction into a small subset of columns at each fully connected layer, propagating a trigger signal to an adversary-chosen target class, and masks the perturbation with an independent isotropic Gaussian dither. The dither serves a single technical purpose: it induces a clean reference distribution anchored at the pre-trained weights, ","authors_text":"Ashish Hooda, Atharv Singh Patlan, Kassem Fawaz, Nils Palumbo, Sarthak Choudhary, Somesh Jha","cross_cats":["cs.AI","cs.LG"],"headline":"A sparse perturbation masked by Gaussian dither embeds backdoors whose detection reduces to the hard Sparse PCA problem.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-05T18:48:09Z","title":"Undetectable Backdoors in Model Parameters: Hiding Sparse Secrets in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04209","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T17:46:52.224990Z","id":"d5f04a65-83af-45f4-ace9-2a199959f977","model_set":{"reader":"grok-4.3"},"one_line_summary":"Sparse Backdoor plants a provably undetectable backdoor in neural network weights via structured sparse perturbations and isotropic Gaussian dithering, with detection hardness reduced to Sparse PCA.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A sparse perturbation masked by Gaussian dither embeds backdoors whose detection reduces to the hard Sparse PCA problem.","strongest_claim":"We prove that distinguishing the backdoor-injected model from this reference is at least as hard as Sparse PCA detection, which is computationally infeasible under standard hardness assumptions. The guarantee holds against any probabilistic polynomial-time distinguisher with white-box access to the parameters.","weakest_assumption":"Under a mild margin condition on the pre-trained classifier, we show that the dithered reference is functionally equivalent to the original classifier."}},"verdict_id":"d5f04a65-83af-45f4-ace9-2a199959f977"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ff5fedcb1e0e875a8d8c390921f9da6972fae92e72b8facf7301dfd37a97b9c","target":"record","created_at":"2026-07-07T02:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be79287cd0b4835d87a4ea0069326fbe1bcf2588d839ce266ab0d2c61886c46d","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-05T18:48:09Z","title_canon_sha256":"0fa9e7dc09eafd9c787eb6c712b03eb3824dfafa953e4cac6c0d93b4ed0489b0"},"schema_version":"1.0","source":{"id":"2605.04209","kind":"arxiv","version":2}},"canonical_sha256":"b9b0a3288b5875f35a5e823dcad8b994d37db6e64763d978c8deab016db7563a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9b0a3288b5875f35a5e823dcad8b994d37db6e64763d978c8deab016db7563a","first_computed_at":"2026-07-07T02:17:26.415350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:17:26.415350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SS3sJCoOg2pkNMdYrw6PGFT0SJ+gUFdpkqh2CECPa4/j9KSHaN+M4RrATEN0kSyi3wbpwXN9UnuG+jxBTzyRDA==","signature_status":"signed_v1","signed_at":"2026-07-07T02:17:26.416176Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04209","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff5fedcb1e0e875a8d8c390921f9da6972fae92e72b8facf7301dfd37a97b9c","sha256:a9215aa3175b0bb22ba9a41b3827029033a3d7c91e42c424213546fb89b43905"],"state_sha256":"37e4e1ddb576c352568a3e898534faadb0cb5cfe27ea39d494c722dc35759256"}