{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DG2WZD3VY5PIOK4T5STVZIRREZ","short_pith_number":"pith:DG2WZD3V","schema_version":"1.0","canonical_sha256":"19b56c8f75c75e872b93eca75ca23126400f0a8a793590d035ba0ac896b2d1ef","source":{"kind":"arxiv","id":"2510.06732","version":2},"attestation_state":"computed","paper":{"title":"Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Jerry Li, Tiancheng Xing, Xiyang Hu, Yixuan Du","submitted_at":"2025-10-08T07:40:40Z","abstract_excerpt":"Large language models (LLMs) are increasingly used as rerankers in information retrieval, yet their ranking behavior can be steered by small, natural-sounding prompts. To expose this vulnerability, we present Rank Anything First (RAF), a two-stage token optimization method that crafts concise textual perturbations to consistently promote a target item in LLM-generated rankings while remaining hard to detect. Stage 1 uses Greedy Coordinate Gradient to shortlist candidate tokens at the current position by combining the gradient of the rank-target with a readability score; Stage 2 evaluates those"},"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":"2510.06732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-10-08T07:40:40Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"bfcc9dbcbec527b71145fafc32a7e8cbde413ceb384a410401494569797f5773","abstract_canon_sha256":"3b774c3861209b8d3f228e82f6ce892f11784d227bc8176a531b3952192e18ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:27.386058Z","signature_b64":"+mlOSe1M3FNpLHZYDkQNiELNU8to7X9ljgPRbSpwCGsiEltSsTrf2/p3IW2YS/5BFjV7azkvh/yMYhl3py3zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19b56c8f75c75e872b93eca75ca23126400f0a8a793590d035ba0ac896b2d1ef","last_reissued_at":"2026-06-30T01:17:27.385385Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:27.385385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Jerry Li, Tiancheng Xing, Xiyang Hu, Yixuan Du","submitted_at":"2025-10-08T07:40:40Z","abstract_excerpt":"Large language models (LLMs) are increasingly used as rerankers in information retrieval, yet their ranking behavior can be steered by small, natural-sounding prompts. To expose this vulnerability, we present Rank Anything First (RAF), a two-stage token optimization method that crafts concise textual perturbations to consistently promote a target item in LLM-generated rankings while remaining hard to detect. Stage 1 uses Greedy Coordinate Gradient to shortlist candidate tokens at the current position by combining the gradient of the rank-target with a readability score; Stage 2 evaluates those"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06732","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/2510.06732/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":"2510.06732","created_at":"2026-06-30T01:17:27.385472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06732v2","created_at":"2026-06-30T01:17:27.385472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06732","created_at":"2026-06-30T01:17:27.385472+00:00"},{"alias_kind":"pith_short_12","alias_value":"DG2WZD3VY5PI","created_at":"2026-06-30T01:17:27.385472+00:00"},{"alias_kind":"pith_short_16","alias_value":"DG2WZD3VY5PIOK4T","created_at":"2026-06-30T01:17:27.385472+00:00"},{"alias_kind":"pith_short_8","alias_value":"DG2WZD3V","created_at":"2026-06-30T01:17:27.385472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"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":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ","json":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ.json","graph_json":"https://pith.science/api/pith-number/DG2WZD3VY5PIOK4T5STVZIRREZ/graph.json","events_json":"https://pith.science/api/pith-number/DG2WZD3VY5PIOK4T5STVZIRREZ/events.json","paper":"https://pith.science/paper/DG2WZD3V"},"agent_actions":{"view_html":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ","download_json":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ.json","view_paper":"https://pith.science/paper/DG2WZD3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06732&json=true","fetch_graph":"https://pith.science/api/pith-number/DG2WZD3VY5PIOK4T5STVZIRREZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DG2WZD3VY5PIOK4T5STVZIRREZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ/action/storage_attestation","attest_author":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ/action/author_attestation","sign_citation":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ/action/citation_signature","submit_replication":"https://pith.science/pith/DG2WZD3VY5PIOK4T5STVZIRREZ/action/replication_record"}},"created_at":"2026-06-30T01:17:27.385472+00:00","updated_at":"2026-06-30T01:17:27.385472+00:00"}