{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PF25UWJ5B3U4ZD5QADWP7ZLZWH","short_pith_number":"pith:PF25UWJ5","schema_version":"1.0","canonical_sha256":"7975da593d0ee9cc8fb000ecffe579b1cfe1cb077a518a084104635b8677baaa","source":{"kind":"arxiv","id":"2402.12851","version":1},"attestation_state":"computed","paper":{"title":"MoELoRA: Contrastive Learning Guided Mixture of Experts on Parameter-Efficient Fine-Tuning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fangyu Lei, Jiahe Lei, Jun Zhao, Kang Liu, Shizhu He, Tongxu Luo, Weihao Liu","submitted_at":"2024-02-20T09:30:48Z","abstract_excerpt":"Fine-tuning is often necessary to enhance the adaptability of Large Language Models (LLM) to downstream tasks. Nonetheless, the process of updating billions of parameters demands significant computational resources and training time, which poses a substantial obstacle to the widespread application of large-scale models in various scenarios. To address this issue, Parameter-Efficient Fine-Tuning (PEFT) has emerged as a prominent paradigm in recent research. However, current PEFT approaches that employ a limited set of global parameters (such as LoRA, which adds low-rank approximation matrices t"},"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":"2402.12851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-20T09:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"01c0bbab28bb8cf36c3c6f4918da4b253e61460591232b1b5814c215857a501c","abstract_canon_sha256":"74cc01f0ca5099d6906ea0cac9022b97d8a89cc8a82ec05c5ed35c2762e0455b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:17.331515Z","signature_b64":"NsIrrVGe01AJ3hI3KJpPpwryb+j1w5PUfUCqFofpb6OIqTtl+pJsQPUjAuV3iNtth0WPsmhwL5lSo0QdIemsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7975da593d0ee9cc8fb000ecffe579b1cfe1cb077a518a084104635b8677baaa","last_reissued_at":"2026-07-05T07:47:17.331099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:17.331099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MoELoRA: Contrastive Learning Guided Mixture of Experts on Parameter-Efficient Fine-Tuning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fangyu Lei, Jiahe Lei, Jun Zhao, Kang Liu, Shizhu He, Tongxu Luo, Weihao Liu","submitted_at":"2024-02-20T09:30:48Z","abstract_excerpt":"Fine-tuning is often necessary to enhance the adaptability of Large Language Models (LLM) to downstream tasks. Nonetheless, the process of updating billions of parameters demands significant computational resources and training time, which poses a substantial obstacle to the widespread application of large-scale models in various scenarios. To address this issue, Parameter-Efficient Fine-Tuning (PEFT) has emerged as a prominent paradigm in recent research. However, current PEFT approaches that employ a limited set of global parameters (such as LoRA, which adds low-rank approximation matrices t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12851","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/2402.12851/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":"2402.12851","created_at":"2026-07-05T07:47:17.331161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12851v1","created_at":"2026-07-05T07:47:17.331161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12851","created_at":"2026-07-05T07:47:17.331161+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF25UWJ5B3U4","created_at":"2026-07-05T07:47:17.331161+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF25UWJ5B3U4ZD5Q","created_at":"2026-07-05T07:47:17.331161+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF25UWJ5","created_at":"2026-07-05T07:47:17.331161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21645","citing_title":"Behavioral and Representational Evidence of Binomial Ordering Preferences in Large Language Models","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31432","citing_title":"Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31432","citing_title":"Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31432","citing_title":"Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07542","citing_title":"DIYHealth Suite: Dataset, Model, and Benchmark for Health Management at Home","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29375","citing_title":"TriageRA-CCF: Source-Side Clinical Confidence and Coverage Signals for Adaptive Rank Budgeting in Medical LLMs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2507.00029","citing_title":"LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25414","citing_title":"Rethinking Parameter Sharing for LLM Fine-Tuning with Multiple LoRAs","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19316","citing_title":"KORE: Enhancing Knowledge Injection for Large Multimodal Models via Knowledge-Oriented Controls","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26340","citing_title":"Adaptive and Fine-grained Module-wise Expert Pruning for Efficient LoRA-MoE Fine-Tuning","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08423","citing_title":"Queryable LoRA: Instruction-Regularized Routing Over Shared Low-Rank Update Atoms","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06291","citing_title":"TalkLoRA: Communication-Aware Mixture of Low-Rank Adaptation for Large Language Models","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17375","citing_title":"When Text Hijacks Vision: Benchmarking and Mitigating Text Overlay-Induced Hallucination in Vision Language Models","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21335","citing_title":"Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH","json":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH.json","graph_json":"https://pith.science/api/pith-number/PF25UWJ5B3U4ZD5QADWP7ZLZWH/graph.json","events_json":"https://pith.science/api/pith-number/PF25UWJ5B3U4ZD5QADWP7ZLZWH/events.json","paper":"https://pith.science/paper/PF25UWJ5"},"agent_actions":{"view_html":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH","download_json":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH.json","view_paper":"https://pith.science/paper/PF25UWJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12851&json=true","fetch_graph":"https://pith.science/api/pith-number/PF25UWJ5B3U4ZD5QADWP7ZLZWH/graph.json","fetch_events":"https://pith.science/api/pith-number/PF25UWJ5B3U4ZD5QADWP7ZLZWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH/action/storage_attestation","attest_author":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH/action/author_attestation","sign_citation":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH/action/citation_signature","submit_replication":"https://pith.science/pith/PF25UWJ5B3U4ZD5QADWP7ZLZWH/action/replication_record"}},"created_at":"2026-07-05T07:47:17.331161+00:00","updated_at":"2026-07-05T07:47:17.331161+00:00"}