{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QKRAJCYNPWHBU7VBG2LYRZVYED","short_pith_number":"pith:QKRAJCYN","schema_version":"1.0","canonical_sha256":"82a2048b0d7d8e1a7ea1369788e6b820f84226d78b2fc0681be98b81bea17733","source":{"kind":"arxiv","id":"1812.05013","version":1},"attestation_state":"computed","paper":{"title":"Thwarting Adversarial Examples: An $L_0$-RobustSparse Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jack Murtagh, Mitali Bafna, Nikhil Vyas","submitted_at":"2018-12-12T16:36:14Z","abstract_excerpt":"We give a new algorithm for approximating the Discrete Fourier transform of an approximately sparse signal that has been corrupted by worst-case $L_0$ noise, namely a bounded number of coordinates of the signal have been corrupted arbitrarily. Our techniques generalize to a wide range of linear transformations that are used in data analysis such as the Discrete Cosine and Sine transforms, the Hadamard transform, and their high-dimensional analogs. We use our algorithm to successfully defend against well known $L_0$ adversaries in the setting of image classification. We give experimental result"},"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":"1812.05013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-12T16:36:14Z","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"title_canon_sha256":"e8583192387b9cbe41fe8ad3c0684d4b97b01266265852486cd698be904c3621","abstract_canon_sha256":"e86fe6f32eedd615cdb2f75583ce913b375c2a09601a8d19235d1b2698f512e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:26.626615Z","signature_b64":"ufK8+y2g8TqTxYAS/HXqI1uSuipVuhbEUHzH0dUCpZLa6YsDC95CWKhDhFQvGsxBLWA71V2smbxR+850WZZcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a2048b0d7d8e1a7ea1369788e6b820f84226d78b2fc0681be98b81bea17733","last_reissued_at":"2026-05-17T23:58:26.626022Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:26.626022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thwarting Adversarial Examples: An $L_0$-RobustSparse Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jack Murtagh, Mitali Bafna, Nikhil Vyas","submitted_at":"2018-12-12T16:36:14Z","abstract_excerpt":"We give a new algorithm for approximating the Discrete Fourier transform of an approximately sparse signal that has been corrupted by worst-case $L_0$ noise, namely a bounded number of coordinates of the signal have been corrupted arbitrarily. Our techniques generalize to a wide range of linear transformations that are used in data analysis such as the Discrete Cosine and Sine transforms, the Hadamard transform, and their high-dimensional analogs. We use our algorithm to successfully defend against well known $L_0$ adversaries in the setting of image classification. We give experimental result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05013","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":""},"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":"1812.05013","created_at":"2026-05-17T23:58:26.626113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05013v1","created_at":"2026-05-17T23:58:26.626113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05013","created_at":"2026-05-17T23:58:26.626113+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKRAJCYNPWHB","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKRAJCYNPWHBU7VB","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKRAJCYN","created_at":"2026-05-18T12:32:46.962924+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/QKRAJCYNPWHBU7VBG2LYRZVYED","json":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED.json","graph_json":"https://pith.science/api/pith-number/QKRAJCYNPWHBU7VBG2LYRZVYED/graph.json","events_json":"https://pith.science/api/pith-number/QKRAJCYNPWHBU7VBG2LYRZVYED/events.json","paper":"https://pith.science/paper/QKRAJCYN"},"agent_actions":{"view_html":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED","download_json":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED.json","view_paper":"https://pith.science/paper/QKRAJCYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05013&json=true","fetch_graph":"https://pith.science/api/pith-number/QKRAJCYNPWHBU7VBG2LYRZVYED/graph.json","fetch_events":"https://pith.science/api/pith-number/QKRAJCYNPWHBU7VBG2LYRZVYED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED/action/storage_attestation","attest_author":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED/action/author_attestation","sign_citation":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED/action/citation_signature","submit_replication":"https://pith.science/pith/QKRAJCYNPWHBU7VBG2LYRZVYED/action/replication_record"}},"created_at":"2026-05-17T23:58:26.626113+00:00","updated_at":"2026-05-17T23:58:26.626113+00:00"}