{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7C2ZIFBY7GEHYDDR2W4DLMWHDQ","short_pith_number":"pith:7C2ZIFBY","schema_version":"1.0","canonical_sha256":"f8b5941438f9887c0c71d5b835b2c71c265e68d6091ad28b804184be5677ab1e","source":{"kind":"arxiv","id":"2606.11700","version":1},"attestation_state":"computed","paper":{"title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Haohang Huang, Junlong Tong, Ping Nie, Rui Meng, Xiaoyu Shen, Xuan Lu, Yingqi Fan, Yuxuan Zhang","submitted_at":"2026-06-10T06:23:46Z","abstract_excerpt":"Large language model (LLM) rerankers have become an important component of modern retrieval and retrieval-augmented generation pipelines, but their high computational cost limits their applicability to long candidate lists. In this paper, we propose \\textbf{CompRank}, a token-efficient reranking framework that reduces redundant computation by aligning reranker design with the sparsity of ranking signals. CompRank decouples document representations from candidate order and query context, enabling reusable document-side states; applies segment-wise token compression to reduce query--document int"},"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":"2606.11700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-10T06:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"aea0abb95cdec4a004f36ef22d69e13b63eb3f526970f902e4938d2f05771b54","abstract_canon_sha256":"b19be8aa309513dfce7eb5f83a41d51c778fb5eb4ea325ae0d1d5459e1ced6aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:03.648290Z","signature_b64":"XATBV7kejO4/HKyIsJ7KLuPOQjr9YT7dlqCvqFag2/7j+NwkW+Am+tdnccSTgYsydeQTVR4EmAylXjEVp84RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b5941438f9887c0c71d5b835b2c71c265e68d6091ad28b804184be5677ab1e","last_reissued_at":"2026-06-11T01:10:03.647403Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:03.647403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Haohang Huang, Junlong Tong, Ping Nie, Rui Meng, Xiaoyu Shen, Xuan Lu, Yingqi Fan, Yuxuan Zhang","submitted_at":"2026-06-10T06:23:46Z","abstract_excerpt":"Large language model (LLM) rerankers have become an important component of modern retrieval and retrieval-augmented generation pipelines, but their high computational cost limits their applicability to long candidate lists. In this paper, we propose \\textbf{CompRank}, a token-efficient reranking framework that reduces redundant computation by aligning reranker design with the sparsity of ranking signals. CompRank decouples document representations from candidate order and query context, enabling reusable document-side states; applies segment-wise token compression to reduce query--document int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11700","kind":"arxiv","version":1},"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/2606.11700/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":"2606.11700","created_at":"2026-06-11T01:10:03.647552+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11700v1","created_at":"2026-06-11T01:10:03.647552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11700","created_at":"2026-06-11T01:10:03.647552+00:00"},{"alias_kind":"pith_short_12","alias_value":"7C2ZIFBY7GEH","created_at":"2026-06-11T01:10:03.647552+00:00"},{"alias_kind":"pith_short_16","alias_value":"7C2ZIFBY7GEHYDDR","created_at":"2026-06-11T01:10:03.647552+00:00"},{"alias_kind":"pith_short_8","alias_value":"7C2ZIFBY","created_at":"2026-06-11T01:10:03.647552+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ","json":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ.json","graph_json":"https://pith.science/api/pith-number/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/graph.json","events_json":"https://pith.science/api/pith-number/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/events.json","paper":"https://pith.science/paper/7C2ZIFBY"},"agent_actions":{"view_html":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ","download_json":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ.json","view_paper":"https://pith.science/paper/7C2ZIFBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11700&json=true","fetch_graph":"https://pith.science/api/pith-number/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/action/storage_attestation","attest_author":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/action/author_attestation","sign_citation":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/action/citation_signature","submit_replication":"https://pith.science/pith/7C2ZIFBY7GEHYDDR2W4DLMWHDQ/action/replication_record"}},"created_at":"2026-06-11T01:10:03.647552+00:00","updated_at":"2026-06-11T01:10:03.647552+00:00"}