{"as_of":"2026-08-17T04:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd225a6b3714a06be4578c6b42387e997eb34fa1a50ddacd1f88460d372e2fff","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:28:32.065932Z","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-15T23:40:11.185444Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":"2310.09497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"859e8b60-027b-4455-956c-c7e2037a9945","year":2023},"citing_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-08-11T22:23:22.715360Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-15T23:40:11.018808Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2312.02724"},"observation_digest":"sha256:a06d9f0436deb965216d9321a675c824942344a16d03338222673aaa0e1cc5f9","observation_id":"00569e38-1161-4295-bacf-58508d2ff955","resolution":{"observed_at":"2026-05-15T23:40:11.189189Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-08-10T19:28:32.065932Z","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-15T16:27:36.855506Z","submitted_at":"2025-01-17T11:12:28Z","title":"PaSa: An LLM Agent for Comprehensive Academic Paper Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:28:32.065932Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2501.10120"},"observation_digest":"sha256:35d8db0b79274363dcee110bc60e0ebb1957c92b871e7d2a403ee7a7f73f7364","observation_id":"5c0ef576-15a1-4222-bd2b-4abb22ba69b1","resolution":{"observed_at":"2026-08-10T19:28:32.065932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-08-07T15:23:03.023530Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15394","last_updated":"2025-05-21T11:35:11Z","snapshot_observed_at":"2026-08-14T20:03:24.945992Z","submitted_at":"2025-05-21T11:35:11Z","title":"Reranking with Compressed Document Representation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:03.023530Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2505.15394"},"observation_digest":"sha256:982c6e6fdd44b65fcda34428f95110dfc884095be7a184d0b36e11f4ae70dfe0","observation_id":"b86b4223-c904-4bab-b1f2-c893deec43f1","resolution":{"observed_at":"2026-08-07T15:23:03.023530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-08-02T20:27:49.815237Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.23234","last_updated":"2026-06-07T00:45:24Z","snapshot_observed_at":"2026-08-16T19:02:28.802010Z","submitted_at":"2026-02-26T17:11:26Z","title":"Scaling Search Relevance: Augmenting App Store Ranking with LLM-Generated Judgments","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T20:27:49.815237Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2602.23234"},"observation_digest":"sha256:445bd99c3f3e86ba95797db7eadcc37f85858c94c976ccc2cd4de3f575985441","observation_id":"70c7dd8e-93cd-42ee-a5ee-a4c39766f458","resolution":{"observed_at":"2026-08-02T20:27:49.815237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","version":2},"cited_work":{"arxiv_id":"2310.09497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.09497","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"859e8b60-027b-4455-956c-c7e2037a9945","year":2023},"citing_paper":{"arxiv_id":"2604.26483","last_updated":"2026-04-29T09:48:44Z","snapshot_observed_at":"2026-08-11T10:25:43.024366Z","submitted_at":"2026-04-29T09:48:44Z","title":"Efficient Listwise Reranking with Compressed Document Representations","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-07T10:44:37.955281Z"},"links":{"cited_paper":"/paper/2310.09497","citing_paper":"/paper/2604.26483"},"observation_digest":"sha256:6a897e61f77b3ebb34b1758f0fde0fcdc80f33cccfa0c56d96368cffb36778f2","observation_id":"05239255-7bb0-408f-84e9-ada6bf431d81","resolution":{"observed_at":"2026-05-12T09:31:25.607011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.09497/citation-record","integrity":"/paper/2310.09497/integrity","json":"/paper/2310.09497/citation-record.json","paper":"/paper/2310.09497"},"outbound":[],"paper":{"arxiv_id":"2310.09497","last_updated":"2024-05-30T10:03:27Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T14:52:11.436779Z","submitted_at":"2023-10-14T05:20:02Z","title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2310.09497."}