{"as_of":"2026-08-09T15:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13da8f0f069f763bddc3c23357071424fc5f2489a262575e0108aa7e02abba17","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:49:14.854778Z","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-08-07T17:54:16.806953Z","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-07T23:49:14.854778Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.08767","last_updated":"2025-05-26T01:07:58Z","snapshot_observed_at":"2026-08-09T01:41:22.532098Z","submitted_at":"2025-02-12T20:13:56Z","title":"SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-07T23:49:14.854778Z"},"links":{"cited_paper":"/paper/2502.16852","citing_paper":"/paper/2502.08767"},"observation_digest":"sha256:dd9edeb5e54296054a56145fae30101626074766c6955eda27b08343bf69cbc2","observation_id":"46aa73ec-3aab-4942-ba24-86c20a2b6047","resolution":{"observed_at":"2026-08-07T23:49:14.854778Z","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-08-07T17:54:16.806953Z","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-07T16:01:39.307745Z","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:20ce0461fe0ddcc902f346ab26f22fabee5a3a0ae431a59b2f18f07985c53ccd","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-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.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-08-07T17:54:16.806953Z","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:7f6eb9fc3474096f387a5dde63390173c0a8aa9a0c257b2db9edd83816ea313d","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-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.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-08-07T17:54:16.806953Z","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-06T07:38:24.259000Z","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:f216df9ea289a0264d48beaaee13209d37c67112a1b82cff947d6abacd927162","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-08-07T17:54:16.806953Z","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-08T01:13:19.346639Z","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:ffdc4ac0d0feb61863d3fcb52a4eddcd257a5679c8fde097cc6a2c09a891a7c0","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-08-07T17:54:16.806953Z","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:57189811dccaacb673d216e0a468d67ba6d485776daaee32e2b3ecef5910f0c1","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-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.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-08-07T17:54:16.806953Z","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:ce77e12cdbbfd6a7b09377a3fa683a8b109bfa30c148ffdff90bea10a4f7db3f","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-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.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-08-07T17:54:16.806953Z","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:68336c92f6bb8312d6449bdf08fcd50378917392d0f3ed0167b499e5480af77a","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-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.16852","last_updated":"2025-02-24T05:24:52Z","snapshot_observed_at":"2026-08-07T17:54:16.806953Z","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-07T13:04:16.701334Z","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:06339163e665e4cf4fba910d46b83ccc7317531d8c300826c0190fb167f7e338","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-08-07T17:54:16.806953Z","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-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 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2502.16852."}