{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X463EKGEBZKF2RLZMAKXDZXFXF","short_pith_number":"pith:X463EKGE","schema_version":"1.0","canonical_sha256":"bf3db228c40e545d4579601571e6e5b976f0a3d81aa091cb0eac13c76f065c10","source":{"kind":"arxiv","id":"2402.01879","version":3},"attestation_state":"computed","paper":{"title":"$\\sigma$-zero: Gradient-based Optimization of $\\ell_0$-norm Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Antonio Emanuele Cin\\`a, Battista Biggio, Francesco Villani, Lea Sch\\\"onherr, Marcello Pelillo, Maura Pintor","submitted_at":"2024-02-02T20:08:11Z","abstract_excerpt":"Evaluating the adversarial robustness of deep networks to gradient-based attacks is challenging. While most attacks consider $\\ell_2$- and $\\ell_\\infty$-norm constraints to craft input perturbations, only a few investigate sparse $\\ell_1$- and $\\ell_0$-norm attacks. In particular, $\\ell_0$-norm attacks remain the least studied due to the inherent complexity of optimizing over a non-convex and non-differentiable constraint. However, evaluating adversarial robustness under these attacks could reveal weaknesses otherwise left untested with more conventional $\\ell_2$- and $\\ell_\\infty$-norm attack"},"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":"2402.01879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T20:08:11Z","cross_cats_sorted":["cs.CR","cs.CV"],"title_canon_sha256":"df928b3eb3c94745fe1c935cb650a2ca41235db238ef97462bb4f84ed7456eba","abstract_canon_sha256":"4ddae5c0e31f4cd53a73bc227b9833260b2ff1aa98ddb4d93f4b0704688f7193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:04.476293Z","signature_b64":"AfbtIYW5vo64G+enaHcBjs8/AnhKh7Zcn6/9aqKPLuYh4nLKfH0WtZCghoGrlfEM7nOdKdevLP4/5hm0rWmnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3db228c40e545d4579601571e6e5b976f0a3d81aa091cb0eac13c76f065c10","last_reissued_at":"2026-07-05T10:25:04.475805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:04.475805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\sigma$-zero: Gradient-based Optimization of $\\ell_0$-norm Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Antonio Emanuele Cin\\`a, Battista Biggio, Francesco Villani, Lea Sch\\\"onherr, Marcello Pelillo, Maura Pintor","submitted_at":"2024-02-02T20:08:11Z","abstract_excerpt":"Evaluating the adversarial robustness of deep networks to gradient-based attacks is challenging. While most attacks consider $\\ell_2$- and $\\ell_\\infty$-norm constraints to craft input perturbations, only a few investigate sparse $\\ell_1$- and $\\ell_0$-norm attacks. In particular, $\\ell_0$-norm attacks remain the least studied due to the inherent complexity of optimizing over a non-convex and non-differentiable constraint. However, evaluating adversarial robustness under these attacks could reveal weaknesses otherwise left untested with more conventional $\\ell_2$- and $\\ell_\\infty$-norm attack"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01879","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.01879/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":"2402.01879","created_at":"2026-07-05T10:25:04.475861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01879v3","created_at":"2026-07-05T10:25:04.475861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01879","created_at":"2026-07-05T10:25:04.475861+00:00"},{"alias_kind":"pith_short_12","alias_value":"X463EKGEBZKF","created_at":"2026-07-05T10:25:04.475861+00:00"},{"alias_kind":"pith_short_16","alias_value":"X463EKGEBZKF2RLZ","created_at":"2026-07-05T10:25:04.475861+00:00"},{"alias_kind":"pith_short_8","alias_value":"X463EKGE","created_at":"2026-07-05T10:25:04.475861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05441","citing_title":"Adversarial Machine Learning Attacks on Financial Reporting via Maximum Violated Multi-Objective Attack","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF","json":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF.json","graph_json":"https://pith.science/api/pith-number/X463EKGEBZKF2RLZMAKXDZXFXF/graph.json","events_json":"https://pith.science/api/pith-number/X463EKGEBZKF2RLZMAKXDZXFXF/events.json","paper":"https://pith.science/paper/X463EKGE"},"agent_actions":{"view_html":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF","download_json":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF.json","view_paper":"https://pith.science/paper/X463EKGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01879&json=true","fetch_graph":"https://pith.science/api/pith-number/X463EKGEBZKF2RLZMAKXDZXFXF/graph.json","fetch_events":"https://pith.science/api/pith-number/X463EKGEBZKF2RLZMAKXDZXFXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF/action/storage_attestation","attest_author":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF/action/author_attestation","sign_citation":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF/action/citation_signature","submit_replication":"https://pith.science/pith/X463EKGEBZKF2RLZMAKXDZXFXF/action/replication_record"}},"created_at":"2026-07-05T10:25:04.475861+00:00","updated_at":"2026-07-05T10:25:04.475861+00:00"}