{"as_of":"2026-08-22T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0846c1cdbabefc7a7b458e20c1dba049d533c617c46664d2453aa32b841324bb","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T08:28:14.637197Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.11700/citation-record","integrity":"/paper/2606.11700/integrity","json":"/paper/2606.11700/citation-record.json","paper":"/paper/2606.11700"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Hyperrag: Enhancing quality-efficiency tradeoffs in retrieval-augmented generation with reranker kv-cache reuse, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:1dd1c3c8fba22cc59f4336e50d5780d143157a7f6c5bc40c56d2f22bc6914eaa","observation_id":"9c394a53-06a9-455d-b2a2-4d588c41182d","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Peters, and Arman Cohan","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:fa024a443457d2614f2f95d3b2bd0c273bd17bfc6622e0e91d4b6e8d6198855e","observation_id":"bb349981-357d-4d85-aeef-fc445ca136ce","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Attention in large language models yields efficient zero-shot re-rankers","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:7fc0e4c1eb9472de69cf2588f4d8bb06de4b21285d5e8730450f44f77573dec7","observation_id":"87e63875-413a-420c-b64f-65ea8379ed23","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Deepseek-v3.2-exp: Boosting long-context efficiency with deepseek sparse attention, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:cfe81fcdafc001a5fdee7e2ff335f567e4eafbea12d9df268028cc07f4801f7c","observation_id":"baed1cff-ad9d-446c-a92c-bc1ec0e01cd6","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Deepseek-v4: Towards highly efficient million-token context intelligence, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:a69f675811c6025d6dca8236129f85e7351b90bdb5e03a91f09522697dcd709b","observation_id":"4182bc33-7acb-4a70-8cb0-c8f6619aab4c","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Reranking with compressed document representation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:ff821a31b9bdabdddf5bb239c367361cb44565634efb2c671b9fd1a680607d7f","observation_id":"f26a5201-4ddb-4d0a-9dea-b1bb725a4d71","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"minireranker: Efficient multimodal reranking through visual cache reuse and interaction sparsity, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:0b06a1a2b47b415fa9f9e20a7f170c7a6dc45b9bacc5dcf49c83d53c30c30fc5","observation_id":"c95d6d35-0a83-4a5e-b973-201b6d84a1c9","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:eb15a527b4485acd49124587f3fdb8e08485bc117dd8cc5c075367899aef5e3f","observation_id":"2bf1e490-f436-4276-9dae-89e654ec8268","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:f7b1b13a8dd780dfe115fb2cb57a4fbd591ae253e3f0389bdb804f8268b77821","observation_id":"5f29792c-fe48-46fa-8290-3e514eda3c2b","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.23321","last_updated":"2026-07-29T16:19:23Z","snapshot_observed_at":"2026-08-13T09:41:21.198598Z","submitted_at":"2026-04-25T14:15:05Z","title":"MMEB-V3: Measuring the Performance Gaps of Omni-Modality Embedding Models","version":2},"cited_work":{"arxiv_id":"2604.23321","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.23321","snapshot_observed_at":"2026-07-03T13:08:08.703056Z","title":"MMEB-V3: Measuring the Performance Gaps of Omni-Modality Embedding Models","venue":"cs.IR","work_id":"a812bd44-bd81-4a6e-a59e-cb3f9e30ccf9","year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"cited_paper":"/paper/2604.23321","citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:cf80be33c16b9eb2b2d2e7afe4d17d8e9f4cd818af57ebcd439c5bf220e3c057","observation_id":"8a761262-7854-419e-b4e3-46198bf851f4","resolution":{"observed_at":"2026-07-03T13:08:08.705595Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Retrieval-augmented generation for knowledge- intensive nlp tasks.Advances in neural information processing systems, 33:9459–9474, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:02b3f348e3ffda5b46ce5b49e508ad278831838121b8f3364995232aaa069bd9","observation_id":"bf7452dd-a363-4546-ae0b-c808e6532631","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Efficient long-document reranking via block-level embeddings and top-k interaction refinement, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:505e7e43bcdb6c450229de8fad5feb119c57dc5f5053521ed957d05710b8aa14","observation_id":"83d61fe9-e097-45a4-b0ba-209c9b9900d7","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Leveraging passage embeddings for efficient listwise reranking with large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:8110cf7f8fe2878aeede4bd43a9ea80853859f65d6592ca1a0b825eb476445ea","observation_id":"f58049c5-1db7-4097-ae57-3cacef1d30e2","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Rethinking reasoning in document ranking: Why chain-of-thought falls short","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:cb486ef057853e23fbfba333ecd99320c66db49e6fe8561861b6b76e51701eb5","observation_id":"60dbdb9d-ff8d-44ed-b7c8-509066102468","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Tools are under- documented: Simple document expansion boosts tool retrieval","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:40c5298ba0575909e9a6fece79bf2d2732bf7d2c554491d19f666763186e2bcc","observation_id":"3b9ae6e0-83c3-4e3c-8b58-c66fcdb8d437","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Beyond global similarity: Multi-conditional retrieval for fine-grained cross-modal understanding","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:c7bbc06154bb495421675bbc603e3940e3e9defd3d65cf384da15e8f21fadadb","observation_id":"e3e8ec42-8388-42a5-9bd9-8a0a6caa6166","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"MultiConIR: Towards multi-condition information retrieval","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:da43ecf89c441ff0fd2b2a51ab1bb757550c6b0846ed53273e75bf7856e9ee26","observation_id":"6ef1f4d5-b2b8-4d93-927a-eb621c302bbc","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Fine-tuning llama for multi-stage text retrieval","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:4e2409f7f6a164b90c17a31ac66527bcfb66e2963090e8bcb53bd1dccb18a4de","observation_id":"ab5d0720-e746-43fc-a466-daf980772754","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Multi-stage document ranking with bert, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:5515e8c3bc3a01d913b236816575a3a9a9d3cf9c1130d98c54eba7fc0e5804f0","observation_id":"c453ad43-1c48-47a0-8e08-0e77446a9984","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Document ranking with a pretrained sequence-to-sequence model","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:1f530e8a64c257793b95022b4a0611de34d334f6f50a9cebfb5a0a1ef2682e3d","observation_id":"6aa8a126-14eb-4873-95b8-d58396da3643","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Rankvicuna: Zero-shot listwise document reranking with open-source large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:6a1205627c32cc77017039c13f6b1cafd1aafcf80fd1476849669aa2554c449a","observation_id":"4fe24b82-8b41-4e92-a4a6-29950b28f200","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Rankzephyr: Effective and robust zero-shot listwise reranking is a breeze!, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:f8fd2c2d9b9cbf666355c1521e124876977e9eeb79ce0a94101b42e3fc617ab7","observation_id":"20d00969-be2d-4f00-b95b-d4827c269b30","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Large language models are effective text rankers with pairwise ranking prompting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:0847baaacef0f4f3ce4248b578aa40e2aff8078cd45ab27aae7af0fa3c85be1d","observation_id":"677536d7-25f5-46d4-8678-42d81a8499c9","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"First: Faster improved listwise reranking with single token decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:c20ef597dbdb146f034270c7a8d79f964a31a12833a53b41da8697083ac19d95","observation_id":"de562e6a-c9bb-4e3a-bab5-a919b53f04b6","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Rankllm: A python package for reranking with llms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:23d9758257b086c4748852ba5965fc484e061ddc7b5479537b94e1a5f659582a","observation_id":"d7d087a6-8d4f-48f2-928d-2071075f01b7","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Is chatgpt good at search? investigating large language models as re-ranking agents","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:78241750c870bf8d83bb6f0cf41a24ac3aa7ce51479255e516de62c4ad65e13b","observation_id":"a2e5d2d5-6158-4507-89c5-d9c79be80d28","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Is chatgpt good at search? investigating large language models as re-ranking agents, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:d55cefb15996a39984f3778e458ad89aabe89e054b19d90fe589857fb4feabfa","observation_id":"ba1e1fd4-6e58-4277-aa1d-bfdfe5f49890","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"BEIR: A het- erogeneous benchmark for zero-shot evaluation of information retrieval models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:9157c488bdd3ec6cccb8b4d43eca68971ecd8060415da439e20e19fd4f27ce4d","observation_id":"4da6c47a-00a0-430c-896a-436118afa0a4","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Contrastive retrieval heads improve attention-based re-ranking, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:7ff8454d088133ff2dd291e362255fae165cd5834f86d80e420a88492b1686e9","observation_id":"3d896ff8-9417-475f-964f-984ed98b7177","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Headrank: Decoding-free passage reranking via preference-aligned attention heads, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:def5d6fe2c9a6443e673fc0321ad62323682f6bb977e0e910a387beba87eae56","observation_id":"42802f95-9134-4fc0-bff2-047fb742b4b9","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"When should queries be decomposed? a stage-aware study of query decomposition for multi-condition retrieval, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:2dda845d8c80ee614b449da2c5861608e8433d5d541735d5d7b3bae5e9578fe1","observation_id":"f28849b4-6e9e-4dc3-97a8-0e6aa54407be","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Big bird: Transformers for longer sequences","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:97d8a16588b0ce633574a520539816869e5c2d752b4235d90a05fe7116529a38","observation_id":"006e55c3-0e9a-4e84-8a3a-7afffd5e283c","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Query-focused retrieval heads improve long-context reasoning and re-ranking","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:8f371d7eee5ff05caf1add0a2622dfcbbeebdbab1865faf412b1c36855875c79","observation_id":"638d27f1-1571-40db-87bc-11e2fa6ef58f","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Compress-then-rank: Faster and better listwise reranking with large language models via ranking-aware passage compression","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:bf1e9ecdd3d059efffe65a4de119667825c0ead683ff6cd14fcd481fbbd5d553","observation_id":"75a675e5-7b63-4c92-9b97-f6d26960dc84","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"Lon- granker: Efficient one-pass document reranking with long-context large language models","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:f19b74772ea29628207474e7c92dd81f7cd5d368d8a10ce0fbcb8eeb8fb2543f","observation_id":"c77930a8-8b95-4402-a0fc-9b9e2d1ee1cb","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"A setwise approach for effective and highly efficient zero-shot ranking with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:b072d898f8a13e5bb54c30aa0863d1d9e5fcd538dac4aac41313e842b22e3590","observation_id":"83630892-db68-41a4-8cc5-b2e67619772a","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:28:14.637197Z","title":"[n] {passage_n} Search Query: {query}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T08:28:14.637197Z"},"links":{"citing_paper":"/paper/2606.11700"},"observation_digest":"sha256:7a3f8b90118a3e0848f3d675e847abaf2e401fa2309ef3ba83ea28b319c7c9fc","observation_id":"38cb3dd8-3c38-4678-b2c6-5f8507109be5","resolution":{"observed_at":"2026-06-27T08:28:14.637197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11700","last_updated":"2026-06-10T06:23:46Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-19T16:29:38.327189Z","submitted_at":"2026-06-10T06:23:46Z","title":"CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2606.11700."}