{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5JY5X75TTQPBEJIDX22URK7AWL","short_pith_number":"pith:5JY5X75T","schema_version":"1.0","canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","source":{"kind":"arxiv","id":"1712.00679","version":2},"attestation_state":"computed","paper":{"title":"GANGs: Generative Adversarial Network Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"stat.ML","authors_text":"Edwin D. de Jong, Elise van der Pol, Frans A. Oliehoek, Jose Gallego-Posada, Rahul Savani, Roderich Gross","submitted_at":"2017-12-02T23:38:03Z","abstract_excerpt":"Generative Adversarial Networks (GAN) have become one of the most successful frameworks for unsupervised generative modeling. As GANs are difficult to train much research has focused on this. However, very little of this research has directly exploited game-theoretic techniques. We introduce Generative Adversarial Network Games (GANGs), which explicitly model a finite zero-sum game between a generator ($G$) and classifier ($C$) that use mixed strategies. The size of these games precludes exact solution methods, therefore we define resource-bounded best responses (RBBRs), and a resource-bounded"},"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":"1712.00679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-02T23:38:03Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"d7ccb7db5e821b5d2c2f1fdcbabf9b2e6003056f9904f85f5f68c7c1aad8dd9a","abstract_canon_sha256":"854fb9d3e0ff381e2edd5ffc03b8d3b7b6e838132688950cb342d22580ad775d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.938350Z","signature_b64":"2R9NbPjq1z5hfk2r2krNsagMNik6yRI7/xw3PQOy1jBf5dngEa4Qo+yA2MY+ElTskZSNzd/tAkgKANlezgNhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","last_reissued_at":"2026-05-18T00:27:51.937792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.937792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GANGs: Generative Adversarial Network Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"stat.ML","authors_text":"Edwin D. de Jong, Elise van der Pol, Frans A. Oliehoek, Jose Gallego-Posada, Rahul Savani, Roderich Gross","submitted_at":"2017-12-02T23:38:03Z","abstract_excerpt":"Generative Adversarial Networks (GAN) have become one of the most successful frameworks for unsupervised generative modeling. As GANs are difficult to train much research has focused on this. However, very little of this research has directly exploited game-theoretic techniques. We introduce Generative Adversarial Network Games (GANGs), which explicitly model a finite zero-sum game between a generator ($G$) and classifier ($C$) that use mixed strategies. The size of these games precludes exact solution methods, therefore we define resource-bounded best responses (RBBRs), and a resource-bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00679","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":""},"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":"1712.00679","created_at":"2026-05-18T00:27:51.937914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00679v2","created_at":"2026-05-18T00:27:51.937914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00679","created_at":"2026-05-18T00:27:51.937914+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JY5X75TTQPB","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JY5X75TTQPBEJID","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JY5X75T","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07724","citing_title":"Curated Synthetic Data Doesn't Have to Collapse: A Theoretical Study of Generative Retraining with Pluralistic Preferences","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL","json":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL.json","graph_json":"https://pith.science/api/pith-number/5JY5X75TTQPBEJIDX22URK7AWL/graph.json","events_json":"https://pith.science/api/pith-number/5JY5X75TTQPBEJIDX22URK7AWL/events.json","paper":"https://pith.science/paper/5JY5X75T"},"agent_actions":{"view_html":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL","download_json":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL.json","view_paper":"https://pith.science/paper/5JY5X75T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00679&json=true","fetch_graph":"https://pith.science/api/pith-number/5JY5X75TTQPBEJIDX22URK7AWL/graph.json","fetch_events":"https://pith.science/api/pith-number/5JY5X75TTQPBEJIDX22URK7AWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/action/storage_attestation","attest_author":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/action/author_attestation","sign_citation":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/action/citation_signature","submit_replication":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/action/replication_record"}},"created_at":"2026-05-18T00:27:51.937914+00:00","updated_at":"2026-05-18T00:27:51.937914+00:00"}