{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O2ND3VXYGY2LFPS4WTUG2VWE3U","short_pith_number":"pith:O2ND3VXY","schema_version":"1.0","canonical_sha256":"769a3dd6f83634b2be5cb4e86d56c4dd1f21b30c28febceb0923df9ab3395479","source":{"kind":"arxiv","id":"2501.07793","version":1},"attestation_state":"computed","paper":{"title":"Unsupervised Query Routing for Retrieval Augmented Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fei Huang, Feiteng Mu, Liwen Zhang, Pengjun Xie, Wenjie Li, Yong Jiang, Zhen Zhang","submitted_at":"2025-01-14T02:27:06Z","abstract_excerpt":"Query routing for retrieval-augmented generation aims to assign an input query to the most suitable search engine. Existing works rely heavily on supervised datasets that require extensive manual annotation, resulting in high costs and limited scalability, as well as poor generalization to out-of-distribution scenarios. To address these challenges, we introduce a novel unsupervised method that constructs the \"upper-bound\" response to evaluate the quality of retrieval-augmented responses. This evaluation enables the decision of the most suitable search engine for a given query. By eliminating m"},"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":"2501.07793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-01-14T02:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"18c0c0274af906bbeb4daeadebabcb40b7a093d6a90b1bec5435fcfebc62adc5","abstract_canon_sha256":"01a7a461262eee57c31a6c4e969a089d81efa6bf33bd6f60e2c0dcf4a34f7bf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:50.118027Z","signature_b64":"5LDXLNXqrDxqS0EVnJ3zyJpAnPwlbeRq7bm5c9m4XmKuEIVJmQQIrh7fA7LryvP+2t5CZ6aEwfZn4LPdKUH6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"769a3dd6f83634b2be5cb4e86d56c4dd1f21b30c28febceb0923df9ab3395479","last_reissued_at":"2026-07-05T10:00:50.117604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:50.117604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Query Routing for Retrieval Augmented Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fei Huang, Feiteng Mu, Liwen Zhang, Pengjun Xie, Wenjie Li, Yong Jiang, Zhen Zhang","submitted_at":"2025-01-14T02:27:06Z","abstract_excerpt":"Query routing for retrieval-augmented generation aims to assign an input query to the most suitable search engine. Existing works rely heavily on supervised datasets that require extensive manual annotation, resulting in high costs and limited scalability, as well as poor generalization to out-of-distribution scenarios. To address these challenges, we introduce a novel unsupervised method that constructs the \"upper-bound\" response to evaluate the quality of retrieval-augmented responses. This evaluation enables the decision of the most suitable search engine for a given query. By eliminating m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07793","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/2501.07793/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":"2501.07793","created_at":"2026-07-05T10:00:50.117661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07793v1","created_at":"2026-07-05T10:00:50.117661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07793","created_at":"2026-07-05T10:00:50.117661+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2ND3VXYGY2L","created_at":"2026-07-05T10:00:50.117661+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2ND3VXYGY2LFPS4","created_at":"2026-07-05T10:00:50.117661+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2ND3VXY","created_at":"2026-07-05T10:00:50.117661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U","json":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U.json","graph_json":"https://pith.science/api/pith-number/O2ND3VXYGY2LFPS4WTUG2VWE3U/graph.json","events_json":"https://pith.science/api/pith-number/O2ND3VXYGY2LFPS4WTUG2VWE3U/events.json","paper":"https://pith.science/paper/O2ND3VXY"},"agent_actions":{"view_html":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U","download_json":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U.json","view_paper":"https://pith.science/paper/O2ND3VXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07793&json=true","fetch_graph":"https://pith.science/api/pith-number/O2ND3VXYGY2LFPS4WTUG2VWE3U/graph.json","fetch_events":"https://pith.science/api/pith-number/O2ND3VXYGY2LFPS4WTUG2VWE3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U/action/storage_attestation","attest_author":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U/action/author_attestation","sign_citation":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U/action/citation_signature","submit_replication":"https://pith.science/pith/O2ND3VXYGY2LFPS4WTUG2VWE3U/action/replication_record"}},"created_at":"2026-07-05T10:00:50.117661+00:00","updated_at":"2026-07-05T10:00:50.117661+00:00"}