{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LARF65ZUUHCAO7SL7LVFYV6KDC","short_pith_number":"pith:LARF65ZU","schema_version":"1.0","canonical_sha256":"58225f7734a1c4077e4bfaea5c57ca18b302700adf77f7687103a3bf6efa5ee7","source":{"kind":"arxiv","id":"2508.16438","version":4},"attestation_state":"computed","paper":{"title":"OPERA: A Reinforcement Learning--Enhanced Orchestrated Planner-Executor Architecture for Reasoning-Oriented Multi-Hop Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Cong Cao, Fangfang Yuan, Jianjun Li, Kun Peng, Weizhuo Chen, Yanbing Liu, Youbang Sun, Yu Liu, Zhiyuan Ma","submitted_at":"2025-08-22T14:50:26Z","abstract_excerpt":"Recent advances in large language models (LLMs) and dense retrievers have driven significant progress in retrieval-augmented generation (RAG). However, existing approaches face significant challenges in complex reasoning-oriented multi-hop retrieval tasks: 1) Ineffective reasoning-oriented planning: Prior methods struggle to generate robust multi-step plans for complex queries, as rule-based decomposers perform poorly on out-of-template questions. 2) Suboptimal reasoning-driven retrieval: Related methods employ limited query reformulation, leading to iterative retrieval loops that often fail t"},"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.16438","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-08-22T14:50:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d168cdb6c5e9820cf709be1f6782b46e6deb1a524856effb13e982efb451e0a5","abstract_canon_sha256":"63b4f02ae8e444142e788a2087ac88d85e8fa8454a48958e98661bebeb651c90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:53.439827Z","signature_b64":"h1OV0IgzURpT9do3xMW8768YsRbXYMzHT+UD87S4bmuqymtoQPRaGPXaO1YzZqgHYoWd5H2bDwUJMkosGUqbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58225f7734a1c4077e4bfaea5c57ca18b302700adf77f7687103a3bf6efa5ee7","last_reissued_at":"2026-05-20T00:02:53.438959Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:53.438959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OPERA: A Reinforcement Learning--Enhanced Orchestrated Planner-Executor Architecture for Reasoning-Oriented Multi-Hop Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Cong Cao, Fangfang Yuan, Jianjun Li, Kun Peng, Weizhuo Chen, Yanbing Liu, Youbang Sun, Yu Liu, Zhiyuan Ma","submitted_at":"2025-08-22T14:50:26Z","abstract_excerpt":"Recent advances in large language models (LLMs) and dense retrievers have driven significant progress in retrieval-augmented generation (RAG). However, existing approaches face significant challenges in complex reasoning-oriented multi-hop retrieval tasks: 1) Ineffective reasoning-oriented planning: Prior methods struggle to generate robust multi-step plans for complex queries, as rule-based decomposers perform poorly on out-of-template questions. 2) Suboptimal reasoning-driven retrieval: Related methods employ limited query reformulation, leading to iterative retrieval loops that often fail t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16438","kind":"arxiv","version":4},"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.16438/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.16438","created_at":"2026-05-20T00:02:53.439105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16438v4","created_at":"2026-05-20T00:02:53.439105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16438","created_at":"2026-05-20T00:02:53.439105+00:00"},{"alias_kind":"pith_short_12","alias_value":"LARF65ZUUHCA","created_at":"2026-05-20T00:02:53.439105+00:00"},{"alias_kind":"pith_short_16","alias_value":"LARF65ZUUHCAO7SL","created_at":"2026-05-20T00:02:53.439105+00:00"},{"alias_kind":"pith_short_8","alias_value":"LARF65ZU","created_at":"2026-05-20T00:02:53.439105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC","json":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC.json","graph_json":"https://pith.science/api/pith-number/LARF65ZUUHCAO7SL7LVFYV6KDC/graph.json","events_json":"https://pith.science/api/pith-number/LARF65ZUUHCAO7SL7LVFYV6KDC/events.json","paper":"https://pith.science/paper/LARF65ZU"},"agent_actions":{"view_html":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC","download_json":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC.json","view_paper":"https://pith.science/paper/LARF65ZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16438&json=true","fetch_graph":"https://pith.science/api/pith-number/LARF65ZUUHCAO7SL7LVFYV6KDC/graph.json","fetch_events":"https://pith.science/api/pith-number/LARF65ZUUHCAO7SL7LVFYV6KDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC/action/storage_attestation","attest_author":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC/action/author_attestation","sign_citation":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC/action/citation_signature","submit_replication":"https://pith.science/pith/LARF65ZUUHCAO7SL7LVFYV6KDC/action/replication_record"}},"created_at":"2026-05-20T00:02:53.439105+00:00","updated_at":"2026-05-20T00:02:53.439105+00:00"}