{"as_of":"2026-08-15T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6067c85fa52bbf8b24815ee6a1468811497aeffb54cee028fb866732e151c61","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:59:56.742378Z","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-12T10:11:27.165069Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.19181","last_updated":"2024-09-27T08:57:34Z","snapshot_observed_at":"2026-08-13T00:43:16.701084Z","submitted_at":"2024-03-28T07:22:16Z","title":"Make Large Language Model a Better Ranker","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19181","snapshot_observed_at":"2026-08-12T21:59:56.742378Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.08165","last_updated":"2025-04-30T12:02:25Z","snapshot_observed_at":"2026-08-12T21:51:39.179221Z","submitted_at":"2024-11-12T20:15:58Z","title":"Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T21:59:56.742378Z"},"links":{"cited_paper":"/paper/2403.19181","citing_paper":"/paper/2411.08165"},"observation_digest":"sha256:f9ba4ca63d54ec3fe6038cf93c40806abc5290edfedbf5e9db7f2c47e919e00f","observation_id":"2ecdbfab-5c03-48f9-85e1-bade189410f8","resolution":{"observed_at":"2026-08-12T21:59:56.742378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19181","last_updated":"2024-09-27T08:57:34Z","snapshot_observed_at":"2026-08-13T00:43:16.701084Z","submitted_at":"2024-03-28T07:22:16Z","title":"Make Large Language Model a Better Ranker","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19181","snapshot_observed_at":"2026-08-10T19:28:32.337034Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.10120","last_updated":"2025-05-27T11:01:29Z","snapshot_observed_at":"2026-08-14T06:33:25.101734Z","submitted_at":"2025-01-17T11:12:28Z","title":"PaSa: An LLM Agent for Comprehensive Academic Paper Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:28:32.337034Z"},"links":{"cited_paper":"/paper/2403.19181","citing_paper":"/paper/2501.10120"},"observation_digest":"sha256:a3ba8cf4213dd19981e2a6a579d9e2852cc73b390764a27c25d154f925ca1fcc","observation_id":"0c310c0c-8500-4a8d-9790-2af53de9f4c1","resolution":{"observed_at":"2026-08-10T19:28:32.337034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19181","last_updated":"2024-09-27T08:57:34Z","snapshot_observed_at":"2026-08-13T00:43:16.701084Z","submitted_at":"2024-03-28T07:22:16Z","title":"Make Large Language Model a Better Ranker","version":3},"cited_work":{"arxiv_id":"2403.19181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19181","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b83e9e62-3165-4b4b-9d05-6e1b3f822857","year":2024},"citing_paper":{"arxiv_id":"2604.27599","last_updated":"2026-04-30T08:49:44Z","snapshot_observed_at":"2026-08-01T03:49:09.757174Z","submitted_at":"2026-04-30T08:49:44Z","title":"One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T07:34:40.725207Z"},"links":{"cited_paper":"/paper/2403.19181","citing_paper":"/paper/2604.27599"},"observation_digest":"sha256:bb15fc97f4951244df675a99594ac28c36683ce0d083837d7c701b9165c2e990","observation_id":"74395008-6aa3-4b29-9ca5-bb0ab5e573e0","resolution":{"observed_at":"2026-05-12T10:11:27.166625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19181","last_updated":"2024-09-27T08:57:34Z","snapshot_observed_at":"2026-08-13T00:43:16.701084Z","submitted_at":"2024-03-28T07:22:16Z","title":"Make Large Language Model a Better Ranker","version":3},"cited_work":{"arxiv_id":"2403.19181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19181","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b83e9e62-3165-4b4b-9d05-6e1b3f822857","year":2024},"citing_paper":{"arxiv_id":"2605.04559","last_updated":"2026-05-06T07:02:57Z","snapshot_observed_at":"2026-08-15T05:32:55.813536Z","submitted_at":"2026-05-06T07:02:57Z","title":"Beyond Static Best-of-N: Bayesian List-wise Alignment for LLM-based Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T17:06:18.050592Z"},"links":{"cited_paper":"/paper/2403.19181","citing_paper":"/paper/2605.04559"},"observation_digest":"sha256:1651fcdc6a2c46cf05936610b36492124d4ca6c11569597ead1c109577b2d5fb","observation_id":"3304f731-6687-4611-93dc-e9ad51a54210","resolution":{"observed_at":"2026-05-11T17:51:06.520382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.19181/citation-record","integrity":"/paper/2403.19181/integrity","json":"/paper/2403.19181/citation-record.json","paper":"/paper/2403.19181"},"outbound":[],"paper":{"arxiv_id":"2403.19181","last_updated":"2024-09-27T08:57:34Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-13T00:43:16.701084Z","submitted_at":"2024-03-28T07:22:16Z","title":"Make Large Language Model a Better Ranker"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2403.19181."}