{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L35APBMTKN2TT624I6N6AJUWHA","short_pith_number":"pith:L35APBMT","schema_version":"1.0","canonical_sha256":"5efa078593537539fb5c479be0269638005582b0d1f0dea59b32d02600214877","source":{"kind":"arxiv","id":"1909.05040","version":1},"attestation_state":"computed","paper":{"title":"Sparse and Imperceivable Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein","submitted_at":"2019-09-11T13:28:44Z","abstract_excerpt":"Neural networks have been proven to be vulnerable to a variety of adversarial attacks. From a safety perspective, highly sparse adversarial attacks are particularly dangerous. On the other hand the pixelwise perturbations of sparse attacks are typically large and thus can be potentially detected. We propose a new black-box technique to craft adversarial examples aiming at minimizing $l_0$-distance to the original image. Extensive experiments show that our attack is better or competitive to the state of the art. Moreover, we can integrate additional bounds on the componentwise perturbation. All"},"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":"1909.05040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-11T13:28:44Z","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"title_canon_sha256":"1fc3f6f8d1fd9dd2839d15b3386deea99e261a412a309ccc764f3caa2a6f1a0f","abstract_canon_sha256":"c37098f72d79abd53bfcdb1452aa19f2b7f67f0934159d89d148c5e8c7a10534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:02.477069Z","signature_b64":"geyzJNEjypR/vzdWjjuETWm/PGNgY/l8kk4Ktwi+4A4zR5h5G8rWOdnlk1O69isXue5U5nl/udH4U/ecLCk7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5efa078593537539fb5c479be0269638005582b0d1f0dea59b32d02600214877","last_reissued_at":"2026-07-05T00:04:02.476676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:02.476676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse and Imperceivable Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein","submitted_at":"2019-09-11T13:28:44Z","abstract_excerpt":"Neural networks have been proven to be vulnerable to a variety of adversarial attacks. From a safety perspective, highly sparse adversarial attacks are particularly dangerous. On the other hand the pixelwise perturbations of sparse attacks are typically large and thus can be potentially detected. We propose a new black-box technique to craft adversarial examples aiming at minimizing $l_0$-distance to the original image. Extensive experiments show that our attack is better or competitive to the state of the art. Moreover, we can integrate additional bounds on the componentwise perturbation. All"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05040","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/1909.05040/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":"1909.05040","created_at":"2026-07-05T00:04:02.476735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05040v1","created_at":"2026-07-05T00:04:02.476735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05040","created_at":"2026-07-05T00:04:02.476735+00:00"},{"alias_kind":"pith_short_12","alias_value":"L35APBMTKN2T","created_at":"2026-07-05T00:04:02.476735+00:00"},{"alias_kind":"pith_short_16","alias_value":"L35APBMTKN2TT624","created_at":"2026-07-05T00:04:02.476735+00:00"},{"alias_kind":"pith_short_8","alias_value":"L35APBMT","created_at":"2026-07-05T00:04:02.476735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04057","citing_title":"LaPrune: Controllable Differentiable Sparsity at Million Scale","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA","json":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA.json","graph_json":"https://pith.science/api/pith-number/L35APBMTKN2TT624I6N6AJUWHA/graph.json","events_json":"https://pith.science/api/pith-number/L35APBMTKN2TT624I6N6AJUWHA/events.json","paper":"https://pith.science/paper/L35APBMT"},"agent_actions":{"view_html":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA","download_json":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA.json","view_paper":"https://pith.science/paper/L35APBMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05040&json=true","fetch_graph":"https://pith.science/api/pith-number/L35APBMTKN2TT624I6N6AJUWHA/graph.json","fetch_events":"https://pith.science/api/pith-number/L35APBMTKN2TT624I6N6AJUWHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA/action/storage_attestation","attest_author":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA/action/author_attestation","sign_citation":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA/action/citation_signature","submit_replication":"https://pith.science/pith/L35APBMTKN2TT624I6N6AJUWHA/action/replication_record"}},"created_at":"2026-07-05T00:04:02.476735+00:00","updated_at":"2026-07-05T00:04:02.476735+00:00"}