{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FHLWW33OMVBPU5M2ZV2UNYPU5Q","short_pith_number":"pith:FHLWW33O","schema_version":"1.0","canonical_sha256":"29d76b6f6e6542fa759acd7546e1f4ec3dfe3298e774f7217f3681a0ab602996","source":{"kind":"arxiv","id":"2406.16989","version":2},"attestation_state":"computed","paper":{"title":"Retrieval-Augmented Mixture of LoRA Experts for Uploadable Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fei Wu, Guoyin Wang, Hongxia Yang, Kun Kuang, Leilei Gan, Tao Shen, Yuwei Hu, Ziyu Zhao","submitted_at":"2024-06-24T05:24:41Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) offers an efficient way to fine-tune large language models (LLMs). Its modular and plug-and-play nature allows the integration of various domain-specific LoRAs, enhancing LLM capabilities. Open-source platforms like Huggingface and Modelscope have introduced a new computational paradigm, Uploadable Machine Learning (UML). In UML, contributors use decentralized data to train specialized adapters, which are then uploaded to a central platform to improve LLMs. This platform uses these domain-specific adapters to handle mixed-task requests requiring personalized service."},"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":"2406.16989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T05:24:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"872a084cd33f32b0348143cbe5f0c19588e5c4d29aeb73a121b66b9d92e34659","abstract_canon_sha256":"0cdb243d59f9d8761c556c6c6686173688cc00f461ae11446175b8745db26c5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:15.033864Z","signature_b64":"IehQ8FaQPmZrMs4I+F0QA3ifSBG4dyBDjgYsOBZlzlvNyAkL1ktXDxKryAg8SEzj/Fvo+fLOaI3K/u7FSdlcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d76b6f6e6542fa759acd7546e1f4ec3dfe3298e774f7217f3681a0ab602996","last_reissued_at":"2026-07-05T08:44:15.033406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:15.033406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Retrieval-Augmented Mixture of LoRA Experts for Uploadable Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fei Wu, Guoyin Wang, Hongxia Yang, Kun Kuang, Leilei Gan, Tao Shen, Yuwei Hu, Ziyu Zhao","submitted_at":"2024-06-24T05:24:41Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) offers an efficient way to fine-tune large language models (LLMs). Its modular and plug-and-play nature allows the integration of various domain-specific LoRAs, enhancing LLM capabilities. Open-source platforms like Huggingface and Modelscope have introduced a new computational paradigm, Uploadable Machine Learning (UML). In UML, contributors use decentralized data to train specialized adapters, which are then uploaded to a central platform to improve LLMs. This platform uses these domain-specific adapters to handle mixed-task requests requiring personalized service."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16989","kind":"arxiv","version":2},"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/2406.16989/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":"2406.16989","created_at":"2026-07-05T08:44:15.033462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16989v2","created_at":"2026-07-05T08:44:15.033462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16989","created_at":"2026-07-05T08:44:15.033462+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHLWW33OMVBP","created_at":"2026-07-05T08:44:15.033462+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHLWW33OMVBPU5M2","created_at":"2026-07-05T08:44:15.033462+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHLWW33O","created_at":"2026-07-05T08:44:15.033462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.08223","citing_title":"Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devices","ref_index":99,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21905","citing_title":"Low-Rank Adaptation Redux for Large Models","ref_index":244,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q","json":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q.json","graph_json":"https://pith.science/api/pith-number/FHLWW33OMVBPU5M2ZV2UNYPU5Q/graph.json","events_json":"https://pith.science/api/pith-number/FHLWW33OMVBPU5M2ZV2UNYPU5Q/events.json","paper":"https://pith.science/paper/FHLWW33O"},"agent_actions":{"view_html":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q","download_json":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q.json","view_paper":"https://pith.science/paper/FHLWW33O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16989&json=true","fetch_graph":"https://pith.science/api/pith-number/FHLWW33OMVBPU5M2ZV2UNYPU5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/FHLWW33OMVBPU5M2ZV2UNYPU5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q/action/storage_attestation","attest_author":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q/action/author_attestation","sign_citation":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q/action/citation_signature","submit_replication":"https://pith.science/pith/FHLWW33OMVBPU5M2ZV2UNYPU5Q/action/replication_record"}},"created_at":"2026-07-05T08:44:15.033462+00:00","updated_at":"2026-07-05T08:44:15.033462+00:00"}