{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5JY5X75TTQPBEJIDX22URK7AWL","short_pith_number":"pith:5JY5X75T","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"},"canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","source":{"kind":"arxiv","id":"1712.00679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00679","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00679v2","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00679","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"5JY5X75TTQPB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5JY5X75TTQPBEJID","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5JY5X75T","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5JY5X75TTQPBEJIDX22URK7AWL","target":"record","payload":{"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"},"canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","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"},"source_kind":"arxiv","source_id":"1712.00679","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-05-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBV8+k4EucyV4qhTAZ/uCeRH2JwxsWH4R4sr4AcXU241Z2PPZEuxT7BOsVIMOqQS9PCJevvgaSQjrKCL6v/CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:58:00.513865Z"},"content_sha256":"2a17f5c590293827b658339c22ab0ba18129783a826693f975205f198bdd07e2","schema_version":"1.0","event_id":"sha256:2a17f5c590293827b658339c22ab0ba18129783a826693f975205f198bdd07e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5JY5X75TTQPBEJIDX22URK7AWL","target":"graph","payload":{"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"},"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:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFACD2P2ciH3lBAavn2TR3WLgqkC/TK1JXLBQIQaBdjKFsbwpn8FKT/o+wu+O7ZyJuVZcTaZy4rFW1Pb3liKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:58:00.514209Z"},"content_sha256":"6ecf73d002709a528a3826b70d1232ee48b80a68121a7f097bc67e90d5de022f","schema_version":"1.0","event_id":"sha256:6ecf73d002709a528a3826b70d1232ee48b80a68121a7f097bc67e90d5de022f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/bundle.json","state_url":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JY5X75TTQPBEJIDX22URK7AWL/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-06-01T05:58:00Z","links":{"resolver":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL","bundle":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/bundle.json","state":"https://pith.science/pith/5JY5X75TTQPBEJIDX22URK7AWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JY5X75TTQPBEJIDX22URK7AWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5JY5X75TTQPBEJIDX22URK7AWL","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":"854fb9d3e0ff381e2edd5ffc03b8d3b7b6e838132688950cb342d22580ad775d","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-02T23:38:03Z","title_canon_sha256":"d7ccb7db5e821b5d2c2f1fdcbabf9b2e6003056f9904f85f5f68c7c1aad8dd9a"},"schema_version":"1.0","source":{"id":"1712.00679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00679","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00679v2","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00679","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"5JY5X75TTQPB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5JY5X75TTQPBEJID","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5JY5X75T","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:6ecf73d002709a528a3826b70d1232ee48b80a68121a7f097bc67e90d5de022f","target":"graph","created_at":"2026-05-18T00:27:51Z","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 (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","authors_text":"Edwin D. de Jong, Elise van der Pol, Frans A. Oliehoek, Jose Gallego-Posada, Rahul Savani, Roderich Gross","cross_cats":["cs.GT","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-02T23:38:03Z","title":"GANGs: Generative Adversarial Network Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00679","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:2a17f5c590293827b658339c22ab0ba18129783a826693f975205f198bdd07e2","target":"record","created_at":"2026-05-18T00:27:51Z","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":"854fb9d3e0ff381e2edd5ffc03b8d3b7b6e838132688950cb342d22580ad775d","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-02T23:38:03Z","title_canon_sha256":"d7ccb7db5e821b5d2c2f1fdcbabf9b2e6003056f9904f85f5f68c7c1aad8dd9a"},"schema_version":"1.0","source":{"id":"1712.00679","kind":"arxiv","version":2}},"canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea71dbffb39c1e122503beb548abe0b2cbcd6db825a64c71720fb280a3b8dd8d","first_computed_at":"2026-05-18T00:27:51.937792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:51.937792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2R9NbPjq1z5hfk2r2krNsagMNik6yRI7/xw3PQOy1jBf5dngEa4Qo+yA2MY+ElTskZSNzd/tAkgKANlezgNhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:51.938350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a17f5c590293827b658339c22ab0ba18129783a826693f975205f198bdd07e2","sha256:6ecf73d002709a528a3826b70d1232ee48b80a68121a7f097bc67e90d5de022f"],"state_sha256":"ae1e3d1422fc42685eba1fd58e3c642034e4354622d94047efd7eb75d2bd7665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUZROhYhd98vXAfQx12S38vTumflwpLuxTuJLIPlmIe8ONbI9MZmVs+D8/McjELXth24LIJiWvx1g2jY7++wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:58:00.516168Z","bundle_sha256":"d31f2cff974c8e0b52bbf4437c3e3bf725c4970cd816ed88f0609995d3cf8d4d"}}