{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:P6KW2YQQDET7JDLZPJFLSMJEWQ","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":"44e4bc85df5790c06a0124d3a0916423f7a06167b82ed4ccf2a564347d5433f4","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-14T11:29:55Z","title_canon_sha256":"4e15b588cf1ee7cc4ef98cf031c598d4cf2de809a81bd1f56cf3ec54fa22bcc5"},"schema_version":"1.0","source":{"id":"2011.07271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.07271","created_at":"2026-07-05T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"2011.07271v2","created_at":"2026-07-05T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07271","created_at":"2026-07-05T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"P6KW2YQQDET7","created_at":"2026-07-05T02:26:51Z"},{"alias_kind":"pith_short_16","alias_value":"P6KW2YQQDET7JDLZ","created_at":"2026-07-05T02:26:51Z"},{"alias_kind":"pith_short_8","alias_value":"P6KW2YQQ","created_at":"2026-07-05T02:26:51Z"}],"graph_snapshots":[{"event_id":"sha256:a7998c17e118465a5aa2e9666e72b7a1c07bb36ef5c09bb4f274bc72e21690e6","target":"graph","created_at":"2026-07-05T02:26:51Z","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/2011.07271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Wireless communications is often subject to channel fading. Various statistical models have been proposed to capture the inherent randomness in fading, and conventional model-based receiver designs rely on accurate knowledge of this underlying distribution, which, in practice, may be complex and intractable. In this work, we propose a neural network-based symbol detection technique for downlink fading channels, which is based on the maximum a-posteriori probability (MAP) detector. To enable training on a diverse ensemble of fading realizations, we propose a federated training scheme, in which ","authors_text":"Deniz Gunduz, Mahdi Boloursaz Mashhadi, Nir Shlezinger, Yonina C. Eldar","cross_cats":["eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-14T11:29:55Z","title":"FedRec: Federated Learning of Universal Receivers over Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07271","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:2e76d99ae5b39000895b3ba590ea4eaa7a46861084b563054b023931e96698c4","target":"record","created_at":"2026-07-05T02:26:51Z","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":"44e4bc85df5790c06a0124d3a0916423f7a06167b82ed4ccf2a564347d5433f4","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-14T11:29:55Z","title_canon_sha256":"4e15b588cf1ee7cc4ef98cf031c598d4cf2de809a81bd1f56cf3ec54fa22bcc5"},"schema_version":"1.0","source":{"id":"2011.07271","kind":"arxiv","version":2}},"canonical_sha256":"7f956d62101927f48d797a4ab93124b4036ab00455571d686ab5d84f29107e64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f956d62101927f48d797a4ab93124b4036ab00455571d686ab5d84f29107e64","first_computed_at":"2026-07-05T02:26:51.809602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:51.809602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ghAAEH2w4mDiyWSYbP1GS2GPImkoun41G0fHl+6DRlJV9e4bTl3jNCempJmoPcSj7+CAW7QUuRALRctVvMMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:51.810155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.07271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e76d99ae5b39000895b3ba590ea4eaa7a46861084b563054b023931e96698c4","sha256:a7998c17e118465a5aa2e9666e72b7a1c07bb36ef5c09bb4f274bc72e21690e6"],"state_sha256":"87b6332da132068ca16f9f564f094896fc3ace44bf5ba1ccd5fb82a37119d366"}