{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LQWRP6LP2KPL3LGLATECXA26WQ","short_pith_number":"pith:LQWRP6LP","schema_version":"1.0","canonical_sha256":"5c2d17f96fd29ebdaccb04c82b835eb425274d2a05e4430a56cbf705b0294837","source":{"kind":"arxiv","id":"2311.09270","version":1},"attestation_state":"computed","paper":{"title":"FedCode: Communication-Efficient Federated Learning via Transferring Codebooks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Nirvana Meratnia, Saeed Khalilian, Tanir Ozcelebi, Vasileios Tsouvalas","submitted_at":"2023-11-15T12:06:32Z","abstract_excerpt":"Federated Learning (FL) is a distributed machine learning paradigm that enables learning models from decentralized local data. While FL offers appealing properties for clients' data privacy, it imposes high communication burdens for exchanging model weights between a server and the clients. Existing approaches rely on model compression techniques, such as pruning and weight clustering to tackle this. However, transmitting the entire set of weight updates at each federated round, even in a compressed format, limits the potential for a substantial reduction in communication volume. We propose Fe"},"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":"2311.09270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-15T12:06:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f96237e524cf826d07484ab02f953ef2da6f435b374f5551dfd2b9cfc2591684","abstract_canon_sha256":"3dc56b84dbc2c991c44f17ba1ed463e724b61f615eccaa244832f847413eb4b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:12.286243Z","signature_b64":"Bu6YNyWMvxzPdBur1eJOErCFEG0X3MoBfpNTabF0MnkDehQtnrHiumqFe4LZ3W/5Fizq3twhXErvMvPBKpIVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c2d17f96fd29ebdaccb04c82b835eb425274d2a05e4430a56cbf705b0294837","last_reissued_at":"2026-07-05T07:13:12.285780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:12.285780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedCode: Communication-Efficient Federated Learning via Transferring Codebooks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Nirvana Meratnia, Saeed Khalilian, Tanir Ozcelebi, Vasileios Tsouvalas","submitted_at":"2023-11-15T12:06:32Z","abstract_excerpt":"Federated Learning (FL) is a distributed machine learning paradigm that enables learning models from decentralized local data. While FL offers appealing properties for clients' data privacy, it imposes high communication burdens for exchanging model weights between a server and the clients. Existing approaches rely on model compression techniques, such as pruning and weight clustering to tackle this. However, transmitting the entire set of weight updates at each federated round, even in a compressed format, limits the potential for a substantial reduction in communication volume. We propose Fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09270","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/2311.09270/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":"2311.09270","created_at":"2026-07-05T07:13:12.285843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09270v1","created_at":"2026-07-05T07:13:12.285843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09270","created_at":"2026-07-05T07:13:12.285843+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQWRP6LP2KPL","created_at":"2026-07-05T07:13:12.285843+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQWRP6LP2KPL3LGL","created_at":"2026-07-05T07:13:12.285843+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQWRP6LP","created_at":"2026-07-05T07:13:12.285843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ","json":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ.json","graph_json":"https://pith.science/api/pith-number/LQWRP6LP2KPL3LGLATECXA26WQ/graph.json","events_json":"https://pith.science/api/pith-number/LQWRP6LP2KPL3LGLATECXA26WQ/events.json","paper":"https://pith.science/paper/LQWRP6LP"},"agent_actions":{"view_html":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ","download_json":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ.json","view_paper":"https://pith.science/paper/LQWRP6LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09270&json=true","fetch_graph":"https://pith.science/api/pith-number/LQWRP6LP2KPL3LGLATECXA26WQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LQWRP6LP2KPL3LGLATECXA26WQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ/action/storage_attestation","attest_author":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ/action/author_attestation","sign_citation":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ/action/citation_signature","submit_replication":"https://pith.science/pith/LQWRP6LP2KPL3LGLATECXA26WQ/action/replication_record"}},"created_at":"2026-07-05T07:13:12.285843+00:00","updated_at":"2026-07-05T07:13:12.285843+00:00"}