{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7CUCZJQEN4BVMFBNNGYQVJ6X6J","short_pith_number":"pith:7CUCZJQE","schema_version":"1.0","canonical_sha256":"f8a82ca6046f0356142d69b10aa7d7f24e9a218cf00bf595f968a3ca772667bc","source":{"kind":"arxiv","id":"2403.01023","version":1},"attestation_state":"computed","paper":{"title":"Federated Learning via Lattice Joint Source-Channel Coding","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Lav R. Varshney, Seyed Mohammad Azimi-Abarghouyi","submitted_at":"2024-03-01T22:53:57Z","abstract_excerpt":"This paper introduces a universal federated learning framework that enables over-the-air computation via digital communications, using a new joint source-channel coding scheme. Without relying on channel state information at devices, this scheme employs lattice codes to both quantize model parameters and exploit interference from the devices. A novel two-layer receiver structure at the server is designed to reliably decode an integer combination of the quantized model parameters as a lattice point for the purpose of aggregation. Numerical experiments validate the effectiveness of the proposed "},"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":"2403.01023","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-01T22:53:57Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"9c6cc14a293f21c87b685918736cfbb84a6d50860615468b91cfb177f1282f46","abstract_canon_sha256":"806e4502d1826df4f1de51f67f49246047ae6a4855e93eff2dbdebae6b8de9dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:15.240514Z","signature_b64":"rqn41X+rBhqnrLpjEHJCQxQP96PvEBn6Ihi19XHfJxiU/t02eUVHhCqnfZgEsLj9/W5YE+9YbKGVlA/f8TvAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a82ca6046f0356142d69b10aa7d7f24e9a218cf00bf595f968a3ca772667bc","last_reissued_at":"2026-07-05T07:51:15.240151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:15.240151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Learning via Lattice Joint Source-Channel Coding","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Lav R. Varshney, Seyed Mohammad Azimi-Abarghouyi","submitted_at":"2024-03-01T22:53:57Z","abstract_excerpt":"This paper introduces a universal federated learning framework that enables over-the-air computation via digital communications, using a new joint source-channel coding scheme. Without relying on channel state information at devices, this scheme employs lattice codes to both quantize model parameters and exploit interference from the devices. A novel two-layer receiver structure at the server is designed to reliably decode an integer combination of the quantized model parameters as a lattice point for the purpose of aggregation. Numerical experiments validate the effectiveness of the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01023","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/2403.01023/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":"2403.01023","created_at":"2026-07-05T07:51:15.240208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01023v1","created_at":"2026-07-05T07:51:15.240208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01023","created_at":"2026-07-05T07:51:15.240208+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CUCZJQEN4BV","created_at":"2026-07-05T07:51:15.240208+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CUCZJQEN4BVMFBN","created_at":"2026-07-05T07:51:15.240208+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CUCZJQE","created_at":"2026-07-05T07:51:15.240208+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03388","citing_title":"Memory-Efficient Distributed Unlearning","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J","json":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J.json","graph_json":"https://pith.science/api/pith-number/7CUCZJQEN4BVMFBNNGYQVJ6X6J/graph.json","events_json":"https://pith.science/api/pith-number/7CUCZJQEN4BVMFBNNGYQVJ6X6J/events.json","paper":"https://pith.science/paper/7CUCZJQE"},"agent_actions":{"view_html":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J","download_json":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J.json","view_paper":"https://pith.science/paper/7CUCZJQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01023&json=true","fetch_graph":"https://pith.science/api/pith-number/7CUCZJQEN4BVMFBNNGYQVJ6X6J/graph.json","fetch_events":"https://pith.science/api/pith-number/7CUCZJQEN4BVMFBNNGYQVJ6X6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J/action/storage_attestation","attest_author":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J/action/author_attestation","sign_citation":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J/action/citation_signature","submit_replication":"https://pith.science/pith/7CUCZJQEN4BVMFBNNGYQVJ6X6J/action/replication_record"}},"created_at":"2026-07-05T07:51:15.240208+00:00","updated_at":"2026-07-05T07:51:15.240208+00:00"}