{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:S6UN4MCXN2BC4Q7XTXBRO536F7","short_pith_number":"pith:S6UN4MCX","schema_version":"1.0","canonical_sha256":"97a8de30576e822e43f79dc317777e2fd6219bf6899d2737a02759393991a637","source":{"kind":"arxiv","id":"2410.10200","version":2},"attestation_state":"computed","paper":{"title":"Fed-pilot: Optimizing LoRA Allocation for Efficient Federated Fine-Tuning with Heterogeneous Clients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jiahao Xu, Ping Liu, Rui Hu, Zikai Zhang","submitted_at":"2024-10-14T06:36:41Z","abstract_excerpt":"Federated Learning enables the fine-tuning of foundation models (FMs) across distributed clients for specific tasks; however, its scalability is limited by the heterogeneity of client memory capacities. In this work, we propose Fed-pilot, a memory-efficient federated fine-tuning framework. It enables memory-constrained clients to participate in Low-Rank Adaptation (LoRA)-based fine-tuning by training only a subset of LoRA modules locally. Fed-pilot identifies the optimal selection of trainable LoRA modules as a knapsack optimization problem, maximizing model performance under memory constraint"},"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":"2410.10200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-14T06:36:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c277a95d61c9b536ab0059dcb9de84ea4af06ab9a2cac07ef92a72cd7594c2cb","abstract_canon_sha256":"6a84709e5e1cdb971ea7c2f4d5ead7e267d1ef65d26bb3185627e6cb0e4c07cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:04.332751Z","signature_b64":"CJDlYBBqeIkrTsrQePRuz4kCjYw7QXeHng/RQ6HYd9SoH9ff+4VuLKIFgJwsGeae5Ur9cnuny8VU7oPiSNZBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a8de30576e822e43f79dc317777e2fd6219bf6899d2737a02759393991a637","last_reissued_at":"2026-07-05T11:25:04.329957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:04.329957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fed-pilot: Optimizing LoRA Allocation for Efficient Federated Fine-Tuning with Heterogeneous Clients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jiahao Xu, Ping Liu, Rui Hu, Zikai Zhang","submitted_at":"2024-10-14T06:36:41Z","abstract_excerpt":"Federated Learning enables the fine-tuning of foundation models (FMs) across distributed clients for specific tasks; however, its scalability is limited by the heterogeneity of client memory capacities. In this work, we propose Fed-pilot, a memory-efficient federated fine-tuning framework. It enables memory-constrained clients to participate in Low-Rank Adaptation (LoRA)-based fine-tuning by training only a subset of LoRA modules locally. Fed-pilot identifies the optimal selection of trainable LoRA modules as a knapsack optimization problem, maximizing model performance under memory constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10200","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/2410.10200/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":"2410.10200","created_at":"2026-07-05T11:25:04.330024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10200v2","created_at":"2026-07-05T11:25:04.330024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10200","created_at":"2026-07-05T11:25:04.330024+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6UN4MCXN2BC","created_at":"2026-07-05T11:25:04.330024+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6UN4MCXN2BC4Q7X","created_at":"2026-07-05T11:25:04.330024+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6UN4MCX","created_at":"2026-07-05T11:25:04.330024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12213","citing_title":"Fed-HeLLo: Efficient Federated Foundation Model Fine-Tuning with Heterogeneous LoRA Allocation","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7","json":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7.json","graph_json":"https://pith.science/api/pith-number/S6UN4MCXN2BC4Q7XTXBRO536F7/graph.json","events_json":"https://pith.science/api/pith-number/S6UN4MCXN2BC4Q7XTXBRO536F7/events.json","paper":"https://pith.science/paper/S6UN4MCX"},"agent_actions":{"view_html":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7","download_json":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7.json","view_paper":"https://pith.science/paper/S6UN4MCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10200&json=true","fetch_graph":"https://pith.science/api/pith-number/S6UN4MCXN2BC4Q7XTXBRO536F7/graph.json","fetch_events":"https://pith.science/api/pith-number/S6UN4MCXN2BC4Q7XTXBRO536F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7/action/storage_attestation","attest_author":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7/action/author_attestation","sign_citation":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7/action/citation_signature","submit_replication":"https://pith.science/pith/S6UN4MCXN2BC4Q7XTXBRO536F7/action/replication_record"}},"created_at":"2026-07-05T11:25:04.330024+00:00","updated_at":"2026-07-05T11:25:04.330024+00:00"}