{"as_of":"2026-08-10T12:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e092ebb9d26c18b3ce8c19b1da18b0b3a0e47e9d9af6ccc38949f5f3c2de4862","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-10T06:31:04.303077+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-07T12:04:31.853290Z","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:6370af8f1a9826fdca51451786038a1cd966ccf1775f65acfec4511c1f73502e","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-07T12:04:31.853290Z","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:c1a079025d50234c99e05c745be0a681066c2d9bfc086002141714e129b0045d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:ea6d425d372e103cfe5db4965eecb6c8c72ee17969f6c1f7e3ffcc17fa6714a8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:14dcd72a6dd824a284b1ae715ffbfbd148aa82f827b53af9372c17e210ab0872","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:1342f06d0ac6f9e9a4a51eaf19ad7b9094d86eb7cf939bd1f358c081e8ba2988","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:edb31a31c8c68d3e56ba1b5c8323535e55e55acda09ca26a337eca1f06ff5b94","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:4460dca020d440e3acb8c4383cebe86f8db61df368c65a6647ac224d968042e7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T07:30:12.213965Z","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-07T12:04:31.853290Z","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:75d6cd1c242f8a76a552cfd84871ddbff581301fb2f32ecefb3a0d695c82bc1c","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-07T12:04:31.853290Z","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:aa4de692fdb00cd5764a89269946e35072ff595960e3094dbfb22876ab8af597","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:b0e6f06aa8e5b2f26f5bcb9e866fd4a2bfc3217f3deb99b6c45046b384fea06a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:92a2d20a6aff7fd03244f738d3d402896f65e14f875a08b395c12133e56e75ca","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-07T12:04:31.853290Z","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:b7e32339e86a5d1839328e59e07439626a9a72cd2bce6438d80d390d66ff35be","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-07T12:04:31.853290Z","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:1997f56ba9496c9aa954c646de9040318f4ed55260e5b5084644441f34999efd","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-07T12:04:31.853290Z","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:4d6179abe1647f2a098808d3d1d9bf4439e5eddf32bb01d9b7de0fac40d88e53","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:59cc80e206b0e94d6505c78297adedbc58123dd6f54819b10024f4f95fc86b27","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:d211dd37de8fee6c984b3af3ec7826a6f05e081bbf7fb2194da85140adf88e5f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:28d0e5053384814e93ebfdbdf29e9f0dfb8549f2c5efa7a1c2a3c7f1d6af1b53","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:fa01b665164ada9cc88808edfff2f862f8a5cdebdd74e356835d7b7340d77493","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:c1c524c71f4a2e9cc3f34a706511b27402f1c5a64ec546fdc2dd92ab1d4fc3f9","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-07T12:04:31.853290Z","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:ca63fa65fa4ec50a09a8248479e4d023a53a823e478f1d37f661d49bb625eda3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:e0d7f851d9c22ab5d3fca520a851807ae773c044659e13e1a86f08429a30fb97","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:a592de5adee099b3500b0031ce4d38e8e45902161b86bce3b0e6b5183b1e3c2b","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-07T12:04:31.853290Z","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:5b14d5ee8fc57a5e32f512cc5c4b8c0f928aa2ec8dce6da3c79ca67e053dbe6f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:8575dc8c981cd72e077e712746493526cfda3c888879f44dafbcb59414f75b8d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:f7ede006d04343ceeb12db3af3ff3d90e31fb78b84a66ac8db96c384aaafe6c6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:8fd826f06e0ba02abb026866cb60c463cd91a9ad9d5577dec719e20211ab6783","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-08T23:24:39.055718Z","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-07T12:04:31.853290Z","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:719533bed0f42d7a1e9873d9168769b3d59c2aeba570436c9b4442d4cc9d5766","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-07T12:04:31.853290Z","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:73ff8d613d960b9b1beeafcc21e36565172b6ccb551a8b8edf92f3855d96bc53","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:6c81696b4380115651463961836cabc9d821ee82f3f21ce12c08e53c75abc89c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:c57d67514f41986c54efb03c94343455c1ecbe96b934e2a5f93b829fd0e076eb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:57a8d4615e42733892a749d5a1cf7c2c4d2c90634cb772d1bc5774360fd3cf95","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:f253f518854b63519b7a86cbb63ab99b65def1ab548e8b600f99b94087d2957c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:bc8d70599a064ea2276e8290bc27e12acdc313dc5f459e521b2ea1d1ff143e39","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:5d5f404032ca015f47b345e92a07dbc384d1668bfad701d71360e33c5365e176","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-08-10T11:02:14.031196Z","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-07T12:04:31.853290Z","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:1044d26d12a69eccbe483b836fd6c4a4d874bf50febd16dea3f24a604d1c2359","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-07T12:04:31.853290Z","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:260729ef3c43b8f811e958e79881c6e88504cb07d6bd9debdb3782a912d21305","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-07T12:04:31.853290Z","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:4ed7b329dc9eacf717eaebc5b56f1a736acc0552d46f37ada03fce1f4e18f727","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:2aae0248b595706e145aef60f352fa19320ee113c5fc0ee05597f745c3233391","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:00792b8fd50b0fbde77f527beeff82fb4cb030c4c7edd8f515f71ff8700d61f4","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-07T12:04:31.853290Z","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:69b3550c8289f9ed8b20511540fc277d4294a9bff8560480b9189d4f30396d42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:c4f5bc075aec2a304dbfc1e7c135d0104ba20bd00eb2e9b4887de33de73f7dc6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T11:52:33.198329Z","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-07T12:04:31.853290Z","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:1e0f9aa83352c1279e560352decf67129c4a6774cafd784fc1b40111d5a41db3","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-07T12:04:31.853290Z","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:9a5749a494649a28e01786eaf1321b15f0a8062baa3acf2ad309e16ab63d226c","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-07T15:21:40.079260Z","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-07T12:04:31.853290Z","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:acce070423a91356b05dbb245d7c9d647d7d4fd00141be99ce2a7519e73f8a80","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-07T12:04:31.853290Z","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:be926338a086e41425fcb7af48530ca38c61c85f9bd4712308565006cfddcd71","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-09T00:25:41.948655Z","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-07T12:04:31.853290Z","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:c3c076919d7657dbe1718a93393fcda77070bf78a2df9656e42d8df3515fec26","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-07T12:04:31.853290Z","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:e66fe2f0f244b1ca5de54b99ba1c580cbf93e6225cec29dc6a75824ec4fa9436","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-07T12:04:31.853290Z","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:db096ca32e68bef017b6c113fcd6393f2aaea9172e6a6e162966ca7afd1af79d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:04:31.853290Z","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:030956980d10478bf8b7332aad5bad2353da77ebeaa642c01e2fb44ab96e9b74","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-09T13:15:04.057332Z","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-07T12:04:31.853290Z","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:52fddf8b05252fdd1c7c3f135854a717044cba876e1f3c4224f4557e925880aa","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-07T12:04:31.853290Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 7 inbound Pith citation observations for arXiv:2508.09303."}