{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N2TI232U3OW56V5ORF7ZZ3FIHS","short_pith_number":"pith:N2TI232U","schema_version":"1.0","canonical_sha256":"6ea68d6f54dbaddf57ae897f9ceca83c872cb8c3dd717965649a4dce77b96b45","source":{"kind":"arxiv","id":"2607.18098","version":1},"attestation_state":"computed","paper":{"title":"VDAR-Router: Adaptive LLMs Routing via Verbalized Query Difficulty Analysis Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"An-Zi Yen, Jun-Chen Hung, Wen-Chih Peng, Yu-Chien Tang","submitted_at":"2026-07-20T16:00:45Z","abstract_excerpt":"Large language models are increasingly used in practical systems, making efficient model selection important for reducing deployment cost. LLM routing has emerged as a practical solution for allocating each input query to an appropriate model under a desired cost-performance trade-off. Existing routing methods often estimate model suitability from the surface semantics or embedding similarity of the input query. However, such methods may ignore the underlying difficulty of a query, leading to suboptimal routing decisions. To address the challenge, we propose VDAR-Router, a difficulty-aware ret"},"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":"2607.18098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-20T16:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"83e25a8fc97db3071d9c4431f1ebdaf18cabddc7de970932d8518621333f6596","abstract_canon_sha256":"0bcda9a635ac783d98c40edad3834f4808e5dcaf9274608ef44053a3797ccb2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T02:22:16.241011Z","signature_b64":"CRzbeXY8pmfmzpQdm2FU4yI4MsNnYIkF1IxzJxFBn9mkpJD/h/vNrS9b4URUDsNZlFzw7XLfAN/QjqsxwfReCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ea68d6f54dbaddf57ae897f9ceca83c872cb8c3dd717965649a4dce77b96b45","last_reissued_at":"2026-07-21T02:22:16.240054Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T02:22:16.240054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VDAR-Router: Adaptive LLMs Routing via Verbalized Query Difficulty Analysis Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"An-Zi Yen, Jun-Chen Hung, Wen-Chih Peng, Yu-Chien Tang","submitted_at":"2026-07-20T16:00:45Z","abstract_excerpt":"Large language models are increasingly used in practical systems, making efficient model selection important for reducing deployment cost. LLM routing has emerged as a practical solution for allocating each input query to an appropriate model under a desired cost-performance trade-off. Existing routing methods often estimate model suitability from the surface semantics or embedding similarity of the input query. However, such methods may ignore the underlying difficulty of a query, leading to suboptimal routing decisions. To address the challenge, we propose VDAR-Router, a difficulty-aware ret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18098","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/2607.18098/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":"2607.18098","created_at":"2026-07-21T02:22:16.240596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18098v1","created_at":"2026-07-21T02:22:16.240596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18098","created_at":"2026-07-21T02:22:16.240596+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2TI232U3OW5","created_at":"2026-07-21T02:22:16.240596+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2TI232U3OW56V5O","created_at":"2026-07-21T02:22:16.240596+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2TI232U","created_at":"2026-07-21T02:22:16.240596+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/N2TI232U3OW56V5ORF7ZZ3FIHS","json":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS.json","graph_json":"https://pith.science/api/pith-number/N2TI232U3OW56V5ORF7ZZ3FIHS/graph.json","events_json":"https://pith.science/api/pith-number/N2TI232U3OW56V5ORF7ZZ3FIHS/events.json","paper":"https://pith.science/paper/N2TI232U"},"agent_actions":{"view_html":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS","download_json":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS.json","view_paper":"https://pith.science/paper/N2TI232U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18098&json=true","fetch_graph":"https://pith.science/api/pith-number/N2TI232U3OW56V5ORF7ZZ3FIHS/graph.json","fetch_events":"https://pith.science/api/pith-number/N2TI232U3OW56V5ORF7ZZ3FIHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS/action/storage_attestation","attest_author":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS/action/author_attestation","sign_citation":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS/action/citation_signature","submit_replication":"https://pith.science/pith/N2TI232U3OW56V5ORF7ZZ3FIHS/action/replication_record"}},"created_at":"2026-07-21T02:22:16.240596+00:00","updated_at":"2026-07-21T02:22:16.240596+00:00"}