{"as_of":"2026-08-09T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0c864681ecea6ce62c2f2d83bc8d907c32beecf999c34c5a9f6414f49ea72ff","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-09T06:31:02.800959+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-08T10:21:23.821082Z","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:85f17eee38d045bf1a3bb55c0f3a70e46895bca96a284c7dabdade3d13619645","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:093d86164cd536f5e8141009d375e61cf8e4ed634c86a9fc93b272c7c042cae1","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-08T10:21:23.821082Z","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:cf36572c416c8ee163862054b39a598f50fc37f55405976d356d22370df2d370","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-08T10:21:23.821082Z","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:a873c150d1e5b9175bc8a60233ba6c0253f75e0b5ff120ed6bb0fe318182c40d","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-08-09T10:42:57.617611Z","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-08T10:21:23.821082Z","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:d2982842be8c7e8c5e5ffde9f6b33ca8c4486c64941aa4449b516dd688e8d245","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-08T10:21:23.821082Z","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:359b02bf1ac873f3cb7f2768c26df2b29cb8d29743a19bf934995f1faf48057d","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-08T10:21:23.821082Z","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:d68683d57bd1c85ebb7331eabcd0e99b8b1d9f5286c56c76beeccf505ee2985e","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-08T10:21:23.821082Z","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:f042c2279048a9229a2a8266a5cbc96f379191452351c24e6e6c1c69f82c0945","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:870939f55a3996f119ca35e82b84230b1ca43c24af0990898178e1cb236b7ffa","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-08T10:21:23.821082Z","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:f5bbdb3d361747826b9ca152ee1fda9e595f42eaea909357ed8ffccd4b7937ca","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-08T10:21:23.821082Z","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:67b267f659d2b266acfc3c5f3771e41dc19b53c2a1a26fa0799e846e36962e02","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-08T10:21:23.821082Z","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:b49218ee8ecb179fe76a099999e62b85c43bacae346eae5d3772eca73e45dbac","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:9cbee6e996281fb8e820b5ce30d27160a1ab103f90114fb37358b216d3dfde40","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-08T10:21:23.821082Z","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:8d7ce12b3e846b2035254b5f23606c58130e5cec1a35a65537d6ce0eb405e619","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-08T10:21:23.821082Z","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:2935c02dbb369ff929075a6af59470a447190512a03e207392e8c3d40142aa40","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:e107898feb079609bbf5b9d6455bbbfb1c471ccaf5f2291d453cee9aa6cbfedb","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-08T10:21:23.821082Z","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:bb1f7e36450b0da03af7b27a5cbd88a33508fa349f4843e3d3936131bb93cd31","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:7167b9a33f65e0918877f004111080a36b19280a756c7d609c9da0d9621ef6e9","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:03c8f523fd1c55547ea7a8174107ec3e89f75580637628cd928a5380e755550e","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-08T10:21:23.821082Z","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:a113431b30a7c261c9eba42dc4d683ef2ce43af209bdfa0ac578df27818a6b57","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:c3cde99151c1e77dd0160ebc975f1904bf00368945b57e96e323dee6d2eee7c9","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:6f90fe97c4c6d6e6bbcb47f6075d7e625eac5ca4cdf64e8f1965feea4319c60c","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-08T10:21:23.821082Z","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:5bdb85e3f1d49ab569fa7d092fd9fc18ec409c4ae47b118fb3a4d66771221905","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:52213ba6dfd309b446d118d54bfacd17d27bfda4419b2b527df70f7b929974ba","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-08T10:21:23.821082Z","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:ebb9c9d2f42c3acfc203eb14518241e1db0176f626aafe462a69e52badfa8513","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-08T10:21:23.821082Z","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:4a2ea93a3bce3d850eef5c12dacd5306480d05436d02bcb1bf5c5b5c9fbfc30c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:00399d1ea163fbe2902c356ec98c256cfd36c4262c07ecbb61428e9dbe6b8e13","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:847552023792fd82aec1320f54c2173a339bf40f7bc6acefb1575aba5a0ca402","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-08T10:21:23.821082Z","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:01c600a2effcf7a11e04d4718d9d41338033d8992a37126d64ad9ffae9b2ef95","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-08T10:21:23.821082Z","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:3a6f616518924630d053657c199c0ef1d1979800f130d83d5272ee0976103542","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-08T10:21:23.821082Z","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:0ac9a6f66760e43872cd5e7f35b06d6efc9cd53d2cff3150553e1632df7d972f","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-08T10:21:23.821082Z","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:aae7809177ad281b97cd477df2eb1b28759dec2551fef457240a2332822538f3","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-08-09T14:11:36.092661Z","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-08T10:21:23.821082Z","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:c0cf4f1ab14ac2a939ab9b82699439aeeb64c4e7cebe256ade1bf22180edfe0a","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-08T10:21:23.821082Z","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:930b8a8fbe1da8c2bed2f34b52e6a859ad52abba319535020e3be466f9ae0725","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-08T10:21:23.821082Z","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:ca3842f970605039e61f2619aeb2243ff6d0207fe168d1bf4ffc25765d82f9d6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:cbbc3ae4cf5a0b6d8f97a8283e46c1783f55591d8e782a2b4054204e01f94fee","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-08-08T07:13:16.297536Z","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-08T10:21:23.821082Z","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:c9b82b217bf1fce93e2a38069e548a6513893c948edc98a20017a8a57b4bbca5","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-08T10:21:23.821082Z","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:7d4943e5d3fa5cd0e6d2eb98404bb881208316dd7d86fc76b4d6938a40321f91","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-08T10:21:23.821082Z","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:5cf0d7b548b8e111336ab70ff3d73c324639c085d68eb5a8afb385d175386439","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:e4a170a939578176391ff7f59192f52d5249b989b63aed84734576fb204753c3","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-08T10:21:23.821082Z","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:97455d0fb5d765d70220f078216e29b172e65f86afa4fbe53775892a1f3bc6b2","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:15963da321c771e4eac265eabdbc34f363148b387f639bbcec0ad05aca6fa243","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-08T10:21:23.821082Z","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:e1a73c98f28342b943f1361dbc9724fb735f4ba386979a394ba3a1baa2919524","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-08T10:21:23.821082Z","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:2e556957699bdd5c048a8bc26a0e8401e025d627232433a323cdd2cc5213e2de","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:b03d58018fca4bd2d9eeb4f50e733666a530bea159f435b72a23922c84f5e182","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:405a656c5c55944caa99aedd3b80d591278aada2de03243d1231457be159fd23","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T10:21:23.821082Z","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:21d76f7fdd01987fa43dba0f2a41af0e9010322ae8beeebb916e2076cbea0eb7","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-08T10:21:23.821082Z","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:40e57467572a08229656e76ef1dd2f954c1a2a9d39a9c3861a0f710b2c8038db","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-08T10:21:23.821082Z","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:dd0f89c813f575b1f30ac08bba26c2c071d55a4ab2223ffe3608a02afb349637","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-08T10:21:23.821082Z","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:f0a27138e499ac4983b36c3553d69e9aea8c0fd00fa8f81607dfa721fa6c4d3b","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-08T10:21:23.821082Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.00441."}