{"as_of":"2026-08-06T08:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:299dc23dcfc66866234e5836e25e06243defc7c76751f6494eb244a7961c71b5","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-14T20:03:33.411994Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.12975/citation-record","integrity":"/paper/2605.12975/integrity","json":"/paper/2605.12975/citation-record.json","paper":"/paper/2605.12975"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pathrag: Pruning graph-based retrieval augmented generation with relational paths","venue":null,"work_id":"cd70c5f3-52f2-4dd8-8e03-f154e0c5499d","year":2026},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:a9d95cf1dc7ab01eaf85e50269968e6698e0fb4d96e11912e42366d0d051ba38","observation_id":"4d1455cd-2358-486d-8a0d-3ca7b4c97dd3","resolution":{"observed_at":"2026-05-15T17:20:11.675416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19470","last_updated":"2025-09-23T03:45:42Z","snapshot_observed_at":"2026-07-06T20:58:19.305457Z","submitted_at":"2025-03-25T09:00:58Z","title":"ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2503.19470","doi":"10.48550/arxiv.2503.19470","metadata_source":"pith","pith_arxiv_id":"2503.19470","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learning","venue":"cs.AI","work_id":"cc9775d9-2fbd-4690-a641-2b50ae4a59dc","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2503.19470","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:34065168ece994a005c1a8fe90f885a1ec6315d3c557d23ff3fe2ff55d9f3466","observation_id":"e809aa83-59a1-4f70-bbb5-fd3b5d0dd777","resolution":{"observed_at":"2026-05-16T15:48:34.842623Z","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":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":"2211.12588","doi":"10.48550/arxiv.2211.12588","metadata_source":"pith","pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","venue":"cs.CL","work_id":"618aa44c-a6c6-425c-abce-8aa8aa842921","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:585fc984fd86d6fd6621ec0a32371ea54be95a4536a69650e8f605849dab02ca","observation_id":"ae562cd6-a511-4399-b227-d8bb3b34acb1","resolution":{"observed_at":"2026-05-14T20:07:54.267720Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02875","last_updated":"2023-03-01T03:21:40Z","snapshot_observed_at":"2026-08-05T15:39:35.472037Z","submitted_at":"2022-10-06T12:55:17Z","title":"Binding Language Models in Symbolic Languages","version":2},"cited_work":{"arxiv_id":"2210.02875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.02875","snapshot_observed_at":"2026-07-03T05:07:38.938825Z","title":"Smith, and Tao Yu","venue":null,"work_id":"f8fe6642-904b-44b0-a533-ae63c3a213e1","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2210.02875","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:8b5f0c7aeef4c69881c1c05aedfc4da3d21ec8f14b2f1f878eec86203fe1427b","observation_id":"2a0f2d58-e929-4209-898c-6e304842d0fd","resolution":{"observed_at":"2026-05-14T20:07:54.274918Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":"2404.16130","doi":"10.48550/arxiv.2404.16130","metadata_source":"pith","pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","venue":"cs.CL","work_id":"588618d7-fd41-4053-b34d-a981f8793039","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:6b4dbfde282d93fe298f7f49b936fb910f95f2760390f490732392c03a8e50ce","observation_id":"2a13464a-cf6e-4105-a714-90c975e25e3e","resolution":{"observed_at":"2026-05-14T20:07:54.372012Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on rag meeting llms: Towards retrieval-augmented large language models","venue":null,"work_id":"dfea5a55-87a8-47dc-845c-5a21ea5bc963","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:fc5490259ea1fb532676fa0c8a5682e1fcf3bb1ab1a59dea42a4c3125be56afc","observation_id":"f1b45943-2496-4d5d-9435-299d37ae7f2f","resolution":{"observed_at":"2026-05-15T17:20:11.665153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pal: Program-aided language models","venue":null,"work_id":"15cd69fe-a9e5-42f0-be82-d9623b3430d1","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:9d6a4fea0f9a8896e6c672d1d986bd5986e4b235b7294a2bec7b8352219d33f3","observation_id":"9975a92e-4211-48df-a95c-4a1d6ed3e9a4","resolution":{"observed_at":"2026-05-15T17:20:11.678970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":"2312.10997","doi":"10.1186/1476-072x-8-72","metadata_source":"pith","pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":"cs.CL","work_id":"b80d2790-6cd9-4c87-b3c4-de404f99a80e","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:4049251c03de8b83ff4893d570f3439fcc695d5c7242ba84c11cbfa3ce28c9be","observation_id":"7afa5ab3-4f43-4c49-af83-91a9b4d9f1a0","resolution":{"observed_at":"2026-05-14T20:07:54.337344Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:00f27d5dfdca0e1e3ebdbeef9733d7bc257a612e035e68b7eb0c245de06b9fd6","observation_id":"a558f558-8ce1-4f87-84da-3e1a8cdf075d","resolution":{"observed_at":"2026-05-14T20:07:54.254782Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hipporag: Neurobio- logically inspired long-term memory for large language models.Advances in neural information processing systems","venue":null,"work_id":"8220619d-cb03-4afe-9e7b-9b319ead07e4","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:40a269df4e6174b7ff579269704a8e9cb165f9944fbb5e4eed8366e8994d0621","observation_id":"8823cbc0-7c17-4a49-9f2b-202964108103","resolution":{"observed_at":"2026-05-15T17:20:11.652378Z","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":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":"2009.03300","doi":"10.48550/arxiv.2009.03300","metadata_source":"pith","pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Measuring Massive Multitask Language Understanding","venue":"cs.CY","work_id":"e87ec49a-544b-4ec8-8991-75298c64ff5e","year":2020},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:eec32943530b5d6567f527dc1a7e3aac92560ca8e4f77055fb46a211993f79ad","observation_id":"464fdb07-185f-4c04-b1e1-945879a08bd1","resolution":{"observed_at":"2026-05-14T20:07:54.248711Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-04T01:08:06.256034+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T01:08:06.256034+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Constructing a multi-hop question answering dataset for comprehensive evaluation of reasoning steps","venue":null,"work_id":"43b311a5-1a20-45a3-a2a4-79754d7aa0ac","year":2020},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:23fb267a75ba2ea1234fe2ee32a32696987a3d3f48ee8d094e016f487eed4b1f","observation_id":"1a2d8dc9-4fa2-4d58-8ff5-e4d9141a2c8b","resolution":{"observed_at":"2026-05-15T17:20:11.667757Z","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-07-05T17:51:15.063521Z","title":"LoRA: Low-rank adaptation of large language models","venue":null,"work_id":"086c733f-0d5d-4708-8d9f-66e1a10d4aa8","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:41e3ec4b28411a31aa04198fbd6b356c26bbaf6ba62300f437b40f11b022984b","observation_id":"fb105d82-d7b1-4333-8f58-d2a1c0069ba8","resolution":{"observed_at":"2026-05-15T17:20:11.683915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Da-code: Agent data science code generation benchmark for large language models","venue":null,"work_id":"d7e809cd-e746-4a58-96a2-a9b8f6051779","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:5ff39491cd107d5c97751d7d9589a3c025ed333bda0b76d0245c9ac6e4ca2fe6","observation_id":"752e40d3-1f0d-43a4-a2a5-4334315d0457","resolution":{"observed_at":"2026-05-15T17:20:11.701984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":"2409.12186","doi":"10.48550/arxiv.2409.12186","metadata_source":"pith","pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5-Coder Technical Report","venue":"cs.CL","work_id":"09ba463d-6377-4017-9801-444ffb94b056","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:22baa96df6cfd223d655fedd14d741eedf974fdb4692189a9182f4156ed359f9","observation_id":"11d62db1-9b4b-4bd8-b321-2e21425b38c6","resolution":{"observed_at":"2026-05-14T20:07:54.330427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Active retrieval augmented generation","venue":null,"work_id":"2024d591-6ef6-45a5-bba1-48f8a7bc3a87","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:985c81fcd78827c8afcd2cdc2dbcaba0260eea631a42fa8c1c201a2d819bfe56","observation_id":"298aaa1e-1e4f-4855-83e4-0349f93ad034","resolution":{"observed_at":"2026-05-15T17:20:11.649794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09516","last_updated":"2025-08-05T19:08:38Z","snapshot_observed_at":"2026-07-06T20:51:28.022519Z","submitted_at":"2025-03-12T16:26:39Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","version":5},"cited_work":{"arxiv_id":"2503.09516","doi":"10.48550/arxiv.2503.09516","metadata_source":"pith","pith_arxiv_id":"2503.09516","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","venue":"cs.CL","work_id":"0e0b7549-2bc4-4574-aa7f-588ffa16eaae","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:9d784938e2e7ee8222f30d33712860552f62670c0704ce7a1c619748b051cfc3","observation_id":"fdc0f671-dfdb-463a-b396-84c914bda9a1","resolution":{"observed_at":"2026-05-14T20:07:54.344206Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":"036f9982-3ac8-4cc4-ae6b-1d3198787071","year":2020},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:c3f68f5838a50e08c04c50844109e39073a1ef1fd0a501cc29068ccd3981b5c8","observation_id":"9d5a7799-4149-4e9c-84f2-f6ce5fc55494","resolution":{"observed_at":"2026-05-15T17:20:11.686218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14024","last_updated":"2023-01-23T17:00:01Z","snapshot_observed_at":"2026-07-06T14:35:37.368351Z","submitted_at":"2022-12-28T18:52:44Z","title":"Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP","version":2},"cited_work":{"arxiv_id":"2212.14024","doi":"10.48550/arxiv.2212.14024","metadata_source":"pith","pith_arxiv_id":"2212.14024","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demonstrate-search-predict: Composing retrieval and language models for knowledge-intensive nlp","venue":"cs.CL","work_id":"8d4545f4-9530-4521-8def-7d279b7c0dd8","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2212.14024","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:ed4ab26fefdac4bd49b0afddbf05c669e5a5702b7ae6d1f2984bc133d6f45975","observation_id":"953794ef-e93c-4d9b-bf35-fc3c7e77e996","resolution":{"observed_at":"2026-05-14T20:07:54.323763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Joshi, Hanna Moazam, Heather Miller, Matei Zaharia, and Christopher Potts","venue":null,"work_id":"05d2e1f1-712c-4b0f-a459-5b1e673f630a","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:239a92bb5479988035e7bfacbf2a23c32d4c8afe4b9525b252735ee234ccd337","observation_id":"8739ed8c-61dd-40f3-9e75-751eac6c6c50","resolution":{"observed_at":"2026-05-15T17:20:11.670528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Natural questions: A benchmark for question answering research.Transactions of the Association for Computational Linguistics","venue":null,"work_id":"e6aa1916-1912-415c-ac32-13766c92bbc8","year":2019},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:0f2ece92e7fbf70939132f51857927fade88f851115bb59e25bfff549a862bac","observation_id":"d3afe7c3-d3e6-4106-8328-8004e04083e4","resolution":{"observed_at":"2026-05-15T17:20:11.700052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"PhD thesis, UC Berkeley","venue":null,"work_id":"0d122b72-39cf-45ae-bafc-36e7722d6295","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:1abf594d21dd27fa60a8d951f231be4bed1574912b35cfad8b9b67835e7f8de7","observation_id":"3dca443b-222c-44df-bbfd-bbbb84951ff1","resolution":{"observed_at":"2026-05-15T17:20:11.698050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks.Advances in neural information processing systems, 33","venue":null,"work_id":"8cc47761-a4e1-45af-9b27-33889b086d4a","year":2020},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:76db7950d3ebc5dac47cb26fe91b762a69d5992e18275b0e8bb86f60a2a274b2","observation_id":"dcc7bbfe-8102-47d7-a93f-337c0b7f78c3","resolution":{"observed_at":"2026-05-15T17:20:11.659977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Search-o1: Agentic search-enhanced large reasoning models","venue":null,"work_id":"6ab1dc72-2d80-439e-b1a2-c9c809264b59","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:d7c42a2f7b9ca3a609cb721363a54497cbeeb01ebfc3a5caa03d6caf0be8c5ea","observation_id":"49135f83-e4af-43ef-89a8-9a7b26fa85e7","resolution":{"observed_at":"2026-05-15T17:20:11.657377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faithful chain-of-thought reasoning","venue":null,"work_id":"09c60b29-6289-4c38-9e93-54e603c78b98","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:0fcce4d38f56e1273dd218c69ff35e1ba51ec76efee7f741fa2a36c8b977e5b0","observation_id":"bcab8c5b-f135-4f2c-8e87-1486890a596d","resolution":{"observed_at":"2026-05-15T17:20:11.664877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When not to trust language models: Investigating effectiveness of parametric and non-parametric memories","venue":null,"work_id":"86e73b7b-04cc-4b98-a8c7-e4b66250d7bf","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:b4d944fe3baf86fc4436e4c65b9ce67cc3e82af7352451a5b1aee773da455cdb","observation_id":"10722e94-c740-4374-92fb-ba0acdf18ab1","resolution":{"observed_at":"2026-05-15T17:20:11.673144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Logic-lm: Empowering large language models with symbolic solvers for faithful logical reasoning","venue":null,"work_id":"bb9ab6bb-c3fc-4a3e-8b65-d76b3110eca2","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:2a1c4cece7a2029acb211bceff7a177098b961bb15cff4eed21e1cedfaa08a61","observation_id":"140089c0-d0e5-4934-8db6-cd17c1972772","resolution":{"observed_at":"2026-05-15T17:20:11.681687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fact-checking complex claims with program-guided reasoning","venue":null,"work_id":"af17b89a-c4cf-4d0e-8247-9e14e34c1924","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:9852273304b017ae404632500803b64f876851aa24cd82d4812fb851831d8b87","observation_id":"0b050a0d-2479-4ed0-bff8-6fb15088c0d4","resolution":{"observed_at":"2026-05-15T17:20:11.707769Z","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":"2506.08364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structure-augmented reasoning genera- tion","venue":null,"work_id":"52d4e169-4cc0-4683-9b90-5a2c29a50060","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:9e8a010450a1505cadfe84a438820bda4da343423b50c70133755743d226b2e6","observation_id":"9b591cc0-09b4-4206-a0d2-d2c27f8dffef","resolution":{"observed_at":"2026-05-14T20:07:54.302910Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Measuring and narrowing the compositionality gap in language models","venue":null,"work_id":"900d8467-4104-48b6-9edc-b45b5537a0f4","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:f7c2ff9e2f64fdb2b609f13b52135fb19fcb9eea76d457a9d2eef0fb22c4cf96","observation_id":"f77b33c1-23bb-43e5-a212-941328675b71","resolution":{"observed_at":"2026-05-15T17:20:11.647321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enhancing retrieval-augmented large language models with iterative retrieval-generation synergy","venue":null,"work_id":"e17ff0e5-af52-43ff-b916-b42d02b62cba","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:1b706b3ae542ce26cf4a326ca858e375b8fd70e6e46f6425f9398766fe1d9071","observation_id":"dcd9d5e7-7ada-48db-b85e-76abd96c1756","resolution":{"observed_at":"2026-05-15T17:20:11.662782Z","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":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":"2402.03300","doi":"10.1016/0004-3702(73)90011-8","metadata_source":"pith","pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","venue":"cs.CL","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:15e188fb8b9e9776af041238d9ce63726e630997782e6149330147c729f73167","observation_id":"8312f05c-6aa2-46dc-a97a-5ba3d8a2f5c4","resolution":{"observed_at":"2026-05-14T20:07:54.378364Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hybridflow: A flexible and efficient rlhf framework","venue":null,"work_id":"c2f68372-ef3d-48de-ba08-24255e1ffae9","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:5a6b064c2f676d6de53d2facf3d05401f56807f87f65de0548d29d3fe230b0ba","observation_id":"70ed94bf-01b8-4f1c-9f8a-cebb6b469a07","resolution":{"observed_at":"2026-05-15T17:20:11.695505Z","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.19288","last_updated":"2025-08-04T00:07:30Z","snapshot_observed_at":"2026-08-01T18:46:59.530695Z","submitted_at":"2025-05-25T19:42:06Z","title":"Hypercube-Based Retrieval-Augmented Generation for Scientific Question-Answering","version":2},"cited_work":{"arxiv_id":"2505.19288","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.19288","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hypercube-based retrieval-augmented generation for scientific question- answering","venue":null,"work_id":"f4712184-628e-4783-98e2-d9bd4dddeb89","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2505.19288","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:e7781662153fc1676a8bf188c3463a83322cbdc83bf0cd3d2efcab4ab93bc485","observation_id":"5ba34ad1-9798-4cd7-93d0-053cf6ad4bd4","resolution":{"observed_at":"2026-05-14T20:07:54.316847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.15898","doi":"10.48550/arxiv.2602.15898","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multicube-rag for multi-hop question answering","venue":"Open MIND","work_id":"0f9a0225-897c-4d92-a0a0-29174f9efdc0","year":2026},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:15b1d199965296dd1a047c9ac7d67b8d80bcf4f975cafa37bead454f5d986cb4","observation_id":"a6ad63bf-2685-467d-a86b-10d9ce0d8f8b","resolution":{"observed_at":"2026-05-14T20:07:54.357347Z","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":"2503.05592","last_updated":"2025-03-18T08:32:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-07T17:14:44Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2503.05592","doi":"10.48550/arxiv.2503.05592","metadata_source":"pith","pith_arxiv_id":"2503.05592","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","venue":"cs.AI","work_id":"f5ed73d2-f2ff-4cf6-853d-3586333e44ef","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2503.05592","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:5e1d364214881ed9eb4053230e991b24240ff6e4991ef1546f43ae2a24d671d6","observation_id":"32a97260-89ea-4f35-8c02-84b5cb93ef55","resolution":{"observed_at":"2026-05-14T20:07:54.364963Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04588","last_updated":"2026-05-19T11:51:42Z","snapshot_observed_at":"2026-08-04T18:36:41.979541Z","submitted_at":"2025-05-07T17:30:22Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","version":3},"cited_work":{"arxiv_id":"2505.04588","doi":"10.48550/arxiv.2505.04588","metadata_source":"pith","pith_arxiv_id":"2505.04588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","venue":"cs.CL","work_id":"0ea11521-4603-4e7a-abe3-bbc2f3e3f71c","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2505.04588","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:73435f9cf7f868c28986a7f129ed30e964bb8346b9351c53a35cf4a1c22a0dd2","observation_id":"0fe2ae17-37ae-4eb8-bc64-1fa77e860d0c","resolution":{"observed_at":"2026-05-17T17:44:13.577137Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Think-on-graph: Deep and responsible reasoning of large language model on knowledge graph","venue":null,"work_id":"ff356d67-ce81-42e2-8df3-49fdb1110d1f","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:20c2f9097db6d4585e517a09c7d9afbaac3fe0d759382c1678a523b52c08c1d4","observation_id":"346359be-23be-4557-b200-455add202caa","resolution":{"observed_at":"2026-05-15T17:20:11.705808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rethinking the reranker: Boundary-aware evidence selec- tion for robust retrieval-augmented generation","venue":null,"work_id":"a7985867-0815-47a9-8245-2b27a4005ce3","year":2026},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:7b17cb54dd25d29d531ea73e1e529641a864dc14200584d13a937299369a4bcf","observation_id":"4fc2284c-2d8d-4a7c-8cd2-3237968e1eb8","resolution":{"observed_at":"2026-05-15T17:20:11.691257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GRACE: Generative representation learning via contrastive policy optimization","venue":null,"work_id":"190e9af8-78a6-4bcd-8be1-c2b82abd7680","year":null},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:a59451d7c005a2232a5947ee2c15e40818ff9309c9480926ff07bc9edd962112","observation_id":"3bab93de-95c1-43ed-b0d0-197fedb8c872","resolution":{"observed_at":"2026-05-15T17:20:11.688768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4df0a815-3ef5-4ab0-bdef-b3b5e244d968","year":null},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:7fc9119a9fb880aff5a7612c6319b2df574d6ec911922f9b47de55c2049e05a7","observation_id":"1944e1d5-da90-43bc-bf07-3e49aae3751c","resolution":{"observed_at":"2026-05-15T17:20:11.670241Z","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":"2603.09341","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tasr-rag: Taxonomy-guided structured reasoning for retrieval-augmented generation","venue":null,"work_id":"fd587290-edeb-49fb-a321-84581c4a45f6","year":2026},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:cdc471707bd4d8d88304488e630817d42257b20989d2911e637fdfaf9aa76df4","observation_id":"abb2f7c1-493a-4d66-9d5e-21117f6b0392","resolution":{"observed_at":"2026-05-14T20:07:54.282154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"DynamicRAG: Leveraging outputs of large language model as feedback for dynamic reranking in retrieval-augmented generation","venue":null,"work_id":"78957b55-6670-4bb7-b1b0-881c39fea8ca","year":2026},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:d8805d2c87b1fb6e246a82ad9e506ca3b710209c0d75d2d76a6e5aa82f922c70","observation_id":"fe5d6f1a-79e2-43f8-ba2d-3c21ae0eee18","resolution":{"observed_at":"2026-05-15T17:20:11.632448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Musique: Multihop questions via single-hop question composition.Transactions of the Association for Computational Linguistics","venue":null,"work_id":"4083a6e3-2bfa-4884-9ce0-847189bd612a","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:e53e5f909f0375810ca886782b85d9a6853b0d3bf215bee5a5c7cf587db953f0","observation_id":"abe87455-b1f7-45f6-bef3-a356261e7ad9","resolution":{"observed_at":"2026-05-15T17:20:11.703863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Interleaving retrieval with chain-of-thought reasoning for knowledge-intensive multi-step questions","venue":null,"work_id":"255a036f-77af-4692-a62e-72f2f97e5f87","year":2023},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:fabccf1e36775daf77698ac898f531e10040e097bac1f240b6aeb3bfa036d2fa","observation_id":"2675cdda-865c-478d-a545-81800146ca87","resolution":{"observed_at":"2026-05-15T17:20:11.667515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"b6488d15-ec6c-4331-a627-27f0b1a6c57e","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:c2d2dcbc934a9dd2b28c758716aa7257af586d0da2417b5d0a2577c5951c4a06","observation_id":"284d6312-2388-41ec-95d6-1306834e85ef","resolution":{"observed_at":"2026-05-15T17:20:11.693275Z","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":"2510.15191","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structure-r1: Dynamically leveraging structural knowledge in llm reasoning through reinforcement learning.arXiv preprint arXiv:2510.15191","venue":null,"work_id":"ff6b1904-7125-4b5e-aaf2-84730a701dc7","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:c633402ea8a93e25d3e44523679bd1c7ebf7440d0e02c3efb0bebaf559a78842","observation_id":"eed18345-a7ca-41b8-9d8e-a3e87ff48bb9","resolution":{"observed_at":"2026-05-14T20:07:54.295618Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.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":"2412.15115","doi":"10.1145/3581783.3612503","metadata_source":"pith","pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5 Technical Report","venue":"cs.CL","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","year":2024},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:f8c636c8b44a432029b7f7a05e41403e992df706f380f1c0db2f052037736fa8","observation_id":"037eab7f-5016-437c-906e-740b660cdf6e","resolution":{"observed_at":"2026-05-14T20:07:54.309586Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hotpotqa: A dataset for diverse, explainable multi-hop question answering","venue":null,"work_id":"648b54a8-08e2-480b-bf00-776121ed12ec","year":2018},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:8a4cd95421b2f314949ef3fc8eee9e5b2a887cf6fb5a25e1aca0006e0d8bc78f","observation_id":"1f80a762-1dc8-4ed7-bd0e-9cf5ecc539ea","resolution":{"observed_at":"2026-05-15T17:20:11.650678Z","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":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":"2210.03629","doi":"10.48550/arxiv.2210.03629","metadata_source":"pith","pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","venue":"cs.CL","work_id":"407a2351-25f1-497d-b611-f77d0292a8e6","year":2022},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:c63e4142a39fe79d52c5c7ded4498b5bf0e2f335603226833389fd7263e37964","observation_id":"3006c138-2e4f-47ec-ac94-6793af41f435","resolution":{"observed_at":"2026-05-14T20:07:54.350187Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-12T03:19:36.897515+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T03:19:36.897515+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unknown Error","venue":null,"work_id":"99c89ade-70ab-4693-ba4b-16161b3a63b7","year":2025},"citing_paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-14T20:03:33.411994Z"},"links":{"citing_paper":"/paper/2605.12975"},"observation_digest":"sha256:7a871bb574c659ddec199e2125e87b01a1f18034aa2f8b6782678e5aea2de620","observation_id":"c443e3d8-b03d-4f4c-ae26-2b731f8731ab","resolution":{"observed_at":"2026-05-15T17:20:11.662506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.12975","last_updated":"2026-05-13T04:14:13Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-02T05:04:15.676998Z","submitted_at":"2026-05-13T04:14:13Z","title":"Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":19,"verified_fuzzy":30},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2605.12975."}