{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WWHWBXDL4QMBFAXNWISKS4HVKG","short_pith_number":"pith:WWHWBXDL","schema_version":"1.0","canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","source":{"kind":"arxiv","id":"2506.16655","version":1},"attestation_state":"computed","paper":{"title":"Arch-Router: Aligning LLM Routing with Human Preferences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adil Hafeez, Co Tran, Salman Paracha, Shuguang Chen","submitted_at":"2025-06-19T23:57:41Z","abstract_excerpt":"With the rapid proliferation of large language models (LLMs) -- each optimized for different strengths, style, or latency/cost profile -- routing has become an essential technique to operationalize the use of different models. However, existing LLM routing approaches are limited in two key ways: they evaluate performance using benchmarks that often fail to capture human preferences driven by subjective evaluation criteria, and they typically select from a limited pool of models. In this work, we propose a preference-aligned routing framework that guides model selection by matching queries to u"},"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":"2506.16655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"ef210e8599af7d08601f0e187519e7f1ce5e2dbd0492b231c73f4943c38c86dc","abstract_canon_sha256":"3062d132ee6a1a5655d90c94351eeecd0943d2b66062c5da973e8281daea134b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:40.279458Z","signature_b64":"zHx4c3+RxV1Xxvs59zyxiitlnlcCo7S9WdermDwEvIKJ41nwB6X0fVDTsrVPkonCnjiC8V37B1Vz69QWWYNCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","last_reissued_at":"2026-07-05T11:24:40.278952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:40.278952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arch-Router: Aligning LLM Routing with Human Preferences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adil Hafeez, Co Tran, Salman Paracha, Shuguang Chen","submitted_at":"2025-06-19T23:57:41Z","abstract_excerpt":"With the rapid proliferation of large language models (LLMs) -- each optimized for different strengths, style, or latency/cost profile -- routing has become an essential technique to operationalize the use of different models. However, existing LLM routing approaches are limited in two key ways: they evaluate performance using benchmarks that often fail to capture human preferences driven by subjective evaluation criteria, and they typically select from a limited pool of models. In this work, we propose a preference-aligned routing framework that guides model selection by matching queries to u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16655","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/2506.16655/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":"2506.16655","created_at":"2026-07-05T11:24:40.279007+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16655v1","created_at":"2026-07-05T11:24:40.279007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16655","created_at":"2026-07-05T11:24:40.279007+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWHWBXDL4QMB","created_at":"2026-07-05T11:24:40.279007+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWHWBXDL4QMBFAXN","created_at":"2026-07-05T11:24:40.279007+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWHWBXDL","created_at":"2026-07-05T11:24:40.279007+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.15411","citing_title":"Foundational Design Principles and Patterns for Building Robust and Adaptive GenAI-Native Systems","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG","json":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG.json","graph_json":"https://pith.science/api/pith-number/WWHWBXDL4QMBFAXNWISKS4HVKG/graph.json","events_json":"https://pith.science/api/pith-number/WWHWBXDL4QMBFAXNWISKS4HVKG/events.json","paper":"https://pith.science/paper/WWHWBXDL"},"agent_actions":{"view_html":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG","download_json":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG.json","view_paper":"https://pith.science/paper/WWHWBXDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16655&json=true","fetch_graph":"https://pith.science/api/pith-number/WWHWBXDL4QMBFAXNWISKS4HVKG/graph.json","fetch_events":"https://pith.science/api/pith-number/WWHWBXDL4QMBFAXNWISKS4HVKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/action/storage_attestation","attest_author":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/action/author_attestation","sign_citation":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/action/citation_signature","submit_replication":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/action/replication_record"}},"created_at":"2026-07-05T11:24:40.279007+00:00","updated_at":"2026-07-05T11:24:40.279007+00:00"}