{"as_of":"2026-08-08T23:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a19826c721d1c23bd082251db577b3544bf084677ab52c7a0f3f2e82ea5108d0","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:03.023530Z","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:39:09.182575Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"cited_work":{"arxiv_id":"2505.15394","doi":"10.48550/arxiv.2505.15394","metadata_source":"pith","pith_arxiv_id":"2505.15394","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Reranking with Compressed Document Representation","venue":"cs.IR","work_id":"4ad1a7f1-7a40-49d9-a010-381844f0fc2d","year":2025},"citing_paper":{"arxiv_id":"2602.16299","last_updated":"2026-07-06T07:51:55Z","snapshot_observed_at":"2026-08-07T14:01:38.387734Z","submitted_at":"2026-02-18T09:30:29Z","title":"MICE: Minimal Interaction Cross-Encoders for efficient Re-ranking","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T22:39:09.182575Z"},"links":{"cited_paper":"/paper/2505.15394","citing_paper":"/paper/2602.16299"},"observation_digest":"sha256:87e1d981755f66eb040589b749e63b7383561cd732df3072e0c026881f8c1325","observation_id":"e72a940c-a426-4da8-84fb-c9dda9189b95","resolution":{"observed_at":"2026-08-02T22:44:36.199575Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15394/citation-record","integrity":"/paper/2505.15394/integrity","json":"/paper/2505.15394/citation-record.json","paper":"/paper/2505.15394"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-07T15:23:00.831291Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:00.831291Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:2f2b885cbc1495ea4052079a29e615ac9300ac9ef3627b4738d203d985d6ec12","observation_id":"b34e9b12-77d6-4ede-8233-3043267e2927","resolution":{"observed_at":"2026-08-07T15:23:00.831291Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:05.018552Z","title":null,"venue":null,"work_id":"76523793-2a43-4ab6-9a33-dfd556c4ecb6","year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:00.899337Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:dac11999c19b73edc9d26e099c031fa9f56da439302f023db802203a67fb8a95","observation_id":"2eb160d8-9bf8-4fc3-87a8-b487b4920a5b","resolution":{"observed_at":"2026-08-07T15:23:05.057428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.899272Z","title":null,"venue":null,"work_id":"61561616-f31f-41e9-899c-3d260542520a","year":2025},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:00.937678Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:78007ba1cd7d9f2f04f4fd8c897024a4aa937aa1bcc53f0b0befb6a9934c5e6a","observation_id":"b38b8581-7fb6-4692-99b7-fec0d028c083","resolution":{"observed_at":"2026-08-07T15:23:04.954011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01607","last_updated":"2024-06-19T06:52:13Z","snapshot_observed_at":"2026-07-30T13:57:18.871516Z","submitted_at":"2024-05-27T09:52:54Z","title":"Recent advances in text embedding: A Comprehensive Review of Top-Performing Methods on the MTEB Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01607","snapshot_observed_at":"2026-08-07T15:23:00.976245Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:00.976245Z"},"links":{"cited_paper":"/paper/2406.01607","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:57275a5110ba70bd17ea56ba42b803038b4fd545e5d2fe1f109b2f6d1700ccaa","observation_id":"f134d536-67e9-4dff-b5dc-bd348c16a8eb","resolution":{"observed_at":"2026-08-07T15:23:00.976245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07662","last_updated":"2021-02-15T16:47:00Z","snapshot_observed_at":"2026-07-06T10:41:31.563193Z","submitted_at":"2021-02-15T16:47:00Z","title":"Overview of the TREC 2020 deep learning track","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07662","snapshot_observed_at":"2026-08-07T15:23:01.020023Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.020023Z"},"links":{"cited_paper":"/paper/2102.07662","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:c546decbf754d8b5a35f5a6fdb7fbf767ea6541833a0e70f850f62b96112638b","observation_id":"4632784f-7fe2-4f29-b925-28e77cc1f53d","resolution":{"observed_at":"2026-08-07T15:23:01.020023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-07-06T09:05:23.015957Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-07T15:23:01.088080Z","title":"Voorhees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.088080Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:1de8eddc19f177a17262acf96fd1af6d0e8477b2e920c84a3b230593ab93ae69","observation_id":"5351583f-16d0-47f8-9b24-7c9d29e47e62","resolution":{"observed_at":"2026-08-07T15:23:01.088080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10407","last_updated":"2024-03-15T15:39:56Z","snapshot_observed_at":"2026-07-06T17:45:19.668165Z","submitted_at":"2024-03-15T15:39:56Z","title":"A Thorough Comparison of Cross-Encoders and LLMs for Reranking SPLADE","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10407","snapshot_observed_at":"2026-08-07T15:23:01.147315Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.147315Z"},"links":{"cited_paper":"/paper/2403.10407","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:c09fc8b086d87170a2d3a848fb204ace3c5af0a6207332887346e749deb1ec67","observation_id":"a6f96700-6ca3-4eeb-9f04-be4d52de8c71","resolution":{"observed_at":"2026-08-07T15:23:01.147315Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.759697Z","title":null,"venue":null,"work_id":"a298f7b4-c67d-4448-86f6-a4715090f50d","year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.191526Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:300cb40908a006f82819cf284f150020f884f090d45beecd561bdd1c1c94fce9","observation_id":"3f6dbd2b-7914-4014-9ab0-55a17515dd35","resolution":{"observed_at":"2026-08-07T15:23:04.813462Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.603597Z","title":null,"venue":null,"work_id":"64e48bf3-7e39-4e6e-b32e-05198843dcd2","year":2020},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.286245Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:0c02b49d9464628341450bf2c0bc7d7968d7ae59e9e9889b9d9272031b4cf479","observation_id":"1b4fc3e6-edc4-4959-97a4-11b3b960f25e","resolution":{"observed_at":"2026-08-07T15:23:04.675205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T15:23:01.363599Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.363599Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:7d3ace9c39d28e35af86ed5a513b0f0d5feeaa411af984fd11ded994b4ed8dda","observation_id":"21c4dd20-6530-46d7-8983-0ba71a0e531c","resolution":{"observed_at":"2026-08-07T15:23:01.363599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06945","last_updated":"2024-05-08T18:16:09Z","snapshot_observed_at":"2026-08-02T18:04:23.903413Z","submitted_at":"2023-07-13T17:59:21Z","title":"In-context Autoencoder for Context Compression in a Large Language Model","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.06945","snapshot_observed_at":"2026-08-07T15:23:01.440306Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.440306Z"},"links":{"cited_paper":"/paper/2307.06945","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:c458d13853d183d49ab4f769dd9c317f0d6ffcff82978e1a228119bef8cf5677","observation_id":"fcffa416-523a-425d-a7ca-d66d0cffbf46","resolution":{"observed_at":"2026-08-07T15:23:01.440306Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.444689Z","title":null,"venue":null,"work_id":"0bf3d5d5-5429-4350-b5dc-a2c8e54c688a","year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.485888Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:c017e56985dfa56836e3e00ac850945a31ad945f7642add739048196d27b7087","observation_id":"8159db40-d232-421c-8a96-93b8eb026d86","resolution":{"observed_at":"2026-08-07T15:23:04.506354Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.13357","last_updated":"2024-04-20T11:49:45Z","snapshot_observed_at":"2026-08-04T00:50:52.790869Z","submitted_at":"2024-04-20T11:49:45Z","title":"Two-Step SPLADE: Simple, Efficient and Effective Approximation of SPLADE","version":1},"cited_work":{"arxiv_id":"2404.13357","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.13357","snapshot_observed_at":"2026-08-07T15:23:03.337241Z","title":"Two-Step SPLADE: Simple, Efficient and Effective Approximation of SPLADE","venue":"cs.IR","work_id":"b714bd9d-8f94-4cac-900c-0ada03fde0f8","year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.636938Z"},"links":{"cited_paper":"/paper/2404.13357","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:a312ce3e6ac434f4906ac9a5b3e649b1d4328dcdbbc93d52af721686b5c77bd8","observation_id":"ab729437-67b9-459b-9505-a82571d88e62","resolution":{"observed_at":"2026-08-07T15:23:03.402302Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06789","last_updated":"2024-03-11T15:04:55Z","snapshot_observed_at":"2026-08-06T04:34:33.497904Z","submitted_at":"2024-03-11T15:04:55Z","title":"SPLADE-v3: New baselines for SPLADE","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06789","snapshot_observed_at":"2026-08-07T15:23:01.681864Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.681864Z"},"links":{"cited_paper":"/paper/2403.06789","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:79c4391e8fecda288590ad86c42ad0d0ad740584b0dd300de66b5626377fb7df","observation_id":"fabbb697-9e04-483f-abdf-542727a9e7e5","resolution":{"observed_at":"2026-08-07T15:23:01.681864Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.308741Z","title":null,"venue":null,"work_id":"12306ef9-9eb0-4b9c-a075-662b0d449b78","year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.726190Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:49006497b3232e88cc9b5b90d0422b57cc9a59330ae21e0fac657fd126d81155","observation_id":"41fa9713-ffe1-44bf-b17b-f9ec88ffcdf4","resolution":{"observed_at":"2026-08-07T15:23:04.370011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16302","last_updated":"2025-01-27T18:42:48Z","snapshot_observed_at":"2026-07-06T20:26:55.455541Z","submitted_at":"2025-01-27T18:42:48Z","title":"Matryoshka Re-Ranker: A Flexible Re-Ranking Architecture With Configurable Depth and Width","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16302","snapshot_observed_at":"2026-08-07T15:23:01.792128Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.792128Z"},"links":{"cited_paper":"/paper/2501.16302","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:0440310466bbaced3f834132c37175c60b233ae448f5562416d8eb0a9e3cde2f","observation_id":"65e5a341-a58f-4209-8aec-e771c0e6e138","resolution":{"observed_at":"2026-08-07T15:23:01.792128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16075","last_updated":"2025-01-27T14:26:27Z","snapshot_observed_at":"2026-07-06T20:26:46.276053Z","submitted_at":"2025-01-27T14:26:27Z","title":"PISCO: Pretty Simple Compression for Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16075","snapshot_observed_at":"2026-08-07T15:23:01.879314Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.879314Z"},"links":{"cited_paper":"/paper/2501.16075","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:b87e9b1ee2a5a5dadac6b7cb8814e33ec6bd1d37dbc5210d3ed17207a029f72d","observation_id":"ed873497-6390-4017-9c8e-55917612487a","resolution":{"observed_at":"2026-08-07T15:23:01.879314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08319","last_updated":"2023-10-12T13:32:35Z","snapshot_observed_at":"2026-07-06T16:31:52.204065Z","submitted_at":"2023-10-12T13:32:35Z","title":"Fine-Tuning LLaMA for Multi-Stage Text Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08319","snapshot_observed_at":"2026-08-07T15:23:01.925896Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.925896Z"},"links":{"cited_paper":"/paper/2310.08319","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:318bc6081490f30961e104277df8e26534caea4e728688d8ce5cdc20cb5e4798","observation_id":"3e290251-67fe-435b-af1d-54a12e4cd628","resolution":{"observed_at":"2026-08-07T15:23:01.925896Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.186055Z","title":null,"venue":null,"work_id":"fca17615-a0a3-44e4-a764-98124b9a2db0","year":2020},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.968268Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:332d9af9e0f235222d6397a0a2a41809103fd3acb31be4838e8c22c4ac72e2b0","observation_id":"1f0bbd47-0296-4c18-b294-86ddc1634360","resolution":{"observed_at":"2026-08-07T15:23:04.225763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-02T11:18:37.014004Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-07T15:23:02.007228Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.007228Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:5c18d6ef7bf65912bd176299c60fcca20692a00bd988a9124a737fd55bc02c86","observation_id":"ff29da4c-00f0-48e8-82ca-5759424a67f9","resolution":{"observed_at":"2026-08-07T15:23:02.007228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05667","last_updated":"2021-01-14T15:29:54Z","snapshot_observed_at":"2026-08-07T23:48:38.118363Z","submitted_at":"2021-01-14T15:29:54Z","title":"The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05667","snapshot_observed_at":"2026-08-07T15:23:02.108948Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.108948Z"},"links":{"cited_paper":"/paper/2101.05667","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:8c813b26aada0e553f2dcfb298dcf688be77737e033b0a12b0234f73d5f94d70","observation_id":"b1d48b7a-76c0-41f8-a109-0b204b59f94f","resolution":{"observed_at":"2026-08-07T15:23:02.108948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01102","last_updated":"2024-07-01T09:09:27Z","snapshot_observed_at":"2026-07-06T18:39:24.513351Z","submitted_at":"2024-07-01T09:09:27Z","title":"BERGEN: A Benchmarking Library for Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01102","snapshot_observed_at":"2026-08-07T15:23:02.176330Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.176330Z"},"links":{"cited_paper":"/paper/2407.01102","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:6aa7da99458afa34a558c2c1191748b28393a6f291c182dab0cac6f10a9cb024","observation_id":"09359216-0bdc-4c86-b3ec-773617b1c379","resolution":{"observed_at":"2026-08-07T15:23:02.176330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09252","last_updated":"2024-10-29T17:34:54Z","snapshot_observed_at":"2026-08-06T11:40:05.866749Z","submitted_at":"2024-07-12T13:30:44Z","title":"Context Embeddings for Efficient Answer Generation in RAG","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.09252","snapshot_observed_at":"2026-08-07T15:23:02.217524Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.217524Z"},"links":{"cited_paper":"/paper/2407.09252","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:e6cb1c6b4a6ffa220bd423ca453fee9bc9c2d086dd8751e5cb14fb2a50f5bbcb","observation_id":"23792d52-767b-4689-9a32-3737333532fc","resolution":{"observed_at":"2026-08-07T15:23:02.217524Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:04.041103Z","title":"Khattab, Jon Saad-Falcon, Christopher Potts, and Matei A","venue":null,"work_id":"6770e37a-8543-437c-88aa-f7c1c6442d68","year":2021},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.306267Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:672e96b4664f7518173d315b8e162586a6ed23ea8eab33cd147c48aeeea4bf62","observation_id":"2115a1bc-7d25-46ff-9092-acc6866433ef","resolution":{"observed_at":"2026-08-07T15:23:04.106343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:03.914322Z","title":null,"venue":null,"work_id":"41c28f06-e168-496a-89b1-c066bbc08aee","year":2018},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.385971Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:7d59d73e2b7c9de06a89be8f52d107f3907cfd21d8995800604d890db6ca75c2","observation_id":"5eac53b7-dab8-469e-b04f-263a8e93488f","resolution":{"observed_at":"2026-08-07T15:23:03.988310Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:03.795912Z","title":null,"venue":null,"work_id":"a3e3c1d0-cb6e-4ee7-bedb-a23e2669c966","year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.427690Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:95d0a5f3634770b057f84119a4a09c3cf2436c7c35b428f05d12dd6e95fe8261","observation_id":"2983aac6-75d5-4183-a119-28e6d2c2861d","resolution":{"observed_at":"2026-08-07T15:23:03.859073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09542","last_updated":"2024-12-28T06:20:54Z","snapshot_observed_at":"2026-08-06T00:21:17.259026Z","submitted_at":"2023-04-19T10:16:03Z","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09542","snapshot_observed_at":"2026-08-07T15:23:02.488520Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.488520Z"},"links":{"cited_paper":"/paper/2304.09542","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:bdd3c0df1645d4c491e3f00574880d5cb2d04b0e8c2aab09937bb9ff32bb5292","observation_id":"79f3043e-dd26-4ced-b89a-10c036891537","resolution":{"observed_at":"2026-08-07T15:23:02.488520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-07T15:23:02.574411Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.574411Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:eb3394177677181fed0ec3ae54a038a29b8d293f40410cb2bf832ac1d476c52c","observation_id":"d8903ccc-a480-441c-b2bd-d4cff7622326","resolution":{"observed_at":"2026-08-07T15:23:02.574411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13663","last_updated":"2024-12-19T06:32:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-18T09:39:44Z","title":"Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13663","snapshot_observed_at":"2026-08-07T15:23:02.652535Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.652535Z"},"links":{"cited_paper":"/paper/2412.13663","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:6f27deb9f8593c7959c6cab49b3ee53c44f0ca24738673cfb8703bf4b8b1cc37","observation_id":"fbe6a554-c3a5-4968-bf87-4d23688076d4","resolution":{"observed_at":"2026-08-07T15:23:02.652535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07597","last_updated":"2024-09-24T03:01:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-14T10:57:50Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07597","snapshot_observed_at":"2026-08-07T15:23:02.718663Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.718663Z"},"links":{"cited_paper":"/paper/2309.07597","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:eadcde927917e7b6c5ecbb6f5d04365690ded1860131a44ac89f9c443c438bc0","observation_id":"d0cdee8d-d749-40db-8b9d-0367f5696143","resolution":{"observed_at":"2026-08-07T15:23:02.718663Z","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-08-07T15:23:02.806089Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.806089Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:5a9a58cc6da6f773fef76d1199d82c1f4849bae6944e167316434e09eab48a4c","observation_id":"25beeba0-6d0f-404f-90cc-7ce38e679d17","resolution":{"observed_at":"2026-08-07T15:23:02.806089Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:03.669802Z","title":null,"venue":null,"work_id":"7d691e49-c8af-406c-a86c-e017bcd0eca9","year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.924184Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:4a7c2d210a652e4c956271b3d9b46f3f0f5c2824a87248f530c3de85eb6d2f11","observation_id":"ca71f07b-7d22-4356-bac5-76dec85f33bc","resolution":{"observed_at":"2026-08-07T15:23:03.723992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-07-06T16:32:59.993032Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-08-07T15:23:03.023530Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:03.023530Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:645427bce6df60210f88bd3d0e0615af250096e7b5635a8a38e086557058f384","observation_id":"b86b4223-c904-4bab-b1f2-c893deec43f1","resolution":{"observed_at":"2026-08-07T15:23:03.023530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.08751","last_updated":"2021-01-21T18:04:58Z","snapshot_observed_at":"2026-08-08T20:26:19.890539Z","submitted_at":"2021-01-21T18:04:58Z","title":"Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipeline","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.08751","snapshot_observed_at":"2026-08-07T15:23:01.399555Z","title":"arXiv preprint","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.399555Z"},"links":{"cited_paper":"/paper/2101.08751","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:e3344d50cf866ecda3bf9cd86de7273b39db032083c35b5b60b387d170b3e169","observation_id":"84cc5fc8-e44c-4d1f-ae84-a8b2a3a08869","resolution":{"observed_at":"2026-08-07T15:23:01.399555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12574","last_updated":"2023-02-24T10:58:31Z","snapshot_observed_at":"2026-08-08T14:18:14.049337Z","submitted_at":"2023-02-24T10:58:31Z","title":"Naver Labs Europe (SPLADE) @ TREC Deep Learning 2022","version":1},"cited_work":{"arxiv_id":"2302.12574","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.12574","snapshot_observed_at":"2026-08-07T15:23:03.464815Z","title":"Naver Labs Europe (SPLADE) @ TREC Deep Learning 2022","venue":"cs.IR","work_id":"5c58bfd8-430b-4a0a-8af4-a929faa5859c","year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:01.588532Z"},"links":{"cited_paper":"/paper/2302.12574","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:edf621183dc519c0ab7a33c4e53f63c28997687997adefbd8b98b314a59c3ee2","observation_id":"2d272d64-f0a7-47da-a4d2-14d73bae5ee3","resolution":{"observed_at":"2026-08-07T15:23:03.542669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T15:23:02.864674Z","title":"Preprint, arXiv:2308.07107","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:02.864674Z"},"links":{"citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:861bc7ceaf5baca0bf2035a05d89d2639b1b50b8f272d21e312f4156ce661d57","observation_id":"9e2487df-999c-4f24-b21e-602cef1e8d89","resolution":{"observed_at":"2026-08-07T15:23:02.864674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T15:16:17.642697Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":36},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:2505.15394."}