{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VIS4NHJ536H7BO4BNFWRVDI7FQ","short_pith_number":"pith:VIS4NHJ5","schema_version":"1.0","canonical_sha256":"aa25c69d3ddf8ff0bb81696d1a8d1f2c3fa6db232b2bdbb17a77c3eb954ebc52","source":{"kind":"arxiv","id":"2504.05804","version":2},"attestation_state":"computed","paper":{"title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Chenxiao Yu, Tiankai Yang, Xiyang Hu, Yi Fan, Yiming Tang, Yue Zhao","submitted_at":"2025-04-08T08:36:18Z","abstract_excerpt":"The integration of large language models (LLMs) into information retrieval systems introduces new attack surfaces, particularly for adversarial ranking manipulations. We present $\\textbf{StealthRank}$, a novel adversarial attack method that manipulates LLM-driven ranking systems while maintaining textual fluency and stealth. Unlike existing methods that often introduce detectable anomalies, StealthRank employs an energy-based optimization framework combined with Langevin dynamics to generate StealthRank Prompts (SRPs)-adversarial text sequences embedded within item or document descriptions tha"},"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":"2504.05804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-04-08T08:36:18Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG","stat.ML"],"title_canon_sha256":"0c7aa4b26bcdf419dc9a3820a3d142f112bd678d6bca620da729a70e0db9e36e","abstract_canon_sha256":"9b91f714a82e89d243a211d32c65dbc8f3bea355820181dc1eedcbfe9e06b1d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:19.038296Z","signature_b64":"TKphjefKxG5n4Gv1u+Ni1OZJhPy9JN83nTRqglyCQxFVzdfLtc9s0xtVr2fjr5N6BM9PDDoVL65sPuxx6YH7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa25c69d3ddf8ff0bb81696d1a8d1f2c3fa6db232b2bdbb17a77c3eb954ebc52","last_reissued_at":"2026-07-05T11:08:19.037751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:19.037751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Chenxiao Yu, Tiankai Yang, Xiyang Hu, Yi Fan, Yiming Tang, Yue Zhao","submitted_at":"2025-04-08T08:36:18Z","abstract_excerpt":"The integration of large language models (LLMs) into information retrieval systems introduces new attack surfaces, particularly for adversarial ranking manipulations. We present $\\textbf{StealthRank}$, a novel adversarial attack method that manipulates LLM-driven ranking systems while maintaining textual fluency and stealth. Unlike existing methods that often introduce detectable anomalies, StealthRank employs an energy-based optimization framework combined with Langevin dynamics to generate StealthRank Prompts (SRPs)-adversarial text sequences embedded within item or document descriptions tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05804","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/2504.05804/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":"2504.05804","created_at":"2026-07-05T11:08:19.037812+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05804v2","created_at":"2026-07-05T11:08:19.037812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05804","created_at":"2026-07-05T11:08:19.037812+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIS4NHJ536H7","created_at":"2026-07-05T11:08:19.037812+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIS4NHJ536H7BO4B","created_at":"2026-07-05T11:08:19.037812+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIS4NHJ5","created_at":"2026-07-05T11:08:19.037812+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28017","citing_title":"Can It Reach the Generator? Investigating the Survival of Prompt-Injection Attacks in Realistic RAG Settings","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2602.00364","citing_title":"\"Someone Hid It\": Query-Agnostic Black-Box Attacks on LLM-Based Retrieval","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ","json":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ.json","graph_json":"https://pith.science/api/pith-number/VIS4NHJ536H7BO4BNFWRVDI7FQ/graph.json","events_json":"https://pith.science/api/pith-number/VIS4NHJ536H7BO4BNFWRVDI7FQ/events.json","paper":"https://pith.science/paper/VIS4NHJ5"},"agent_actions":{"view_html":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ","download_json":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ.json","view_paper":"https://pith.science/paper/VIS4NHJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05804&json=true","fetch_graph":"https://pith.science/api/pith-number/VIS4NHJ536H7BO4BNFWRVDI7FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VIS4NHJ536H7BO4BNFWRVDI7FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ/action/storage_attestation","attest_author":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ/action/author_attestation","sign_citation":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ/action/citation_signature","submit_replication":"https://pith.science/pith/VIS4NHJ536H7BO4BNFWRVDI7FQ/action/replication_record"}},"created_at":"2026-07-05T11:08:19.037812+00:00","updated_at":"2026-07-05T11:08:19.037812+00:00"}