{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KJH4VWYR7BJ6IVVQFXD6IUHRBW","short_pith_number":"pith:KJH4VWYR","schema_version":"1.0","canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","source":{"kind":"arxiv","id":"2410.03834","version":2},"attestation_state":"computed","paper":{"title":"GraphRouter: A Graph-based Router for LLM Selections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiaxuan You, Tao Feng, Yanzhen Shen","submitted_at":"2024-10-04T18:02:48Z","abstract_excerpt":"The rapidly growing number and variety of Large Language Models (LLMs) present significant challenges in efficiently selecting the appropriate LLM for a given query, especially considering the trade-offs between performance and computational cost. Current LLM selection methods often struggle to generalize across new LLMs and different tasks because of their limited ability to leverage contextual interactions among tasks, queries, and LLMs, as well as their dependence on a transductive learning framework. To address these shortcomings, we introduce a novel inductive graph framework, named as Gr"},"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.03834","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"710c38a1728ee39f918d97ef9c8d2a5781d48abe9488a730d591435d6f293140","abstract_canon_sha256":"01b282de59944e78225979560598779804b39ec5ef13baf1605a13e1b0ba27b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:31.752642Z","signature_b64":"mGGbUJ5312rDwF8AZFHanqcn8oNBnFXKVATUYyUQq5eRKKEAae1HV2c0Tor3oUmPwAgdjyJQ9y+1VR2pXIDYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","last_reissued_at":"2026-07-05T10:32:31.751842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:31.751842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphRouter: A Graph-based Router for LLM Selections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiaxuan You, Tao Feng, Yanzhen Shen","submitted_at":"2024-10-04T18:02:48Z","abstract_excerpt":"The rapidly growing number and variety of Large Language Models (LLMs) present significant challenges in efficiently selecting the appropriate LLM for a given query, especially considering the trade-offs between performance and computational cost. Current LLM selection methods often struggle to generalize across new LLMs and different tasks because of their limited ability to leverage contextual interactions among tasks, queries, and LLMs, as well as their dependence on a transductive learning framework. To address these shortcomings, we introduce a novel inductive graph framework, named as Gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03834","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.03834/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.03834","created_at":"2026-07-05T10:32:31.751940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03834v2","created_at":"2026-07-05T10:32:31.751940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03834","created_at":"2026-07-05T10:32:31.751940+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJH4VWYR7BJ6","created_at":"2026-07-05T10:32:31.751940+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJH4VWYR7BJ6IVVQ","created_at":"2026-07-05T10:32:31.751940+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJH4VWYR","created_at":"2026-07-05T10:32:31.751940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12479","citing_title":"ReCal: Reward Calibration for RL-based LLM Routing","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00053","citing_title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30217","citing_title":"Before Thinking, Learn to Decide: Proactive Routing for Efficient Visual Reasoning","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29424","citing_title":"EntroRouter: Learning Efficient Model Routing via Entropy Regulation","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07587","citing_title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27810","citing_title":"LRanker: LLM Ranker for Massive Candidates","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30693","citing_title":"Triaging Threats to Specialized Guardrails","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18859","citing_title":"TwinRouterBench: Fast Static and Live Dynamic Evaluation for Realistic Agentic LLM Routing","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2505.12601","citing_title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18859","citing_title":"TwinRouterBench: Fast Static and Live Dynamic Evaluation for Realistic Agentic LLM Routing","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13647","citing_title":"FlowCompile: An Optimizing Compiler for Structured LLM Workflows","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11301","citing_title":"LatentRouter: Can We Choose the Right Multimodal Model Before Seeing Its Answer?","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11603","citing_title":"GAR: Carbon-Aware Routing for LLM Inference via Constrained Optimization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07112","citing_title":"Switchcraft: AI Model Router for Agentic Tool Calling","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07075","citing_title":"ModelLens: Finding the Best for Your Task from Myriads of Models","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15728","citing_title":"Privacy-Preserving LLMs Routing","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW","json":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW.json","graph_json":"https://pith.science/api/pith-number/KJH4VWYR7BJ6IVVQFXD6IUHRBW/graph.json","events_json":"https://pith.science/api/pith-number/KJH4VWYR7BJ6IVVQFXD6IUHRBW/events.json","paper":"https://pith.science/paper/KJH4VWYR"},"agent_actions":{"view_html":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW","download_json":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW.json","view_paper":"https://pith.science/paper/KJH4VWYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03834&json=true","fetch_graph":"https://pith.science/api/pith-number/KJH4VWYR7BJ6IVVQFXD6IUHRBW/graph.json","fetch_events":"https://pith.science/api/pith-number/KJH4VWYR7BJ6IVVQFXD6IUHRBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/action/storage_attestation","attest_author":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/action/author_attestation","sign_citation":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/action/citation_signature","submit_replication":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/action/replication_record"}},"created_at":"2026-07-05T10:32:31.751940+00:00","updated_at":"2026-07-05T10:32:31.751940+00:00"}