{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PBCNHBRV6ZLOTIYQAVZETP5AHM","short_pith_number":"pith:PBCNHBRV","schema_version":"1.0","canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","source":{"kind":"arxiv","id":"2403.13247","version":2},"attestation_state":"computed","paper":{"title":"FedNMUT -- Federated Noisy Model Update Tracking Convergence Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Abolfazl Hashemi, Antesh Upadhyay, Stanislaw H. \\.Zak, Vishnu Pandi Chellapandi","submitted_at":"2024-03-20T02:17:47Z","abstract_excerpt":"A novel Decentralized Noisy Model Update Tracking Federated Learning algorithm (FedNMUT) is proposed that is tailored to function efficiently in the presence of noisy communication channels that reflect imperfect information exchange. This algorithm uses gradient tracking to minimize the impact of data heterogeneity while minimizing communication overhead. The proposed algorithm incorporates noise into its parameters to mimic the conditions of noisy communication channels, thereby enabling consensus among clients through a communication graph topology in such challenging environments. FedNMUT "},"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.13247","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-20T02:17:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4cb69cc5530f7817a3f6364f55ec8d28f88b4c654f74543aaef3640db2fd729e","abstract_canon_sha256":"fb3230df4a807fd58971c64152aea4ce6e21a7929d1f6165fc70f707d4549705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:04.072598Z","signature_b64":"ZIRg2DDnPlm9TtHLD1G+Sb5qR7BlWPdgi5oH2OCprwV3SaXONpIp99vEykGoQBsYBlQs9XJwBZRVa5sTYjxDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","last_reissued_at":"2026-07-05T08:00:04.072182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:04.072182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedNMUT -- Federated Noisy Model Update Tracking Convergence Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Abolfazl Hashemi, Antesh Upadhyay, Stanislaw H. \\.Zak, Vishnu Pandi Chellapandi","submitted_at":"2024-03-20T02:17:47Z","abstract_excerpt":"A novel Decentralized Noisy Model Update Tracking Federated Learning algorithm (FedNMUT) is proposed that is tailored to function efficiently in the presence of noisy communication channels that reflect imperfect information exchange. This algorithm uses gradient tracking to minimize the impact of data heterogeneity while minimizing communication overhead. The proposed algorithm incorporates noise into its parameters to mimic the conditions of noisy communication channels, thereby enabling consensus among clients through a communication graph topology in such challenging environments. FedNMUT "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13247","kind":"arxiv","version":2},"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.13247/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.13247","created_at":"2026-07-05T08:00:04.072248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13247v2","created_at":"2026-07-05T08:00:04.072248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13247","created_at":"2026-07-05T08:00:04.072248+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBCNHBRV6ZLO","created_at":"2026-07-05T08:00:04.072248+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBCNHBRV6ZLOTIYQ","created_at":"2026-07-05T08:00:04.072248+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBCNHBRV","created_at":"2026-07-05T08:00:04.072248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15388","citing_title":"Unified High-Probability Analysis of Stochastic Variance-Reduced Estimation","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM","json":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM.json","graph_json":"https://pith.science/api/pith-number/PBCNHBRV6ZLOTIYQAVZETP5AHM/graph.json","events_json":"https://pith.science/api/pith-number/PBCNHBRV6ZLOTIYQAVZETP5AHM/events.json","paper":"https://pith.science/paper/PBCNHBRV"},"agent_actions":{"view_html":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM","download_json":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM.json","view_paper":"https://pith.science/paper/PBCNHBRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13247&json=true","fetch_graph":"https://pith.science/api/pith-number/PBCNHBRV6ZLOTIYQAVZETP5AHM/graph.json","fetch_events":"https://pith.science/api/pith-number/PBCNHBRV6ZLOTIYQAVZETP5AHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/action/storage_attestation","attest_author":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/action/author_attestation","sign_citation":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/action/citation_signature","submit_replication":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/action/replication_record"}},"created_at":"2026-07-05T08:00:04.072248+00:00","updated_at":"2026-07-05T08:00:04.072248+00:00"}