{"as_of":"2026-08-08T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7db1ef9206e429ed9b6cd18fc7fad734300f0be13e70eb3fc4956203aae95c7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:40:11.506379Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T19:52:52.360309Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-07T15:40:11.506379Z","title":"Scaling down, litting up: Effi- cient zero-shot listwise reranking with seq2seq encoder-decoder models.arXiv preprint arXiv:2312.16098,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.506379Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:183952c8d52a11d00b656daacce80c54cbcb61129e66d85ca9f00e35c4234045","observation_id":"a10e5d2c-2b05-4480-8f4b-85417550c32b","resolution":{"observed_at":"2026-08-07T15:40:11.506379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-07T14:23:42.043574Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19274","last_updated":"2025-05-25T19:06:19Z","snapshot_observed_at":"2026-08-07T22:54:37.605449Z","submitted_at":"2025-05-25T19:06:19Z","title":"Conventional Contrastive Learning Often Falls Short: Improving Dense Retrieval with Cross-Encoder Listwise Distillation and Synthetic Data","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T14:23:42.043574Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2505.19274"},"observation_digest":"sha256:9e95c6fadee3d966a8b53b7b2646e2cff354ee7f01a7073733537861dbc90df8","observation_id":"fd4d8c7a-72cc-49e3-82b7-0bb4a286edb6","resolution":{"observed_at":"2026-08-07T14:23:42.043574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-07T14:20:40.711679Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19284","last_updated":"2025-05-25T19:29:27Z","snapshot_observed_at":"2026-08-07T22:58:22.585088Z","submitted_at":"2025-05-25T19:29:27Z","title":"RankLLM: A Python Package for Reranking with LLMs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:40.711679Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2505.19284"},"observation_digest":"sha256:ba32dc17a85f2dca038902de2a55581752d981b6d08508354c216939250f639b","observation_id":"8699ba02-3e3f-485d-a0f2-f87f1c0502d1","resolution":{"observed_at":"2026-08-07T14:20:40.711679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-06T22:14:09.659069Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22262","last_updated":"2025-06-27T14:30:12Z","snapshot_observed_at":"2026-08-06T22:05:24.047262Z","submitted_at":"2025-06-27T14:30:12Z","title":"JointRank: Rank Large Set with Single Pass","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:14:09.659069Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2506.22262"},"observation_digest":"sha256:12b0cb30d9dc69d4a40177af69c7dc076f9ca6c0d642f010de2bcb7ec50487d2","observation_id":"ea948976-5eff-44b6-9769-cf22d4d729ba","resolution":{"observed_at":"2026-08-06T22:14:09.659069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-05T17:15:15.367334Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.16757","last_updated":"2025-08-22T19:30:04Z","snapshot_observed_at":"2026-08-08T10:43:38.606053Z","submitted_at":"2025-08-22T19:30:04Z","title":"How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T17:15:15.367334Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2508.16757"},"observation_digest":"sha256:b1231ee3288c2c42a7e9d9928fba6011fe4c3996f8c3caf3454bb02ca489895b","observation_id":"4ce76377-8243-45a1-aa11-147c6d5c2fd0","resolution":{"observed_at":"2026-08-05T17:15:15.367334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":"2312.16098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling down, litting up: Efficient zero-shot listwise reranking with seq2seq encoder-decoder models","venue":null,"work_id":"1db5e058-96ce-4dcd-974a-ab1e0921e989","year":2023},"citing_paper":{"arxiv_id":"2604.15621","last_updated":"2026-04-17T02:00:52Z","snapshot_observed_at":"2026-07-06T23:03:07.228701Z","submitted_at":"2026-04-17T02:00:52Z","title":"Rethinking the Necessity of Adaptive Retrieval-Augmented Generation through the Lens of Adaptive Listwise Ranking","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T08:26:02.605596Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2604.15621"},"observation_digest":"sha256:ace01f09bc0929f996620d83c70bfdcd7d4a5bf094e44216c555641e93374f08","observation_id":"8b5d6e05-50b1-4e26-abd1-9b6e65c9bc6e","resolution":{"observed_at":"2026-05-10T08:27:51.794103Z","resolver_source":"arxiv_id","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":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":"2312.16098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling down, litting up: Efficient zero-shot listwise reranking with seq2seq encoder-decoder models","venue":null,"work_id":"1db5e058-96ce-4dcd-974a-ab1e0921e989","year":2023},"citing_paper":{"arxiv_id":"2605.12995","last_updated":"2026-05-13T04:52:33Z","snapshot_observed_at":"2026-08-08T09:21:40.860154Z","submitted_at":"2026-05-13T04:52:33Z","title":"F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-14T19:51:45.657658Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2605.12995"},"observation_digest":"sha256:16025fe79eb878abedab93f114c2e34d1281d120655a220549bcb8fcdbbe98e8","observation_id":"3dadcd33-4791-412c-af7f-46a6d84bebff","resolution":{"observed_at":"2026-05-14T19:52:52.363050Z","resolver_source":"arxiv_id","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/2312.16098/citation-record","integrity":"/paper/2312.16098/integrity","json":"/paper/2312.16098/citation-record.json","paper":"/paper/2312.16098"},"outbound":[],"paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2312.16098."}