{"as_of":"2026-08-06T12:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d744a231cb287e0c2f7670640e38d4de4ed56b2ed11d0498fcc4dfb44ee793c1","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T11:06:20.058342Z","state":"measured"},{"denominator":75,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":75,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:44:14.695498Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.00861","snapshot_observed_at":"2026-08-04T16:44:14.695498Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02011","last_updated":"2026-08-04T14:04:12Z","snapshot_observed_at":"2026-08-06T12:25:31.839725Z","submitted_at":"2026-08-03T10:09:19Z","title":"Before Reasoning Can Fail: Pre-Evidence Procedural Failures in Agentic RAG","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T16:44:14.695498Z"},"links":{"cited_paper":"/paper/2510.00861","citing_paper":"/paper/2608.02011"},"observation_digest":"sha256:113ddb06c86eae137e5b78d8a9bc089218b4e85b8f0317d6d781230493b80aba","observation_id":"1e718ada-7632-450a-be42-0cb321846434","resolution":{"observed_at":"2026-08-04T16:44:14.695498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2510.00861/citation-record","integrity":"/paper/2510.00861/integrity","json":"/paper/2510.00861/citation-record.json","paper":"/paper/2510.00861"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gpt-5 system card","venue":null,"work_id":"04918a31-bef3-4a6a-b17a-07971bbcdebe","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:366e12cf4ca02ba9bac7b832a251ef8a551e8337747dd38392b7ab0db8555a8a","observation_id":"5522e861-a8a9-4dba-98d6-8cdcd6a3b449","resolution":{"observed_at":"2026-05-18T11:11:19.643334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The llama 4 herd: The beginning of a new era of natively multimodal intelli- gence","venue":null,"work_id":"0bd083f3-b706-4f14-8ff3-d2dd3c783425","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:01de025bf9c161b309d69555f434ddb597201b3eed43b2807d7e5d1315de9a0f","observation_id":"d4f26dd5-899a-43d5-bb22-3ffba4195ff6","resolution":{"observed_at":"2026-05-18T11:11:19.639382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:0b8bae2752bf34f6cbb48eed78bf46d66a9f45d792341df9b41fbf3979a11e27","observation_id":"1472877b-77eb-45b5-b274-a22a5c0423a4","resolution":{"observed_at":"2026-05-18T11:11:18.199394Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions","venue":null,"work_id":"b4fedc21-67d2-4402-9092-d09a414905ea","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:79b8a12674dfb62f4077416a50ba9a1224e119e7a9d1a2345db627d4d4966db1","observation_id":"e7a849a3-a296-4ca8-86a2-8675c6d56616","resolution":{"observed_at":"2026-05-18T11:11:19.584766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05561","last_updated":"2024-09-30T10:17:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-10T22:07:21Z","title":"TrustLLM: Trustworthiness in Large Language Models","version":6},"cited_work":{"arxiv_id":"2401.05561","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.05561","snapshot_observed_at":"2026-07-04T19:50:11.226678Z","title":"TrustLLM: Trustworthiness in Large Language Models","venue":"cs.CL","work_id":"d16f7fcd-8a69-4cc5-b63f-6bb2fe440d76","year":2024},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2401.05561","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:9bf91a8f71ac9655cb919ecad686640ce76feae404681b8f8c3786463f8f325b","observation_id":"d7032d39-2799-4dd7-aa96-b2a198868bcf","resolution":{"observed_at":"2026-05-18T11:17:09.209714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":"2412.16720","doi":"10.48550/arxiv.2412.16720","metadata_source":"pith","pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"OpenAI o1 System Card","venue":"cs.AI","work_id":"68d3c334-0fc9-49e3-b7b0-a69afae933e2","year":2024},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:bd87f143bf64beaf448d069dbb8bbbacc952d69c948ad174d901ff5883b7c162","observation_id":"e5f570a1-8761-4ca2-87b2-16eaaaef9eb7","resolution":{"observed_at":"2026-05-18T11:11:18.076643Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:5067407811ad03675ab7b3a288d74c28e719ab677c700f8dc86e6526084ef7f7","observation_id":"c65d0d83-dcd0-4cfb-b0bf-91dd860cc313","resolution":{"observed_at":"2026-05-18T11:11:18.153736Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"cited_work":{"arxiv_id":"2507.20534","doi":"10.1145/3448609","metadata_source":"pith","pith_arxiv_id":"2507.20534","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kimi K2: Open Agentic Intelligence","venue":"cs.LG","work_id":"7f18284c-12d3-4137-bea1-1da97e8cf3c1","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2507.20534","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:4214278409708cd7232f2bd54f2a09ea59cc7f2c8f56062adeb415ac17a9fba5","observation_id":"5d98d0fd-b6d6-4e76-b462-7cce0e5f652c","resolution":{"observed_at":"2026-05-18T11:11:18.124338Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T01:23:16.170083+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T01:23:16.170083+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.05668","last_updated":"2025-08-19T05:15:19Z","snapshot_observed_at":"2026-08-06T05:30:35.068556Z","submitted_at":"2025-08-03T08:02:51Z","title":"A Survey of LLM-based Deep Search Agents: Paradigm, Optimization, Evaluation, and Challenges","version":3},"cited_work":{"arxiv_id":"2508.05668","doi":"10.48550/arxiv.2508.05668","metadata_source":"pith","pith_arxiv_id":"2508.05668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2508.05668 , year=","venue":"cs.IR","work_id":"d504829e-614b-4812-bb38-8ee43f2a863f","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2508.05668","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f90003c9fa5456c77934cdb97adf5b7560d0e16b4f4411ef3211ab7a97a40426","observation_id":"4266b1db-1aad-4bdb-b26b-791ebcb31019","resolution":{"observed_at":"2026-05-18T11:11:18.254256Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","venue":null,"work_id":"af636160-07ff-452e-bbac-d2a040672112","year":2020},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:2d87356bdfe583533349ace60a6f9186659dedd250c08b1d0eb2b618c9fa9c14","observation_id":"3af8b030-38f1-4052-b7f0-ee2c8f86a3f6","resolution":{"observed_at":"2026-05-18T11:11:19.575728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":"2312.10997","doi":"10.1186/1476-072x-8-72","metadata_source":"pith","pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":"cs.CL","work_id":"b80d2790-6cd9-4c87-b3c4-de404f99a80e","year":2023},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:de5a792f3a5c34a08e569a45f036b2225438edfe5d7193020308f06773c766d5","observation_id":"22ae4234-45c5-4ef2-a718-f39125af97dd","resolution":{"observed_at":"2026-05-18T11:11:18.131734Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Introducing deep research","venue":null,"work_id":"b49ff892-bd90-4be9-aa73-4c1333e4e8ed","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:2352486df00c56af982853420d857effe280dac4e536173da6b3064cfc903db8","observation_id":"ab3052a3-84fb-46bb-8382-bfd75c3e51ff","resolution":{"observed_at":"2026-05-18T11:11:19.483454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gemini deep research – your personal research assistant","venue":null,"work_id":"acf27408-d1ed-453f-9765-ba99850e2bc4","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:31c52df8c421fb586b426e5763af9a7bea877ee991814889359a7e7e07f8a7c2","observation_id":"688bacf0-196d-48d0-88d2-4682a5e20f8d","resolution":{"observed_at":"2026-05-18T11:11:19.554793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Introducing perplexity deep research","venue":null,"work_id":"9fd3b0e9-975c-4a93-8336-103bc4f6f0b3","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:8eaf88a3666e09391e67630643825be3663d1dca073eba2a69c41e10ad088016","observation_id":"0a5071e2-d99c-4246-b7d8-3408ce814114","resolution":{"observed_at":"2026-05-18T11:11:19.551419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.07274","last_updated":"2018-11-26T04:56:31Z","snapshot_observed_at":"2026-07-06T05:27:30.168672Z","submitted_at":"2017-01-25T11:52:11Z","title":"Deep Reinforcement Learning: An Overview","version":6},"cited_work":{"arxiv_id":"1701.07274","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.07274","snapshot_observed_at":"2026-07-04T19:00:06.264165Z","title":"Deep Reinforcement Learning: An Overview","venue":"cs.LG","work_id":"68a5d043-bfc1-49c5-9396-40bb3d602cee","year":2017},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/1701.07274","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:e71cc4e3e1c8eac9e9f9c13f1a51047b09d1b7a22793c0ea2bdad1a2c3fd3b85","observation_id":"a19526f1-039f-4269-a1d7-9a97a266df7e","resolution":{"observed_at":"2026-05-18T11:11:18.220351Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09516","last_updated":"2025-08-05T19:08:38Z","snapshot_observed_at":"2026-07-06T20:51:28.022519Z","submitted_at":"2025-03-12T16:26:39Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","version":5},"cited_work":{"arxiv_id":"2503.09516","doi":"10.48550/arxiv.2503.09516","metadata_source":"pith","pith_arxiv_id":"2503.09516","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","venue":"cs.CL","work_id":"0e0b7549-2bc4-4574-aa7f-588ffa16eaae","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:c980f73a1d4f69451fa6115eec086db675f8cff834080dbe1fa51b9445846d0b","observation_id":"4e3b49b0-5a79-4fc5-bf8c-00184450c28d","resolution":{"observed_at":"2026-05-18T11:11:18.231320Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05592","last_updated":"2025-03-18T08:32:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-07T17:14:44Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2503.05592","doi":"10.48550/arxiv.2503.05592","metadata_source":"pith","pith_arxiv_id":"2503.05592","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","venue":"cs.AI","work_id":"f5ed73d2-f2ff-4cf6-853d-3586333e44ef","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2503.05592","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:73fcca5a341c8f05aae5f6e1246d97e864ded65b85fc6d866423945c9bd47fdf","observation_id":"f0ca6996-4c88-494e-87e7-4e3a5b5a3559","resolution":{"observed_at":"2026-05-18T11:11:18.095752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.09303","last_updated":"2025-08-12T19:38:21Z","snapshot_observed_at":"2026-08-05T21:12:09.160784Z","submitted_at":"2025-08-12T19:38:21Z","title":"ParallelSearch: Train your LLMs to Decompose Query and Search Sub-queries in Parallel with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2508.09303","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.09303","snapshot_observed_at":"2026-06-28T22:32:44.029593Z","title":"Par- allelsearch: Train your llms to decompose query and search sub-queries in parallel with reinforcement learning","venue":null,"work_id":"1a767f87-f215-4e70-bdcd-a05327fe1314","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:2843c0d05f1981158b57cf420eb33f5e960055de11a93c1fecdc5bb69fce8b12","observation_id":"74f3c35a-f61f-4efb-a4ee-568e19fcdf03","resolution":{"observed_at":"2026-05-18T11:11:18.137585Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09600","last_updated":"2018-09-25T17:28:20Z","snapshot_observed_at":"2026-07-31T11:19:06.421362Z","submitted_at":"2018-09-25T17:28:20Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":"1809.09600","doi":"10.48550/arxiv.1809.09600","metadata_source":"pith","pith_arxiv_id":"1809.09600","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","venue":"cs.CL","work_id":"c87d7e5f-b81a-41c8-beca-f0b9d598aae4","year":2018},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/1809.09600","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:a0a47502634220857bee5910fa7607ef0b11699da2a6c4d37cb477f50dc81c7f","observation_id":"c8954da1-60fc-43b4-91cb-061781681a02","resolution":{"observed_at":"2026-05-18T11:11:18.148341Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Musique: Multihop questions via single-hop question composition","venue":null,"work_id":"59bf3f1b-0423-410e-915a-01ba14bc8429","year":2022},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f203c2675333ec5bd2b348101a576f2fa2a5b371309534617355afc3853563a5","observation_id":"ddc5a5d6-2253-4654-8f7d-1ce9633c1e8f","resolution":{"observed_at":"2026-05-18T11:11:19.490135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.01060","last_updated":"2020-11-12T07:47:48Z","snapshot_observed_at":"2026-07-06T10:10:56.466018Z","submitted_at":"2020-11-02T15:42:40Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","version":2},"cited_work":{"arxiv_id":"2011.01060","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.01060","snapshot_observed_at":"2026-07-11T03:17:50.841893Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","venue":"cs.CL","work_id":"73ded6d0-6905-404f-b7d5-b66e36e1b4f8","year":2020},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2011.01060","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:6a3cbefc0924f8051728c2f073149676ae4332bd7ecdc4dc7fb630cc5d16d6c8","observation_id":"43168c99-88ac-4736-9b1b-7433bd3e196b","resolution":{"observed_at":"2026-05-18T11:11:18.210123Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18096","last_updated":"2025-09-03T15:32:23Z","snapshot_observed_at":"2026-08-03T17:41:39.573093Z","submitted_at":"2025-06-22T16:52:48Z","title":"Deep Research Agents: A Systematic Examination And Roadmap","version":2},"cited_work":{"arxiv_id":"2506.18096","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.18096","snapshot_observed_at":"2026-07-08T13:04:56.715325Z","title":"Deep Research Agents: A Systematic Examination And Roadmap, September 2025","venue":"cs.AI","work_id":"ac5cfd30-9bde-4b94-9dd3-65ec5ef6056b","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2506.18096","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:aa88a9499370237591ed85260ca7cf8413a0ed6f5cadd953744537bac386be4f","observation_id":"ba085bd1-dce0-48e0-9ec9-d97a70c7f8e1","resolution":{"observed_at":"2026-05-18T11:11:18.070924Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.06733","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T08:06:47.684400Z","title":"Reinforcement learning foundations for deep research systems: A survey","venue":null,"work_id":"2db9840f-e2ec-4797-ba5b-4d13e8903e07","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:fdc735487e02b685f8b2187b11de055abd227df5446884e655618b755d4520b9","observation_id":"92a7248f-7939-4dbe-acdd-f2217147c428","resolution":{"observed_at":"2026-05-18T11:11:18.160725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning: An introduction, volume 1","venue":null,"work_id":"a475a56b-b318-478c-864c-4cafa862ce02","year":1998},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:15b74bb244f5ad8ccd02909058e18865277b28b32d2254bcf2d79df22b86bd5c","observation_id":"fb0f6d9c-0454-48ba-94c7-c5ebb4f24fc0","resolution":{"observed_at":"2026-05-18T11:11:19.479975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning: A survey","venue":null,"work_id":"cf94b356-7ba0-426d-8021-4babc3e481d5","year":1996},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:858c6b0a49157295adf1fc37e87a85ab5808a4bbecd1a7996766c5b62980d248","observation_id":"bcc31c79-d875-40af-b99a-e5c851527ffe","resolution":{"observed_at":"2026-05-18T11:11:19.496232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06580","last_updated":"2025-03-09T12:19:47Z","snapshot_observed_at":"2026-07-06T20:49:22.677266Z","submitted_at":"2025-03-09T12:19:47Z","title":"Agent models: Internalizing Chain-of-Action Generation into Reasoning models","version":1},"cited_work":{"arxiv_id":"2503.06580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.06580","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Agent models: Inter- nalizing chain-of-action generation into reasoning models","venue":null,"work_id":"db01870c-3010-4eac-82a3-2a43905fdd13","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2503.06580","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:e75c3fd78aa070beac5007e4cc15aa2214f2b786927790ef2cf70998f7764319","observation_id":"0fb80d5e-1fd7-449b-a908-02bc1a97f13f","resolution":{"observed_at":"2026-05-18T11:11:18.178584Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15117","last_updated":"2025-05-21T05:09:43Z","snapshot_observed_at":"2026-08-05T07:47:57.659901Z","submitted_at":"2025-05-21T05:09:43Z","title":"An Empirical Study on Reinforcement Learning for Reasoning-Search Interleaved LLM Agents","version":1},"cited_work":{"arxiv_id":"2505.15117","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15117","snapshot_observed_at":"2026-07-01T00:55:12.126083Z","title":"An empirical study on reinforcement learning for reasoning-search interleaved llm agents","venue":null,"work_id":"7637d87e-ae91-40d6-a208-921791b92408","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.15117","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f56c2bfd38b5e78a3ded71260ff97828d38319118f0c741459193460c7083ceb","observation_id":"0fcab628-5b5b-4eea-af6c-c1a9c9c9a03d","resolution":{"observed_at":"2026-05-18T11:11:18.283961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.07976","doi":"10.48550/arxiv.2508.07976","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Beyond ten turns: Unlocking long-horizon agentic search with large-scale asynchronous rl","venue":"ArXiv.org","work_id":"cf9b5d87-269e-421e-aec4-52f7899c89f0","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:4006bfaf84a3f0534924759427ce7503e49c388240d516f9eb738e0cb50d981c","observation_id":"8a8749f6-0fad-4c28-b227-8d4485acdae2","resolution":{"observed_at":"2026-05-18T11:11:18.277974Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03350","last_updated":"2023-10-17T18:57:17Z","snapshot_observed_at":"2026-07-31T15:52:06.089691Z","submitted_at":"2022-10-07T06:50:23Z","title":"Measuring and Narrowing the Compositionality Gap in Language Models","version":3},"cited_work":{"arxiv_id":"2210.03350","doi":"10.1007/s11229-022-03791-y","metadata_source":"pith","pith_arxiv_id":"2210.03350","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Measuring and Narrowing the Compositionality Gap in Language Models","venue":"cs.CL","work_id":"79aa4add-ff4a-4871-9c74-6f473b0579c1","year":2022},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2210.03350","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:bf798e653a5038a469a826ecc4e7d86c3f52a427d6286efe65407e46f8ec2a92","observation_id":"169d6c5c-414c-4bce-b66a-120a191233e7","resolution":{"observed_at":"2026-05-18T11:11:18.204818Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12061","last_updated":"2024-06-05T15:08:28Z","snapshot_observed_at":"2026-07-06T17:32:10.828230Z","submitted_at":"2024-02-19T11:28:20Z","title":"All Language Models Large and Small","version":2},"cited_work":{"arxiv_id":"2402.12061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.12061","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"All language models large and small","venue":null,"work_id":"0013c609-295e-4a2c-b53a-3e12c5c88725","year":2024},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2402.12061","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:512145ae6a628a4faa1d8ec7eab34149f700b74c9c260d7e02b40448eba61a26","observation_id":"b9e39aa2-fa98-4f6c-979a-b3fb2e413cd2","resolution":{"observed_at":"2026-05-18T11:11:18.272302Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning as heuristic for action-rule preferences","venue":null,"work_id":"1183a1fe-aaab-4bd5-984e-7bcd2450a2e3","year":2010},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:924604067b662ec161c9d829cb1f0421d708e586b895596101c5dd686f396c97","observation_id":"a0e2c2ea-fe14-490d-91ea-f5cc5551a909","resolution":{"observed_at":"2026-05-18T11:11:19.597757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning framework for window hardware installation","venue":null,"work_id":"860e84d7-3fb8-4251-ba1c-e40142fb0451","year":2022},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:34859a5f551759fbfc5a7a0c67e4754e53702e75eb28ffc8cdc3f065a95d70ed","observation_id":"ab6fa824-fb78-49ac-93da-b737226b6f4b","resolution":{"observed_at":"2026-05-18T11:11:19.592232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":"1707.06347","doi":"10.1016/j.artint.2010.12.005","metadata_source":"pith","pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proximal Policy Optimization Algorithms","venue":"cs.LG","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","year":2017},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:cdcdc53277bdbfcc6b01af861c71b1549004c5c349e32909623bd4ecff739869","observation_id":"56fa5997-eb6b-4eb8-a6f2-81443f103673","resolution":{"observed_at":"2026-05-18T11:11:18.289884Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":"1506.02438","doi":"10.48550/arxiv.1506.02438","metadata_source":"pith","pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","venue":"cs.LG","work_id":"38e3ca94-96f0-4b19-a355-0754931af8be","year":2015},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:04f69a3b612762f8d9f5dcfa84806832d740da94c6edfe56701b32c1967ebc65","observation_id":"eb437cf5-3b5e-4212-9264-0670d1554bc7","resolution":{"observed_at":"2026-05-18T11:11:18.248341Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19470","last_updated":"2025-09-23T03:45:42Z","snapshot_observed_at":"2026-07-06T20:58:19.305457Z","submitted_at":"2025-03-25T09:00:58Z","title":"ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2503.19470","doi":"10.48550/arxiv.2503.19470","metadata_source":"pith","pith_arxiv_id":"2503.19470","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learning","venue":"cs.AI","work_id":"cc9775d9-2fbd-4690-a641-2b50ae4a59dc","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2503.19470","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:e09c5d9156e3821747fbfda756c04835ac6eb5bf957ee368b94f420afb09255e","observation_id":"9d75b404-86cb-4739-a4aa-3cb4d678bd00","resolution":{"observed_at":"2026-05-18T11:11:18.215298Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04588","last_updated":"2026-05-19T11:51:42Z","snapshot_observed_at":"2026-08-04T18:36:41.979541Z","submitted_at":"2025-05-07T17:30:22Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","version":3},"cited_work":{"arxiv_id":"2505.04588","doi":"10.48550/arxiv.2505.04588","metadata_source":"pith","pith_arxiv_id":"2505.04588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","venue":"cs.CL","work_id":"0ea11521-4603-4e7a-abe3-bbc2f3e3f71c","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.04588","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:06302e899604a2adb6238f1cb1b07effde1f42e80cfd787710bd12ce9a546851","observation_id":"fe3ef81d-2135-4304-b812-a8ab20d4c57c","resolution":{"observed_at":"2026-05-18T11:11:18.243027Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.04185","last_updated":"2025-06-04T17:29:22Z","snapshot_observed_at":"2026-07-06T21:36:40.449308Z","submitted_at":"2025-06-04T17:29:22Z","title":"R-Search: Empowering LLM Reasoning with Search via Multi-Reward Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2506.04185","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04185","snapshot_observed_at":"2026-07-04T06:19:38.663842Z","title":"R-search: Em- powering llm reasoning with search via multi-reward reinforcement learning","venue":null,"work_id":"6cbb2815-00cc-4d21-be56-367f5ec33a28","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2506.04185","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:ddfd0e7c8d076df599718a9f336c1acc279483e756a63aaf1b1166690c74bb58","observation_id":"e1aa069b-9b7b-46a1-aba8-ddf010ed2d6b","resolution":{"observed_at":"2026-05-18T11:11:18.237838Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10874","last_updated":"2025-08-14T17:46:01Z","snapshot_observed_at":"2026-08-06T03:19:32.559275Z","submitted_at":"2025-08-14T17:46:01Z","title":"SSRL: Self-Search Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2508.10874","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10874","snapshot_observed_at":"2026-07-04T17:09:59.246273Z","title":"Ssrl: Self-search reinforcement learning","venue":null,"work_id":"c683ed23-515e-491e-a19f-6ed448756e15","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2508.10874","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:2e070aaa0e7485a206bf491a558172af381d08539f83244108c3cb5e2a021b1e","observation_id":"c7c41de9-4fe9-4c31-8288-f52bc1be63bb","resolution":{"observed_at":"2026-05-18T11:11:18.267234Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15107","last_updated":"2025-05-26T04:44:21Z","snapshot_observed_at":"2026-07-06T21:27:32.828750Z","submitted_at":"2025-05-21T05:01:31Z","title":"StepSearch: Igniting LLMs Search Ability via Step-Wise Proximal Policy Optimization","version":2},"cited_work":{"arxiv_id":"2505.15107","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.15107","snapshot_observed_at":"2026-07-08T13:04:56.727934Z","title":"Stepsearch: Igniting llms search ability via step-wise proximal policy optimization.arXiv preprint arXiv:2505.15107","venue":"cs.CL","work_id":"0c9eadf8-223b-4c81-a25c-3a46d830ba8b","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.15107","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:5970e746d7f80b0ab99a28798287bd4cf2cae766b4ba00e8c530376f0816e624","observation_id":"8e9fd6de-99b2-4e1f-b9e1-580c3c687b17","resolution":{"observed_at":"2026-05-18T11:11:18.260446Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T04:45:59.150968Z","title":"Qwen2.5 technical report","venue":null,"work_id":"eeff09af-1102-4fc1-a19e-ab55d74373ab","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f7bd7c8b9758d84f67bcac4aa771ce8460a5732e46c9c998d194c95cb464b9cf","observation_id":"59c667e9-3d8f-4a65-a37b-c138a590df99","resolution":{"observed_at":"2026-05-18T11:11:19.588576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":"2212.03533","doi":"10.48550/arxiv.2212.03533","metadata_source":"pith","pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","venue":"cs.CL","work_id":"789cc674-467e-4f23-bb50-05c79fe8c4c2","year":2022},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:99969b4dbea9ad339f3456c984c954bc1baabdca38b418ca498940b368454a6d","observation_id":"48b1a9db-60ea-4af6-b27e-d01b7b24938c","resolution":{"observed_at":"2026-05-18T11:11:18.226219Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-01T10:08:09.486841+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T10:08:09.486841+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":"083941a0-3b2d-4423-9758-b7e23b2217b6","year":2020},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:56e1466c51b346f26ca62f6ac34b16e2ac6db80205e75e75e74501eff068e819","observation_id":"50f0a0b5-41e8-4729-8698-9eb2008ae68a","resolution":{"observed_at":"2026-05-18T11:11:19.579882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03160","last_updated":"2025-04-17T04:46:08Z","snapshot_observed_at":"2026-07-06T21:04:06.413573Z","submitted_at":"2025-04-04T04:41:28Z","title":"DeepResearcher: Scaling Deep Research via Reinforcement Learning in Real-world Environments","version":4},"cited_work":{"arxiv_id":"2504.03160","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.03160","snapshot_observed_at":"2026-07-03T04:37:37.738752Z","title":"DeepResearcher: Scaling Deep Research via Reinforcement Learning in Real-world Environments","venue":"cs.AI","work_id":"460d8021-a193-45c3-89a7-b72f6767c87f","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2504.03160","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:b8c211a02287c9a0c9e54a6824dbfcc84eaafd10aa4262e1115b6967bfc76070","observation_id":"698e925b-6bb9-4d9f-a849-1e5c58ca86a2","resolution":{"observed_at":"2026-05-18T11:11:18.188303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16582","last_updated":"2025-05-26T10:07:05Z","snapshot_observed_at":"2026-07-06T21:28:29.307086Z","submitted_at":"2025-05-22T12:17:13Z","title":"O$^2$-Searcher: A Searching-based Agent Model for Open-Domain Open-Ended Question Answering","version":2},"cited_work":{"arxiv_id":"2505.16582","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.16582","snapshot_observed_at":"2026-06-29T12:53:26.512979Z","title":"O2-searcher: A searching-based agent model for open-domain open-ended question answering","venue":null,"work_id":"eafd4f43-5373-4ff5-a2d3-6dda4860daf6","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.16582","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:7befd695352f62335254edde5dd85a4a5f23debfa20fa9f371bfd33509530b82","observation_id":"95a35b92-324c-41c0-afe5-153aa7987f46","resolution":{"observed_at":"2026-05-18T11:11:18.194028Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20285","last_updated":"2025-05-27T06:46:24Z","snapshot_observed_at":"2026-08-04T03:10:05.250607Z","submitted_at":"2025-05-26T17:58:50Z","title":"MaskSearch: A Universal Pre-Training Framework to Enhance Agentic Search Capability","version":2},"cited_work":{"arxiv_id":"2505.20285","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20285","snapshot_observed_at":"2026-06-29T12:53:26.559767Z","title":"Masksearch: A universal pre-training framework to enhance agentic search capability","venue":null,"work_id":"0a13754a-9d99-437b-a5a1-f5b92c1c24b7","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.20285","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:c095ff03a283adc3cbc274c0b1b3bb748ad4575bf04235edc9506a7c46c10416","observation_id":"4edd2f95-e2de-4c54-93fe-7b8d4a76f0fc","resolution":{"observed_at":"2026-05-18T11:11:18.143270Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22501","last_updated":"2025-05-28T15:50:48Z","snapshot_observed_at":"2026-07-30T22:31:52.311808Z","submitted_at":"2025-05-28T15:50:48Z","title":"EvolveSearch: An Iterative Self-Evolving Search Agent","version":1},"cited_work":{"arxiv_id":"2505.22501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22501","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Evolvesearch: An iterative self-evolving search agent","venue":null,"work_id":"0b705ee4-edfe-4e09-bfb1-535f3a32a05a","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2505.22501","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:79f76526a5282067bfbf3a0c09eb92ebcaec785f8ae32761d59965df98df714d","observation_id":"44da3697-5f01-4e2f-bd71-eca5deb2ca06","resolution":{"observed_at":"2026-05-18T11:11:18.166986Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.17365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:24:56.779160Z","title":"Dynasearcher: Dynamic knowl- edge graph augmented search agent via multi-reward reinforcement learning.arXiv preprint arXiv:2507.17365","venue":null,"work_id":"a348193e-095c-448e-bad7-4b3e75d5034f","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:d017c038838002655752234c84862aac66afae16c529f2b661caeddd49e8d24f","observation_id":"49995253-25d3-4d8f-8adf-ea7e59401c3f","resolution":{"observed_at":"2026-05-18T11:11:18.173111Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.19113","last_updated":"2026-05-25T15:33:03Z","snapshot_observed_at":"2026-08-05T16:00:10.626014Z","submitted_at":"2025-08-26T15:15:17Z","title":"Hybrid Deep Searcher: Scalable Parallel and Sequential Search Reasoning","version":3},"cited_work":{"arxiv_id":"2508.19113","doi":"10.48550/arxiv.2508.19113","metadata_source":"pith","pith_arxiv_id":"2508.19113","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hybrid deep searcher: Integrating parallel and sequential search reasoning","venue":"cs.AI","work_id":"765fb019-063e-4ffa-b060-2d0dd6306a0c","year":2025},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2508.19113","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f93d65b0d806cf16bd5765fcea906227df26b880d6726f749ac699279b1622d1","observation_id":"80df2a23-96fa-4d33-a5ef-5582c7155f66","resolution":{"observed_at":"2026-05-26T03:04:55.832401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Constructing a multi-hop QA dataset for comprehensive evaluation of reasoning steps","venue":null,"work_id":"1ee9b2c5-b805-40dd-a76d-d5ede29f577a","year":2020},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:14f4ab849fed836bca3eb77916f217b1179dcee2c696f4a7b4dcf90595e93d98","observation_id":"5bd3d417-cfb6-49ae-8263-e532d53a9dd2","resolution":{"observed_at":"2026-05-18T11:11:19.571459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Musique: Multihop questions via single-hop question composition","venue":null,"work_id":"22eb901e-defd-4e33-9e30-9acbc808a2a8","year":2022},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:78b6cc471f996d8b5e815210467dfa5f195c5e65e3d2bd83911896fababb5f57","observation_id":"4274b44a-aeeb-46d4-81dd-6148880450f4","resolution":{"observed_at":"2026-05-18T11:11:19.567578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19256","last_updated":"2024-10-02T04:01:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-28T06:20:03Z","title":"HybridFlow: A Flexible and Efficient RLHF Framework","version":2},"cited_work":{"arxiv_id":"2409.19256","doi":"10.1145/3689031.3696075.url:","metadata_source":"pith","pith_arxiv_id":"2409.19256","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"HybridFlow: A Flexible and Efficient RLHF Framework","venue":"cs.LG","work_id":"7eb9c9f4-b322-4bba-8011-09ff8d6ad801","year":2024},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"cited_paper":"/paper/2409.19256","citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:e74a8cbdb6c6dc5e1bd919237d9df56719adf81a2a1966e8aec2ac1a48e8b544","observation_id":"4144baa3-ebe0-4588-b4db-b54e73a3d1af","resolution":{"observed_at":"2026-05-18T11:11:18.084347Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5480.4280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"cheatable","venue":null,"work_id":"5aad0cd9-5264-4dda-90cf-80fc9190bc0f","year":2020},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:0df0919ba364629dfe5ef79c89f03c4b33f455017d90cd99b0d08d46e60b4d7f","observation_id":"3be489a4-d316-4e85-87c6-12004b738e88","resolution":{"observed_at":"2026-05-18T11:11:18.109682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8c63bfb0-afaf-41f5-9729-784c438d7671","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:5f2dcba53726205b439282f7756a4a6d0943417484ef077131a8a843a264989c","observation_id":"e9147bb6-11d3-4ef4-aa3d-61631c60acd6","resolution":{"observed_at":"2026-05-18T11:11:19.564328Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Frédéric Chopin","venue":null,"work_id":"db01dfb9-6cb3-4cac-b4e1-720532d843a3","year":2000},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:835bc41c8853bbfbb2ffc2b0aef476fc2edbb9e526e0c2ebb62a86e593d7cf16","observation_id":"6187f4d6-eea4-4fc3-b720-4ad127846508","resolution":{"observed_at":"2026-05-18T11:11:19.560946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"presidential election","venue":null,"work_id":"b180decc-31ab-496d-9461-98adab1fda56","year":2000},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:dd180be1ae961646a66a3f688f61a99e5570d1bc7a5f4a7096f1108870cb7f06","observation_id":"73e5a1b9-f6d3-4cb8-80a6-d010477ae8c1","resolution":{"observed_at":"2026-05-18T11:11:19.557728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"46e00a0b-9c72-42b4-927f-0fa16e255923","year":2000},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:23a5f9fad9571713de35beca4bc5b8201dc5d28ff76fdf90c65dbe17eed4bd6b","observation_id":"20cee2c4-472d-4dde-b5ac-264b3e3b7889","resolution":{"observed_at":"2026-05-18T11:11:19.548210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"34754c9d-98bb-41b0-bbfc-870f90af4448","year":2000},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:126eb5646ba071999b6b2bdb7bd24bd36868b10a67126102c18c16e160416099","observation_id":"4b9fd755-9b88-476b-a961-3940243a51a6","resolution":{"observed_at":"2026-05-18T11:11:19.545184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2000 United States presidential election","venue":null,"work_id":"43b7b005-3fbb-4cda-b3ce-9cbf435c44c6","year":2000},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:17291acce7b917a3a1b6839211c6c1b7a3df0e1e12131a921d64919870d617d2","observation_id":"5cde93b6-9a10-4745-ac71-4d3423110213","resolution":{"observed_at":"2026-05-18T11:11:19.542039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6af74ab1-eb93-4c1d-9bb1-59ed874c0227","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:e6d7892d32b88e20e79b62bc879e99477dcbd73fec8698bd1adc02d14129bed3","observation_id":"85f81e82-0e57-45d9-9f79-04b8edf5d734","resolution":{"observed_at":"2026-05-18T11:11:19.538728Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Road to City A","venue":null,"work_id":"cb641494-265e-461c-85c9-f5a465b0627e","year":2004},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:3b47fb48ded1f37ae414ffef9ef952d9ac347f999cdf38d9605498b66a732432","observation_id":"dd1a9eef-1cf8-4720-9041-18fb7cfb327c","resolution":{"observed_at":"2026-05-18T11:11:19.535731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"88ec8755-a3a7-439d-8b96-9f5ad8f6c35d","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:f6c9dbe03cb263b891b44afff4f3c54568f73a944cbbe061ee8847c5ba0bab33","observation_id":"64a24498-bd34-43d6-b6fc-506052223298","resolution":{"observed_at":"2026-05-18T11:11:19.532864Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"58bd07e3-1129-4d67-bb2b-06815dcad014","year":2004},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:9468f8734098bffb59283f1cc2a7726c4a41d3004e77e406d2840bf0d635dab4","observation_id":"328b5363-f98b-455a-bbe3-ad99969e0847","resolution":{"observed_at":"2026-05-18T11:11:19.529707Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7785ff40-7b5b-49f3-9288-03d37cedec06","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:123d4a24776e1e488d70e4cd22c6f0a59cb7e1ee1e3a3c1a6f8a4e6a19f114f1","observation_id":"7196d4c6-5fbc-4f3f-b2d9-96cbf2ecca96","resolution":{"observed_at":"2026-05-18T11:11:19.526152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"United Ireland","venue":null,"work_id":"28c6302f-fcd1-4fea-b0d2-8bd870b1c114","year":1921},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:df283cd49e773a93ad980ab3cef6fe92c6d6b11acb694c68376e21017f6995f6","observation_id":"797c1711-0cea-4ed9-90e4-b2fa7466ba50","resolution":{"observed_at":"2026-05-18T11:11:19.522849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a0c09e3c-e4a0-4fc4-8354-39817bddd307","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:6ff4a049893f3eb081f5676c1c21a685e6cdc218268ce5bfe317da1cb4dacfd8","observation_id":"7d2c87a5-e121-4030-bd6d-8ae05be7f180","resolution":{"observed_at":"2026-05-18T11:11:19.519527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bdfed0d2-abf0-40a1-b09e-a50eb0e9d28f","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:39e848ede840b184e46047752ffbe25becb4295f8fb19d42d27148dc8887e1f9","observation_id":"4c45e757-b749-48e5-a58c-5aa20c3bdbdc","resolution":{"observed_at":"2026-05-18T11:11:19.516512Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"75277447-07bb-4c2b-822e-549b078b7ef6","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:64187e1353d9949bcd85ffeb1db971cf182296cd03f0153ccde62939845fe704","observation_id":"d8136fd6-12d1-41ae-968e-f8d2ab9a1ae0","resolution":{"observed_at":"2026-05-18T11:11:19.513734Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wellesley, Massachusetts","venue":null,"work_id":"673147a8-fc55-43c3-98dd-31808bcfa3e1","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:caf28f67e1f3498d3496c38335166d4c591d16f4ecc514e8cf6ddaa8c268ad22","observation_id":"07d7e813-ed85-492b-8c12-d29872e7d3d5","resolution":{"observed_at":"2026-05-18T11:11:19.510816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"America-Lite: How Imperial Academia Dismantled Our Culture","venue":null,"work_id":"b6f01d63-10db-44ff-afa6-9ab8f9572bb7","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:75d1794ceed1fc1e52a7704b902738c56f495bf73755b89d2e0944f379522320","observation_id":"d7b0447c-48a2-4d76-bbe0-fa9fe1acf184","resolution":{"observed_at":"2026-05-18T11:11:19.507430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"921aa96b-8ce0-44cc-8467-9eae140f0e98","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:6b384e5a852637667677bf06f2354c83943a9d06ea0f73c2b81ea7e628627d1c","observation_id":"3f2b3fca-d731-4c3e-ad07-55bed299e683","resolution":{"observed_at":"2026-05-18T11:11:19.492882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"America-Lite: How Imperial Academia Dismantled Our Culture","venue":null,"work_id":"488fd24b-b6f4-43b2-b643-70c2b0480247","year":2012},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:6b7ea1e5e007ed4244f0a3ce46cbae2facd81a0813fcbf83e5687f3756f71de0","observation_id":"5f618c56-0c51-4b4a-b9ac-de7542f3eeaa","resolution":{"observed_at":"2026-05-18T11:11:19.504476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"13f3210b-8634-4c9b-91d1-3200bcf0fb7d","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:be0a10a1d5d82c130c4a4a0fcb273b0fa4b90e84d7b7af31243d32b66986019d","observation_id":"d726adbd-7e76-4b45-a3d1-8108faa3e0ce","resolution":{"observed_at":"2026-05-18T11:11:19.501551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4486e9aa-4b8f-48ae-8d64-14481731da4f","year":null},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:d7b69222f4b94a5ea0e0c745b8f38b3c725051b1a47f06ec93a352ebf8455b5a","observation_id":"2ea9bbe0-ebb7-4283-b316-cd37dc099432","resolution":{"observed_at":"2026-05-18T11:11:19.486514Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Mystic Masseur","venue":null,"work_id":"f21449c6-7571-4ac5-b07a-f9cb27052b46","year":2001},"citing_paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-18T11:06:20.058342Z"},"links":{"citing_paper":"/paper/2510.00861"},"observation_digest":"sha256:93e73b555e7fdb47d154c253786fc549a36e8febcc4d8676b0504410892607a5","observation_id":"16734296-2cec-4cde-abac-d3c34c3e7138","resolution":{"observed_at":"2026-05-18T11:11:19.498835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2510.00861","last_updated":"2026-04-20T08:17:44Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T13:10:36Z","title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":13,"verified_exact":35,"verified_fuzzy":25},"total_outbound_references":74},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 1 inbound Pith citation observation for arXiv:2510.00861."}