{"as_of":"2026-08-07T17:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de0c0b53f0240cc869747943f4f09ee7fc271af756d4c06ceadc45370f3d9e70","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:44:00.007759Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T22:33:32.175982Z","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-07-04T18:50:04.307163Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"cited_work":{"arxiv_id":"2507.04820","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.04820","snapshot_observed_at":"2026-07-04T18:50:04.307163Z","title":null,"venue":null,"work_id":"38f8bdd2-5f5c-4d80-8378-cf07a6153f1c","year":2025},"citing_paper":{"arxiv_id":"2606.24346","last_updated":"2026-06-23T09:37:44Z","snapshot_observed_at":"2026-08-06T12:40:00.111432Z","submitted_at":"2026-06-23T09:37:44Z","title":"PETRA: Transforming Web Text for Petroleum-Engineering Domain Adaptation","version":1},"reference_index":118,"source":"arxiv_source","source_observed_at":"2026-06-25T22:33:32.175982Z"},"links":{"cited_paper":"/paper/2507.04820","citing_paper":"/paper/2606.24346"},"observation_digest":"sha256:f5c5835eb72f94acca9b8402ad72c99a8526d05147d825b37601c0373fb42682","observation_id":"99d18153-3817-4298-b575-d4f7df88b484","resolution":{"observed_at":"2026-07-04T18:50:04.309088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.04820/citation-record","integrity":"/paper/2507.04820/integrity","json":"/paper/2507.04820/citation-record.json","paper":"/paper/2507.04820"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-06T19:43:56.987585Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:56.987585Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:081acf71d8dee01b4d5022ec38739f5ed1c468b17c59f6e04de7b8a6d51b4319","observation_id":"85df9b0b-244a-427b-b1b8-b48ad5a3c1df","resolution":{"observed_at":"2026-08-06T19:43:56.987585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:43:57.066497Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.066497Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:8cba6ca1ea99310c964b6ef7f488f0d6f5bf6d9239e5ccb5def344729e960224","observation_id":"6a0a9cea-7da5-4e45-8f13-bbac4666dfe3","resolution":{"observed_at":"2026-08-06T19:43:57.066497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09110","last_updated":"2023-10-01T21:44:23Z","snapshot_observed_at":"2026-08-01T19:14:56.803459Z","submitted_at":"2022-11-16T18:51:34Z","title":"Holistic Evaluation of Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09110","snapshot_observed_at":"2026-08-06T19:43:57.117708Z","title":"Liang, R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.117708Z"},"links":{"cited_paper":"/paper/2211.09110","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:0e65c9b6a74db86d153549e8af5eab843530ec87d5ec26953e1b2086b933340f","observation_id":"38c5ee0f-35ef-4ac2-a32a-516d5b1947a7","resolution":{"observed_at":"2026-08-06T19:43:57.117708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09542","last_updated":"2024-12-28T06:20:54Z","snapshot_observed_at":"2026-08-06T00:21:17.259026Z","submitted_at":"2023-04-19T10:16:03Z","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09542","snapshot_observed_at":"2026-08-06T19:43:57.176891Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.176891Z"},"links":{"cited_paper":"/paper/2304.09542","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:16d3490224161d0700a9ae9c00bb7208b0abdc4e00d3deea013a5aca12abe63d","observation_id":"c92e9d9b-9a72-4d67-820c-d7e6b2304efa","resolution":{"observed_at":"2026-08-06T19:43:57.176891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14122","last_updated":"2024-04-02T01:47:40Z","snapshot_observed_at":"2026-08-05T09:27:51.904444Z","submitted_at":"2023-10-21T21:39:48Z","title":"Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.14122","snapshot_observed_at":"2026-08-06T19:43:57.314346Z","title":"Zhuang, Z","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.314346Z"},"links":{"cited_paper":"/paper/2310.14122","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:6a62b1a368b34ec736b85d8ad222a3136f778e18558cacbc6c0fb790ea378803","observation_id":"eb8c98d1-afdd-4260-898d-d95aa0930592","resolution":{"observed_at":"2026-08-06T19:43:57.314346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15088","last_updated":"2023-09-26T17:31:57Z","snapshot_observed_at":"2026-07-06T16:23:57.143116Z","submitted_at":"2023-09-26T17:31:57Z","title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15088","snapshot_observed_at":"2026-08-06T19:43:57.458041Z","title":"Pradeep, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.458041Z"},"links":{"cited_paper":"/paper/2309.15088","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:ac65dc229384d52852ff49e462b4ea63c70207fc6950e994efc7284e99c9276c","observation_id":"d1945070-5761-489c-bbe2-2130793a0b70","resolution":{"observed_at":"2026-08-06T19:43:57.458041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:03.142087Z","title":null,"venue":null,"work_id":"9e66d9f5-0689-4201-81bb-b2c7b3de2107","year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.631661Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:f28109fb3ab886fe88bd6ab3c3450e87af420413306bfd0b5cd9be1c91c944b8","observation_id":"a282bceb-d23b-4a4c-96b1-fa4fd54a77d3","resolution":{"observed_at":"2026-08-06T19:44:03.257656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-06T19:43:57.768980Z","title":"Hinton, Distilling the knowledge in a neural network, arXiv preprint arXiv:1503.02531 (2015)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.768980Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:3614a32b79efb6fd42bcb9f21290483df784c96a9b76da63b82e7b3fd6635650","observation_id":"86015c44-2683-4ad1-ba3b-f0772106a0fe","resolution":{"observed_at":"2026-08-06T19:43:57.768980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:02.863354Z","title":null,"venue":null,"work_id":"04128005-ff8e-42c1-9608-27ad8bb3d310","year":2018},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:57.905189Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:d920ed6b937827114bbb8ddaf81e7c5715002c9ea7d529385f0ed6d526f4a53e","observation_id":"27f5b786-80e2-437b-9425-b9b3fd136437","resolution":{"observed_at":"2026-08-06T19:44:02.991282Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:02.505630Z","title":"Reddi, R","venue":null,"work_id":"17eb1fb5-f62c-455e-8de7-46d93c82d592","year":2021},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.008777Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:e1a95e11e3b0dc2d8ec56a176d4b860192705cb83cb815f3b0050403a001ae66","observation_id":"7c49fe2f-f1f3-4400-906a-7757c52f2b28","resolution":{"observed_at":"2026-08-06T19:44:02.677645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01555","last_updated":"2023-11-02T19:16:21Z","snapshot_observed_at":"2026-08-01T19:49:30.116009Z","submitted_at":"2023-11-02T19:16:21Z","title":"Instruction Distillation Makes Large Language Models Efficient Zero-shot Rankers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01555","snapshot_observed_at":"2026-08-06T19:43:58.190242Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.190242Z"},"links":{"cited_paper":"/paper/2311.01555","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:7cce0c2fd91d4dc9f35fe45c18eab9c8eacc6744a1db5b516e9f5f4cbb952634","observation_id":"3d9b0556-e654-4cac-9acc-36075ab5b0f1","resolution":{"observed_at":"2026-08-06T19:43:58.190242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:02.222062Z","title":"Huang, Y.-N","venue":null,"work_id":"68a5faca-b1f5-4a89-8d94-25149eb83c70","year":2024},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.298259Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:8b09026ca5a918d755cb9f9a110a30718430004a0dabd43afe18904d97dd8c5d","observation_id":"057fbc96-0428-4f4f-9d75-b71445b80bc4","resolution":{"observed_at":"2026-08-06T19:44:02.342859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:01.987959Z","title":"Burges, T","venue":null,"work_id":"ee4a9217-6f58-41f6-9100-233c1219d10a","year":2005},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.430499Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:9749bfc30b6d2f66d1f73258083b2e3930cade05dff936447afd125816502d79","observation_id":"b322bc6e-15ec-45c1-94c6-44756b877628","resolution":{"observed_at":"2026-08-06T19:44:02.080507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:01.718136Z","title":null,"venue":null,"work_id":"4cb38c16-5228-4d0a-8878-b9670b289849","year":2010},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.519891Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:1573a047bee1a7b611ca71a2adc2c5de147960976c9d6aa34ffb19bd10f3bd93","observation_id":"0abdca18-0144-4a47-9f9f-fdbe8584e48b","resolution":{"observed_at":"2026-08-06T19:44:01.828405Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:43:58.627719Z","title":"Craswell, Mean Reciprocal Rank, Springer US, Boston, MA, 2009, pp","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.627719Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:d569315c47dac364f077865d462b01cb4f9b18ff184dba2714531c15e837ec6d","observation_id":"30415b3a-1805-4464-814a-79fc98696892","resolution":{"observed_at":"2026-08-06T19:43:58.627719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:01.479784Z","title":"Burges, K","venue":null,"work_id":"0a16d218-ab13-4a71-b045-b5eb9f2910b2","year":2011},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.735744Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:cc23425c7588efc1fa6903e105750775234a153744eeb72972cb0bfe5c60b3fb","observation_id":"b599e5bb-6a22-4d86-86be-d842b669864e","resolution":{"observed_at":"2026-08-06T19:44:01.629285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:01.136938Z","title":null,"venue":null,"work_id":"6af60152-657a-4ba1-a662-a36eef962fb2","year":2018},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.834116Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:0af4b3e35ce36d5c487db06a48f903a3aca77dda0137834eb8d8f984864ef178","observation_id":"6f56238d-1072-4564-b912-db7abe73b392","resolution":{"observed_at":"2026-08-06T19:44:01.291511Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:00.796294Z","title":null,"venue":null,"work_id":"23bedf7d-27a2-45d5-ba0f-d6871235ab6f","year":2005},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:58.966797Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:d3ac0c57f4041bccfe86f5018261ae3706726071ad50a84e1738d1b489200954","observation_id":"0bad2c89-da84-424d-8b60-ef0b5298d1e4","resolution":{"observed_at":"2026-08-06T19:44:00.963149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:44:00.499624Z","title":"Craswell, B","venue":null,"work_id":"88b485d2-32b8-4a6f-8aac-7ec1ec1192a7","year":2021},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.054350Z"},"links":{"citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:7a1ea3762a05a86fd84ec8317bc94f18c96dbcd4cd9ebb5f02a88d1d56c9b24e","observation_id":"8d9a02da-4127-4e62-9275-ea735a4e95c3","resolution":{"observed_at":"2026-08-06T19:44:00.656685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-07-06T09:05:23.015957Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-06T19:43:59.135012Z","title":"Craswell, B","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.135012Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:fe0019778fd79fc7bf31c858f4dd297426db9602b1f6a632d5d882a5e76c9c15","observation_id":"7a4cca7a-be70-41e5-bf97-b75166e7e173","resolution":{"observed_at":"2026-08-06T19:43:59.135012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10403","snapshot_observed_at":"2026-08-06T19:43:59.322180Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.322180Z"},"links":{"cited_paper":"/paper/2305.10403","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:98e1a35182753435bdbae2600349ceb9e3646dac7bc723c07e819b150ad8bc4c","observation_id":"4b883cd2-4832-4dbd-b426-b7dbf9410c59","resolution":{"observed_at":"2026-08-06T19:43:59.322180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-06T19:43:59.504330Z","title":"Achiam, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.504330Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:547c9c5eac3f591ff8d71808b2548e32a9ab685b821ae9d57a55cb6aa222752a","observation_id":"a528a784-95fb-4541-933c-7a30fe90ff10","resolution":{"observed_at":"2026-08-06T19:43:59.504330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T19:43:59.589283Z","title":"Dubey, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.589283Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:eb0d563bab5c6aec8228e7bbc0045fd2acbab231cbd60b3ed5af3689bbf237b5","observation_id":"5d7e2a43-7c66-44ad-bfbb-624a47cb3c04","resolution":{"observed_at":"2026-08-06T19:43:59.589283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-06T19:43:59.667608Z","title":"Touvron, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.667608Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:cf97c7741fcec5bf357eb9ad40874922ad136bf2b908d0e51def96df772cda10","observation_id":"1eec72f6-27f0-42cb-9b9b-d4b5f26afb66","resolution":{"observed_at":"2026-08-06T19:43:59.667608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-08-06T19:43:59.808010Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.808010Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:c57d490efb238899ace134a7b524a9c48b004d82f4c5d211af46d97fbbbceb8c","observation_id":"6a369cea-b2d9-4a35-b8e7-1b27015558b1","resolution":{"observed_at":"2026-08-06T19:43:59.808010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-06T19:43:59.930434Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:59.930434Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:9f02a731de5747e0f739758bc39d126da984ae4a1a5858e6c333fef6d68f7061","observation_id":"4c6fae69-285a-47af-92ce-1b64be7dab40","resolution":{"observed_at":"2026-08-06T19:43:59.930434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02656","last_updated":"2025-03-04T14:17:00Z","snapshot_observed_at":"2026-08-07T17:30:19.524218Z","submitted_at":"2025-03-04T14:17:00Z","title":"Adapting Decoder-Based Language Models for Diverse Encoder Downstream Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02656","snapshot_observed_at":"2026-08-06T19:44:00.007759Z","title":"Suganthan, F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:44:00.007759Z"},"links":{"cited_paper":"/paper/2503.02656","citing_paper":"/paper/2507.04820"},"observation_digest":"sha256:4cc03e9ff213f50c6380c69b36339161a425b2405dd9b65dc7eb12a6a2e9dacd","observation_id":"f693d7e5-8cce-494a-86ec-eee4a2dfeb3a","resolution":{"observed_at":"2026-08-06T19:44:00.007759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.04820","last_updated":"2025-07-07T09:38:43Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T19:36:18.605301Z","submitted_at":"2025-07-07T09:38:43Z","title":"Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":27},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:2507.04820."}