{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7RTGDRMPJBGRN5P7JVS5QOD7NB","short_pith_number":"pith:7RTGDRMP","schema_version":"1.0","canonical_sha256":"fc6661c58f484d16f5ff4d65d8387f6856f5262e06e1bd00c80d76afd2e3b1d6","source":{"kind":"arxiv","id":"2412.16382","version":2},"attestation_state":"computed","paper":{"title":"EMPRA: Embedding Perturbation Rank Attack against Neural Ranking Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Amin Bigdeli, Charles L. A. Clarke, Ebrahim Bagheri, Negar Arabzadeh","submitted_at":"2024-12-20T22:36:19Z","abstract_excerpt":"Recent research has shown that neural information retrieval techniques may be susceptible to adversarial attacks. Adversarial attacks seek to manipulate the ranking of documents, with the intention of exposing users to targeted content. In this paper, we introduce the Embedding Perturbation Rank Attack (EMPRA) method, a novel approach designed to perform adversarial attacks on black-box Neural Ranking Models (NRMs). EMPRA manipulates sentence-level embeddings, guiding them towards pertinent context related to the query while preserving semantic integrity. This process generates adversarial tex"},"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":"2412.16382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-20T22:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"bc495357861ca205615f92587b2ca14d97015d8bd0a8068aac6b5cfaeaeea14d","abstract_canon_sha256":"273867e7c5813d5295e94b7bdf7a2e4814f89337a3ef7237f46ad5266e3bdd81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:42.421500Z","signature_b64":"OSVsraDt8bEQVBsmZLjjOpgmp/7tfnfU/kFEYWDDSosGF/49TmGzblUPgcL9OOe9OqHZEGEuaB06RxWblpzvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6661c58f484d16f5ff4d65d8387f6856f5262e06e1bd00c80d76afd2e3b1d6","last_reissued_at":"2026-07-05T10:20:42.420940Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:42.420940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EMPRA: Embedding Perturbation Rank Attack against Neural Ranking Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Amin Bigdeli, Charles L. A. Clarke, Ebrahim Bagheri, Negar Arabzadeh","submitted_at":"2024-12-20T22:36:19Z","abstract_excerpt":"Recent research has shown that neural information retrieval techniques may be susceptible to adversarial attacks. Adversarial attacks seek to manipulate the ranking of documents, with the intention of exposing users to targeted content. In this paper, we introduce the Embedding Perturbation Rank Attack (EMPRA) method, a novel approach designed to perform adversarial attacks on black-box Neural Ranking Models (NRMs). EMPRA manipulates sentence-level embeddings, guiding them towards pertinent context related to the query while preserving semantic integrity. This process generates adversarial tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16382","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/2412.16382/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":"2412.16382","created_at":"2026-07-05T10:20:42.421005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16382v2","created_at":"2026-07-05T10:20:42.421005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16382","created_at":"2026-07-05T10:20:42.421005+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RTGDRMPJBGR","created_at":"2026-07-05T10:20:42.421005+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RTGDRMPJBGRN5P7","created_at":"2026-07-05T10:20:42.421005+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RTGDRMP","created_at":"2026-07-05T10:20:42.421005+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07083","citing_title":"Predictive Style Matching: Natural and Robust Humanoid Locomotion","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17805","citing_title":"Ranking Abuse via Strategic Pairwise Data Perturbations","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB","json":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB.json","graph_json":"https://pith.science/api/pith-number/7RTGDRMPJBGRN5P7JVS5QOD7NB/graph.json","events_json":"https://pith.science/api/pith-number/7RTGDRMPJBGRN5P7JVS5QOD7NB/events.json","paper":"https://pith.science/paper/7RTGDRMP"},"agent_actions":{"view_html":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB","download_json":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB.json","view_paper":"https://pith.science/paper/7RTGDRMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16382&json=true","fetch_graph":"https://pith.science/api/pith-number/7RTGDRMPJBGRN5P7JVS5QOD7NB/graph.json","fetch_events":"https://pith.science/api/pith-number/7RTGDRMPJBGRN5P7JVS5QOD7NB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB/action/storage_attestation","attest_author":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB/action/author_attestation","sign_citation":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB/action/citation_signature","submit_replication":"https://pith.science/pith/7RTGDRMPJBGRN5P7JVS5QOD7NB/action/replication_record"}},"created_at":"2026-07-05T10:20:42.421005+00:00","updated_at":"2026-07-05T10:20:42.421005+00:00"}