{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LYF54WMEB3C5R7TKWPHYOU4CFQ","short_pith_number":"pith:LYF54WME","schema_version":"1.0","canonical_sha256":"5e0bde59840ec5d8fe6ab3cf8753822c2799b3e5f3acda1fe720b3c7b4947228","source":{"kind":"arxiv","id":"1908.03173","version":5},"attestation_state":"computed","paper":{"title":"Universal Adversarial Audio Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD","eess.AS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro L. Koerich, Ismail Ben Ayed, Jerome Rony, Luiz G. Hafemann, Patrick Cardinal, Sajjad Abdoli","submitted_at":"2019-08-08T17:07:30Z","abstract_excerpt":"We demonstrate the existence of universal adversarial perturbations, which can fool a family of audio classification architectures, for both targeted and untargeted attack scenarios. We propose two methods for finding such perturbations. The first method is based on an iterative, greedy approach that is well-known in computer vision: it aggregates small perturbations to the input so as to push it to the decision boundary. The second method, which is the main contribution of this work, is a novel penalty formulation, which finds targeted and untargeted universal adversarial perturbations. Diffe"},"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":"1908.03173","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-08T17:07:30Z","cross_cats_sorted":["cs.SD","eess.AS","stat.ML"],"title_canon_sha256":"05940eba6a05686fc1a95f1be46622a9fd5972118e63a7cd78a92acfab387435","abstract_canon_sha256":"8d89c3496181f1b4b49b3296957ab6caa5c96a8c82c0f394fcc81343633397f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:59.027190Z","signature_b64":"SJI1UPqAmNJeqq4USKTfF/wwjXg8LEqNlQGQ8iqhAEjoH1X2ekY//ACfFmANGVNe0SDd4Ywfc8frCuByRDhvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0bde59840ec5d8fe6ab3cf8753822c2799b3e5f3acda1fe720b3c7b4947228","last_reissued_at":"2026-07-05T01:51:59.026764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:59.026764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Adversarial Audio Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD","eess.AS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro L. Koerich, Ismail Ben Ayed, Jerome Rony, Luiz G. Hafemann, Patrick Cardinal, Sajjad Abdoli","submitted_at":"2019-08-08T17:07:30Z","abstract_excerpt":"We demonstrate the existence of universal adversarial perturbations, which can fool a family of audio classification architectures, for both targeted and untargeted attack scenarios. We propose two methods for finding such perturbations. The first method is based on an iterative, greedy approach that is well-known in computer vision: it aggregates small perturbations to the input so as to push it to the decision boundary. The second method, which is the main contribution of this work, is a novel penalty formulation, which finds targeted and untargeted universal adversarial perturbations. Diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03173","kind":"arxiv","version":5},"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/1908.03173/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":"1908.03173","created_at":"2026-07-05T01:51:59.026821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03173v5","created_at":"2026-07-05T01:51:59.026821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03173","created_at":"2026-07-05T01:51:59.026821+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYF54WMEB3C5","created_at":"2026-07-05T01:51:59.026821+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYF54WMEB3C5R7TK","created_at":"2026-07-05T01:51:59.026821+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYF54WME","created_at":"2026-07-05T01:51:59.026821+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06833","citing_title":"Hearing the Unspoken: Language Model Priors for Acoustic Adversarial Attacks","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ","json":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ.json","graph_json":"https://pith.science/api/pith-number/LYF54WMEB3C5R7TKWPHYOU4CFQ/graph.json","events_json":"https://pith.science/api/pith-number/LYF54WMEB3C5R7TKWPHYOU4CFQ/events.json","paper":"https://pith.science/paper/LYF54WME"},"agent_actions":{"view_html":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ","download_json":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ.json","view_paper":"https://pith.science/paper/LYF54WME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03173&json=true","fetch_graph":"https://pith.science/api/pith-number/LYF54WMEB3C5R7TKWPHYOU4CFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LYF54WMEB3C5R7TKWPHYOU4CFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ/action/storage_attestation","attest_author":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ/action/author_attestation","sign_citation":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ/action/citation_signature","submit_replication":"https://pith.science/pith/LYF54WMEB3C5R7TKWPHYOU4CFQ/action/replication_record"}},"created_at":"2026-07-05T01:51:59.026821+00:00","updated_at":"2026-07-05T01:51:59.026821+00:00"}