{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SFYKC5C3PJNMKVKKBEAG4BOUEQ","short_pith_number":"pith:SFYKC5C3","canonical_record":{"source":{"id":"1806.11382","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-29T12:41:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a57f57f7d0438745112a17ecb5cb31d808d57eafa32ee42abbb234f80346efe0","abstract_canon_sha256":"52c3d746b1f3b77a130aa51932a6eed8b10f0655af878f2f56208f3a8258130a"},"schema_version":"1.0"},"canonical_sha256":"9170a1745b7a5ac5554a09006e05d424370837f226002432214898184e3eda22","source":{"kind":"arxiv","id":"1806.11382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11382","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11382v1","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11382","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"SFYKC5C3PJNM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFYKC5C3PJNMKVKK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFYKC5C3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SFYKC5C3PJNMKVKKBEAG4BOUEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.11382","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-29T12:41:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a57f57f7d0438745112a17ecb5cb31d808d57eafa32ee42abbb234f80346efe0","abstract_canon_sha256":"52c3d746b1f3b77a130aa51932a6eed8b10f0655af878f2f56208f3a8258130a"},"schema_version":"1.0"},"canonical_sha256":"9170a1745b7a5ac5554a09006e05d424370837f226002432214898184e3eda22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:02.039249Z","signature_b64":"v4d0MgY2EhkrdvOsMxaWMBBsB1HdMT2okZMXD/ezzfAO3e4aXA98YWv8Iny4DLPuuvhyllT7Kwo8R5LQsB54DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9170a1745b7a5ac5554a09006e05d424370837f226002432214898184e3eda22","last_reissued_at":"2026-05-18T00:12:02.038582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:02.038582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.11382","source_version":1,"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-05-18T00:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HP4VpW/a5wIQDWk07ZZ49NvOCBet/dFoP59xS6wXnuhceU3n5v0CcU6tEXVr83Bj5YSe9CJGn6uWFz4AbillCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:14:24.015073Z"},"content_sha256":"bd08fa9a2444d291e568e19f0a385bdd605e88e5b14d90e74c32ec90c387ba80","schema_version":"1.0","event_id":"sha256:bd08fa9a2444d291e568e19f0a385bdd605e88e5b14d90e74c32ec90c387ba80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SFYKC5C3PJNMKVKKBEAG4BOUEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Problems with Generative Adversarial Networks (GANs)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Samuel A. Barnett","submitted_at":"2018-06-29T12:41:12Z","abstract_excerpt":"Generative adversarial networks (GANs) are a novel approach to generative modelling, a task whose goal it is to learn a distribution of real data points. They have often proved difficult to train: GANs are unlike many techniques in machine learning, in that they are best described as a two-player game between a discriminator and generator. This has yielded both unreliability in the training process, and a general lack of understanding as to how GANs converge, and if so, to what. The purpose of this dissertation is to provide an account of the theory of GANs suitable for the mathematician, high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11382","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkmfOIZt8nNr4LXLNYgBC2cBbFziZbHVg0XKxRql50EhR/NPtuBRT99qTaa0DZvbV3HRyIfjzxqjlDzeXRBGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:14:24.015741Z"},"content_sha256":"2da2db960e7aeec99546fc8e8cd4b41e852edc6a5e42edf7889be8adbe5f7f81","schema_version":"1.0","event_id":"sha256:2da2db960e7aeec99546fc8e8cd4b41e852edc6a5e42edf7889be8adbe5f7f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/bundle.json","state_url":"https://pith.science/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/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-17T18:14:24Z","links":{"resolver":"https://pith.science/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ","bundle":"https://pith.science/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/bundle.json","state":"https://pith.science/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFYKC5C3PJNMKVKKBEAG4BOUEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SFYKC5C3PJNMKVKKBEAG4BOUEQ","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":"52c3d746b1f3b77a130aa51932a6eed8b10f0655af878f2f56208f3a8258130a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-29T12:41:12Z","title_canon_sha256":"a57f57f7d0438745112a17ecb5cb31d808d57eafa32ee42abbb234f80346efe0"},"schema_version":"1.0","source":{"id":"1806.11382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11382","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11382v1","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11382","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"SFYKC5C3PJNM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFYKC5C3PJNMKVKK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFYKC5C3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:2da2db960e7aeec99546fc8e8cd4b41e852edc6a5e42edf7889be8adbe5f7f81","target":"graph","created_at":"2026-05-18T00:12:02Z","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"},"paper":{"abstract_excerpt":"Generative adversarial networks (GANs) are a novel approach to generative modelling, a task whose goal it is to learn a distribution of real data points. They have often proved difficult to train: GANs are unlike many techniques in machine learning, in that they are best described as a two-player game between a discriminator and generator. This has yielded both unreliability in the training process, and a general lack of understanding as to how GANs converge, and if so, to what. The purpose of this dissertation is to provide an account of the theory of GANs suitable for the mathematician, high","authors_text":"Samuel A. Barnett","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-29T12:41:12Z","title":"Convergence Problems with Generative Adversarial Networks (GANs)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11382","kind":"arxiv","version":1},"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:bd08fa9a2444d291e568e19f0a385bdd605e88e5b14d90e74c32ec90c387ba80","target":"record","created_at":"2026-05-18T00:12:02Z","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":"52c3d746b1f3b77a130aa51932a6eed8b10f0655af878f2f56208f3a8258130a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-29T12:41:12Z","title_canon_sha256":"a57f57f7d0438745112a17ecb5cb31d808d57eafa32ee42abbb234f80346efe0"},"schema_version":"1.0","source":{"id":"1806.11382","kind":"arxiv","version":1}},"canonical_sha256":"9170a1745b7a5ac5554a09006e05d424370837f226002432214898184e3eda22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9170a1745b7a5ac5554a09006e05d424370837f226002432214898184e3eda22","first_computed_at":"2026-05-18T00:12:02.038582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:02.038582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v4d0MgY2EhkrdvOsMxaWMBBsB1HdMT2okZMXD/ezzfAO3e4aXA98YWv8Iny4DLPuuvhyllT7Kwo8R5LQsB54DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:02.039249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd08fa9a2444d291e568e19f0a385bdd605e88e5b14d90e74c32ec90c387ba80","sha256:2da2db960e7aeec99546fc8e8cd4b41e852edc6a5e42edf7889be8adbe5f7f81"],"state_sha256":"2253045dbed7ca6251a19ba3b112a775ffc17e75305105e821840848b4e42561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdomN1VGUxVbOIJRrNQ4/sHV36dYYKBzjamdJhRKazodG2JaYXCyu00BYHBDNO4P3dmMWLbfaE2IjqhlZbcnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T18:14:24.021832Z","bundle_sha256":"85e0217573a3223b0b7277b4db55f6cae23e8b6aa0f17358d7b2ede40e82eb78"}}