{"as_of":"2026-08-05T01:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2aff6c1a7d0cabb97b198cb2cf7b2b5b99b46bf8216a4926dd3b3b480b8b4b39","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T14:24:25.789502Z","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-22T19:32:01.290815Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":"2502.16852","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving LLM general preference alignment via optimistic online mirror descent","venue":null,"work_id":"f683d7e0-430b-4748-a7de-fa775b0811aa","year":2025},"citing_paper":{"arxiv_id":"2504.12501","last_updated":"2026-08-03T01:47:58Z","snapshot_observed_at":"2026-08-05T00:27:43.279107Z","submitted_at":"2025-04-16T21:36:46Z","title":"Reinforcement Learning from Human Feedback","version":9},"reference_index":147,"source":"pdf_text","source_observed_at":"2026-05-22T19:27:40.991325Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2504.12501"},"observation_digest":"sha256:f605c079f1bf1021213bd6a789fc555c64837319ee166d5f0ea0ac8f31d1b88e","observation_id":"1bc552a7-eb6f-4ba2-be9c-c225b57e6375","resolution":{"observed_at":"2026-05-22T19:32:01.293338Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":"2502.16852","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving LLM general preference alignment via optimistic online mirror descent","venue":null,"work_id":"f683d7e0-430b-4748-a7de-fa775b0811aa","year":2025},"citing_paper":{"arxiv_id":"2509.23102","last_updated":"2026-04-06T19:14:12Z","snapshot_observed_at":"2026-08-03T06:33:00.420621Z","submitted_at":"2025-09-27T04:18:33Z","title":"Multiplayer Nash Preference Optimization","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-18T13:09:54.433720Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2509.23102"},"observation_digest":"sha256:8c4444dc55dccaece7eb4bd6b6c40dccb3a09db9e583da3aa9078062948f2f31","observation_id":"d8df3fe8-36b7-4734-82a2-68f7d0244696","resolution":{"observed_at":"2026-05-18T13:11:24.022728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-08-03T14:24:25.789502Z","title":"Improving llm general preference alignment via optimistic online mirror descent, 2025 c","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.20806","last_updated":"2026-05-31T13:11:43Z","snapshot_observed_at":"2026-08-03T15:38:47.492714Z","submitted_at":"2025-12-23T22:13:14Z","title":"Safety Alignment of LMs via Non-cooperative Games","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-03T14:24:25.789502Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2512.20806"},"observation_digest":"sha256:3514f2b61867b5d0d35111c5cd282373b66bff5c98b99370091e5def2abffbe7","observation_id":"644bbec5-543a-4555-819a-4c4ca0d16576","resolution":{"observed_at":"2026-08-03T14:24:25.789502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-08-03T05:49:25.670135Z","title":"Improving llm general preference alignment via optimistic online mirror descent.arXiv preprint arXiv:2502.16852,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01357","last_updated":"2026-06-08T05:19:57Z","snapshot_observed_at":"2026-08-03T05:49:22.620202Z","submitted_at":"2026-02-01T17:50:59Z","title":"Your Self-Play Algorithm is Secretly an Adversarial Imitator: Understanding LLM Self-Play through the Lens of Imitation Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T05:49:25.670135Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2602.01357"},"observation_digest":"sha256:76ddfa9e5c6a4611cd186b734b29277c70cc0c6cf9fd1ce3098839696e5b1e79","observation_id":"564865ed-5513-407d-87d0-01759a8b9402","resolution":{"observed_at":"2026-08-03T05:49:25.670135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":"2502.16852","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving LLM general preference alignment via optimistic online mirror descent","venue":null,"work_id":"f683d7e0-430b-4748-a7de-fa775b0811aa","year":2025},"citing_paper":{"arxiv_id":"2605.04494","last_updated":"2026-05-06T04:50:42Z","snapshot_observed_at":"2026-07-31T05:58:54.504742Z","submitted_at":"2026-05-06T04:50:42Z","title":"Towards General Preference Alignment: Diffusion Models at Nash Equilibrium","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-08T16:54:58.732444Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2605.04494"},"observation_digest":"sha256:f8e287d0839ee411f3e0b43dadb606f4073e643cacc006f8b640f4d478bf6413","observation_id":"7a2fc9aa-b845-4e20-82e8-52e78af90a38","resolution":{"observed_at":"2026-05-11T17:56:06.812051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":"2502.16852","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving LLM general preference alignment via optimistic online mirror descent","venue":null,"work_id":"f683d7e0-430b-4748-a7de-fa775b0811aa","year":2025},"citing_paper":{"arxiv_id":"2605.07331","last_updated":"2026-05-08T06:35:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-08T06:35:02Z","title":"Rethinking Importance Sampling in LLM Policy Optimization: A Cumulative Token Perspective","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-11T01:19:58.448344Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2605.07331"},"observation_digest":"sha256:11ae3d6e286a1b08ef499d1194274a8adf111a574f62352632059977e0b43f21","observation_id":"b3a700e2-9e5a-403b-8dac-0574b3b2c91d","resolution":{"observed_at":"2026-05-11T04:30:55.154910Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":"2502.16852","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving LLM general preference alignment via optimistic online mirror descent","venue":null,"work_id":"f683d7e0-430b-4748-a7de-fa775b0811aa","year":2025},"citing_paper":{"arxiv_id":"2605.17342","last_updated":"2026-05-17T09:27:26Z","snapshot_observed_at":"2026-08-02T08:43:29.718077Z","submitted_at":"2026-05-17T09:27:26Z","title":"Transitivity Meets Cyclicity: Explicit Preference Decomposition for Dynamic Large Language Model Alignment","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-05-20T14:26:06.428076Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2605.17342"},"observation_digest":"sha256:bb7d3713c39f2aad9b84064148f2694e0ff2119722bc97545a50241d4f89ff2c","observation_id":"a50f61f9-77eb-403f-b166-1f1aa1d90a84","resolution":{"observed_at":"2026-05-20T14:28:21.277911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16852","snapshot_observed_at":"2026-08-02T02:24:42.953753Z","title":"arXiv preprint arXiv:2502.16852 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14371","last_updated":"2026-07-15T21:17:42Z","snapshot_observed_at":"2026-08-02T02:24:28.392090Z","submitted_at":"2026-07-15T21:17:42Z","title":"Supervised Fine-Tuning vs. In-Context Learning: An Equilibrium Analysis of LLM Personalization under Congestion","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-02T02:24:42.953753Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2607.14371"},"observation_digest":"sha256:a48079b3a2720f23fac6cf79d450e6c254fd7ecea1a61194ce213016540dbf23","observation_id":"c42f0dc0-1a24-4b14-b95b-906cda524044","resolution":{"observed_at":"2026-08-02T02:24:42.953753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.16852/citation-record","integrity":"/paper/2502.16852/integrity","json":"/paper/2502.16852/citation-record.json","paper":"/paper/2502.16852"},"outbound":[],"paper":{"arxiv_id":"2502.16852","last_updated":"2025-02-24T05:24:52Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:41:28.562637Z","submitted_at":"2025-02-24T05:24:52Z","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2502.16852."}