{"as_of":"2026-08-11T14:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e69d8130dbf2256a9ae3017cdd9336ff6cb30aab5c8e513a4f5682ef7869f2b","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-11T06:34:44.6726+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-10T19:28:32.337034Z","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-11T11:30:20.759818Z","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-10T20:19:22.654200Z","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:d8beb7b698c011d46ecda686f4e07717f90f6bd6531e6b505639167e653ea322","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-11T11:30:20.759818Z","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:737065306d524001fd4bbfe5672a3252f44c606957cfba1f864af0f053d8ec21","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:30:20.759818Z","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-09T10:25:25.665012Z","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:cdd8c7a4bab6c838881e759859a5d19c52543f8f78ae7afbe13775a0759ed1ad","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T11:30:20.759818Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.19181."}