{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LSKGWY2INEABCNTQUHKIORPAPD","short_pith_number":"pith:LSKGWY2I","schema_version":"1.0","canonical_sha256":"5c946b63486900113670a1d48745e078d58b5814ca30f6cb24b52fbb54d485c9","source":{"kind":"arxiv","id":"2508.09303","version":1},"attestation_state":"computed","paper":{"title":"ParallelSearch: Train your LLMs to Decompose Query and Search Sub-queries in Parallel with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Aaditya Shukla, Anbang Xu, Japinder Singh, Rama Akkiraju, Shu Zhao, Tan Yu","submitted_at":"2025-08-12T19:38:21Z","abstract_excerpt":"Reasoning-augmented search agents such as Search-R1, trained via reinforcement learning with verifiable rewards (RLVR), demonstrate remarkable capabilities in multi-step information retrieval from external knowledge sources. These agents address the limitations of their parametric memory by dynamically gathering relevant facts to address complex reasoning tasks. However, existing approaches suffer from a fundamental architectural limitation: they process search queries strictly sequentially, even when handling inherently parallelizable and logically independent comparisons. This sequential bot"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.09303","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-12T19:38:21Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"eb0e1e5da6740c9eb8d1858dd5babd24811000ac70a9a11ae37a01fcaeabacb5","abstract_canon_sha256":"58177831f59abbd8df2856f2d4ad3dc8eae506714e352b7ba173ac6fc6fad2a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:12.136307Z","signature_b64":"VTGmep56EMA+60V7wknagHOaeM8vPhJOrx8sCVaqHy2V/Tk0FBYUVJEdBHX/TvlC0C+rhAGlKZjCD4nyQ0yGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c946b63486900113670a1d48745e078d58b5814ca30f6cb24b52fbb54d485c9","last_reissued_at":"2026-07-05T11:53:12.135726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:12.135726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ParallelSearch: Train your LLMs to Decompose Query and Search Sub-queries in Parallel with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Aaditya Shukla, Anbang Xu, Japinder Singh, Rama Akkiraju, Shu Zhao, Tan Yu","submitted_at":"2025-08-12T19:38:21Z","abstract_excerpt":"Reasoning-augmented search agents such as Search-R1, trained via reinforcement learning with verifiable rewards (RLVR), demonstrate remarkable capabilities in multi-step information retrieval from external knowledge sources. These agents address the limitations of their parametric memory by dynamically gathering relevant facts to address complex reasoning tasks. However, existing approaches suffer from a fundamental architectural limitation: they process search queries strictly sequentially, even when handling inherently parallelizable and logically independent comparisons. This sequential bot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09303","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.09303/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.09303","created_at":"2026-07-05T11:53:12.135826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09303v1","created_at":"2026-07-05T11:53:12.135826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09303","created_at":"2026-07-05T11:53:12.135826+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSKGWY2INEAB","created_at":"2026-07-05T11:53:12.135826+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSKGWY2INEABCNTQ","created_at":"2026-07-05T11:53:12.135826+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSKGWY2I","created_at":"2026-07-05T11:53:12.135826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30824","citing_title":"Planner-Centric Reinforcement Learning for Deep Research with Structure-Aware Reward","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2510.00861","citing_title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2512.07461","citing_title":"Native Parallel Reasoner: Reasoning in Parallelism via Self-Distilled Reinforcement Learning","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07177","citing_title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06285","citing_title":"LatentRAG: Latent Reasoning and Retrieval for Efficient Agentic RAG","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07177","citing_title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD","json":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD.json","graph_json":"https://pith.science/api/pith-number/LSKGWY2INEABCNTQUHKIORPAPD/graph.json","events_json":"https://pith.science/api/pith-number/LSKGWY2INEABCNTQUHKIORPAPD/events.json","paper":"https://pith.science/paper/LSKGWY2I"},"agent_actions":{"view_html":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD","download_json":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD.json","view_paper":"https://pith.science/paper/LSKGWY2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09303&json=true","fetch_graph":"https://pith.science/api/pith-number/LSKGWY2INEABCNTQUHKIORPAPD/graph.json","fetch_events":"https://pith.science/api/pith-number/LSKGWY2INEABCNTQUHKIORPAPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD/action/storage_attestation","attest_author":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD/action/author_attestation","sign_citation":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD/action/citation_signature","submit_replication":"https://pith.science/pith/LSKGWY2INEABCNTQUHKIORPAPD/action/replication_record"}},"created_at":"2026-07-05T11:53:12.135826+00:00","updated_at":"2026-07-05T11:53:12.135826+00:00"}