{"as_of":"2026-08-05T07:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7dbf56fe8c220613ebd80d4e043ba46d77515754550d9e73568f959adbfbfa84","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-05T06:32:48.257954+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-04T10:40:58.431783Z","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-15T06:15:06.516739Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-08-04T10:40:58.431783Z","title":"https://arxiv.org/abs/ 2407.00617ICLR 2025 (OpenReview) version available","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.09330","last_updated":"2026-05-31T10:03:39Z","snapshot_observed_at":"2026-08-04T10:40:55.499553Z","submitted_at":"2025-10-10T12:32:43Z","title":"Safety Game: Inference-Time Alignment of Black-Box LLMs via Constrained Optimization","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T10:40:58.431783Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2510.09330"},"observation_digest":"sha256:0dc7eee233571a382c33f224494a90532e97c918f7fb0bf618ebbe775a124b17","observation_id":"78f2aad9-cdc8-4194-835f-960b014972e0","resolution":{"observed_at":"2026-08-04T10:40:58.431783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-08-03T05:49:25.524406Z","title":"Iterative nash policy optimization: Aligning llms with general preferences via no-regret learning.arXiv preprint arXiv:2407.00617,","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":19,"source":"pdf_text","source_observed_at":"2026-08-03T05:49:25.524406Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2602.01357"},"observation_digest":"sha256:35b3cc26b218ace4cfd095eba924dd3089a94e1936cf4f8e9a4d1459c9d5349d","observation_id":"0bea63a5-2892-41ef-8df9-08596b5ac2cb","resolution":{"observed_at":"2026-08-03T05:49:25.524406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-08-03T06:06:24.161428Z","title":"Iterative nash policy optimization: Aligning llms with general preferences via no-regret learning.arXiv preprint arXiv:2407.00617,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02572","last_updated":"2026-06-07T17:10:20Z","snapshot_observed_at":"2026-08-05T00:08:42.424141Z","submitted_at":"2026-01-31T05:45:51Z","title":"Reward Shaping for (Inference-Time) Alignment: A Stackelberg Game Perspective","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T06:06:24.161428Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2602.02572"},"observation_digest":"sha256:d84ea34751a22f927c5462c1594aa39b062d83ad3f1a1703aff8a97e4698cf5f","observation_id":"e3367dc2-ea39-4b96-bdba-d8f844872624","resolution":{"observed_at":"2026-08-03T06:06:24.161428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"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":52,"source":"pdf_text","source_observed_at":"2026-05-08T16:54:58.732444Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.04494"},"observation_digest":"sha256:530159d35a7121d12ce42310fe089dbffa4f69d420ca6f015a1c44ddfaaf99b4","observation_id":"12b22110-0364-4920-8647-55160f8ecb2a","resolution":{"observed_at":"2026-05-11T17:56:06.862801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"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":26,"source":"arxiv_source","source_observed_at":"2026-05-11T01:19:58.448344Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.07331"},"observation_digest":"sha256:73bc651d436faebd6cbcd27a9c0f5967a982b0ce666dae4493b69303fee852fd","observation_id":"3de88b08-e481-495b-9ba6-eb8aae212352","resolution":{"observed_at":"2026-05-11T04:30:55.373741Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"citing_paper":{"arxiv_id":"2605.09363","last_updated":"2026-05-10T06:23:19Z","snapshot_observed_at":"2026-08-03T01:34:15.771125Z","submitted_at":"2026-05-10T06:23:19Z","title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-12T03:46:35.908522Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.09363"},"observation_digest":"sha256:2bb9e140506e53a027fa9a7c1a6a9c4b33cd27311361ceb8388a807bba358909","observation_id":"494ba96e-1b3c-4bb4-8a3a-7784ce071891","resolution":{"observed_at":"2026-05-12T06:56:31.596943Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"citing_paper":{"arxiv_id":"2605.09946","last_updated":"2026-05-12T21:07:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-11T03:50:09Z","title":"Structure from Strategic Interaction & Uncertainty: Risk Sensitive Games for Robust Preference Learning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-12T04:15:24.919355Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.09946"},"observation_digest":"sha256:3bbec2a5f8aea242f06a0428410de1a4661424865d2d307400b6b177da84faa9","observation_id":"4b125e06-5f14-43d4-85bb-79ce9038f6cb","resolution":{"observed_at":"2026-05-12T06:26:26.511794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"citing_paper":{"arxiv_id":"2605.09946","last_updated":"2026-05-12T21:07:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-11T03:50:09Z","title":"Structure from Strategic Interaction & Uncertainty: Risk Sensitive Games for Robust Preference Learning","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-14T22:03:05.102274Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.09946"},"observation_digest":"sha256:41f0fa92d6b637eddf921cb5972605b663606a5212f5be55c73ceab3cbeb41d4","observation_id":"0b3fc829-0a8d-4059-8640-cab73bdfc385","resolution":{"observed_at":"2026-05-14T22:08:05.102397Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","version":4},"cited_work":{"arxiv_id":"2407.00617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.00617 , year=","venue":null,"work_id":"75dac9ac-2891-444a-b2cf-fd9255b113fc","year":2024},"citing_paper":{"arxiv_id":"2605.13875","last_updated":"2026-05-08T06:56:35Z","snapshot_observed_at":"2026-08-02T22:27:33.584660Z","submitted_at":"2026-05-08T06:56:35Z","title":"Common-agency Games for Multi-Objective Test-Time Alignment","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-15T06:14:53.685486Z"},"links":{"cited_paper":"/paper/2407.00617","citing_paper":"/paper/2605.13875"},"observation_digest":"sha256:ffeda38f4553130a5bb142f975cd39f8f0f13b30657f3a8f4142a0c76510455a","observation_id":"fd179071-170e-4843-bc7f-41dad63fcca3","resolution":{"observed_at":"2026-05-15T06:15:06.520722Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.00617/citation-record","integrity":"/paper/2407.00617/integrity","json":"/paper/2407.00617/citation-record.json","paper":"/paper/2407.00617"},"outbound":[],"paper":{"arxiv_id":"2407.00617","last_updated":"2025-03-03T03:41:11Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T13:20:45.016742Z","submitted_at":"2024-06-30T08:00:34Z","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2407.00617."}