{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MAFRM4GLO2EOTTW3G6ZC5FBJ55","short_pith_number":"pith:MAFRM4GL","schema_version":"1.0","canonical_sha256":"600b1670cb7688e9cedb37b22e9429ef424c9aba60a5b1b039de4ce684e52cdb","source":{"kind":"arxiv","id":"2501.19389","version":4},"attestation_state":"computed","paper":{"title":"Federated Sketching LoRA: A Flexible Framework for Heterogeneous Collaborative Fine-Tuning of LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher G. Brinton, Dong-Jun Han, Liangqi Yuan, Seyyedali Hosseinalipour, Wenzhi Fang","submitted_at":"2025-01-31T18:44:35Z","abstract_excerpt":"Fine-tuning large language models (LLMs) on resource-constrained clients remains a challenging problem. Recent works have fused low-rank adaptation (LoRA) techniques with federated fine-tuning to mitigate challenges associated with client model sizes and data scarcity. Still, the heterogeneity of resources remains a critical bottleneck: while higher-rank modules generally enhance performance, varying client capabilities constrain LoRA's feasible rank range. Existing approaches attempting to resolve this issue either lack analytical justification or impose additional computational overhead, lea"},"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":"2501.19389","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T18:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"342b906840b52a21c5d7d9807a554d32b18dee7bdac7dce4445d2e74f82defcc","abstract_canon_sha256":"210964d1c86b62e4e5bf594f5632ea9af93f4368d6efa7632260779f2ba60626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:10.970446Z","signature_b64":"W/UmBLW1KfhKzbojhCW0gsK3bTy7RvbWgGWvC1LWeCJXjQE9Hawvs+XuKGRB6DKRFg9Db2MG6P99vlJSI8+ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600b1670cb7688e9cedb37b22e9429ef424c9aba60a5b1b039de4ce684e52cdb","last_reissued_at":"2026-05-26T01:03:10.969408Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:10.969408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Sketching LoRA: A Flexible Framework for Heterogeneous Collaborative Fine-Tuning of LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher G. Brinton, Dong-Jun Han, Liangqi Yuan, Seyyedali Hosseinalipour, Wenzhi Fang","submitted_at":"2025-01-31T18:44:35Z","abstract_excerpt":"Fine-tuning large language models (LLMs) on resource-constrained clients remains a challenging problem. Recent works have fused low-rank adaptation (LoRA) techniques with federated fine-tuning to mitigate challenges associated with client model sizes and data scarcity. Still, the heterogeneity of resources remains a critical bottleneck: while higher-rank modules generally enhance performance, varying client capabilities constrain LoRA's feasible rank range. Existing approaches attempting to resolve this issue either lack analytical justification or impose additional computational overhead, lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19389","kind":"arxiv","version":4},"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/2501.19389/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":"2501.19389","created_at":"2026-05-26T01:03:10.969550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.19389v4","created_at":"2026-05-26T01:03:10.969550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19389","created_at":"2026-05-26T01:03:10.969550+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAFRM4GLO2EO","created_at":"2026-05-26T01:03:10.969550+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAFRM4GLO2EOTTW3","created_at":"2026-05-26T01:03:10.969550+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAFRM4GL","created_at":"2026-05-26T01:03:10.969550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.07977","citing_title":"Self-Play Enhancement via Advantage-Weighted Refinement in Online Federated LLM Fine-Tuning with Real-Time Feedback","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55","json":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55.json","graph_json":"https://pith.science/api/pith-number/MAFRM4GLO2EOTTW3G6ZC5FBJ55/graph.json","events_json":"https://pith.science/api/pith-number/MAFRM4GLO2EOTTW3G6ZC5FBJ55/events.json","paper":"https://pith.science/paper/MAFRM4GL"},"agent_actions":{"view_html":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55","download_json":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55.json","view_paper":"https://pith.science/paper/MAFRM4GL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.19389&json=true","fetch_graph":"https://pith.science/api/pith-number/MAFRM4GLO2EOTTW3G6ZC5FBJ55/graph.json","fetch_events":"https://pith.science/api/pith-number/MAFRM4GLO2EOTTW3G6ZC5FBJ55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55/action/storage_attestation","attest_author":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55/action/author_attestation","sign_citation":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55/action/citation_signature","submit_replication":"https://pith.science/pith/MAFRM4GLO2EOTTW3G6ZC5FBJ55/action/replication_record"}},"created_at":"2026-05-26T01:03:10.969550+00:00","updated_at":"2026-05-26T01:03:10.969550+00:00"}