{"as_of":"2026-08-07T19:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6088b5b313899573e15eb12d699774a55b5dcca2d560082b3246ec963d35b4ae","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:13:02.211673Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.00441/citation-record","integrity":"/paper/2506.00441/integrity","json":"/paper/2506.00441/citation-record.json","paper":"/paper/2506.00441"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.0662","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:04.090828Z","title":null,"venue":null,"work_id":"85e0c6a6-25aa-443e-a534-c09dae6f7513","year":2016},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.147089Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:c549488d9e1259cc8239d7628a32947efa3f1692b1efa8a6c9942f6ea77ec62d","observation_id":"6747957d-8254-4454-b20f-c987ce45fb19","resolution":{"observed_at":"2026-08-07T12:13:04.166547Z","resolver_source":"raw_fallback","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"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02737","last_updated":"2025-02-04T21:43:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-04T21:43:16Z","title":"SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02737","snapshot_observed_at":"2026-08-07T12:12:57.239675Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.239675Z"},"links":{"cited_paper":"/paper/2502.02737","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:818cdb892a6042c3eace042beefb429b2ab609b539070d6859c568902f1549fb","observation_id":"b1da7eda-5346-492c-8d2c-baf12cc6686f","resolution":{"observed_at":"2026-08-07T12:12:57.239675Z","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-07T12:12:57.332409Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.332409Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:c205a1d6030770cc7b031607134ed67d29eb3c66f7240cfb7b1e96e6f00d48ec","observation_id":"cb02904d-ca93-47d6-91f2-42c3b80aa01d","resolution":{"observed_at":"2026-08-07T12:12:57.332409Z","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-07T12:12:57.357517Z","title":null,"venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.357517Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:ee471ba2e0a012c2d1be90fe3418dc5b256a4119638ddd2f1fbbefefca17e2d9","observation_id":"0268f881-d1e5-49a1-a2d0-439cad072561","resolution":{"observed_at":"2026-08-07T12:12:57.357517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19534","last_updated":"2024-10-31T14:32:28Z","snapshot_observed_at":"2026-07-06T18:22:18.644161Z","submitted_at":"2024-05-29T21:29:44Z","title":"Preference Learning Algorithms Do Not Learn Preference Rankings","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19534","snapshot_observed_at":"2026-08-07T12:12:57.440131Z","title":"Zhang, Xinyi Chen, Qiuyi Zhang, Rajesh Ranganath, and Kyunghyun Cho","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.440131Z"},"links":{"cited_paper":"/paper/2405.19534","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:5d6dff816c29b2303b0d3144b887890197d7ce0fa31b7f7e7496e233f6882659","observation_id":"d88378b9-0fdc-4369-b25d-db5e88dffb56","resolution":{"observed_at":"2026-08-07T12:12:57.440131Z","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-07T12:12:57.505919Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.505919Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:1fd17a924a624ee1a45631dbac1a91262d5fe362aa472a00d4fe4ff42e9d5a1a","observation_id":"0b2b11e4-fee4-47cf-b014-54498c39c777","resolution":{"observed_at":"2026-08-07T12:12:57.505919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-07-06T18:30:23.849880Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-07T12:12:57.548054Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.548054Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:9692bf288cc638f46a0e10b443a7ca02e2c54c5debc631f199ad8d8ebd605461","observation_id":"6a056e33-371f-4d29-be1d-44dd0b141a0a","resolution":{"observed_at":"2026-08-07T12:12:57.548054Z","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":"10.1145/3698807","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:02.970670Z","title":null,"venue":null,"work_id":"c367d76a-c8a9-43e1-90a5-5146eda15189","year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.628011Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:fa49ba4b81dc1e102a1f4048ffa26d87f912ed8dfba317935be4602ad9a76ba8","observation_id":"69e6ae49-f728-478f-99f5-8124257a05a8","resolution":{"observed_at":"2026-08-07T12:13:03.061809Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01306","last_updated":"2024-11-19T18:12:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-02T10:53:36Z","title":"KTO: Model Alignment as Prospect Theoretic Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01306","snapshot_observed_at":"2026-08-07T12:12:57.703541Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.703541Z"},"links":{"cited_paper":"/paper/2402.01306","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:27acf8723987ca0b1be80baf622107a8f760032e1e05fffe04f91d5ecf98c956","observation_id":"f0e6e8d6-620a-4bb6-85b8-522db040a6d9","resolution":{"observed_at":"2026-08-07T12:12:57.703541Z","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-07T12:12:57.769205Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.769205Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:a456a2667002b3078553e4bdaa96bbf6aedcbd7450ffc65c0900e55e1cc43cde","observation_id":"d0637252-2c5d-45bf-a844-3885d6def638","resolution":{"observed_at":"2026-08-07T12:12:57.769205Z","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-07T12:12:57.860819Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.860819Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:45ed0c77888b4959db12ed23dfa30a4635306555d75169779c070bd52f00e655","observation_id":"ac62b2c4-1859-4227-a6c9-eec66122aa68","resolution":{"observed_at":"2026-08-07T12:12:57.860819Z","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-07T12:13:06.795681Z","title":null,"venue":null,"work_id":"80f7d3ef-13ea-4401-a262-421d1bd660ab","year":2025},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.998104Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:29043bc9da25231074d31b98ae6aa65378bf3985ca4020a1b731b13ae223607a","observation_id":"b4eff45f-4b15-4472-b755-e9421c9309bf","resolution":{"observed_at":"2026-08-07T12:13:06.898134Z","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-07T12:12:58.049070Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.049070Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:20ca52cd0f344fd71e88e1f3d12348e7f579085af948668ba1299f4c5e431e76","observation_id":"d4632426-4fce-4099-848f-64c228dd23c9","resolution":{"observed_at":"2026-08-07T12:12:58.049070Z","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-07T12:12:58.113205Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.113205Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:193d198af2ec10168a1ab628e5ebc78a32f7f2e5cbe2b11de16eabe4e25514c1","observation_id":"ba4134e3-cd79-4e61-97a3-fce17d391a7f","resolution":{"observed_at":"2026-08-07T12:12:58.113205Z","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-07T12:13:06.576781Z","title":null,"venue":null,"work_id":"018a6add-db7b-47bc-87b1-61328a115df9","year":2016},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.175876Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:707b1bee988f45ff096d4d1d65484f65d0cde03ae236eacd38707786489d52fa","observation_id":"c8f472fd-0f84-48f5-a7b0-1feb03b5e48e","resolution":{"observed_at":"2026-08-07T12:13:06.639310Z","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-07T12:12:58.258016Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen - Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.258016Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:d33a00292ed763faecd7b876c595553536bcc6e64e5595e89818869eb5b32fed","observation_id":"56be07a6-f92a-4192-b964-b6712dfead84","resolution":{"observed_at":"2026-08-07T12:12:58.258016Z","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-07T12:13:06.342778Z","title":null,"venue":null,"work_id":"09803367-5c1e-4d0a-a7f8-3c5973272e9d","year":1979},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.310831Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:bb7bc1538c2b80ddd7380a092b4382d09a4e0e94655c45aaafd61044c51f86f7","observation_id":"1eccde09-d480-46a0-870b-a1e07caec483","resolution":{"observed_at":"2026-08-07T12:13:06.478096Z","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-07T12:13:06.033583Z","title":null,"venue":null,"work_id":"fd60d3ce-b005-4c2e-93e8-d3a723a879a9","year":2018},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.356242Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:99d20ed7a197ea56581fa734669bb35a7c383f2c84d4c2e1320f6ed196c6ac5b","observation_id":"1a61f944-0fcd-4d43-a622-5d0c2788ed5b","resolution":{"observed_at":"2026-08-07T12:13:06.188825Z","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-07T12:12:58.464378Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.464378Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:d0f3bade4954160f9d9dd52fedbe1fae498beb9f6643cf0f076975b724a0803f","observation_id":"982ccdd9-bdbf-49c3-9827-13add08c5ae6","resolution":{"observed_at":"2026-08-07T12:12:58.464378Z","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":"10.1613/jair.1.12403","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:02.718308Z","title":"Le and Hady Wirawan Lauw","venue":null,"work_id":"8903e47a-18c1-403f-b4cc-916c2307d8cd","year":2021},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.567326Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:4d7e28ff211688386642bd0327cff3410dc369e0c4899324d9453ba47a45ef2b","observation_id":"90911013-54e3-40b6-bd17-61e331125e41","resolution":{"observed_at":"2026-08-07T12:13:02.803811Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:05.829224Z","title":null,"venue":null,"work_id":"12b65287-5663-45b3-97c7-7bc2d1c3d178","year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.706925Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:40601d4ebb4661adb63f9de8ad431a7977d9c02823f42876e76be5a6e794f38a","observation_id":"998c9961-d7d6-43e9-a6b5-9cacbf4c0e60","resolution":{"observed_at":"2026-08-07T12:13:05.935117Z","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-07T12:12:58.783752Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.783752Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:94c51641e9bcf55c29797047b6293a9ac07b4bc1696366e6e891900c23c192fe","observation_id":"c5f56ede-3990-4c60-bf7c-65a8c2fc241b","resolution":{"observed_at":"2026-08-07T12:12:58.783752Z","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-07T12:13:05.572947Z","title":null,"venue":null,"work_id":"b702ef5a-5c1d-46a7-98e0-40721add8524","year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.925039Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:ec0927d3f501adff3312690cde01fedb7a7b3f1a0b9fe28807bd810fa625bec4","observation_id":"0d5ddef5-04c3-4e0d-be93-ee1660848d5e","resolution":{"observed_at":"2026-08-07T12:13:05.667936Z","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-07T12:12:59.031157Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.031157Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:d66c164d198b6789d52c067cdb8ed1727d1bee2e6b611c9c6498563af9b653dd","observation_id":"0b62a9ca-db0b-404c-9beb-7ea78c33086f","resolution":{"observed_at":"2026-08-07T12:12:59.031157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14734","last_updated":"2024-11-01T20:05:19Z","snapshot_observed_at":"2026-08-03T02:02:15.325394Z","submitted_at":"2024-05-23T16:01:46Z","title":"SimPO: Simple Preference Optimization with a Reference-Free Reward","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14734","snapshot_observed_at":"2026-08-07T12:12:59.152851Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.152851Z"},"links":{"cited_paper":"/paper/2405.14734","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:0b51784c58831d0286c6b9e1befe8818a02f55c42d8c6769a46ea3cb79424d04","observation_id":"3dd5bdc4-8a04-4b06-b302-602038d8cdcf","resolution":{"observed_at":"2026-08-07T12:12:59.152851Z","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-07T12:13:05.376803Z","title":null,"venue":null,"work_id":"b11f7762-688f-49a0-b83e-071ad1098a80","year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.288129Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:53287d4e2acb8c21419d801ee7c23ca694c905e49ca4d2470c42c142bcac2f7d","observation_id":"0dc2bf76-bd60-4765-922b-c2404ac3102c","resolution":{"observed_at":"2026-08-07T12:13:05.475963Z","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-07T12:13:05.167558Z","title":null,"venue":null,"work_id":"3774633e-4b35-4cb5-a29d-6ad073d0ebca","year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.441708Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:25089c1c9fd4656d5632daf86727778e90066134ac1bd517dbade3a447ebe558","observation_id":"dfaf7c5b-c87e-437e-b63b-eb53c5ea7013","resolution":{"observed_at":"2026-08-07T12:13:05.280467Z","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-07T12:12:59.634314Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.634314Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:a6880732e2aefad78f19a98d2dffc4b144e939f8d84f18c389cbc5aef7e65766","observation_id":"0f064311-d790-4140-b9f0-b84a1e7103a9","resolution":{"observed_at":"2026-08-07T12:12:59.634314Z","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-07T12:12:59.817066Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.817066Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:4a399df386ecf82431642bab88a30e56c0ca67c469e122719b3898bd3ab674c9","observation_id":"9ea9cb70-e624-4e0b-8941-f9272c1afd9c","resolution":{"observed_at":"2026-08-07T12:12:59.817066Z","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-07T12:12:59.970536Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:59.970536Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:ace5b68acae0fd5ccf6255ef62b85f4075aeaf1a56788e0c830bb7abe670afea","observation_id":"d3203a5a-132d-4f79-a6ea-807cdd54f82c","resolution":{"observed_at":"2026-08-07T12:12:59.970536Z","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-07T12:13:00.098529Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.098529Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:07e01c29069f0be492935f164db9521a540322270135fac33f3175a77535be25","observation_id":"2967ea5b-0217-49d0-8c32-73d8da19cabc","resolution":{"observed_at":"2026-08-07T12:13:00.098529Z","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-07T12:13:00.202242Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.202242Z"},"links":{"cited_paper":"/paper/2309.15088","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:7f6d8f3c739ee74d2ac013f867f5a5095b8d1a6fb6c0a3c49cb4e44051351e6f","observation_id":"a525791f-d6d6-41d0-9adc-5f3110f0c511","resolution":{"observed_at":"2026-08-07T12:13:00.202242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-07-06T16:57:09.664139Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02724","snapshot_observed_at":"2026-08-07T12:13:00.336071Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.336071Z"},"links":{"cited_paper":"/paper/2312.02724","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:3210d5f54325d8347fde8e0646a3358e7d51aa77f363bab665179609a7b84101","observation_id":"224315e9-17d0-44f3-a1fb-62cba23264ca","resolution":{"observed_at":"2026-08-07T12:13:00.336071Z","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-07T12:13:00.477224Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.477224Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:2b87c1b125e8a5fdb65d430e05b06d6c296b60a3c5bd82297ad570dab9b0efb1","observation_id":"7aa4aa1d-7381-4ac4-af60-e3317a9e3714","resolution":{"observed_at":"2026-08-07T12:13:00.477224Z","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-07T12:13:04.946903Z","title":"Manning, Stefano Ermon, and Chelsea Finn","venue":null,"work_id":"ea6f3427-2232-483e-b3d3-4c050e948fbb","year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.674637Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:61e513840546f7642fb44cea6985649861f54c1cbaa69913d5b55b8551cad378","observation_id":"3c12c019-91b5-4572-aa2c-b0f871e51475","resolution":{"observed_at":"2026-08-07T12:13:05.028277Z","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":"2206.06588","last_updated":"2022-06-14T04:25:26Z","snapshot_observed_at":"2026-07-06T13:20:29.949578Z","submitted_at":"2022-06-14T04:25:26Z","title":"Shopping Queries Dataset: A Large-Scale ESCI Benchmark for Improving Product Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06588","snapshot_observed_at":"2026-08-07T12:13:00.775447Z","title":"Reddy, Llu \\' s M \\` a rquez, Fran Valero, Nikhil Rao, Hugo Zaragoza, Sambaran Bandyopadhyay, Arnab Biswas, Anlu Xing, and Karthik Subbian","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.775447Z"},"links":{"cited_paper":"/paper/2206.06588","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:89bfbc32793f583558675c0bff20ccefcbc5bc13f12dbf1118c87e63af0a75df","observation_id":"a1f478d7-6554-4617-8764-a9777f71991b","resolution":{"observed_at":"2026-08-07T12:13:00.775447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03744","last_updated":"2023-11-08T20:06:28Z","snapshot_observed_at":"2026-07-06T15:51:35.559366Z","submitted_at":"2023-07-07T17:53:07Z","title":"Comparing Traditional and LLM-based Search for Consumer Choice: A Randomized Experiment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.03744","snapshot_observed_at":"2026-08-07T12:13:00.886166Z","title":"Rothschild, Daniel G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.886166Z"},"links":{"cited_paper":"/paper/2307.03744","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:23fc053b3f2b44aa77653a9fb585296fcaed10ff0e5d738ece399d35f663fa7c","observation_id":"7b691962-91b2-49cc-ae68-b99f3aed0ce0","resolution":{"observed_at":"2026-08-07T12:13:00.886166Z","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-07T12:13:01.055521Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.055521Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:79681272cfb349898d91ff269cff5de1dca9f819ba32ea3cf6ef98ba86be74d4","observation_id":"74c5b0bb-19b8-41ae-97b6-014ae470edc9","resolution":{"observed_at":"2026-08-07T12:13:01.055521Z","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-07T12:13:04.778316Z","title":null,"venue":null,"work_id":"7e513064-529c-495d-8b20-7d1ae283c9b7","year":2018},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.211754Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:f6cb321f98d4d73d314906c5044f89d23508b75d908cf7d8fb4fd1705b6e6fac","observation_id":"4ce1ae27-a046-41cd-811e-a31182ba5000","resolution":{"observed_at":"2026-08-07T12:13:04.848707Z","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-07T12:13:01.294280Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.294280Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:d316824b034c1fde29359d0f21c52a6d52f1e8d0442803e2270fb76b77a9ee0f","observation_id":"05131a31-7a5f-4b39-9adf-aeff48b5c3d8","resolution":{"observed_at":"2026-08-07T12:13:01.294280Z","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-07T12:13:04.574834Z","title":null,"venue":null,"work_id":"c35d42d9-259b-4393-b30d-30d8d209b70c","year":1992},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.392983Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:cf61b6baffffa9c722b3a4463ec00268bd93f41662677b358a1187041281f702","observation_id":"7e41eb0d-0fc2-4600-af18-1e1e7fe79367","resolution":{"observed_at":"2026-08-07T12:13:04.674034Z","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-07T12:13:01.545476Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.545476Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:1ef92591bc8105cba1ada9c2dd79e1cd658feaa63a2818f78029767cb854e53e","observation_id":"8fc3d63c-cf8d-4044-8fa2-82c95de9aca3","resolution":{"observed_at":"2026-08-07T12:13:01.545476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02614","last_updated":"2025-05-31T03:25:45Z","snapshot_observed_at":"2026-08-07T17:30:26.371281Z","submitted_at":"2025-03-04T13:34:19Z","title":"Personalized Generation In Large Model Era: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02614","snapshot_observed_at":"2026-08-07T12:13:01.673424Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.673424Z"},"links":{"cited_paper":"/paper/2503.02614","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:1ffa7ee7220966fff170774af3d27701294e05912248634e0442470647e381e2","observation_id":"e8d560a1-b945-4491-a17c-8197144e0463","resolution":{"observed_at":"2026-08-07T12:13:01.673424Z","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-07T12:13:04.452859Z","title":null,"venue":null,"work_id":"3cd45fd0-688a-4e29-9186-de1f7a60bca3","year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.823654Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:59f8444a7af18dbaf441aeb981dd7f9708fd047127603b5921b258c1fd12110d","observation_id":"d12f03a0-27e3-4d1d-97ec-8933341b6a8f","resolution":{"observed_at":"2026-08-07T12:13:04.508193Z","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":"10.18653/v1/2024.acl-long.125","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:02.335830Z","title":null,"venue":null,"work_id":"11fe3e5a-ea82-4f94-89b3-1c614bf7340c","year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:01.928537Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:ede0bf3e39dffb7dce114d2be2747893c1b1b5501c6340ac26d993691128aea7","observation_id":"809c111e-3513-4621-af26-21bde4417f0c","resolution":{"observed_at":"2026-08-07T12:13:02.461688Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:04.289036Z","title":null,"venue":null,"work_id":"9bf3bad9-e568-4dd3-a8b2-10dd437b9cab","year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:02.002683Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:ce53646eafc5a0001a5fc37ff4168f89a666610b545d55eb9e837cd4175efd9f","observation_id":"ece40e27-ea96-4d54-afd5-d3319498da4d","resolution":{"observed_at":"2026-08-07T12:13:04.363499Z","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":"2311.02089","last_updated":"2023-10-25T06:23:48Z","snapshot_observed_at":"2026-08-01T15:07:27.003536Z","submitted_at":"2023-10-25T06:23:48Z","title":"LlamaRec: Two-Stage Recommendation using Large Language Models for Ranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.02089","snapshot_observed_at":"2026-08-07T12:13:02.052560Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:02.052560Z"},"links":{"cited_paper":"/paper/2311.02089","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:75df2f52e0b1a359b0f2950e9a96ddff465d61f14159b92a2e2c80a30386e00a","observation_id":"a391f264-5264-4afb-a9cc-0d41b68a7e7c","resolution":{"observed_at":"2026-08-07T12:13:02.052560Z","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-07T12:13:02.100774Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:02.100774Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:aeff583e0326a7cdf543cb425b48a0b9cef36e15061e38023bdb622e947b370b","observation_id":"1d5a81bf-9117-4643-8c37-0a177fb45dfe","resolution":{"observed_at":"2026-08-07T12:13:02.100774Z","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-07T12:13:02.137094Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:02.137094Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:690a9e9a6d92ea2b2672f25920dd01da8ad80a367a665033bae49b391abf4b93","observation_id":"5c4ea31d-6666-462c-a157-6579d9e0724f","resolution":{"observed_at":"2026-08-07T12:13:02.137094Z","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-07T12:13:02.211673Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:02.211673Z"},"links":{"citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:776c983dde36f0fd40c332d90e8a91cc8db807484935fa055c4ee8aa44411b2b","observation_id":"04ebc3a1-1207-4705-b6b4-f554dd16e152","resolution":{"observed_at":"2026-08-07T12:13:02.211673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T12:02:49.537916Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":4,"verified_fuzzy":1},"total_outbound_references":50},"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 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.00441."}