{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6BTVNXXVPSHMWCATPEQJDDYVQW","short_pith_number":"pith:6BTVNXXV","schema_version":"1.0","canonical_sha256":"f06756def57c8ecb08137920918f158594e9b5da4dcd65060eadd98ad0dfecc4","source":{"kind":"arxiv","id":"2405.00467","version":1},"attestation_state":"computed","paper":{"title":"Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ekaterina Kochmar, Kaushal Kumar Maurya, KV Aditya Srivatsa","submitted_at":"2024-05-01T12:04:28Z","abstract_excerpt":"With the rapid development of LLMs, it is natural to ask how to harness their capabilities efficiently. In this paper, we explore whether it is feasible to direct each input query to a single most suitable LLM. To this end, we propose LLM routing for challenging reasoning tasks. Our extensive experiments suggest that such routing shows promise but is not feasible in all scenarios, so more robust approaches should be investigated to fill this gap."},"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":"2405.00467","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-01T12:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"92949cbe3a23a29ebdf5a958784ac935ff77d5a54b4114e7ae0d185c996dbef6","abstract_canon_sha256":"5768987f4db239b84dcabd3f029a0dc6c96ac31f9a9e7c3e97e5055b89e112d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:13.401567Z","signature_b64":"6hg1AQj9SZeQ2S3IJp3dOCtdxqiR9wvDRxXO+8NlaoQQhoQuWaSsQRnhWiqFufwvSxNgw4qdHP867mtBlkarDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06756def57c8ecb08137920918f158594e9b5da4dcd65060eadd98ad0dfecc4","last_reissued_at":"2026-07-05T08:14:13.401163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:13.401163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ekaterina Kochmar, Kaushal Kumar Maurya, KV Aditya Srivatsa","submitted_at":"2024-05-01T12:04:28Z","abstract_excerpt":"With the rapid development of LLMs, it is natural to ask how to harness their capabilities efficiently. In this paper, we explore whether it is feasible to direct each input query to a single most suitable LLM. To this end, we propose LLM routing for challenging reasoning tasks. Our extensive experiments suggest that such routing shows promise but is not feasible in all scenarios, so more robust approaches should be investigated to fill this gap."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00467","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/2405.00467/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":"2405.00467","created_at":"2026-07-05T08:14:13.401215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00467v1","created_at":"2026-07-05T08:14:13.401215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00467","created_at":"2026-07-05T08:14:13.401215+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BTVNXXVPSHM","created_at":"2026-07-05T08:14:13.401215+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BTVNXXVPSHMWCAT","created_at":"2026-07-05T08:14:13.401215+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BTVNXXV","created_at":"2026-07-05T08:14:13.401215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.18036","citing_title":"Harnessing Multiple Large Language Models: A Survey on LLM Ensemble","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2507.14200","citing_title":"A Scalable Multi-LLM Collaboration System with Retrieval-based Selection and Exploration-Exploitation-Driven Enhancement","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2512.23213","citing_title":"Scoring, Reasoning, and Selecting the Best! Ensembling Large Language Models via a Peer-Review Process","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW","json":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW.json","graph_json":"https://pith.science/api/pith-number/6BTVNXXVPSHMWCATPEQJDDYVQW/graph.json","events_json":"https://pith.science/api/pith-number/6BTVNXXVPSHMWCATPEQJDDYVQW/events.json","paper":"https://pith.science/paper/6BTVNXXV"},"agent_actions":{"view_html":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW","download_json":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW.json","view_paper":"https://pith.science/paper/6BTVNXXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00467&json=true","fetch_graph":"https://pith.science/api/pith-number/6BTVNXXVPSHMWCATPEQJDDYVQW/graph.json","fetch_events":"https://pith.science/api/pith-number/6BTVNXXVPSHMWCATPEQJDDYVQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW/action/storage_attestation","attest_author":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW/action/author_attestation","sign_citation":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW/action/citation_signature","submit_replication":"https://pith.science/pith/6BTVNXXVPSHMWCATPEQJDDYVQW/action/replication_record"}},"created_at":"2026-07-05T08:14:13.401215+00:00","updated_at":"2026-07-05T08:14:13.401215+00:00"}