{"as_of":"2026-08-08T06:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8b3f1d902fc1fb7f67fadd71769fed315632a41023136c97ad3ab9905558214","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:55:20.175303Z","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-18T00:46:56.861091Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"citing_paper":{"arxiv_id":"2304.06767","last_updated":"2023-12-01T14:28:06Z","snapshot_observed_at":"2026-08-07T04:02:54.504761Z","submitted_at":"2023-04-13T18:22:40Z","title":"RAFT: Reward rAnked FineTuning for Generative Foundation Model Alignment","version":4},"reference_index":136,"source":"arxiv_source","source_observed_at":"2026-05-18T00:46:56.664582Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2304.06767"},"observation_digest":"sha256:73c3282e2df0e355ffad15a2f0ead3d260b09acc74dd14c9a004ccf5c0d34bd2","observation_id":"60163b01-834e-4577-85aa-4a58338630d1","resolution":{"observed_at":"2026-05-18T00:46:56.863217Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"citing_paper":{"arxiv_id":"2501.09686","last_updated":"2025-01-23T08:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-16T17:37:58Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","version":3},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-05-15T21:20:59.128986Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2501.09686"},"observation_digest":"sha256:773d8338e96e81b41443c7fe0069ac85c32a29d7731b28343e714036ba9b4303","observation_id":"30583c24-e39b-4dfe-aa0d-406303ddb552","resolution":{"observed_at":"2026-05-15T21:20:59.214159Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-08-07T10:55:20.175303Z","title":"Is reinforcement learning (not) for natural language processing: Benchmarks, baselines, and building blocks for natural language policy optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04302","last_updated":"2025-06-04T14:50:24Z","snapshot_observed_at":"2026-08-08T01:19:21.830190Z","submitted_at":"2025-06-04T14:50:24Z","title":"RedRFT: A Light-Weight Benchmark for Reinforcement Fine-Tuning-Based Red Teaming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:20.175303Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2506.04302"},"observation_digest":"sha256:33322a20b897afca54dcc4a5583da948748d9304d10b8fcbda626881e5c0a1db","observation_id":"4ed6cbbe-99a6-41cd-ae6a-9d427b1592b3","resolution":{"observed_at":"2026-08-07T10:55:20.175303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-08-07T05:40:17.982800Z","title":"Is reinforcement learning (not) for natural language processing: Benchmarks, baselines, and building blocks for natural language policy optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07492","last_updated":"2025-06-09T07:11:01Z","snapshot_observed_at":"2026-08-07T05:29:54.015791Z","submitted_at":"2025-06-09T07:11:01Z","title":"Explicit Preference Optimization: No Need for an Implicit Reward Model","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:40:17.982800Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2506.07492"},"observation_digest":"sha256:ba19c59c7c0173d6633a70add163be4726ec4742510cb312f407606de22d1727","observation_id":"e4315a4d-6138-4a5e-a77a-56c8f4f8748a","resolution":{"observed_at":"2026-08-07T05:40:17.982800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-08-06T14:13:07.092046Z","title":"Is reinforcement learning (not) for natural language processing: Benchmarks, baselines, and building blocks for natural language policy optimization, March 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19672","last_updated":"2025-07-25T20:52:58Z","snapshot_observed_at":"2026-08-07T12:02:14.124506Z","submitted_at":"2025-07-25T20:52:58Z","title":"Alignment and Safety in Large Language Models: Safety Mechanisms, Training Paradigms, and Emerging Challenges","version":1},"reference_index":217,"source":"arxiv_source","source_observed_at":"2026-08-06T14:13:07.092046Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2507.19672"},"observation_digest":"sha256:0156507c28854deb6717e79dc017bf360e22b27cd6c829d75362f69b9618945c","observation_id":"4f5f0ec8-367f-4403-92b0-338e21d2aa72","resolution":{"observed_at":"2026-08-06T14:13:07.092046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"citing_paper":{"arxiv_id":"2603.12510","last_updated":"2026-04-03T20:23:41Z","snapshot_observed_at":"2026-07-06T22:48:53.198077Z","submitted_at":"2026-03-12T22:58:42Z","title":"Red-Teaming Vision-Language-Action Models via Quality Diversity Prompt Generation for Robust Robot Policies","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-15T11:18:36.479092Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2603.12510"},"observation_digest":"sha256:ea2f0c71d76dd38a122561c850bc6e05cf003c2b26e29760f890ab69357c276f","observation_id":"58995126-1e7c-4486-8e9b-dd9328fd994d","resolution":{"observed_at":"2026-05-15T11:19:57.989893Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"citing_paper":{"arxiv_id":"2604.08926","last_updated":"2026-04-10T03:42:16Z","snapshot_observed_at":"2026-07-06T22:57:55.179136Z","submitted_at":"2026-04-10T03:42:16Z","title":"Bridging SFT and RL: Dynamic Policy Optimization for Robust Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T16:49:26.829527Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2604.08926"},"observation_digest":"sha256:6e54fa14f4b188a73b87b4811a9b9b422a0e0f309433e5a147b42eea9b403069","observation_id":"62096ec7-e79e-4dbc-a449-9330c3fc8199","resolution":{"observed_at":"2026-05-11T08:05:59.994873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"citing_paper":{"arxiv_id":"2604.17475","last_updated":"2026-04-19T15:06:30Z","snapshot_observed_at":"2026-07-06T23:04:32.734175Z","submitted_at":"2026-04-19T15:06:30Z","title":"Waking Up Blind: Cold-Start Optimization of Supervision-Free Agentic Trajectories for Grounded Visual Perception","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T05:33:33.589721Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2604.17475"},"observation_digest":"sha256:e223c2ac026269af1041981a0baab9c9b7c0780c438e8af364f829116768ea4c","observation_id":"6935e888-670c-40ab-bb41-51594d2b5b4a","resolution":{"observed_at":"2026-05-10T05:36:01.718759Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":"2210.01241","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2210.01241 , year=","venue":null,"work_id":"34091332-cb3e-4889-864f-83e78bc201a5","year":2022},"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":37,"source":"arxiv_source","source_observed_at":"2026-05-11T01:04:26.288913Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2605.06987"},"observation_digest":"sha256:1f604127ea33519cd881bdfd8c70c4a5ceac54a535667912b69b9b1b34ad8b23","observation_id":"f0a86a7a-ce88-4642-b809-653e5a94be19","resolution":{"observed_at":"2026-05-11T04:45:59.589927Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-07-11T13:53:36.775836Z","title":"arXiv preprint arXiv:2210.01241 , 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":289,"source":"arxiv_source","source_observed_at":"2026-07-11T13:53:36.775836Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:157a4d34643ccd96ad4f6eca55b4aba135656fddda3662fc712607f007872546","observation_id":"a17cbd27-48fa-4f76-94d0-784c84a0ef1f","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":"2210.01241","last_updated":"2023-03-01T01:31:17Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01241","snapshot_observed_at":"2026-08-02T08:41:06.439432Z","title":"arXiv preprint arXiv:2210.01241 , 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":290,"source":"arxiv_source","source_observed_at":"2026-08-02T08:41:06.439432Z"},"links":{"cited_paper":"/paper/2210.01241","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:b2fdb7bc83c7108f2e681bd844ab85843ca32e5ff31406bf3ec1a5b1f4a9300a","observation_id":"7aa3f6ec-309c-4f64-95e9-78ba1ad164c0","resolution":{"observed_at":"2026-08-02T08:41:06.439432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2210.01241/citation-record","integrity":"/paper/2210.01241/integrity","json":"/paper/2210.01241/citation-record.json","paper":"/paper/2210.01241"},"outbound":[],"paper":{"arxiv_id":"2210.01241","last_updated":"2023-03-01T01:31:17Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T21:38:29Z","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2210.01241."}