{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TNOPQXO77ZDRGPVHFPQ5AYZZIQ","short_pith_number":"pith:TNOPQXO7","schema_version":"1.0","canonical_sha256":"9b5cf85ddffe47133ea72be1d06339441c2d12ea097e67574ea8dfd758ece9a8","source":{"kind":"arxiv","id":"2404.05311","version":2},"attestation_state":"computed","paper":{"title":"BruSLeAttack: A Query-Efficient Score-Based Black-Box Sparse Adversarial Attack","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Damith C. Ranasinghe, Ehsan Abbasnejad, Viet Quoc Vo","submitted_at":"2024-04-08T08:59:26Z","abstract_excerpt":"We study the unique, less-well understood problem of generating sparse adversarial samples simply by observing the score-based replies to model queries. Sparse attacks aim to discover a minimum number-the l0 bounded-perturbations to model inputs to craft adversarial examples and misguide model decisions. But, in contrast to query-based dense attack counterparts against black-box models, constructing sparse adversarial perturbations, even when models serve confidence score information to queries in a score-based setting, is non-trivial. Because, such an attack leads to i) an NP-hard problem; an"},"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":"2404.05311","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T08:59:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"80eabff01c65c81fa8fa5c938b76fb0e381cad00a2114a68f0a6316ebee483d2","abstract_canon_sha256":"5e579c28f8daac48afcf11498f1cb486ba837ec1946bdb8fbaeda4937a4c346e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:53.459656Z","signature_b64":"lbSIyZoyG8ouJAT7m7+1Kj1vWFpFARdSCUdwGBY3Hf63UJyG1hx2Uu1Luxnv7HIqPoiETl9B7v3aCQUp8B/TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b5cf85ddffe47133ea72be1d06339441c2d12ea097e67574ea8dfd758ece9a8","last_reissued_at":"2026-07-05T08:25:53.459138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:53.459138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BruSLeAttack: A Query-Efficient Score-Based Black-Box Sparse Adversarial Attack","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Damith C. Ranasinghe, Ehsan Abbasnejad, Viet Quoc Vo","submitted_at":"2024-04-08T08:59:26Z","abstract_excerpt":"We study the unique, less-well understood problem of generating sparse adversarial samples simply by observing the score-based replies to model queries. Sparse attacks aim to discover a minimum number-the l0 bounded-perturbations to model inputs to craft adversarial examples and misguide model decisions. But, in contrast to query-based dense attack counterparts against black-box models, constructing sparse adversarial perturbations, even when models serve confidence score information to queries in a score-based setting, is non-trivial. Because, such an attack leads to i) an NP-hard problem; an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05311","kind":"arxiv","version":2},"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/2404.05311/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":"2404.05311","created_at":"2026-07-05T08:25:53.459207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05311v2","created_at":"2026-07-05T08:25:53.459207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05311","created_at":"2026-07-05T08:25:53.459207+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNOPQXO77ZDR","created_at":"2026-07-05T08:25:53.459207+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNOPQXO77ZDRGPVH","created_at":"2026-07-05T08:25:53.459207+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNOPQXO7","created_at":"2026-07-05T08:25:53.459207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23192","citing_title":"Fooling the Watchers: Breaking AIGC Detectors via Semantic Prompt Attacks","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ","json":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ.json","graph_json":"https://pith.science/api/pith-number/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/graph.json","events_json":"https://pith.science/api/pith-number/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/events.json","paper":"https://pith.science/paper/TNOPQXO7"},"agent_actions":{"view_html":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ","download_json":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ.json","view_paper":"https://pith.science/paper/TNOPQXO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05311&json=true","fetch_graph":"https://pith.science/api/pith-number/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/action/storage_attestation","attest_author":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/action/author_attestation","sign_citation":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/action/citation_signature","submit_replication":"https://pith.science/pith/TNOPQXO77ZDRGPVHFPQ5AYZZIQ/action/replication_record"}},"created_at":"2026-07-05T08:25:53.459207+00:00","updated_at":"2026-07-05T08:25:53.459207+00:00"}