{"as_of":"2026-08-11T06:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08c2271ffbc0710f8eb420f0e583b2de298de7e49b10b891399bc1217de398ca","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:46:51.815631Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T21:23:27.413513Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":"2402.01878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yu Meng, Mengzhou Xia, and Danqi Chen","venue":null,"work_id":"bfc560e2-a5b5-4872-9de6-480e87ef1dea","year":2024},"citing_paper":{"arxiv_id":"2408.15339","last_updated":"2026-05-07T20:32:48Z","snapshot_observed_at":"2026-08-06T15:22:00.046544Z","submitted_at":"2024-08-27T18:04:07Z","title":"UNA: A Unified Supervised Framework for Efficient LLM Alignment Across Feedback Types","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T21:22:36.970101Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2408.15339"},"observation_digest":"sha256:c531f1dc78fa89db1516c0c921170ab9c37f0c51d44c6e1b4df900e3b74d1704","observation_id":"2ebd1d91-ecbf-45fb-bfd3-e5688bb9c815","resolution":{"observed_at":"2026-05-23T21:23:27.417555Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-10T14:46:51.815631Z","title":"arXiv preprint arXiv:2402.01878","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15007","last_updated":"2025-01-25T00:59:12Z","snapshot_observed_at":"2026-08-10T17:00:36.765883Z","submitted_at":"2025-01-25T00:59:12Z","title":"Controllable Protein Sequence Generation with LLM Preference Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:46:51.815631Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2501.15007"},"observation_digest":"sha256:eac12dedd868087602cce5a0616d6e439ce1b9efa8be811ff26e544710d5faa8","observation_id":"52f1e475-40f3-437a-a27d-c611f82978de","resolution":{"observed_at":"2026-08-10T14:46:51.815631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":"2402.01878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yu Meng, Mengzhou Xia, and Danqi Chen","venue":null,"work_id":"bfc560e2-a5b5-4872-9de6-480e87ef1dea","year":2024},"citing_paper":{"arxiv_id":"2502.01237","last_updated":"2026-05-08T19:36:24Z","snapshot_observed_at":"2026-08-06T16:27:29.744138Z","submitted_at":"2025-02-03T10:54:14Z","title":"The Differences Between Direct Alignment Algorithms are a Blur","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-23T03:50:03.720389Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2502.01237"},"observation_digest":"sha256:a5d7498acead5535e97fc6af49ee4efb96b93d3797a50995d4b9bda2f9e1d932","observation_id":"17aeefa1-009b-4909-aa4d-091165f021e5","resolution":{"observed_at":"2026-05-23T03:52:29.529197Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-09T04:08:51.724809Z","title":"Lipo: Listwise preference optimization through learning- to-rank","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03699","last_updated":"2025-07-23T21:26:26Z","snapshot_observed_at":"2026-08-10T19:03:46.582009Z","submitted_at":"2025-02-06T01:22:06Z","title":"LLM Alignment as Retriever Optimization: An Information Retrieval Perspective","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T04:08:51.724809Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2502.03699"},"observation_digest":"sha256:ef4504e541067afababb88871ce8a9305ec48aec2c99eed7d31dd5a3387893f9","observation_id":"8b1e524f-e854-4e74-b820-d5a26e47e936","resolution":{"observed_at":"2026-08-09T04:08:51.724809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-09T06:01:13.306315Z","title":"Lipo: Listwise preference optimization through learning-to-rank","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04371","last_updated":"2025-02-05T11:28:11Z","snapshot_observed_at":"2026-08-10T19:48:51.143556Z","submitted_at":"2025-02-05T11:28:11Z","title":"PerPO: Perceptual Preference Optimization via Discriminative Rewarding","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T06:01:13.306315Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2502.04371"},"observation_digest":"sha256:9f820237675ce416b79cb32db4f1b0a8b6daea7d56cb483b84e4a13f28fbc803","observation_id":"f00dd238-8ddf-480e-a080-9759f83a6233","resolution":{"observed_at":"2026-08-09T06:01:13.306315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-07T15:15:18.276005Z","title":"Lipo: Listwise preference optimization through learning-to-rank","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15710","last_updated":"2025-05-21T16:21:29Z","snapshot_observed_at":"2026-08-08T20:58:02.100576Z","submitted_at":"2025-05-21T16:21:29Z","title":"Advancing LLM Safe Alignment with Safety Representation Ranking","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:18.276005Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2505.15710"},"observation_digest":"sha256:b49306604ad197021d38f965db4f36c3e2cdd062b0b7bc8e109a925d92e6daaf","observation_id":"ac0a7142-37ff-468f-868a-eb0e608aa41a","resolution":{"observed_at":"2026-08-07T15:15:18.276005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-07T14:57:28.962243Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16869","last_updated":"2025-05-22T16:24:51Z","snapshot_observed_at":"2026-08-09T02:24:14.170168Z","submitted_at":"2025-05-22T16:24:51Z","title":"MPO: Multilingual Safety Alignment via Reward Gap Optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:57:28.962243Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2505.16869"},"observation_digest":"sha256:0a9dbdac9aee9467acf62a5b17910b11e0d9c628af1677182dbf466ffd2ef6de","observation_id":"6852c46f-e6fb-4d63-972d-aac640c962ee","resolution":{"observed_at":"2026-08-07T14:57:28.962243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-07T13:45:55.816724Z","title":"Liu, and Xuanhui Wang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21061","last_updated":"2025-05-27T11:47:28Z","snapshot_observed_at":"2026-08-10T01:38:24.632537Z","submitted_at":"2025-05-27T11:47:28Z","title":"LPOI: Listwise Preference Optimization for Vision Language Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.816724Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2505.21061"},"observation_digest":"sha256:a765eb103e5cfa42428799169322d68756ec971c1dec7672388cbcabdba88aff","observation_id":"8d7eba4a-3ff9-4c93-ad87-bddebd038360","resolution":{"observed_at":"2026-08-07T13:45:55.816724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-07T12:00:48.923951Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00805","last_updated":"2025-06-01T03:11:00Z","snapshot_observed_at":"2026-08-10T21:22:01.293448Z","submitted_at":"2025-06-01T03:11:00Z","title":"HSCR: Hierarchical Self-Contrastive Rewarding for Aligning Medical Vision Language Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:48.923951Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2506.00805"},"observation_digest":"sha256:c9855322e2435025bd3c17f667a02efdc9f8d9a59f2581614c58fd8e4c09e40c","observation_id":"c104ef4b-df02-4545-b873-a02691f147ea","resolution":{"observed_at":"2026-08-07T12:00:48.923951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-07T10:28:48.212275Z","title":"Lipo: Listwise preference optimization through learning-to-rank.arXiv preprint arXiv:2402.01878, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05260","last_updated":"2025-06-05T17:21:16Z","snapshot_observed_at":"2026-08-09T11:16:28.299508Z","submitted_at":"2025-06-05T17:21:16Z","title":"LeanPO: Lean Preference Optimization for Likelihood Alignment in Video-LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:28:48.212275Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2506.05260"},"observation_digest":"sha256:5759e6caeeb14550fb74a9f794c1c30a0031535fca046dd624cae61f19e7693b","observation_id":"98d5ad29-7c6a-41bb-900b-d36ab5f2d551","resolution":{"observed_at":"2026-08-07T10:28:48.212275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-05T16:13:08.310472Z","title":"Liu, and Xuanhui Wang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18884","last_updated":"2025-08-26T09:59:44Z","snapshot_observed_at":"2026-08-05T16:13:06.922080Z","submitted_at":"2025-08-26T09:59:44Z","title":"HAEPO: History-Aggregated Exploratory Policy Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T16:13:08.310472Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2508.18884"},"observation_digest":"sha256:75438779a9fc28fdafdba7dbfa80ad2e19f4b566d6d22da68e7def6ffe5c3bdf","observation_id":"9bfe8b37-794b-4f8e-8281-d7588622099f","resolution":{"observed_at":"2026-08-05T16:13:08.310472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":"2402.01878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yu Meng, Mengzhou Xia, and Danqi Chen","venue":null,"work_id":"bfc560e2-a5b5-4872-9de6-480e87ef1dea","year":2024},"citing_paper":{"arxiv_id":"2605.04653","last_updated":"2026-05-06T08:59:16Z","snapshot_observed_at":"2026-07-31T19:04:20.539218Z","submitted_at":"2026-05-06T08:59:16Z","title":"Threshold-Guided Optimization for Visual Generative Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-08T17:14:36.632493Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2605.04653"},"observation_digest":"sha256:e74ea05fdf719976c3c3608536b7813924df34b8a900957c9aee1fb4dbe26565","observation_id":"582509b3-ae83-4d8b-ad9a-5603ce94dccc","resolution":{"observed_at":"2026-05-11T17:46:07.941014Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":"2402.01878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yu Meng, Mengzhou Xia, and Danqi Chen","venue":null,"work_id":"bfc560e2-a5b5-4872-9de6-480e87ef1dea","year":2024},"citing_paper":{"arxiv_id":"2605.06987","last_updated":"2026-05-07T22:05:23Z","snapshot_observed_at":"2026-07-31T05:30:22.249144Z","submitted_at":"2026-05-07T22:05:23Z","title":"Response Time Enhances Alignment with Heterogeneous Preferences","version":1},"reference_index":160,"source":"arxiv_source","source_observed_at":"2026-05-11T01:04:26.288913Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2605.06987"},"observation_digest":"sha256:212a3229d8598cb18fee9bed56d059874e4943e37efde372057d2785161d07b3","observation_id":"1838de3e-0a41-455a-b996-f0c3cb00713a","resolution":{"observed_at":"2026-05-11T04:46:00.020414Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-07-12T01:50:59.184754Z","title":"arXiv preprint arXiv:2402.01878 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03530","last_updated":"2026-07-03T17:59:58Z","snapshot_observed_at":"2026-08-04T18:44:44.436706Z","submitted_at":"2026-07-03T17:59:58Z","title":"MentalThink: Shaping Thoughts in Mental SVG World","version":1},"reference_index":231,"source":"arxiv_source","source_observed_at":"2026-07-12T01:50:59.184754Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2607.03530"},"observation_digest":"sha256:46ec5348416f0846b19fbbbd0f73169e3940dc26b4e6630f6aa8a6b75c6ba2a7","observation_id":"c99c18e0-2630-4461-99d9-37a51bcdf627","resolution":{"observed_at":"2026-07-12T01:50:59.184754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-07-11T13:53:36.775836Z","title":"arXiv preprint arXiv:2402.01878 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-11T13:53:36.775836Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:b6d2867e9252fce8f9c97e0e7bc8ccab98432896f08bd255668e3f336f11f517","observation_id":"b3380034-14bd-4832-8393-397a7c40bb0f","resolution":{"observed_at":"2026-07-11T13:53:36.775836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01878","snapshot_observed_at":"2026-08-02T08:40:41.165786Z","title":"arXiv preprint arXiv:2402.01878 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":3},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-02T08:40:41.165786Z"},"links":{"cited_paper":"/paper/2402.01878","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:c1c1caaaa5d546a5c1aa142ce96c6078638c4909e5131e7bcc6aea15d850fa94","observation_id":"910aa229-e412-462f-b930-696349ee7d06","resolution":{"observed_at":"2026-08-02T08:40:41.165786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.01878/citation-record","integrity":"/paper/2402.01878/integrity","json":"/paper/2402.01878/citation-record.json","paper":"/paper/2402.01878"},"outbound":[],"paper":{"arxiv_id":"2402.01878","last_updated":"2025-01-24T19:13:34Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:08:10Z","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2402.01878."}