{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V5M4OVFMWKTBRMVQRGRZ45FFPC","short_pith_number":"pith:V5M4OVFM","schema_version":"1.0","canonical_sha256":"af59c754acb2a618b2b089a39e74a578a2b6888230d34301e450fcf19f192fd3","source":{"kind":"arxiv","id":"2006.07228","version":2},"attestation_state":"computed","paper":{"title":"FedGAN: Federated Generative Adversarial Networks for Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mohammad Rasouli, Ram Rajagopal, Tao Sun","submitted_at":"2020-06-12T14:36:43Z","abstract_excerpt":"We propose Federated Generative Adversarial Network (FedGAN) for training a GAN across distributed sources of non-independent-and-identically-distributed data sources subject to communication and privacy constraints. Our algorithm uses local generators and discriminators which are periodically synced via an intermediary that averages and broadcasts the generator and discriminator parameters. We theoretically prove the convergence of FedGAN with both equal and two time-scale updates of generator and discriminator, under standard assumptions, using stochastic approximations and communication eff"},"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":"2006.07228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-12T14:36:43Z","cross_cats_sorted":["cs.CV","cs.MA","stat.ML"],"title_canon_sha256":"3cdd8a6219f215cb33a6929b1a34cb9e90307994b197856cd3dc42a15afc0021","abstract_canon_sha256":"23e785da5b3b708e37893b30f45bdd010827d99e8e436b80b0e67add205e8250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:16.640197Z","signature_b64":"7d1S5sLaINGCvLcTEf6rrOXyPZlXzcjqhxPl9/NpSdWIVe1F/HQ5PJHm7xl7zF0JkA1b6IcDpmi3+yZzJGZKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af59c754acb2a618b2b089a39e74a578a2b6888230d34301e450fcf19f192fd3","last_reissued_at":"2026-07-05T01:10:16.639780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:16.639780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedGAN: Federated Generative Adversarial Networks for Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mohammad Rasouli, Ram Rajagopal, Tao Sun","submitted_at":"2020-06-12T14:36:43Z","abstract_excerpt":"We propose Federated Generative Adversarial Network (FedGAN) for training a GAN across distributed sources of non-independent-and-identically-distributed data sources subject to communication and privacy constraints. Our algorithm uses local generators and discriminators which are periodically synced via an intermediary that averages and broadcasts the generator and discriminator parameters. We theoretically prove the convergence of FedGAN with both equal and two time-scale updates of generator and discriminator, under standard assumptions, using stochastic approximations and communication eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07228","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/2006.07228/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":"2006.07228","created_at":"2026-07-05T01:10:16.639840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.07228v2","created_at":"2026-07-05T01:10:16.639840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07228","created_at":"2026-07-05T01:10:16.639840+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5M4OVFMWKTB","created_at":"2026-07-05T01:10:16.639840+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5M4OVFMWKTBRMVQ","created_at":"2026-07-05T01:10:16.639840+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5M4OVFM","created_at":"2026-07-05T01:10:16.639840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22510","citing_title":"Fed-CausalDiff: Decoupled Synchronization for Federated Do-Simulation and Policy Evaluation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08616","citing_title":"Robust Server Defense Against Unreliable Clients in One-Shot Fair Collaborative Machine Learning","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08760","citing_title":"FedGMI: Generative Model-Driven Federated Learning for Probabilistic Mixture Inference","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC","json":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC.json","graph_json":"https://pith.science/api/pith-number/V5M4OVFMWKTBRMVQRGRZ45FFPC/graph.json","events_json":"https://pith.science/api/pith-number/V5M4OVFMWKTBRMVQRGRZ45FFPC/events.json","paper":"https://pith.science/paper/V5M4OVFM"},"agent_actions":{"view_html":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC","download_json":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC.json","view_paper":"https://pith.science/paper/V5M4OVFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.07228&json=true","fetch_graph":"https://pith.science/api/pith-number/V5M4OVFMWKTBRMVQRGRZ45FFPC/graph.json","fetch_events":"https://pith.science/api/pith-number/V5M4OVFMWKTBRMVQRGRZ45FFPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC/action/storage_attestation","attest_author":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC/action/author_attestation","sign_citation":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC/action/citation_signature","submit_replication":"https://pith.science/pith/V5M4OVFMWKTBRMVQRGRZ45FFPC/action/replication_record"}},"created_at":"2026-07-05T01:10:16.639840+00:00","updated_at":"2026-07-05T01:10:16.639840+00:00"}