{"as_of":"2026-08-05T17:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a19eaddca5bdc89cd39fde9336a9081c9b9c3f6d5091d2f93b9513b524ca53da","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":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":32,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:38:53.871009Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T04:05:55.456269Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2504.13818","last_updated":"2026-04-22T00:26:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-18T17:49:55Z","title":"Not All Rollouts are Useful: Down-Sampling Rollouts in LLM Reinforcement Learning","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T18:46:11.571831Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2504.13818"},"observation_digest":"sha256:9b2e06cdff7ad027b20e6ea504c3805e7fbf1592b1509d5dc6cb75a6ab2fc60e","observation_id":"f3cfd3a9-54be-4a41-b964-576ef5d6a952","resolution":{"observed_at":"2026-05-22T18:46:57.054014Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2505.17086","last_updated":"2026-04-14T00:27:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-20T18:33:03Z","title":"Advancing Multi-Agent RAG Systems with Minimalist Reinforcement Learning","version":4},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-05-22T13:34:27.152447Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2505.17086"},"observation_digest":"sha256:7323b89820934bfa44bcab18a10b1de70dadfe9fe5a68a1a17cc393bdd65bc6d","observation_id":"55773bad-37ca-41b8-a1eb-2acc1865b435","resolution":{"observed_at":"2026-05-22T13:34:53.196041Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2508.20697","last_updated":"2026-08-04T09:31:07Z","snapshot_observed_at":"2026-08-05T16:27:32.889619Z","submitted_at":"2025-08-28T12:07:11Z","title":"Token Buncher: Shielding LLMs from Harmful Reinforcement Learning Fine-Tuning","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-18T20:40:44.496392Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2508.20697"},"observation_digest":"sha256:0b2e814139db51f161199406b96d0eb588fd41d553594b5fcec3ba5d5edacaee","observation_id":"bb2d36c3-c7c9-4a0d-9b02-8641cb2cc399","resolution":{"observed_at":"2026-05-18T20:41:50.456853Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2509.03403","last_updated":"2026-05-15T21:29:46Z","snapshot_observed_at":"2026-07-06T22:23:00.681940Z","submitted_at":"2025-09-03T15:28:51Z","title":"Beyond Correctness: Harmonizing Process and Outcome Rewards through RL Training","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-21T22:38:57.833414Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2509.03403"},"observation_digest":"sha256:4c4d254d85812ea958b3bab23332d1c27ca65c86a910f1f59f46b1beff0e1b39","observation_id":"0c7116e4-8cdc-42c2-9271-48c094d9c972","resolution":{"observed_at":"2026-05-21T22:40:43.244574Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2509.16117","last_updated":"2026-02-16T17:14:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-19T16:09:33Z","title":"DiffusionNFT: Online Diffusion Reinforcement with Forward Process","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-13T16:54:30.953199Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2509.16117"},"observation_digest":"sha256:98bd6f5033d2109945e60ae72bb5f2d09b125aaba73a6e6aa01665689d15b692","observation_id":"3a903c09-9f27-48b5-996a-8758fa183abe","resolution":{"observed_at":"2026-05-13T16:54:30.986262Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-04T11:38:53.871009Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04019","last_updated":"2026-07-23T05:31:21Z","snapshot_observed_at":"2026-08-04T11:38:49.212104Z","submitted_at":"2025-10-05T03:53:16Z","title":"Simple Policy Gradients for Reasoning with Diffusion Language Models","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T11:38:53.871009Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2510.04019"},"observation_digest":"sha256:ed3ac053405d9cf4ab919d5494097a9f2aaeffe84c41b79a2fa6e60042535ce5","observation_id":"9bb53df9-d8d6-4975-bdc3-ab161ec4c708","resolution":{"observed_at":"2026-08-04T11:38:53.871009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-04T08:49:34.587109Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.18874","last_updated":"2026-06-26T02:22:44Z","snapshot_observed_at":"2026-08-04T15:02:09.340673Z","submitted_at":"2025-10-21T17:59:41Z","title":"Retaining by Doing: The Role of On-Policy Data in Mitigating Forgetting","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T08:49:34.587109Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2510.18874"},"observation_digest":"sha256:8315c1f47a9fbc6a299c286996311b9d7c5b8010897b69419bb892ab5a7ca90a","observation_id":"3d40d08e-cbcd-4cba-a805-8b25870ed109","resolution":{"observed_at":"2026-08-04T08:49:34.587109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-03T23:33:50.580515Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.05385","last_updated":"2026-07-23T06:36:18Z","snapshot_observed_at":"2026-08-04T04:34:49.292424Z","submitted_at":"2025-11-07T16:08:34Z","title":"TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T23:33:50.580515Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2511.05385"},"observation_digest":"sha256:e9e69bc193821bc97e92435d81f8f2c513e956b8cd8bddb0500b19480c1978d8","observation_id":"e2e87cb3-0435-455e-8590-bda005b55f76","resolution":{"observed_at":"2026-08-03T23:33:50.580515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2604.26326","last_updated":"2026-05-10T00:50:42Z","snapshot_observed_at":"2026-07-06T23:12:01.813588Z","submitted_at":"2026-04-29T06:16:33Z","title":"Addressing Performance Saturation for LLM RL via Precise Entropy Curve Control","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-07T13:34:06.461850Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2604.26326"},"observation_digest":"sha256:5933a0903e928640951d6d68ccedafeed37a9d680a6e4a73b5bb3fd71ff37919","observation_id":"acc3680d-d292-4990-a7da-29ed62b2cacd","resolution":{"observed_at":"2026-05-12T08:51:25.636355Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2604.26326","last_updated":"2026-05-10T00:50:42Z","snapshot_observed_at":"2026-07-06T23:12:01.813588Z","submitted_at":"2026-04-29T06:16:33Z","title":"Addressing Performance Saturation for LLM RL via Precise Entropy Curve Control","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-12T01:56:51.940356Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2604.26326"},"observation_digest":"sha256:66b9ce41c00ee9050c3de529f591670faa2e7cbbf871e27e8236f37ac214372c","observation_id":"73b77fc9-59fc-469e-91af-c9034311ff2f","resolution":{"observed_at":"2026-05-12T07:46:32.380758Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2604.28005","last_updated":"2026-05-15T18:39:07Z","snapshot_observed_at":"2026-07-06T23:13:20.516759Z","submitted_at":"2026-04-30T15:27:34Z","title":"Kernelized Advantage Estimation: From Nonparametric Statistics to LLM Reasoning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T07:00:32.206081Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2604.28005"},"observation_digest":"sha256:939ef055745797de81d47e79a447eedd62318156ccc37f66baab7ae73827392a","observation_id":"1755dd5f-1fb3-48ea-8ae5-caa2491a1599","resolution":{"observed_at":"2026-05-12T10:11:28.859103Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2604.28005","last_updated":"2026-05-15T18:39:07Z","snapshot_observed_at":"2026-07-06T23:13:20.516759Z","submitted_at":"2026-04-30T15:27:34Z","title":"Kernelized Advantage Estimation: From Nonparametric Statistics to LLM Reasoning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-20T23:47:53.282259Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2604.28005"},"observation_digest":"sha256:0c8e130d21ce5b18cab5e950e63e53d99cbfcd21fd34b75a67296e89aa40652f","observation_id":"630449dd-b80d-4aa3-a288-bfdc3eeaca58","resolution":{"observed_at":"2026-05-20T23:49:14.948536Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.00347","last_updated":"2026-05-01T02:05:56Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T02:05:56Z","title":"Odysseus: Scaling VLMs to 100+ Turn Decision-Making in Games via Reinforcement Learning","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-09T20:22:58.061772Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.00347"},"observation_digest":"sha256:652b55953be9c955335a3fdbf49cc77f602ab1f151e2f6b9b258858d5aea2361","observation_id":"4e3f625f-f911-47dc-913c-9b7283007d79","resolution":{"observed_at":"2026-05-11T15:16:09.087260Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.05965","last_updated":"2026-05-07T10:11:51Z","snapshot_observed_at":"2026-07-06T23:18:31.432422Z","submitted_at":"2026-05-07T10:11:51Z","title":"Beyond Uniform Credit Assignment: Selective Eligibility Traces for RLVR","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-09T15:39:54.001327Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.05965"},"observation_digest":"sha256:fec6443158ab8d4629ca6465c7856a33adde1600bb1c25ff0b17504183254008","observation_id":"27f16019-f5ab-482c-a3c3-229879c8f308","resolution":{"observed_at":"2026-05-11T16:36:10.409003Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.06755","last_updated":"2026-05-07T16:20:13Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-07T16:20:13Z","title":"Gradient Extrapolation-Based Policy Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-11T02:07:08.792030Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.06755"},"observation_digest":"sha256:48e2eb0953083d8b9181196c294a37eab42579713fe7a76ded9a7fab001c8e9e","observation_id":"8904c37e-bae8-43f4-b1f4-e6b1b9576a75","resolution":{"observed_at":"2026-05-11T03:55:56.827682Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.07244","last_updated":"2026-05-08T05:01:40Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T05:01:40Z","title":"Experience Sharing in Mutual Reinforcement Learning for Heterogeneous Language Models","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-05-11T02:02:41.411795Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.07244"},"observation_digest":"sha256:281674ef3ee24019d5101d2e7c523dd5d41412b9e9e0a1635f921b3682646eca","observation_id":"ac7f4f7a-08a9-4ae7-9c10-ac45239fb51b","resolution":{"observed_at":"2026-05-11T04:00:55.092691Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.11505","last_updated":"2026-05-13T06:41:19Z","snapshot_observed_at":"2026-07-06T23:23:21.034839Z","submitted_at":"2026-05-12T04:25:41Z","title":"Selective Off-Policy Reference Tuning with Plan Guidance","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T01:28:18.615371Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.11505"},"observation_digest":"sha256:827fbd2f1ba42ef1986eccef6ef3653868dc62b89c4b677aba042a2b41ab5a7d","observation_id":"cffefd4d-5467-42c3-b666-e5c677216762","resolution":{"observed_at":"2026-05-13T01:47:05.243802Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.11505","last_updated":"2026-05-13T06:41:19Z","snapshot_observed_at":"2026-07-06T23:23:21.034839Z","submitted_at":"2026-05-12T04:25:41Z","title":"Selective Off-Policy Reference Tuning with Plan Guidance","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-14T21:20:24.066520Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.11505"},"observation_digest":"sha256:38c95d0cdc4225bbf1d731184d3a9b40144c9746c718f88eb5b170801299bbd1","observation_id":"04ef7fec-55a2-469b-b11e-13f85b769347","resolution":{"observed_at":"2026-05-14T21:22:59.403633Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.11726","last_updated":"2026-05-13T15:38:02Z","snapshot_observed_at":"2026-07-06T23:23:30.499023Z","submitted_at":"2026-05-12T08:09:42Z","title":"Block-R1: Rethinking the Role of Block Size in Multi-domain Reinforcement Learning for Diffusion Large Language Models","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-13T07:03:00.503644Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.11726"},"observation_digest":"sha256:fd2b32bb73b028052ce8dbc8caa22501991fa34173c1cf311e06765a4d2b015d","observation_id":"6d45c1f7-88b7-4b72-9a5e-75ef342eb4fc","resolution":{"observed_at":"2026-05-13T07:07:28.062118Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.11726","last_updated":"2026-05-13T15:38:02Z","snapshot_observed_at":"2026-07-06T23:23:30.499023Z","submitted_at":"2026-05-12T08:09:42Z","title":"Block-R1: Rethinking the Role of Block Size in Multi-domain Reinforcement Learning for Diffusion Large Language Models","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-14T21:06:01.667173Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.11726"},"observation_digest":"sha256:a8875dfa787b8beb42dd33e1d72126d1176ec5ca1926d571ff8731b2e626f45d","observation_id":"f3cd6cc3-8198-42f8-b0c1-5d701390201b","resolution":{"observed_at":"2026-05-14T21:19:28.199683Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2605.20865","last_updated":"2026-05-20T08:01:01Z","snapshot_observed_at":"2026-08-03T17:48:27.538608Z","submitted_at":"2026-05-20T08:01:01Z","title":"Multi-Step Likelihood-Ratio Correction for Reinforcement Learning with Verifiable Rewards","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T05:55:45.654673Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2605.20865"},"observation_digest":"sha256:cabf32bbc1533a7ce9961a32a854e94e85465ad0916be169e1e2c77a82ecfaf5","observation_id":"fd58e815-33b8-4c2b-a799-7d7328ae7e9f","resolution":{"observed_at":"2026-05-21T05:59:41.063061Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.00257","last_updated":"2026-05-29T18:42:06Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T18:42:06Z","title":"ARCA: Adapter-Residual Credit Assignment When Token Signals Degenerate","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T22:54:53.415067Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.00257"},"observation_digest":"sha256:2aa414d6365faa695016a32f4e8c037aeeba36b11bc7a3b05e9fd2f309fc9ad3","observation_id":"0aee1525-3fe3-446e-a08f-0a4820de4161","resolution":{"observed_at":"2026-07-01T19:16:00.804526Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.02812","last_updated":"2026-06-01T19:30:07Z","snapshot_observed_at":"2026-07-06T23:43:07.940839Z","submitted_at":"2026-06-01T19:30:07Z","title":"Traj-Evolve: A Self-Evolving Multi-Agent System for Patient Trajectory Modeling in Lung Cancer Early Detection","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T14:20:06.381334Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.02812"},"observation_digest":"sha256:268f3eb153d5d92944667250f6d1ce2d3909caa3aeeb19b3bfd58270215e3ac0","observation_id":"c20fbf8a-6285-40a2-b777-36c0e8059a36","resolution":{"observed_at":"2026-07-01T23:26:22.844157Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.04560","last_updated":"2026-06-04T06:53:10Z","snapshot_observed_at":"2026-08-03T03:32:03.287107Z","submitted_at":"2026-06-03T07:47:47Z","title":"Rollout-Level Advantage-Prioritized Experience Replay for GRPO","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-06-28T07:43:21.284574Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.04560"},"observation_digest":"sha256:993d53df9075ea226e97e20b092a8495f50fe72bb39f1d588dcea025481ec78f","observation_id":"247f0921-085c-40d3-bb1a-5832dc6274cc","resolution":{"observed_at":"2026-07-02T06:06:41.052519Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.05597","last_updated":"2026-06-08T19:54:19Z","snapshot_observed_at":"2026-08-02T12:57:05.056812Z","submitted_at":"2026-06-04T02:18:44Z","title":"AsyncWebRL: Efficient Multi-Step RL for Visual Web Agents","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T02:45:25.694378Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.05597"},"observation_digest":"sha256:93145565c70ec7b9ddf8cbb3ec8686376af002622a236ec58111a13050621af2","observation_id":"92d6a179-4695-4e99-92a4-c596e43b8601","resolution":{"observed_at":"2026-07-02T11:56:55.521293Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.18089","last_updated":"2026-07-05T17:40:26Z","snapshot_observed_at":"2026-07-12T13:34:39.011240Z","submitted_at":"2026-06-16T15:55:28Z","title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","version":1},"reference_index":137,"source":"arxiv_source","source_observed_at":"2026-06-27T01:13:11.483599Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.18089"},"observation_digest":"sha256:d8b13aa91066ff7a0473f26a95ecd6c13154371c01b1c95b49d0a3c1f6b15831","observation_id":"842d94d0-100c-48b9-8371-829985f2993b","resolution":{"observed_at":"2026-07-03T20:38:56.067368Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.18307","last_updated":"2026-06-16T07:21:49Z","snapshot_observed_at":"2026-07-06T23:53:45.117607Z","submitted_at":"2026-06-16T07:21:49Z","title":"DRIFT: Refining Instruction Data via On-Policy Data Attribution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T01:57:05.784589Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.18307"},"observation_digest":"sha256:5ed7ab2db853b0c71ba6cf7ff6d2adcdeea9b238ea53c51cac17ef12c2c9cf14","observation_id":"08ff4005-a93c-4e45-97dc-15cb1ad52b5a","resolution":{"observed_at":"2026-07-03T19:18:54.722039Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2606.22570","last_updated":"2026-06-21T16:14:46Z","snapshot_observed_at":"2026-08-05T07:45:25.638269Z","submitted_at":"2026-06-21T16:14:46Z","title":"What are Key Factors for Updates in RL for LLM Reasoning?","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-26T10:24:53.245739Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2606.22570"},"observation_digest":"sha256:fbcc4d72c470b0d94f9c0ff1b909ff5496eee9af0c02469fa88bde054aa929c3","observation_id":"7d607ce7-cda3-4fb0-9d51-f107ba4b1af5","resolution":{"observed_at":"2026-07-04T09:09:43.575477Z","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":"2504.11343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-07-09T04:05:55.456269Z","title":"A minimalist approach to llm reasoning: from rejection sampling to reinforce.arXiv preprint arXiv:2504.11343","venue":"cs.LG","work_id":"90392907-b8b0-4771-9ac8-6cd50245b1dd","year":2025},"citing_paper":{"arxiv_id":"2607.07646","last_updated":"2026-07-08T17:04:42Z","snapshot_observed_at":"2026-07-11T23:20:18.291178Z","submitted_at":"2026-07-08T17:04:42Z","title":"RL Post-Training Builds Compositional Reasoning Strategies","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T04:04:13.942267Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2607.07646"},"observation_digest":"sha256:5061aadd71f9480375760407257d3996941c611087a0d00f459655b86536d924","observation_id":"6299d2f4-a2e8-4d50-99c9-9b112124ab68","resolution":{"observed_at":"2026-07-09T04:05:55.457832Z","resolver_source":"local_arxiv","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":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-02T04:32:37.522325Z","title":"arXiv preprint arXiv:2504.11343 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13683","last_updated":"2026-07-15T10:26:26Z","snapshot_observed_at":"2026-08-04T17:25:28.301350Z","submitted_at":"2026-07-15T10:26:26Z","title":"Self-Evolving Agent Harnesses via Gated Semantic Quality-Diversity","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T04:32:37.522325Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2607.13683"},"observation_digest":"sha256:5f994349c2e4de4ff2bb7e663d536a214cb921f83204f333100b3a7bae0c1129","observation_id":"9d906ae0-a2f9-433e-821b-42cf4472e9ba","resolution":{"observed_at":"2026-08-02T04:32:37.522325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-02T14:45:23.980380Z","title":"arXiv preprint arXiv:2504.11343 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16205","last_updated":"2026-05-07T13:16:09Z","snapshot_observed_at":"2026-08-02T14:45:18.533902Z","submitted_at":"2026-05-07T13:16:09Z","title":"It Takes 8 Tokens: Weak-to-Strong Off-Policy RL via Auxiliary Branches","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T14:45:23.980380Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2607.16205"},"observation_digest":"sha256:9a9d997fe2d3526329cf65c4bcfde0b1820eb6efe56268360d3a5b62edc8d93f","observation_id":"8b0b7d76-777d-494d-a718-80aaea0fcccf","resolution":{"observed_at":"2026-08-02T14:45:23.980380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11343","snapshot_observed_at":"2026-08-01T13:54:23.273919Z","title":"arXiv preprint arXiv:2504.11343 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18979","last_updated":"2026-07-21T11:14:33Z","snapshot_observed_at":"2026-08-01T13:54:09.960101Z","submitted_at":"2026-07-21T11:14:33Z","title":"Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T13:54:23.273919Z"},"links":{"cited_paper":"/paper/2504.11343","citing_paper":"/paper/2607.18979"},"observation_digest":"sha256:14996f47623677edcbeeb9e0490485b0f4bad809fde379d625ec78e07d9164cb","observation_id":"f9475cb6-7154-4997-af99-64cca06655f9","resolution":{"observed_at":"2026-08-01T13:54:23.273919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.11343/citation-record","integrity":"/paper/2504.11343/integrity","json":"/paper/2504.11343/citation-record.json","paper":"/paper/2504.11343"},"outbound":[],"paper":{"arxiv_id":"2504.11343","last_updated":"2025-06-12T06:03:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T21:09:50.780345Z","submitted_at":"2025-04-15T16:15:02Z","title":"A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce"},"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 32 inbound Pith citation observations for arXiv:2504.11343."}