{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PBCNHBRV6ZLOTIYQAVZETP5AHM","short_pith_number":"pith:PBCNHBRV","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"},"canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","source":{"kind":"arxiv","id":"2403.13247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.13247","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.13247v2","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13247","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"PBCNHBRV6ZLO","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_16","alias_value":"PBCNHBRV6ZLOTIYQ","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_8","alias_value":"PBCNHBRV","created_at":"2026-07-05T08:00:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PBCNHBRV6ZLOTIYQAVZETP5AHM","target":"record","payload":{"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"},"canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","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"},"source_kind":"arxiv","source_id":"2403.13247","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtc0MIOsw+g1l+vhYJ6g5U0baRAyjWGAO3MygUuoO13Ek42t/FTeZzayKtsPyUv5aWpZhsT/FCyFoKQ/JvQCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:07:32.396607Z"},"content_sha256":"4cd919e782ed7f0c063da538de429c64c01062596da1f0295f75dfb2eb5bc215","schema_version":"1.0","event_id":"sha256:4cd919e782ed7f0c063da538de429c64c01062596da1f0295f75dfb2eb5bc215"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PBCNHBRV6ZLOTIYQAVZETP5AHM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bk9BAddA19FzlvNClRDqPW6xdVzVgQQK4U5MgPPwJGJ6sroPnh99ldaR8u/ZimD6pAdKg8Uqp5XVVNwIqtsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:07:32.397106Z"},"content_sha256":"49c461a0b9d85adf7ebbeb4db42390dcd10fdc1fd1d4332eb27552828ec49292","schema_version":"1.0","event_id":"sha256:49c461a0b9d85adf7ebbeb4db42390dcd10fdc1fd1d4332eb27552828ec49292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/bundle.json","state_url":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T19:07:32Z","links":{"resolver":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM","bundle":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/bundle.json","state":"https://pith.science/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBCNHBRV6ZLOTIYQAVZETP5AHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PBCNHBRV6ZLOTIYQAVZETP5AHM","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":"fb3230df4a807fd58971c64152aea4ce6e21a7929d1f6165fc70f707d4549705","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-20T02:17:47Z","title_canon_sha256":"4cb69cc5530f7817a3f6364f55ec8d28f88b4c654f74543aaef3640db2fd729e"},"schema_version":"1.0","source":{"id":"2403.13247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.13247","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.13247v2","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13247","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"PBCNHBRV6ZLO","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_16","alias_value":"PBCNHBRV6ZLOTIYQ","created_at":"2026-07-05T08:00:04Z"},{"alias_kind":"pith_short_8","alias_value":"PBCNHBRV","created_at":"2026-07-05T08:00:04Z"}],"graph_snapshots":[{"event_id":"sha256:49c461a0b9d85adf7ebbeb4db42390dcd10fdc1fd1d4332eb27552828ec49292","target":"graph","created_at":"2026-07-05T08:00:04Z","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/2403.13247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Abolfazl Hashemi, Antesh Upadhyay, Stanislaw H. \\.Zak, Vishnu Pandi Chellapandi","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-20T02:17:47Z","title":"FedNMUT -- Federated Noisy Model Update Tracking Convergence Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13247","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:4cd919e782ed7f0c063da538de429c64c01062596da1f0295f75dfb2eb5bc215","target":"record","created_at":"2026-07-05T08:00:04Z","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":"fb3230df4a807fd58971c64152aea4ce6e21a7929d1f6165fc70f707d4549705","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-20T02:17:47Z","title_canon_sha256":"4cb69cc5530f7817a3f6364f55ec8d28f88b4c654f74543aaef3640db2fd729e"},"schema_version":"1.0","source":{"id":"2403.13247","kind":"arxiv","version":2}},"canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7844d38635f656e9a310057249bfa03b0237be076a158b636c16182805f3cb54","first_computed_at":"2026-07-05T08:00:04.072182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:00:04.072182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZIRg2DDnPlm9TtHLD1G+Sb5qR7BlWPdgi5oH2OCprwV3SaXONpIp99vEykGoQBsYBlQs9XJwBZRVa5sTYjxDAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:00:04.072598Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.13247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cd919e782ed7f0c063da538de429c64c01062596da1f0295f75dfb2eb5bc215","sha256:49c461a0b9d85adf7ebbeb4db42390dcd10fdc1fd1d4332eb27552828ec49292"],"state_sha256":"ae8d5a4eb6ed3d62576cab09521c5b9f4605f68c860c0bf0c1555b43c3630b91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/UYdwb1VqsLSWUbR7btEeT3XBEGpI7OT6mcSA89ykXKbSJAGk9AZYleKahNCYt8sYKXcd4/48XMKGcaZzvPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:07:32.401839Z","bundle_sha256":"15e893f6b01b6aa4cfe4c1d1c4f78c6ca89d45df27dc3182bb2b572975807958"}}