{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MVVSYM2AFZZNY35J2RVJPCH5MS","short_pith_number":"pith:MVVSYM2A","schema_version":"1.0","canonical_sha256":"656b2c33402e72dc6fa9d46a9788fd64aa957c1851398e14e673109033070816","source":{"kind":"arxiv","id":"2607.26052","version":1},"attestation_state":"computed","paper":{"title":"Spend Experts Where You Are Unsure: Confidence-Adaptive Routing for Mixture-of-Experts LoRA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel Whitmore, Maya Lindqvist, Priya Nair, Rohan Desai, Tom Saliencro","submitted_at":"2026-07-28T17:59:16Z","abstract_excerpt":"Mixture-of-Experts (MoE) variants of Low-Rank Adaptation (LoRA) route every token to a fixed number of experts $k$. Tokens differ in how uncertain the model is about them, so a single k over-spends on easy tokens and under-serves hard ones. We observe that the router's output distribution is already a per-token uncertainty signal: peaked mass indicates confidence, while a flat distribution indicates ambiguity. We introduce CARE (Confidence-Adaptive Routing of Experts), which admits experts in a nucleus fashion. Experts are activated in decreasing router weight until their cumulative mass reach"},"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.26052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T17:59:16Z","cross_cats_sorted":[],"title_canon_sha256":"073f97eacb548625584014fc232991b854cd99a50f2742420b0a816cd5f3b626","abstract_canon_sha256":"98db2d583e55ae8048e80c5222993ed1eaaed6adccab8778f830ce072eff4b76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:21.692968Z","signature_b64":"cdmnaH/FAZ2OApca9Jg7wDnt4nZxvMIcDcnnkDrBOE/eAo9K2jVp+ZLTx3TD4SAb3BQv0E+tJSI1z6/MBY9UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656b2c33402e72dc6fa9d46a9788fd64aa957c1851398e14e673109033070816","last_reissued_at":"2026-07-29T01:26:21.692084Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:21.692084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spend Experts Where You Are Unsure: Confidence-Adaptive Routing for Mixture-of-Experts LoRA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel Whitmore, Maya Lindqvist, Priya Nair, Rohan Desai, Tom Saliencro","submitted_at":"2026-07-28T17:59:16Z","abstract_excerpt":"Mixture-of-Experts (MoE) variants of Low-Rank Adaptation (LoRA) route every token to a fixed number of experts $k$. Tokens differ in how uncertain the model is about them, so a single k over-spends on easy tokens and under-serves hard ones. We observe that the router's output distribution is already a per-token uncertainty signal: peaked mass indicates confidence, while a flat distribution indicates ambiguity. We introduce CARE (Confidence-Adaptive Routing of Experts), which admits experts in a nucleus fashion. Experts are activated in decreasing router weight until their cumulative mass reach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26052","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.26052/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.26052","created_at":"2026-07-29T01:26:21.692535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26052v1","created_at":"2026-07-29T01:26:21.692535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26052","created_at":"2026-07-29T01:26:21.692535+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVVSYM2AFZZN","created_at":"2026-07-29T01:26:21.692535+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVVSYM2AFZZNY35J","created_at":"2026-07-29T01:26:21.692535+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVVSYM2A","created_at":"2026-07-29T01:26:21.692535+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/MVVSYM2AFZZNY35J2RVJPCH5MS","json":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS.json","graph_json":"https://pith.science/api/pith-number/MVVSYM2AFZZNY35J2RVJPCH5MS/graph.json","events_json":"https://pith.science/api/pith-number/MVVSYM2AFZZNY35J2RVJPCH5MS/events.json","paper":"https://pith.science/paper/MVVSYM2A"},"agent_actions":{"view_html":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS","download_json":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS.json","view_paper":"https://pith.science/paper/MVVSYM2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26052&json=true","fetch_graph":"https://pith.science/api/pith-number/MVVSYM2AFZZNY35J2RVJPCH5MS/graph.json","fetch_events":"https://pith.science/api/pith-number/MVVSYM2AFZZNY35J2RVJPCH5MS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS/action/storage_attestation","attest_author":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS/action/author_attestation","sign_citation":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS/action/citation_signature","submit_replication":"https://pith.science/pith/MVVSYM2AFZZNY35J2RVJPCH5MS/action/replication_record"}},"created_at":"2026-07-29T01:26:21.692535+00:00","updated_at":"2026-07-29T01:26:21.692535+00:00"}