{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7MEC6ORRAL3UPOOF6TXKV25O3A","short_pith_number":"pith:7MEC6ORR","schema_version":"1.0","canonical_sha256":"fb082f3a3102f747b9c5f4eeaaebaed83fe3fb3b975cfdfe98ce8d0d723c2738","source":{"kind":"arxiv","id":"2505.12601","version":2},"attestation_state":"computed","paper":{"title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yang Li","submitted_at":"2025-05-19T01:33:41Z","abstract_excerpt":"As large language models (LLMs) grow in scale and specialization, routing--selecting the best model for a given input--has become essential for efficient and effective deployment. While recent methods rely on complex learned routing strategies, their dependence on disparate training data and evaluation setups makes comparison and generalization difficult. In this work, we revisit LLM routing through the lens of simplicity. We show that a well-tuned k-Nearest Neighbors (kNN) approach not only matches but often outperforms state-of-the-art learned routers across diverse tasks. To support systema"},"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":"2505.12601","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T01:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"6c047cb9b072a3a1efd4906025fc1b1239d8824ecceef99988e056c0cec4f147","abstract_canon_sha256":"44a556e2e7bed6f08641af9fa12b014001b1f187afd10ca52d05f15f475e718f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:19.918602Z","signature_b64":"8Rt064not9E9c0YM3XzmvjD0IomS8geTQBaBwQeK02xCJRfb4TaMpABD7NS/mgTohlpA12b4KoMTKt150SGBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb082f3a3102f747b9c5f4eeaaebaed83fe3fb3b975cfdfe98ce8d0d723c2738","last_reissued_at":"2026-05-20T00:00:19.917989Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:19.917989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yang Li","submitted_at":"2025-05-19T01:33:41Z","abstract_excerpt":"As large language models (LLMs) grow in scale and specialization, routing--selecting the best model for a given input--has become essential for efficient and effective deployment. While recent methods rely on complex learned routing strategies, their dependence on disparate training data and evaluation setups makes comparison and generalization difficult. In this work, we revisit LLM routing through the lens of simplicity. We show that a well-tuned k-Nearest Neighbors (kNN) approach not only matches but often outperforms state-of-the-art learned routers across diverse tasks. To support systema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12601","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/2505.12601/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":"2505.12601","created_at":"2026-05-20T00:00:19.918089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.12601v2","created_at":"2026-05-20T00:00:19.918089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12601","created_at":"2026-05-20T00:00:19.918089+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MEC6ORRAL3U","created_at":"2026-05-20T00:00:19.918089+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MEC6ORRAL3UPOOF","created_at":"2026-05-20T00:00:19.918089+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MEC6ORR","created_at":"2026-05-20T00:00:19.918089+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/7MEC6ORRAL3UPOOF6TXKV25O3A","json":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A.json","graph_json":"https://pith.science/api/pith-number/7MEC6ORRAL3UPOOF6TXKV25O3A/graph.json","events_json":"https://pith.science/api/pith-number/7MEC6ORRAL3UPOOF6TXKV25O3A/events.json","paper":"https://pith.science/paper/7MEC6ORR"},"agent_actions":{"view_html":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A","download_json":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A.json","view_paper":"https://pith.science/paper/7MEC6ORR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.12601&json=true","fetch_graph":"https://pith.science/api/pith-number/7MEC6ORRAL3UPOOF6TXKV25O3A/graph.json","fetch_events":"https://pith.science/api/pith-number/7MEC6ORRAL3UPOOF6TXKV25O3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A/action/storage_attestation","attest_author":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A/action/author_attestation","sign_citation":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A/action/citation_signature","submit_replication":"https://pith.science/pith/7MEC6ORRAL3UPOOF6TXKV25O3A/action/replication_record"}},"created_at":"2026-05-20T00:00:19.918089+00:00","updated_at":"2026-05-20T00:00:19.918089+00:00"}