{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BTBXDCAMCHQAPHKHQBAKLEB5WP","short_pith_number":"pith:BTBXDCAM","schema_version":"1.0","canonical_sha256":"0cc371880c11e0079d478040a5903db3ec1a2e6d501b3b8305e4f36ca4d3fb1a","source":{"kind":"arxiv","id":"2312.02515","version":2},"attestation_state":"computed","paper":{"title":"mLoRA: Fine-Tuning LoRA Adapters via Highly-Efficient Pipeline Parallelism in Multiple GPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dengchun Li, Hui Lu, Jian Sha, Jie Zuo, Lei Duan, Mingjie Tang, Sicong Zhang, Tingfeng Lan, Yuanchun Zhou, Zetao Hu, Zhengmao Ye","submitted_at":"2023-12-05T05:38:38Z","abstract_excerpt":"Transformer-based, pre-trained large language models (LLMs) have demonstrated outstanding performance across diverse domains, particularly in the emerging {\\em pretrain-then-finetune} paradigm. Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method, is commonly used to adapt a base LLM to multiple downstream tasks. Further, LLM platforms enable developers to fine-tune multiple models and develop various domain-specific applications simultaneously. However, existing model parallelism schemes suffer from high communication overhead and inefficient GPU utilization when training mult"},"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":"2312.02515","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-05T05:38:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5090d1f6db830c1c573a66f1a442a8cca6375817fed010ab71ea155b4869b436","abstract_canon_sha256":"e3485ea840e3bd25988474f16054eb9ab2fb956e3b6067a9b56a5098793fb791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:21.999585Z","signature_b64":"5+AGLd74B5in4o+5PkoUH2Dnk61UOZbzV6u0APpstqSE8mzjdcx6qiVwyEBTyWlD6OAPFInF/6PTVGsHU8XRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc371880c11e0079d478040a5903db3ec1a2e6d501b3b8305e4f36ca4d3fb1a","last_reissued_at":"2026-07-05T09:08:21.998954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:21.998954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"mLoRA: Fine-Tuning LoRA Adapters via Highly-Efficient Pipeline Parallelism in Multiple GPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dengchun Li, Hui Lu, Jian Sha, Jie Zuo, Lei Duan, Mingjie Tang, Sicong Zhang, Tingfeng Lan, Yuanchun Zhou, Zetao Hu, Zhengmao Ye","submitted_at":"2023-12-05T05:38:38Z","abstract_excerpt":"Transformer-based, pre-trained large language models (LLMs) have demonstrated outstanding performance across diverse domains, particularly in the emerging {\\em pretrain-then-finetune} paradigm. Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method, is commonly used to adapt a base LLM to multiple downstream tasks. Further, LLM platforms enable developers to fine-tune multiple models and develop various domain-specific applications simultaneously. However, existing model parallelism schemes suffer from high communication overhead and inefficient GPU utilization when training mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02515","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/2312.02515/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":"2312.02515","created_at":"2026-07-05T09:08:21.999038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02515v2","created_at":"2026-07-05T09:08:21.999038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02515","created_at":"2026-07-05T09:08:21.999038+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTBXDCAMCHQA","created_at":"2026-07-05T09:08:21.999038+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTBXDCAMCHQAPHKH","created_at":"2026-07-05T09:08:21.999038+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTBXDCAM","created_at":"2026-07-05T09:08:21.999038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13779","citing_title":"MinT: Managed Infrastructure for Training and Serving Millions of LLMs","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13779","citing_title":"MinT: Managed Infrastructure for Training and Serving Millions of LLMs","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11328","citing_title":"Epistemic Uncertainty for Test-Time Discovery","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP","json":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP.json","graph_json":"https://pith.science/api/pith-number/BTBXDCAMCHQAPHKHQBAKLEB5WP/graph.json","events_json":"https://pith.science/api/pith-number/BTBXDCAMCHQAPHKHQBAKLEB5WP/events.json","paper":"https://pith.science/paper/BTBXDCAM"},"agent_actions":{"view_html":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP","download_json":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP.json","view_paper":"https://pith.science/paper/BTBXDCAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02515&json=true","fetch_graph":"https://pith.science/api/pith-number/BTBXDCAMCHQAPHKHQBAKLEB5WP/graph.json","fetch_events":"https://pith.science/api/pith-number/BTBXDCAMCHQAPHKHQBAKLEB5WP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP/action/storage_attestation","attest_author":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP/action/author_attestation","sign_citation":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP/action/citation_signature","submit_replication":"https://pith.science/pith/BTBXDCAMCHQAPHKHQBAKLEB5WP/action/replication_record"}},"created_at":"2026-07-05T09:08:21.999038+00:00","updated_at":"2026-07-05T09:08:21.999038+00:00"}