{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VDPFURMTWI5SET5DVHD7HCF2HB","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":"af955e3e3305d984787d9df0a62f49f2cc84838e56b08d5898268e70cf0c9956","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-23T17:01:08Z","title_canon_sha256":"06f081bd8a6adb9340f8f4b1cb7a0d5f8f9d4470b5d43aa5e1812be0c4919712"},"schema_version":"1.0","source":{"id":"2103.12685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12685","created_at":"2026-07-05T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12685v1","created_at":"2026-07-05T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12685","created_at":"2026-07-05T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"VDPFURMTWI5S","created_at":"2026-07-05T02:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"VDPFURMTWI5SET5D","created_at":"2026-07-05T02:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"VDPFURMT","created_at":"2026-07-05T02:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:c11c084efcc1b7b0955ea0e8aff0475aaf04ce51b882dd6d53f215d323849aa3","target":"graph","created_at":"2026-07-05T02:25:49Z","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/2103.12685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many applications in machine learning can be framed as minimization problems and solved efficiently using gradient-based techniques. However, recent applications of generative models, particularly GANs, have triggered interest in solving min-max games for which standard optimization techniques are often not suitable. Among known problems experienced by practitioners is the lack of convergence guarantees or convergence to a non-optimum cycle. At the heart of these problems is the min-max structure of the GAN objective which creates non-trivial dependencies between the players. We propose to add","authors_text":"Aurelien Lucchi, Kfir Y. Levy, Paulina Grnarova, Thomas Hofmann, Yannic Kilcher","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-23T17:01:08Z","title":"Generative Minimization Networks: Training GANs Without Competition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.12685","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:f0058fc9a370c31b588d2610d943dcd0dd6eafeb9456d230ee9d3219d183dd98","target":"record","created_at":"2026-07-05T02:25:49Z","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":"af955e3e3305d984787d9df0a62f49f2cc84838e56b08d5898268e70cf0c9956","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-23T17:01:08Z","title_canon_sha256":"06f081bd8a6adb9340f8f4b1cb7a0d5f8f9d4470b5d43aa5e1812be0c4919712"},"schema_version":"1.0","source":{"id":"2103.12685","kind":"arxiv","version":1}},"canonical_sha256":"a8de5a4593b23b224fa3a9c7f388ba384536d997ec1b81c2850c55af89000554","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8de5a4593b23b224fa3a9c7f388ba384536d997ec1b81c2850c55af89000554","first_computed_at":"2026-07-05T02:25:49.037503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:49.037503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHV6f/hox/8CfMdZm8svM+BPmhaO4SdFl0OLqW/4kZmPy6iyf+EBJCKC8O9WWqWL5RHKa6f8gSFefuMktGmwAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:49.037860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.12685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0058fc9a370c31b588d2610d943dcd0dd6eafeb9456d230ee9d3219d183dd98","sha256:c11c084efcc1b7b0955ea0e8aff0475aaf04ce51b882dd6d53f215d323849aa3"],"state_sha256":"c1de276dc9e2bfa6bc7a2a1ba4a8b9791f6170cec99e1c508913a98ef4463e25"}