{"as_of":"2026-08-07T05:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68e749e40d770bf5f19aa64312cfdee4bfb17f50721433c22f488e0e80b3ac40","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:12:12.793725Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:00:11.440671Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T22:32:44.029593Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.09303","snapshot_observed_at":"2026-08-05T16:00:11.440671Z","title":"arXiv preprint arXiv:2508.09303","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:00:11.440671Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2508.19113"},"observation_digest":"sha256:dde85f63167c2a22bc3a24d73a9a588fb2368975cee8cdb52cf939826e41c788","observation_id":"66d5ae84-a72a-457b-a78b-f5679185acc6","resolution":{"observed_at":"2026-08-05T16:00:11.440671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"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":"2512.07461","last_updated":"2026-05-14T12:43:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-12-08T11:39:43Z","title":"Native Parallel Reasoner: Reasoning in Parallelism via Self-Distilled Reinforcement Learning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T01:11:26.411893Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2512.07461"},"observation_digest":"sha256:e633eeefa9ae8a4315c50a017cdad6613354185a3b1c5d0015c605817c54cb84","observation_id":"5d40a41f-8c7f-4ca1-bec9-e8442c3461bc","resolution":{"observed_at":"2026-05-17T01:13:47.974701Z","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.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":"2605.06285","last_updated":"2026-05-07T13:56:13Z","snapshot_observed_at":"2026-07-06T23:18:46.145104Z","submitted_at":"2026-05-07T13:56:13Z","title":"LatentRAG: Latent Reasoning and Retrieval for Efficient Agentic RAG","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-08T10:27:00.257353Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2605.06285"},"observation_digest":"sha256:b3d2190772c7431944959ead20a189ffa7601aa1ed1bf08ab3735be08162c27f","observation_id":"e0200f79-ff96-474c-947e-e6565d15f8f8","resolution":{"observed_at":"2026-05-11T20:01:12.210309Z","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.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":"2605.07177","last_updated":"2026-05-11T11:21:13Z","snapshot_observed_at":"2026-08-03T10:59:43.380213Z","submitted_at":"2026-05-08T03:16:08Z","title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-11T01:28:36.266167Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2605.07177"},"observation_digest":"sha256:eb465e2bb0b89d79ab9fb06a09e1e1a64f1b17e39a7b6b6607d66e1f666a08cf","observation_id":"4ea68c04-6587-46e0-964f-045f83cba423","resolution":{"observed_at":"2026-05-11T01:45:52.310629Z","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.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":"2605.07177","last_updated":"2026-05-11T11:21:13Z","snapshot_observed_at":"2026-08-03T10:59:43.380213Z","submitted_at":"2026-05-08T03:16:08Z","title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-12T03:18:01.006274Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2605.07177"},"observation_digest":"sha256:0b1a09103d195925e9b2f80ea2504d092f7c13f41321cc2f87ba66c57d6ab1b4","observation_id":"b5213207-8b55-42ad-bdcb-e74528680afa","resolution":{"observed_at":"2026-05-12T03:21:19.032968Z","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.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":"2605.30824","last_updated":"2026-05-29T04:18:55Z","snapshot_observed_at":"2026-08-04T19:06:24.801521Z","submitted_at":"2026-05-29T04:18:55Z","title":"Planner-Centric Reinforcement Learning for Deep Research with Structure-Aware Reward","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T22:30:00.735630Z"},"links":{"cited_paper":"/paper/2508.09303","citing_paper":"/paper/2605.30824"},"observation_digest":"sha256:b42e1220d16af0767fe894dd06cb3f29990c1423dc00b04918f7f861accdd625","observation_id":"c1b3fcab-7c07-4700-a910-7f540d833870","resolution":{"observed_at":"2026-06-28T22:32:44.031157Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.09303/citation-record","integrity":"/paper/2508.09303/integrity","json":"/paper/2508.09303/citation-record.json","paper":"/paper/2508.09303"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-05T21:12:10.149968Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.149968Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:6381f0491b33b315777634fff2062c64d5a816f6dd3ca050f328c23055b50d14","observation_id":"7f254660-1248-4545-8767-f6d6303d4f1e","resolution":{"observed_at":"2026-08-05T21:12:10.149968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:17.489147Z","title":"Back to basics: Revisiting reinforce-style optimization for learning from human feedback in llms","venue":null,"work_id":"dcdfb236-c71a-4e10-b90f-f54a93490007","year":2024},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.265720Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:e9a27b500baa512d2e5a16863273e1d879aacd308de5f62f8aff5760843e62dd","observation_id":"61f23d39-ef57-499b-bc83-f6391a3f148f","resolution":{"observed_at":"2026-08-05T21:12:17.666111Z","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-08-05T21:12:17.251439Z","title":"A review of factors influencing user satisfaction in information retrieval","venue":null,"work_id":"5dfbae27-83e9-495e-9f7c-3957a17fef9d","year":2010},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.330610Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:c6540d2022027afb90d0f09d79a74e25c029a16f1512b882397f1c3f4a7bf5fd","observation_id":"60debba3-24aa-4666-9f1f-d21fd3254f03","resolution":{"observed_at":"2026-08-05T21:12:17.330163Z","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":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-05T21:12:10.409056Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.409056Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:1d42d58d8a7560e987ccdf619803ad2acbc255d676746f313f759016f49f28f1","observation_id":"9cf214fc-bd03-4f87-b810-6759d0682650","resolution":{"observed_at":"2026-08-05T21:12:10.409056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T21:12:10.477639Z","title":"Retrieval-augmented generation for large language models: A survey","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.477639Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:eab00e6d03aaa7bb03714b0e080c2f96d721e47e8bfd73cad6734927029cbfec","observation_id":"926ad8e5-0928-40fc-98fd-ff6f831f0d3b","resolution":{"observed_at":"2026-08-05T21:12:10.477639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T21:12:10.565175Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.565175Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:9ddbecb1a21fd30ba02688a2354d04d60a7e7da28393c04eb2f75e443fc3a06a","observation_id":"2e51088c-9156-452a-8866-ac64a9521b25","resolution":{"observed_at":"2026-08-05T21:12:10.565175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:16.986480Z","title":"Retrieval augmented language model pre-training","venue":null,"work_id":"b3f9348a-fcfa-428d-8161-114f806e5685","year":2020},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.645837Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:8648d09f96cb0775cfac206e27e6d6e3298f9425d64cdbd1c8a545e3cfbeedf4","observation_id":"6ab708f3-dc0f-46a0-8c7d-86458547d365","resolution":{"observed_at":"2026-08-05T21:12:17.102872Z","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-08-05T21:12:16.749389Z","title":"Constructing A multi-hop QA dataset for comprehensive evaluation of reasoning steps","venue":null,"work_id":"e728ceae-0266-4aa6-81c4-ab2199b17fe2","year":2020},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.710959Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:b70fd3c785a595bbf912ecab7b0f6078be4eea16414e04b39aa362dd7d8865be","observation_id":"26e37146-a3b6-4175-ba2c-26680d9e7982","resolution":{"observed_at":"2026-08-05T21:12:16.861437Z","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-08-05T21:12:16.480138Z","title":"ORPO: monolithic preference optimization without reference model","venue":null,"work_id":"1e67cef8-20b1-4d53-b0c8-afc3a6ca76e7","year":2024},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.741836Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:a23d839a53ab4c4cc36e2678bf6eb82a67a1f033fb5a2051fd3b7ea8347f8110","observation_id":"c7e6ef23-f227-443f-aa1e-de78ad7f9904","resolution":{"observed_at":"2026-08-05T21:12:16.593997Z","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-08-05T21:12:16.229462Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":"4272529a-8199-4e03-a146-bf9b6b6f7f48","year":2023},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.773407Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:a805e7d5203173dd0c70c0c5131e54ef4ac3b4b796b6c1c5b378887eebfdeaa2","observation_id":"7a300d47-82ef-406e-89b7-5e75e66634e9","resolution":{"observed_at":"2026-08-05T21:12:16.354547Z","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-08-05T21:12:15.973987Z","title":null,"venue":null,"work_id":"cead83ff-dda1-46d8-ac50-243be2bef252","year":2025},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.826331Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:933318daf7c8c94c09561442ba11506a0c1a8436d9ecf8fa53879fd996dfdf25","observation_id":"afe7e04b-abae-4a2b-96fd-ebc3a778285c","resolution":{"observed_at":"2026-08-05T21:12:16.098728Z","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":{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09516","snapshot_observed_at":"2026-08-05T21:12:10.890698Z","title":"Search-r1: Training llms to reason and leverage search engines with reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.890698Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:018103dbc6109b1f2323ca220b74b9f241deb5ab24dafbde0b51f8275676d183","observation_id":"d6e171a5-39d2-41d1-aa9d-37d2404192fc","resolution":{"observed_at":"2026-08-05T21:12:10.890698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:15.783004Z","title":"Weld, and Luke Zettlemoyer","venue":null,"work_id":"fabdd236-cef0-4012-ab85-482149046bb7","year":2017},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:10.958980Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:75adc4854781e90b61ce95d42fc6bf31bb5f4ec046e708ee815fc9449fbf247c","observation_id":"2aa8d116-1426-4df6-b0c9-70faad697aa7","resolution":{"observed_at":"2026-08-05T21:12:15.848643Z","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-08-05T21:12:15.661189Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":"a4e763cb-ba81-4727-bd7c-952f763b15e4","year":2020},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.008903Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:13e338ad646e99ac80cee6de727b37e719d1bd2584e3e00fcca88c76543f0280","observation_id":"38f07e05-e737-479d-8b23-f5f8e54beeb0","resolution":{"observed_at":"2026-08-05T21:12:15.722055Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:11.064527Z","title":"A survey of reinforcement learning from human feedback","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.064527Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:412a97876dd2233a97283acbaf375aa3f73444d2ed5f13afe9349d32e49d8615","observation_id":"85cf4b4f-2a8f-42ac-ac19-09a0614378ef","resolution":{"observed_at":"2026-08-05T21:12:11.064527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:15.509531Z","title":"Parikh, Chris Alberti, Danielle Epstein, Illia Polosukhin, Jacob Devlin, Kenton Lee, Kristina Toutanova, Llion Jones, Matthew Kelcey, Ming - Wei Chang, Andrew M","venue":null,"work_id":"71d07aea-ef35-434b-b67f-c411107c7eb6","year":2019},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.160381Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:7344d6955318c82c079d58558936026381687fff113d0da5b7f4a5d268e43e94","observation_id":"499862f2-3f98-46d6-9e1f-15841e55680a","resolution":{"observed_at":"2026-08-05T21:12:15.594794Z","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-08-05T21:12:15.379580Z","title":"Miranda, Bill Yuchen Lin, Khyathi Raghavi Chandu, Nouha Dziri, Sachin Kumar, Tom Zick, Yejin Choi, Noah A","venue":null,"work_id":"2d6a86f5-610d-41df-a140-c00e49b05da4","year":2025},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.216923Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:65339b5bfe51b3442980f643d5626999e8377977d5ee8bd724f53bf005d0c289","observation_id":"3733b631-9114-4e2c-bd79-634a9bc85621","resolution":{"observed_at":"2026-08-05T21:12:15.477053Z","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-08-05T21:12:15.211112Z","title":"Large language models in finance: A survey","venue":null,"work_id":"a995c86b-6f92-42aa-9c14-c74cbee6898f","year":2023},"citing_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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.274785Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:db9f72fad63af519c4f92a88e14d05f2ff33de1b80c54151b673eec248121727","observation_id":"76aff35a-0537-44c0-b9bd-34f2948e9609","resolution":{"observed_at":"2026-08-05T21:12:15.303679Z","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-08-05T21:12:15.076230Z","title":"When not to trust language models: Investigating effectiveness of parametric and non-parametric memories","venue":null,"work_id":"3e39347a-49de-4ebd-aa0d-4dcbd4f8faa6","year":2023},"citing_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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.328199Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:6b3aaa498ae86f264e72d7738963e3170a9479fe6ecdb9f9e407e4f3c52e1d11","observation_id":"40799862-6eab-41dd-9159-cb04c7eeef93","resolution":{"observed_at":"2026-08-05T21:12:15.155608Z","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.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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16582","snapshot_observed_at":"2026-08-05T21:12:11.380262Z","title":"O2-searcher: A searching-based agent model for open-domain open-ended question answering","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.380262Z"},"links":{"cited_paper":"/paper/2505.16582","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:68cfb92230b11d624991d6970ea37baa163c6c190cdc1ab19914ee18b662051a","observation_id":"db71740e-3dcd-4e2e-9a94-e4126188259d","resolution":{"observed_at":"2026-08-05T21:12:11.380262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:14.927331Z","title":"Simpo: Simple preference optimization with a reference-free reward","venue":null,"work_id":"ec845ea4-7207-458a-9793-c09bc1a2945c","year":2024},"citing_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},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.469102Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:2cee75515154ca9316a526ff34d4d843de9e01a32a9a758915bc14f291d1f004","observation_id":"dd37ca0f-46cc-4136-87e3-e5f3dc0f416d","resolution":{"observed_at":"2026-08-05T21:12:14.987611Z","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-08-05T21:12:14.708408Z","title":null,"venue":null,"work_id":"2b88609f-45d3-4463-ae03-c82e562cd044","year":2022},"citing_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},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.531717Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:5933597b89ffac3b2018edbe4b2af0fe7c9f4e15ffbf9e137e32a19a9af58afc","observation_id":"d2c768b6-3469-4726-a7d1-178707bc66ec","resolution":{"observed_at":"2026-08-05T21:12:14.854532Z","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-08-05T21:12:14.557114Z","title":"Iterative reasoning preference optimization","venue":null,"work_id":"69ec2766-4a43-4c01-8009-e2c20238c7af","year":2024},"citing_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},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.614989Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:530a2bccadc86be5cc2ba667f1b62d86dfff80fa0acf7baf5e7aa45b353c2ce8","observation_id":"c510312e-8ad1-4642-9804-b8d81dcab088","resolution":{"observed_at":"2026-08-05T21:12:14.620173Z","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-08-05T21:12:14.381509Z","title":"Smith, and Mike Lewis","venue":null,"work_id":"f478c473-1cd3-4164-a8bf-0830a116031f","year":2023},"citing_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},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.660534Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:77a192c5d90c7c1ad595983e6346d6fd9aec39757e507b3e7695e3d04c3a2dc4","observation_id":"88087109-df13-4f68-9096-5b191e5b10e7","resolution":{"observed_at":"2026-08-05T21:12:14.444756Z","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-08-05T21:12:14.185757Z","title":"Manning, Stefano Ermon, and Chelsea Finn","venue":null,"work_id":"e60d2c26-7f05-4b5b-b79d-10f71539bab9","year":2023},"citing_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},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.710877Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:044f28f37efc8b067d5322f523bb7d034fab2be335a1cb87e0ab693d61e1b118","observation_id":"0f20ea70-41b3-4e1d-ad52-84df737196e9","resolution":{"observed_at":"2026-08-05T21:12:14.294887Z","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-08-05T21:12:14.009572Z","title":"Toolformer: Language models can teach themselves to use tools","venue":null,"work_id":"6c46fadb-f988-4db1-939d-949fa13bec58","year":2023},"citing_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},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.771234Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:c37fda7f4b5e474b3dba14fdcfe8341e05fc600e4d85ad50cfff4c67f803fccd","observation_id":"9fe1ab6b-48d0-449b-8029-bcf0917ca917","resolution":{"observed_at":"2026-08-05T21:12:14.082981Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T21:12:11.811800Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.811800Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:fc790f49fa1dc9dc401b7f359870741aefbea38a7038cf1474d8f56e18300698","observation_id":"81d2ab38-8b65-413e-8d7a-fe17069685e5","resolution":{"observed_at":"2026-08-05T21:12:11.811800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10947","last_updated":"2026-02-25T01:06:05Z","snapshot_observed_at":"2026-07-30T09:54:40.100382Z","submitted_at":"2025-06-12T17:49:55Z","title":"Spurious Rewards: Rethinking Training Signals in RLVR","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10947","snapshot_observed_at":"2026-08-05T21:12:11.863783Z","title":"Spurious rewards: Rethinking training signals in rlvr","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.863783Z"},"links":{"cited_paper":"/paper/2506.10947","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:88c55161bb7ad2773e52429371ad7aea0787f81897fd26bfeaf6dae130dd02eb","observation_id":"2adda67e-b61d-4bfa-a97b-07329c450e82","resolution":{"observed_at":"2026-08-05T21:12:11.863783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04588","snapshot_observed_at":"2026-08-05T21:12:11.902466Z","title":"Zerosearch: Incentivize the search capability of llms without searching","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.902466Z"},"links":{"cited_paper":"/paper/2505.04588","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:299a68d59f1c7d1ec30127a5753188af3dc96b1b39a50d3d3066809021fbb85b","observation_id":"64186f76-6f6c-4130-a97c-02440d495a05","resolution":{"observed_at":"2026-08-05T21:12:11.902466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:13.872314Z","title":"Sutton and Andrew G","venue":null,"work_id":"dd6737c4-7cca-41cc-b564-d86e3a778318","year":1998},"citing_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},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:11.938138Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:3ce1a583b8e1f52dd5e5e42b74fcdf99d30bed5b429e8334f1ee4a6f809b09af","observation_id":"f3fca3a1-431d-40fe-a749-5676a5df1ae8","resolution":{"observed_at":"2026-08-05T21:12:13.926922Z","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-08-05T21:12:13.748722Z","title":"Multihop- RAG : Benchmarking retrieval-augmented generation for multi-hop queries","venue":null,"work_id":"e266e21c-08c0-4195-9387-909a1181efe8","year":2024},"citing_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},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.022501Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:d066d990f45b7826fcaa68efa64cd843fe6164e81bb4824bd21b551387979b0f","observation_id":"6d2d5a50-a4e4-4e37-bc26-1ccd91cc38aa","resolution":{"observed_at":"2026-08-05T21:12:13.800825Z","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.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-05T21:12:12.111745Z","title":"Gemini: a family of highly capable multimodal models","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.111745Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:f2423dbfcc6df2cd196fe7e387c1e65ba40a2480c34c4a41a838a39e75083946","observation_id":"0b75f438-f758-478e-99dc-a32f4f18f262","resolution":{"observed_at":"2026-08-05T21:12:12.111745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:13.605661Z","title":"Musique: Multihop questions via single-hop question composition","venue":null,"work_id":"4e231bed-db7a-44fe-98ce-dc61bd58f40c","year":2022},"citing_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},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.171420Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:7d1f914dc8733e2c4ef6684f0763e43ab0ba49a34074b9a123420e55a99c0175","observation_id":"2a37d315-32e8-4778-82d9-7287715f7736","resolution":{"observed_at":"2026-08-05T21:12:13.698662Z","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-08-05T21:12:13.439633Z","title":"Interleaving retrieval with chain-of-thought reasoning for knowledge-intensive multi-step questions","venue":null,"work_id":"9443d1d6-53fd-4cc3-96f3-7190dd2fb237","year":2023},"citing_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},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.220676Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:be99ef688c1b14c60f7e3ba20479568eef7cca2de3c450dc59d48503e674c89b","observation_id":"c3f928e5-172d-4496-8e0e-f6a3ea73ec76","resolution":{"observed_at":"2026-08-05T21:12:13.509777Z","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.14870","last_updated":"2025-05-31T20:08:42Z","snapshot_observed_at":"2026-08-05T00:14:13.012902Z","submitted_at":"2025-04-21T05:40:05Z","title":"Acting Less is Reasoning More! Teaching Model to Act Efficiently","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14870","snapshot_observed_at":"2026-08-05T21:12:12.308929Z","title":"Acting less is reasoning more! teaching model to act efficiently","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.308929Z"},"links":{"cited_paper":"/paper/2504.14870","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:a4acb93814df45e847993eeefc6d852c14c2eb9869483385fc45d96ec3284216","observation_id":"d89a6b42-e2b5-4355-8559-36edbc6133c3","resolution":{"observed_at":"2026-08-05T21:12:12.308929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-05T21:12:12.389009Z","title":"Text embeddings by weakly-supervised contrastive pre-training","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.389009Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:6e440a4c411a3277c06f70be4e8b8382b16f93bde29b6f4b293095615219dec4","observation_id":"8cdbb16b-0648-4682-840d-c6757cefeb33","resolution":{"observed_at":"2026-08-05T21:12:12.389009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15107","last_updated":"2025-05-26T04:44:21Z","snapshot_observed_at":"2026-08-07T01:41:10.026662Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15107","snapshot_observed_at":"2026-08-05T21:12:12.451731Z","title":"Stepsearch: Igniting llms search ability via step-wise proximal policy optimization","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.451731Z"},"links":{"cited_paper":"/paper/2505.15107","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:3366ce5bd706510f1bcaf1bdbc3f5bd7e24d4ca960d00fdce9eddae2946b5a02","observation_id":"82c3f128-cd6b-4ca1-b174-dfc382795218","resolution":{"observed_at":"2026-08-05T21:12:12.451731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:12.500175Z","title":"Reasoning or memorization? unreliable results of reinforcement learning due to data contamination","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.500175Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:e535d6eaea5b0e75a20a8343063493810d8005a751d8cfaf1292c36114aca483","observation_id":"84dd0aec-2dac-43c6-b372-30f4b55a0925","resolution":{"observed_at":"2026-08-05T21:12:12.500175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20285","snapshot_observed_at":"2026-08-05T21:12:12.567646Z","title":"Masksearch: A universal pre-training framework to enhance agentic search capability","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.567646Z"},"links":{"cited_paper":"/paper/2505.20285","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:ca7bd1f4887c7dc2512ce636df4d14573b3234790dd38ab3001925ce20dc9999","observation_id":"dc6a072b-c9c2-460c-8d00-ee5ef2d0a98b","resolution":{"observed_at":"2026-08-05T21:12:12.567646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-05T21:12:12.658091Z","title":"Qwen2.5 technical report","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.658091Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:f443ae46d258cc6776ee027f8f5f1e430e0e07ab6ef6dc64a8b25b521c543095","observation_id":"8b525432-1de0-4413-ac36-c9212bd25ad7","resolution":{"observed_at":"2026-08-05T21:12:12.658091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:12:13.329617Z","title":"Cohen, Ruslan Salakhutdinov, and Christopher D","venue":null,"work_id":"fac999f7-07c1-476c-b9a3-804007211541","year":2018},"citing_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},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.715033Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:2ec4f9b51c8ba7684d659a03afbdb3cf4b9896b8914307e408e06011fa250705","observation_id":"64153c56-4968-433a-b4d7-a68af4fd5931","resolution":{"observed_at":"2026-08-05T21:12:13.389477Z","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-08-05T21:12:13.166433Z","title":"Narasimhan, and Yuan Cao","venue":null,"work_id":"ff1ae928-cd52-47a9-8eab-e08f92b243d2","year":2023},"citing_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},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.760593Z"},"links":{"citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:2a0b3649a5694404ecf3a7d0801866c83ef0e1afdf0c50c3c1fa06c49f1bde19","observation_id":"549c28d9-061a-40bb-a086-9bd47816549a","resolution":{"observed_at":"2026-08-05T21:12:13.239715Z","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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.04185","snapshot_observed_at":"2026-08-05T21:12:12.793725Z","title":"R-search: Empowering llm reasoning with search via multi-reward reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T21:12:12.793725Z"},"links":{"cited_paper":"/paper/2506.04185","citing_paper":"/paper/2508.09303"},"observation_digest":"sha256:40e0ce1bbfc0cbc1bf15c8f5ead0cc73df43362e94aafba256c20920073e23cb","observation_id":"a035ada7-ce11-4bbb-8836-820e9b7b309f","resolution":{"observed_at":"2026-08-05T21:12:12.793725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.09303","last_updated":"2025-08-12T19:38:21Z","latest_version":1,"primary_category":"cs.CL","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"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":43},"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 7 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 7 inbound Pith citation observations for arXiv:2508.09303."}