{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TLFTSZCVENGPU6N6MMNSGFQNYY","short_pith_number":"pith:TLFTSZCV","schema_version":"1.0","canonical_sha256":"9acb396455234cfa79be631b23160dc609bb15dc95d04f2370343ff84153b571","source":{"kind":"arxiv","id":"2505.23555","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Federated LoRA in Heterogeneous Wireless Networks with Independent Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bing Luo, Boyu Li, Jiaxiang Geng, Juncheng Wang, Xiaodong Xu, Xiaofeng Tao, Yanzhao Hou","submitted_at":"2025-05-29T15:31:37Z","abstract_excerpt":"Federated LoRA has emerged as a promising technique for efficiently fine-tuning large language models (LLMs) on distributed devices by reducing the number of trainable parameters. However, existing approaches often inadequately overlook the theoretical and practical implications of system and data heterogeneity, thereby failing to optimize the overall training efficiency, particularly in terms of wall-clock time. In this paper, we propose an adaptive federated LoRA strategy with independent client sampling to minimize the convergence wall-clock time of federated fine-tuning under both computat"},"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":"2505.23555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T15:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"bcef7ddb17e9feea14c7a1b53c53dc1d6aeb012cc1c8b774d5fdd4732831d7bf","abstract_canon_sha256":"289a247ed603c9d4ce97627bac206d6284500036a8891567a278eda797df51f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:56.400412Z","signature_b64":"iHYIP2Xqu4cFjfiVydQbIU2vIpT5mdQYQh3zc8YO/S4WTgGj187Vw6kqG4PlsOaFo5TrehBGA1CThtUlHtEXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9acb396455234cfa79be631b23160dc609bb15dc95d04f2370343ff84153b571","last_reissued_at":"2026-07-05T11:35:56.399846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:56.399846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Federated LoRA in Heterogeneous Wireless Networks with Independent Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bing Luo, Boyu Li, Jiaxiang Geng, Juncheng Wang, Xiaodong Xu, Xiaofeng Tao, Yanzhao Hou","submitted_at":"2025-05-29T15:31:37Z","abstract_excerpt":"Federated LoRA has emerged as a promising technique for efficiently fine-tuning large language models (LLMs) on distributed devices by reducing the number of trainable parameters. However, existing approaches often inadequately overlook the theoretical and practical implications of system and data heterogeneity, thereby failing to optimize the overall training efficiency, particularly in terms of wall-clock time. In this paper, we propose an adaptive federated LoRA strategy with independent client sampling to minimize the convergence wall-clock time of federated fine-tuning under both computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23555","kind":"arxiv","version":3},"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/2505.23555/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":"2505.23555","created_at":"2026-07-05T11:35:56.399913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23555v3","created_at":"2026-07-05T11:35:56.399913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23555","created_at":"2026-07-05T11:35:56.399913+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLFTSZCVENGP","created_at":"2026-07-05T11:35:56.399913+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLFTSZCVENGPU6N6","created_at":"2026-07-05T11:35:56.399913+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLFTSZCV","created_at":"2026-07-05T11:35:56.399913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22878","citing_title":"Priority-Aware Learning-Unlearning Correction for Dynamic Decentralized LoRA Fine-Tuning","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY","json":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY.json","graph_json":"https://pith.science/api/pith-number/TLFTSZCVENGPU6N6MMNSGFQNYY/graph.json","events_json":"https://pith.science/api/pith-number/TLFTSZCVENGPU6N6MMNSGFQNYY/events.json","paper":"https://pith.science/paper/TLFTSZCV"},"agent_actions":{"view_html":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY","download_json":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY.json","view_paper":"https://pith.science/paper/TLFTSZCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23555&json=true","fetch_graph":"https://pith.science/api/pith-number/TLFTSZCVENGPU6N6MMNSGFQNYY/graph.json","fetch_events":"https://pith.science/api/pith-number/TLFTSZCVENGPU6N6MMNSGFQNYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY/action/storage_attestation","attest_author":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY/action/author_attestation","sign_citation":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY/action/citation_signature","submit_replication":"https://pith.science/pith/TLFTSZCVENGPU6N6MMNSGFQNYY/action/replication_record"}},"created_at":"2026-07-05T11:35:56.399913+00:00","updated_at":"2026-07-05T11:35:56.399913+00:00"}