{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IQKPYCCR3AZA2X44JVNT7CHPPY","short_pith_number":"pith:IQKPYCCR","schema_version":"1.0","canonical_sha256":"4414fc0851d8320d5f9c4d5b3f88ef7e2f81b67206937dda5beaf3f21efa492f","source":{"kind":"arxiv","id":"2601.05106","version":4},"attestation_state":"computed","paper":{"title":"Token-Level LLM Collaboration via FusionRoute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Furong Huang, Hanqing Zeng, Lizhu Zhang, Nuoya Xiong, Shuchao Bi, Yuhang Zhou, Zhaorun Chen, Zhuokai Zhao","submitted_at":"2026-01-08T16:53:16Z","abstract_excerpt":"Large language models (LLMs) exhibit strengths across diverse domains. However, achieving strong performance across these domains with a single general-purpose model typically requires scaling to sizes that are prohibitively expensive to train and deploy. On the other hand, while smaller domain-specialized models are much more efficient, they struggle to generalize beyond their training distributions. To address this dilemma, we propose FusionRoute, a robust and effective token-level multi-LLM collaboration framework in which a lightweight router simultaneously (i) selects the most suitable ex"},"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":"2601.05106","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-01-08T16:53:16Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"38efce4f1c294fa13f8f868fcb1a9af6791f13210655ee19b4a97de7b8264813","abstract_canon_sha256":"2e79fedfa37213c8b771cce0156e0e01cec1994ab9f7162b7484368a36ccac20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:53.662062Z","signature_b64":"2LZ+U4dKYuVgWUjJljsoEUkN82QBwJktcunHWa0Oi+fZI+e5iXOknsLDI4S9iDVI+QSil/88jh8j9PBed2WtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4414fc0851d8320d5f9c4d5b3f88ef7e2f81b67206937dda5beaf3f21efa492f","last_reissued_at":"2026-05-22T01:03:53.661103Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:53.661103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Token-Level LLM Collaboration via FusionRoute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Furong Huang, Hanqing Zeng, Lizhu Zhang, Nuoya Xiong, Shuchao Bi, Yuhang Zhou, Zhaorun Chen, Zhuokai Zhao","submitted_at":"2026-01-08T16:53:16Z","abstract_excerpt":"Large language models (LLMs) exhibit strengths across diverse domains. However, achieving strong performance across these domains with a single general-purpose model typically requires scaling to sizes that are prohibitively expensive to train and deploy. On the other hand, while smaller domain-specialized models are much more efficient, they struggle to generalize beyond their training distributions. To address this dilemma, we propose FusionRoute, a robust and effective token-level multi-LLM collaboration framework in which a lightweight router simultaneously (i) selects the most suitable ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.05106","kind":"arxiv","version":4},"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/2601.05106/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":"2601.05106","created_at":"2026-05-22T01:03:53.661251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.05106v4","created_at":"2026-05-22T01:03:53.661251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.05106","created_at":"2026-05-22T01:03:53.661251+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQKPYCCR3AZA","created_at":"2026-05-22T01:03:53.661251+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQKPYCCR3AZA2X44","created_at":"2026-05-22T01:03:53.661251+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQKPYCCR","created_at":"2026-05-22T01:03:53.661251+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07494","citing_title":"Triage: Routing Software Engineering Tasks to Cost-Effective LLM Tiers via Code Quality Signals","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY","json":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY.json","graph_json":"https://pith.science/api/pith-number/IQKPYCCR3AZA2X44JVNT7CHPPY/graph.json","events_json":"https://pith.science/api/pith-number/IQKPYCCR3AZA2X44JVNT7CHPPY/events.json","paper":"https://pith.science/paper/IQKPYCCR"},"agent_actions":{"view_html":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY","download_json":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY.json","view_paper":"https://pith.science/paper/IQKPYCCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.05106&json=true","fetch_graph":"https://pith.science/api/pith-number/IQKPYCCR3AZA2X44JVNT7CHPPY/graph.json","fetch_events":"https://pith.science/api/pith-number/IQKPYCCR3AZA2X44JVNT7CHPPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY/action/storage_attestation","attest_author":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY/action/author_attestation","sign_citation":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY/action/citation_signature","submit_replication":"https://pith.science/pith/IQKPYCCR3AZA2X44JVNT7CHPPY/action/replication_record"}},"created_at":"2026-05-22T01:03:53.661251+00:00","updated_at":"2026-05-22T01:03:53.661251+00:00"}