{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XVBSJMUNACE3AWLL4UUSVPER4I","short_pith_number":"pith:XVBSJMUN","schema_version":"1.0","canonical_sha256":"bd4324b28d0089b0596be5292abc91e236ab0810010c6451973c507c736b9897","source":{"kind":"arxiv","id":"2410.09942","version":2},"attestation_state":"computed","paper":{"title":"Learning to Rank for Multiple Retrieval-Augmented Models through Iterative Utility Maximization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Alireza Salemi, Hamed Zamani","submitted_at":"2024-10-13T17:53:50Z","abstract_excerpt":"This paper investigates the design of a unified search engine to serve multiple retrieval-augmented generation (RAG) agents, each with a distinct task, backbone large language model (LLM), and RAG strategy. We introduce an iterative approach where the search engine generates retrieval results for the RAG agents and gathers feedback on the quality of the retrieved documents during an offline phase. This feedback is then used to iteratively optimize the search engine using an expectation-maximization algorithm, with the goal of maximizing each agent's utility function. Additionally, we adapt thi"},"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":"2410.09942","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-13T17:53:50Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"73401d5b7f23598032c3b2cb2834a2a3b4f46acada0fd59a71ffad4565b411cf","abstract_canon_sha256":"036ce547b584c2a5ea9cf09ec9b6588fc199a85ab98d125c3b5fc6f4b61fc7b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:20.891429Z","signature_b64":"9o1pkWg2gkx1Wr5ghcttCp95w77JTeqJNVW9OkJlweNGhQg9rpgmtEWMTNu0fJCFTjX4cFo8LFXQQXVDK7fdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd4324b28d0089b0596be5292abc91e236ab0810010c6451973c507c736b9897","last_reissued_at":"2026-07-05T11:27:20.890906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:20.890906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Rank for Multiple Retrieval-Augmented Models through Iterative Utility Maximization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Alireza Salemi, Hamed Zamani","submitted_at":"2024-10-13T17:53:50Z","abstract_excerpt":"This paper investigates the design of a unified search engine to serve multiple retrieval-augmented generation (RAG) agents, each with a distinct task, backbone large language model (LLM), and RAG strategy. We introduce an iterative approach where the search engine generates retrieval results for the RAG agents and gathers feedback on the quality of the retrieved documents during an offline phase. This feedback is then used to iteratively optimize the search engine using an expectation-maximization algorithm, with the goal of maximizing each agent's utility function. Additionally, we adapt thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09942","kind":"arxiv","version":2},"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/2410.09942/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":"2410.09942","created_at":"2026-07-05T11:27:20.890977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09942v2","created_at":"2026-07-05T11:27:20.890977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09942","created_at":"2026-07-05T11:27:20.890977+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVBSJMUNACE3","created_at":"2026-07-05T11:27:20.890977+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVBSJMUNACE3AWLL","created_at":"2026-07-05T11:27:20.890977+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVBSJMUN","created_at":"2026-07-05T11:27:20.890977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10844","citing_title":"CIIR@LiveRAG 2025: Optimizing Multi-Agent Retrieval Augmented Generation through Self-Training","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I","json":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I.json","graph_json":"https://pith.science/api/pith-number/XVBSJMUNACE3AWLL4UUSVPER4I/graph.json","events_json":"https://pith.science/api/pith-number/XVBSJMUNACE3AWLL4UUSVPER4I/events.json","paper":"https://pith.science/paper/XVBSJMUN"},"agent_actions":{"view_html":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I","download_json":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I.json","view_paper":"https://pith.science/paper/XVBSJMUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09942&json=true","fetch_graph":"https://pith.science/api/pith-number/XVBSJMUNACE3AWLL4UUSVPER4I/graph.json","fetch_events":"https://pith.science/api/pith-number/XVBSJMUNACE3AWLL4UUSVPER4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I/action/storage_attestation","attest_author":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I/action/author_attestation","sign_citation":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I/action/citation_signature","submit_replication":"https://pith.science/pith/XVBSJMUNACE3AWLL4UUSVPER4I/action/replication_record"}},"created_at":"2026-07-05T11:27:20.890977+00:00","updated_at":"2026-07-05T11:27:20.890977+00:00"}