{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GYXRTDKE7CIFMCWDIVB4WIRG7A","short_pith_number":"pith:GYXRTDKE","schema_version":"1.0","canonical_sha256":"362f198d44f890560ac34543cb2226f8001506042350d6342b9cd99ecb500e58","source":{"kind":"arxiv","id":"2411.19443","version":1},"attestation_state":"computed","paper":{"title":"Auto-RAG: Autonomous Retrieval-Augmented Generation for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Shaolei Zhang, Tian Yu, Yang Feng","submitted_at":"2024-11-29T03:01:05Z","abstract_excerpt":"Iterative retrieval refers to the process in which the model continuously queries the retriever during generation to enhance the relevance of the retrieved knowledge, thereby improving the performance of Retrieval-Augmented Generation (RAG). Existing work typically employs few-shot prompting or manually constructed rules to implement iterative retrieval. This introduces additional inference overhead and overlooks the remarkable reasoning capabilities of Large Language Models (LLMs). In this paper, we introduce Auto-RAG, an autonomous iterative retrieval model centered on the LLM's powerful dec"},"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":"2411.19443","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-11-29T03:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"2deff482c7293e5e5969cc081b13aa8bf8685894931b7e61570b7a92fa7840ea","abstract_canon_sha256":"10b1077b4d199991221bebd54e5dcfdbfa70804ea1605f5d50f3d80969cbd3ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:02.505915Z","signature_b64":"TOks6aRTSjKELjvQaIXi8Gr146riT+Wzt64VGQWFl8zgcLN8r7y9z8xrqNZ56gY7loUGNQJlV5axFy8ovVU4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362f198d44f890560ac34543cb2226f8001506042350d6342b9cd99ecb500e58","last_reissued_at":"2026-07-05T09:42:02.505256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:02.505256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-RAG: Autonomous Retrieval-Augmented Generation for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Shaolei Zhang, Tian Yu, Yang Feng","submitted_at":"2024-11-29T03:01:05Z","abstract_excerpt":"Iterative retrieval refers to the process in which the model continuously queries the retriever during generation to enhance the relevance of the retrieved knowledge, thereby improving the performance of Retrieval-Augmented Generation (RAG). Existing work typically employs few-shot prompting or manually constructed rules to implement iterative retrieval. This introduces additional inference overhead and overlooks the remarkable reasoning capabilities of Large Language Models (LLMs). In this paper, we introduce Auto-RAG, an autonomous iterative retrieval model centered on the LLM's powerful dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19443","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/2411.19443/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":"2411.19443","created_at":"2026-07-05T09:42:02.505329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19443v1","created_at":"2026-07-05T09:42:02.505329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19443","created_at":"2026-07-05T09:42:02.505329+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYXRTDKE7CIF","created_at":"2026-07-05T09:42:02.505329+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYXRTDKE7CIFMCWD","created_at":"2026-07-05T09:42:02.505329+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYXRTDKE","created_at":"2026-07-05T09:42:02.505329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07235","citing_title":"FLOWREADER: Min-Cost Flow Optimization for Multi-Modal Long Document Q&A","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2502.13957","citing_title":"Supervising the search process produces reliable and generalizable information-seeking agents","ref_index":92,"is_internal_anchor":false},{"citing_arxiv_id":"2509.00798","citing_title":"Progressive Multimodal Search and Reasoning for Knowledge-Intensive Visual Question Answering","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2507.05257","citing_title":"Evaluating Memory in LLM Agents via Incremental Multi-Turn Interactions","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2504.03160","citing_title":"DeepResearcher: Scaling Deep Research via Reinforcement Learning in Real-world Environments","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14170","citing_title":"Stateful Evidence-Driven Retrieval-Augmented Generation with Iterative Reasoning","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20452","citing_title":"HaS: Accelerating RAG through Homology-Aware Speculative Retrieval","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A","json":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A.json","graph_json":"https://pith.science/api/pith-number/GYXRTDKE7CIFMCWDIVB4WIRG7A/graph.json","events_json":"https://pith.science/api/pith-number/GYXRTDKE7CIFMCWDIVB4WIRG7A/events.json","paper":"https://pith.science/paper/GYXRTDKE"},"agent_actions":{"view_html":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A","download_json":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A.json","view_paper":"https://pith.science/paper/GYXRTDKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19443&json=true","fetch_graph":"https://pith.science/api/pith-number/GYXRTDKE7CIFMCWDIVB4WIRG7A/graph.json","fetch_events":"https://pith.science/api/pith-number/GYXRTDKE7CIFMCWDIVB4WIRG7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A/action/storage_attestation","attest_author":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A/action/author_attestation","sign_citation":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A/action/citation_signature","submit_replication":"https://pith.science/pith/GYXRTDKE7CIFMCWDIVB4WIRG7A/action/replication_record"}},"created_at":"2026-07-05T09:42:02.505329+00:00","updated_at":"2026-07-05T09:42:02.505329+00:00"}