{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4ZP7HHMEW4LEL7ZTDVKYJLRLAY","short_pith_number":"pith:4ZP7HHME","schema_version":"1.0","canonical_sha256":"e65ff39d84b71645ff331d5584ae2b062f3a0b8ee67bd95d671d10deebea492d","source":{"kind":"arxiv","id":"1803.03880","version":3},"attestation_state":"computed","paper":{"title":"Combating Adversarial Attacks Using Sparse Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ramtin Pedarsani, Soorya Gopalakrishnan, Upamanyu Madhow, Zhinus Marzi","submitted_at":"2018-03-11T02:02:46Z","abstract_excerpt":"It is by now well-known that small adversarial perturbations can induce classification errors in deep neural networks (DNNs). In this paper, we make the case that sparse representations of the input data are a crucial tool for combating such attacks. For linear classifiers, we show that a sparsifying front end is provably effective against $\\ell_{\\infty}$-bounded attacks, reducing output distortion due to the attack by a factor of roughly $K / N$ where $N$ is the data dimension and $K$ is the sparsity level. We then extend this concept to DNNs, showing that a \"locally linear\" model can be used"},"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":"1803.03880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-11T02:02:46Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c81e039be47666c6051382a033240e07728081fdd76f7e51a2e1b4748299d632","abstract_canon_sha256":"5a0002a3d2e0f39fa05ab341e58e85246cc18f94d607fcaca24a47cd29aa3d92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.812687Z","signature_b64":"h0ZkWlmJFwvCZjNrRADbwcjejKcrGr8g3wED2xTmbidoX2ziUoZPRbLeNaYuxsHeoYxqoGmudMcCCS1dsL4tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e65ff39d84b71645ff331d5584ae2b062f3a0b8ee67bd95d671d10deebea492d","last_reissued_at":"2026-05-18T00:10:48.812044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.812044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combating Adversarial Attacks Using Sparse Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ramtin Pedarsani, Soorya Gopalakrishnan, Upamanyu Madhow, Zhinus Marzi","submitted_at":"2018-03-11T02:02:46Z","abstract_excerpt":"It is by now well-known that small adversarial perturbations can induce classification errors in deep neural networks (DNNs). In this paper, we make the case that sparse representations of the input data are a crucial tool for combating such attacks. For linear classifiers, we show that a sparsifying front end is provably effective against $\\ell_{\\infty}$-bounded attacks, reducing output distortion due to the attack by a factor of roughly $K / N$ where $N$ is the data dimension and $K$ is the sparsity level. We then extend this concept to DNNs, showing that a \"locally linear\" model can be used"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03880","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1803.03880","created_at":"2026-05-18T00:10:48.812155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03880v3","created_at":"2026-05-18T00:10:48.812155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03880","created_at":"2026-05-18T00:10:48.812155+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZP7HHMEW4LE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZP7HHMEW4LEL7ZT","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZP7HHME","created_at":"2026-05-18T12:32:05.422762+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/4ZP7HHMEW4LEL7ZTDVKYJLRLAY","json":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY.json","graph_json":"https://pith.science/api/pith-number/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/graph.json","events_json":"https://pith.science/api/pith-number/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/events.json","paper":"https://pith.science/paper/4ZP7HHME"},"agent_actions":{"view_html":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY","download_json":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY.json","view_paper":"https://pith.science/paper/4ZP7HHME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03880&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/action/storage_attestation","attest_author":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/action/author_attestation","sign_citation":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/action/citation_signature","submit_replication":"https://pith.science/pith/4ZP7HHMEW4LEL7ZTDVKYJLRLAY/action/replication_record"}},"created_at":"2026-05-18T00:10:48.812155+00:00","updated_at":"2026-05-18T00:10:48.812155+00:00"}