{"as_of":"2026-08-08T15:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d7847ef02d5b4975737b2a8eb3579364a92ce1be1939519786618286d00811e","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-07T14:55:47.281945Z","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-11T08:50:59.357283Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-07T14:20:44.321000Z","title":"Parry, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19334","last_updated":"2025-05-25T21:41:35Z","snapshot_observed_at":"2026-08-07T22:58:05.299125Z","submitted_at":"2025-05-25T21:41:35Z","title":"Likert or Not: LLM Absolute Relevance Judgments on Fine-Grained Ordinal Scales","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T14:20:44.321000Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2505.19334"},"observation_digest":"sha256:09c5f1388ca54b4440df7f39e5937c1835535c901131061cbe5e63474456ee0f","observation_id":"62645983-975a-4984-ad6c-d9d52f1bcc00","resolution":{"observed_at":"2026-08-07T14:20:44.321000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-07T14:55:47.281945Z","title":"Top-down partitioning for efficient list-wise ranking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20316","last_updated":"2025-05-23T02:25:26Z","snapshot_observed_at":"2026-08-08T08:33:09.022524Z","submitted_at":"2025-05-23T02:25:26Z","title":"Reinforcement Speculative Decoding for Fast Ranking","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:47.281945Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2505.20316"},"observation_digest":"sha256:5165b44754d35bb719bc6c7498da1e14b6dd9a296d33a10e70094de5bc271102","observation_id":"25477b58-b72e-4a56-ab7f-b3a4cbfee646","resolution":{"observed_at":"2026-08-07T14:55:47.281945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-07T04:22:36.568912Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10859","last_updated":"2025-06-12T16:20:40Z","snapshot_observed_at":"2026-08-07T22:54:36.783211Z","submitted_at":"2025-06-12T16:20:40Z","title":"Precise Zero-Shot Pointwise Ranking with LLMs through Post-Aggregated Global Context Information","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:36.568912Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2506.10859"},"observation_digest":"sha256:f6bc147f5738c902daaa577d2300b00cdbf00fa711c0af42a4dc5540a67960c9","observation_id":"ea1c8646-b9b7-4c56-81ba-8d9d283d9156","resolution":{"observed_at":"2026-08-07T04:22:36.568912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-06T22:14:08.571613Z","title":null,"venue":null,"work_id":null,"year":2024},"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":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:14:08.571613Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2506.22262"},"observation_digest":"sha256:29a3fee69f630ebb09e45ce024b804269e8653766cfe8648a78cf91ff952a5c8","observation_id":"6c0c8aac-23a4-4f98-aabe-b08b05fa79f0","resolution":{"observed_at":"2026-08-06T22:14:08.571613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-08-03T08:09:51.274375Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.18146","last_updated":"2026-07-16T10:27:29Z","snapshot_observed_at":"2026-08-06T14:40:38.756042Z","submitted_at":"2026-01-26T05:09:07Z","title":"Think When Needed: Model-Aware Reasoning Routing for LLM-based Ranking","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T08:09:51.274375Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2601.18146"},"observation_digest":"sha256:8e3db0d45206cbcb200a2c55f753113db05f7bb730e3a15436e111af70191049","observation_id":"d31e04b1-3b97-49f8-856f-3e9a1a31cc37","resolution":{"observed_at":"2026-08-03T08:09:51.274375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":"2405.14589","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8e5929ae-8353-4dce-aae1-7f10cb4b1452","year":2024},"citing_paper":{"arxiv_id":"2604.09492","last_updated":"2026-05-28T08:58:53Z","snapshot_observed_at":"2026-08-02T09:11:43.382726Z","submitted_at":"2026-04-10T16:59:54Z","title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T16:27:04.127654Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2604.09492"},"observation_digest":"sha256:87c90389c4645d4bb157884d2e71f558ae016f2efc0fdddedfbf1a506d273446","observation_id":"8ca9e53a-b70e-4bff-9eca-6e63d3c7688f","resolution":{"observed_at":"2026-05-11T08:50:59.359225Z","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":"2405.14589","last_updated":"2024-05-23T14:00:26Z","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14589","snapshot_observed_at":"2026-07-30T19:03:06.381714Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23561","last_updated":"2026-07-26T09:24:20Z","snapshot_observed_at":"2026-08-06T15:10:34.318908Z","submitted_at":"2026-07-26T09:24:20Z","title":"Towards a Relevance Posterior in Neural Information Access","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-30T19:03:06.381714Z"},"links":{"cited_paper":"/paper/2405.14589","citing_paper":"/paper/2607.23561"},"observation_digest":"sha256:21bb53f25051eec08dd21ec0698f622a624c0b8cdbec17ba7d67e2167c5980ec","observation_id":"0a90d76d-2ea8-484d-940b-aff33c3e9023","resolution":{"observed_at":"2026-07-30T19:03:06.381714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.14589/citation-record","integrity":"/paper/2405.14589/integrity","json":"/paper/2405.14589/citation-record.json","paper":"/paper/2405.14589"},"outbound":[],"paper":{"arxiv_id":"2405.14589","last_updated":"2024-05-23T14:00:26Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T18:18:39.093732Z","submitted_at":"2024-05-23T14:00:26Z","title":"Top-Down Partitioning for Efficient List-Wise Ranking"},"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:2405.14589."}