{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZX45H6I3XICFLWX3JAPZ5OEIM6","short_pith_number":"pith:ZX45H6I3","schema_version":"1.0","canonical_sha256":"cdf9d3f91bba0455dafb481f9eb88867bf5c5ef4c97ca6468796905c0088f139","source":{"kind":"arxiv","id":"2012.14956","version":2},"attestation_state":"computed","paper":{"title":"Generating Natural Language Attacks in a Hard Label Black Box Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Rishabh Maheshwary, Saket Maheshwary, Vikram Pudi","submitted_at":"2020-12-29T22:01:38Z","abstract_excerpt":"We study an important and challenging task of attacking natural language processing models in a hard label black box setting. We propose a decision-based attack strategy that crafts high quality adversarial examples on text classification and entailment tasks. Our proposed attack strategy leverages population-based optimization algorithm to craft plausible and semantically similar adversarial examples by observing only the top label predicted by the target model. At each iteration, the optimization procedure allow word replacements that maximizes the overall semantic similarity between the ori"},"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":"2012.14956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-29T22:01:38Z","cross_cats_sorted":[],"title_canon_sha256":"a5d738d5219862949d367395f84d77e9872299404e6fc8bf26f534093a850bbd","abstract_canon_sha256":"af38af09332703227574c64631e8bbb530c0437f8c46dae1e7993915bd198d1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:09.492098Z","signature_b64":"oykvLzFx/I07zToMsDBS3uGh1NcAWb364kgZLXX2y04IGlBH4ddIwE/unEF1MTwjOvLvUC8PeBvD+YIcGzLhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf9d3f91bba0455dafb481f9eb88867bf5c5ef4c97ca6468796905c0088f139","last_reissued_at":"2026-07-05T02:36:09.491732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:09.491732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Natural Language Attacks in a Hard Label Black Box Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Rishabh Maheshwary, Saket Maheshwary, Vikram Pudi","submitted_at":"2020-12-29T22:01:38Z","abstract_excerpt":"We study an important and challenging task of attacking natural language processing models in a hard label black box setting. We propose a decision-based attack strategy that crafts high quality adversarial examples on text classification and entailment tasks. Our proposed attack strategy leverages population-based optimization algorithm to craft plausible and semantically similar adversarial examples by observing only the top label predicted by the target model. At each iteration, the optimization procedure allow word replacements that maximizes the overall semantic similarity between the ori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.14956","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/2012.14956/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":"2012.14956","created_at":"2026-07-05T02:36:09.491785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.14956v2","created_at":"2026-07-05T02:36:09.491785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.14956","created_at":"2026-07-05T02:36:09.491785+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZX45H6I3XICF","created_at":"2026-07-05T02:36:09.491785+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZX45H6I3XICFLWX3","created_at":"2026-07-05T02:36:09.491785+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZX45H6I3","created_at":"2026-07-05T02:36:09.491785+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11844","citing_title":"TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attacks","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6","json":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6.json","graph_json":"https://pith.science/api/pith-number/ZX45H6I3XICFLWX3JAPZ5OEIM6/graph.json","events_json":"https://pith.science/api/pith-number/ZX45H6I3XICFLWX3JAPZ5OEIM6/events.json","paper":"https://pith.science/paper/ZX45H6I3"},"agent_actions":{"view_html":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6","download_json":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6.json","view_paper":"https://pith.science/paper/ZX45H6I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.14956&json=true","fetch_graph":"https://pith.science/api/pith-number/ZX45H6I3XICFLWX3JAPZ5OEIM6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZX45H6I3XICFLWX3JAPZ5OEIM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6/action/storage_attestation","attest_author":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6/action/author_attestation","sign_citation":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6/action/citation_signature","submit_replication":"https://pith.science/pith/ZX45H6I3XICFLWX3JAPZ5OEIM6/action/replication_record"}},"created_at":"2026-07-05T02:36:09.491785+00:00","updated_at":"2026-07-05T02:36:09.491785+00:00"}