{"as_of":"2026-08-10T08:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b044753f060c0dd5557e351d79e235266b97e069f4dc154d531255e4098d757c","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:07:24.209319Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T20:39:32.629441Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.17745","last_updated":"2024-10-04T18:35:14Z","snapshot_observed_at":"2026-08-04T01:43:39.574995Z","submitted_at":"2024-09-26T11:19:09Z","title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17745","snapshot_observed_at":"2026-08-09T12:07:24.209319Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02464","last_updated":"2025-02-19T22:46:25Z","snapshot_observed_at":"2026-08-09T18:22:35.162611Z","submitted_at":"2025-02-04T16:33:25Z","title":"Rankify: A Comprehensive Python Toolkit for Retrieval, Re-Ranking, and Retrieval-Augmented Generation","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-09T12:07:24.209319Z"},"links":{"cited_paper":"/paper/2409.17745","citing_paper":"/paper/2502.02464"},"observation_digest":"sha256:34e98ae0a0ec7af6eecd3d2f58bbde9f54ef42ce24581bb5bf92845c21b49e93","observation_id":"9639f218-8866-4232-aeed-58dd92ec8b84","resolution":{"observed_at":"2026-08-09T12:07:24.209319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17745","last_updated":"2024-10-04T18:35:14Z","snapshot_observed_at":"2026-08-04T01:43:39.574995Z","submitted_at":"2024-09-26T11:19:09Z","title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model","version":3},"cited_work":{"arxiv_id":"2409.17745","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.17745","snapshot_observed_at":"2026-08-06T20:39:32.629441Z","title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model","venue":"cs.IR","work_id":"358671f4-a22b-4e06-a0af-61f9087e65af","year":2024},"citing_paper":{"arxiv_id":"2507.21099","last_updated":"2025-07-03T05:36:08Z","snapshot_observed_at":"2026-08-09T12:02:44.787629Z","submitted_at":"2025-07-03T05:36:08Z","title":"Rewrite-to-Rank: Optimizing Ad Visibility via Retrieval-Aware Text Rewriting","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:39:31.984383Z"},"links":{"cited_paper":"/paper/2409.17745","citing_paper":"/paper/2507.21099"},"observation_digest":"sha256:df02ce7bc42ea2c1906a26199c867070aed07db8745b7aff2f17e14985a36835","observation_id":"d8edd48d-03c8-47c4-bcdd-92317b5ad6d4","resolution":{"observed_at":"2026-08-06T20:39:32.687357Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2409.17745/citation-record","integrity":"/paper/2409.17745/integrity","json":"/paper/2409.17745/citation-record.json","paper":"/paper/2409.17745"},"outbound":[],"paper":{"arxiv_id":"2409.17745","last_updated":"2024-10-04T18:35:14Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-04T01:43:39.574995Z","submitted_at":"2024-09-26T11:19:09Z","title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model"},"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 2 inbound Pith citation observations for arXiv:2409.17745."}