{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LCBOUVMZY4C34XU3XHE2AWCTHE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d027242514fe6ba2bb8bbdc78cfbfa12b9ba3b34885500f00fc67edaa12b5924","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T06:30:06Z","title_canon_sha256":"0eaa9849bf32cee50168cc3fd99546e4710e59656fb472519b9453fb905efee0"},"schema_version":"1.0","source":{"id":"2401.07496","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07496","created_at":"2026-07-05T09:39:20Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07496v2","created_at":"2026-07-05T09:39:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07496","created_at":"2026-07-05T09:39:20Z"},{"alias_kind":"pith_short_12","alias_value":"LCBOUVMZY4C3","created_at":"2026-07-05T09:39:20Z"},{"alias_kind":"pith_short_16","alias_value":"LCBOUVMZY4C34XU3","created_at":"2026-07-05T09:39:20Z"},{"alias_kind":"pith_short_8","alias_value":"LCBOUVMZ","created_at":"2026-07-05T09:39:20Z"}],"graph_snapshots":[{"event_id":"sha256:ee2606417a1ae1a6af1589acfa87666af6a61bdc1d46af550a7ae25b8ba04add","target":"graph","created_at":"2026-07-05T09:39:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.07496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a novel gradient compression method for federated learning (FL) in wireless systems. The proposed method centers on a low-rank matrix factorization strategy for local gradient compression that is based on one iteration of a distributed Jacobi successive convex approximation (SCA) at each FL round. The low-rank approximation obtained at one round is used as a \"warm start\" initialization for Jacobi SCA in the next FL round. A new protocol termed over-the-air low-rank compression (Ota-LC) incorporating this gradient compression method with over-the-air computation and error fe","authors_text":"Dingzhu Wen, Dongzhu Liu, Mingzhao Guo, Osvaldo Simeone","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T06:30:06Z","title":"Efficient Wireless Federated Learning via Low-Rank Gradient Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07496","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:224953c29df33a15f4c22f4d460771050637aed707d55b4773f9b1625a87f439","target":"record","created_at":"2026-07-05T09:39:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d027242514fe6ba2bb8bbdc78cfbfa12b9ba3b34885500f00fc67edaa12b5924","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-15T06:30:06Z","title_canon_sha256":"0eaa9849bf32cee50168cc3fd99546e4710e59656fb472519b9453fb905efee0"},"schema_version":"1.0","source":{"id":"2401.07496","kind":"arxiv","version":2}},"canonical_sha256":"5882ea5599c705be5e9bb9c9a058533914f053f73ea0c61c738d087574b9d1c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5882ea5599c705be5e9bb9c9a058533914f053f73ea0c61c738d087574b9d1c0","first_computed_at":"2026-07-05T09:39:20.959872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:20.959872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TFaVXHf+kNSCHn/Ppm134+bO4q3BDVxCAPgkRAsScparu8kaajxebeD3x7k2qLm3yj9fwO9t/CVeK5GgPxCJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:20.960278Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.07496","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:224953c29df33a15f4c22f4d460771050637aed707d55b4773f9b1625a87f439","sha256:ee2606417a1ae1a6af1589acfa87666af6a61bdc1d46af550a7ae25b8ba04add"],"state_sha256":"a17dcea4dd6c4f5aace2b3185e16eb809848ab308c5d1fb48ca3ab7ebfc66e49"}