{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3TDYIH3JSL37OBVZDKOJW54FOX","short_pith_number":"pith:3TDYIH3J","schema_version":"1.0","canonical_sha256":"dcc7841f6992f7f706b91a9c9b778575d21260976baf21020b8df33e1a34c9a8","source":{"kind":"arxiv","id":"2505.08830","version":1},"attestation_state":"computed","paper":{"title":"Federated Large Language Models: Feasibility, Robustness, Security and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Guilin Deng, Lin Liu, Shaojing Fu, Shihong Wu, Silong Chen, Wenhao Jiang, Xinwen Gao, Xu Yang, Yuchuan Luo","submitted_at":"2025-05-13T03:23:54Z","abstract_excerpt":"The integration of Large Language Models (LLMs) and Federated Learning (FL) presents a promising solution for joint training on distributed data while preserving privacy and addressing data silo issues. However, this emerging field, known as Federated Large Language Models (FLLM), faces significant challenges, including communication and computation overheads, heterogeneity, privacy and security concerns. Current research has primarily focused on the feasibility of FLLM, but future trends are expected to emphasize enhancing system robustness and security. This paper provides a comprehensive re"},"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.08830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-05-13T03:23:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e4ea31968e43b8ef49202c82ac1231c57ea42f629f6e8e060ced20fb835195ac","abstract_canon_sha256":"f54379afed8e77e96db53e0c98776f4582df00f57feb02097722b44960b61671"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:45.077349Z","signature_b64":"m9WvhBGXJUvDuzWmzPtR6sF9Uijqf1ewTvk7XzyAB3W9be/sIYuVcEO8iVkmO4QhExW+MJFFkMR7mUEHQJJnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcc7841f6992f7f706b91a9c9b778575d21260976baf21020b8df33e1a34c9a8","last_reissued_at":"2026-07-05T11:02:45.076773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:45.076773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Large Language Models: Feasibility, Robustness, Security and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Guilin Deng, Lin Liu, Shaojing Fu, Shihong Wu, Silong Chen, Wenhao Jiang, Xinwen Gao, Xu Yang, Yuchuan Luo","submitted_at":"2025-05-13T03:23:54Z","abstract_excerpt":"The integration of Large Language Models (LLMs) and Federated Learning (FL) presents a promising solution for joint training on distributed data while preserving privacy and addressing data silo issues. However, this emerging field, known as Federated Large Language Models (FLLM), faces significant challenges, including communication and computation overheads, heterogeneity, privacy and security concerns. Current research has primarily focused on the feasibility of FLLM, but future trends are expected to emphasize enhancing system robustness and security. This paper provides a comprehensive re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08830","kind":"arxiv","version":1},"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.08830/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.08830","created_at":"2026-07-05T11:02:45.076843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08830v1","created_at":"2026-07-05T11:02:45.076843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08830","created_at":"2026-07-05T11:02:45.076843+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TDYIH3JSL37","created_at":"2026-07-05T11:02:45.076843+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TDYIH3JSL37OBVZ","created_at":"2026-07-05T11:02:45.076843+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TDYIH3J","created_at":"2026-07-05T11:02:45.076843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18312","citing_title":"TIGER: Inverting Transformer Gradients via Embedding-Subspace Distance Optimization","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX","json":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX.json","graph_json":"https://pith.science/api/pith-number/3TDYIH3JSL37OBVZDKOJW54FOX/graph.json","events_json":"https://pith.science/api/pith-number/3TDYIH3JSL37OBVZDKOJW54FOX/events.json","paper":"https://pith.science/paper/3TDYIH3J"},"agent_actions":{"view_html":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX","download_json":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX.json","view_paper":"https://pith.science/paper/3TDYIH3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08830&json=true","fetch_graph":"https://pith.science/api/pith-number/3TDYIH3JSL37OBVZDKOJW54FOX/graph.json","fetch_events":"https://pith.science/api/pith-number/3TDYIH3JSL37OBVZDKOJW54FOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX/action/storage_attestation","attest_author":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX/action/author_attestation","sign_citation":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX/action/citation_signature","submit_replication":"https://pith.science/pith/3TDYIH3JSL37OBVZDKOJW54FOX/action/replication_record"}},"created_at":"2026-07-05T11:02:45.076843+00:00","updated_at":"2026-07-05T11:02:45.076843+00:00"}