{"as_of":"2026-08-10T08:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7de8db1720f8c385de5a6428dd74e1064441abef4c7475abba01a3b64629c3b4","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:38.317695Z","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-13T05:27:19.475812Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.05508","last_updated":"2024-11-12T15:36:04Z","snapshot_observed_at":"2026-08-06T09:15:33.449348Z","submitted_at":"2024-11-08T12:08:17Z","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05508","snapshot_observed_at":"2026-08-07T14:20:38.317695Z","title":null,"venue":null,"work_id":null,"year":2024},"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":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:38.317695Z"},"links":{"cited_paper":"/paper/2411.05508","citing_paper":"/paper/2505.19284"},"observation_digest":"sha256:8d72e7fdaaa81a909787456237dee9b1502b3b28a4a152f032039f8d0beb2c4f","observation_id":"6a50b450-33f4-4b8f-9bd3-e758ee35668e","resolution":{"observed_at":"2026-08-07T14:20:38.317695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05508","last_updated":"2024-11-12T15:36:04Z","snapshot_observed_at":"2026-08-06T09:15:33.449348Z","submitted_at":"2024-11-08T12:08:17Z","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05508","snapshot_observed_at":"2026-08-06T18:57:33.564436Z","title":"Preprint, arXiv:2411.05508","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-09T12:51:38.770524Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.564436Z"},"links":{"cited_paper":"/paper/2411.05508","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:7bd51f323be9e5b3f4752d54e1a8d3787b5c5f3f05541b3cd22047b7f08a45e4","observation_id":"b2acb541-8b4b-46f9-882f-0fd807bd20c5","resolution":{"observed_at":"2026-08-06T18:57:33.564436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05508","last_updated":"2024-11-12T15:36:04Z","snapshot_observed_at":"2026-08-06T09:15:33.449348Z","submitted_at":"2024-11-08T12:08:17Z","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking","version":2},"cited_work":{"arxiv_id":"2411.05508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.05508","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.05508 , year=","venue":null,"work_id":"e102404e-1e8d-4f42-a822-476403a16781","year":null},"citing_paper":{"arxiv_id":"2605.11864","last_updated":"2026-05-12T09:45:59Z","snapshot_observed_at":"2026-07-06T23:23:39.723268Z","submitted_at":"2026-05-12T09:45:59Z","title":"Very Efficient Listwise Multimodal Reranking for Long Documents","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-13T05:17:19.587925Z"},"links":{"cited_paper":"/paper/2411.05508","citing_paper":"/paper/2605.11864"},"observation_digest":"sha256:5197f6c180568dce83dcecc98e79261bc44c7706fd92df0da427543f2f1c6573","observation_id":"72c96293-abbe-4fae-bebf-7a711219cd08","resolution":{"observed_at":"2026-05-13T05:27:19.477486Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.05508/citation-record","integrity":"/paper/2411.05508/integrity","json":"/paper/2411.05508/citation-record.json","paper":"/paper/2411.05508"},"outbound":[],"paper":{"arxiv_id":"2411.05508","last_updated":"2024-11-12T15:36:04Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T09:15:33.449348Z","submitted_at":"2024-11-08T12:08:17Z","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2411.05508."}