{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KKE4T7I67QDBC5YMHGYAHV5H6I","short_pith_number":"pith:KKE4T7I6","canonical_record":{"source":{"id":"1711.01744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T06:33:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"bae662e2e12c1f2722d949c1dd73fb9d3247d53f9377b459504c6a42cc87436c","abstract_canon_sha256":"826ddae3c6ef29dc03ffabd507dd670829e7963fd85147146af74ad7fffb753d"},"schema_version":"1.0"},"canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","source":{"kind":"arxiv","id":"1711.01744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01744","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01744v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01744","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"KKE4T7I67QDB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKE4T7I67QDBC5YM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKE4T7I6","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KKE4T7I67QDBC5YMHGYAHV5H6I","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T06:33:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"bae662e2e12c1f2722d949c1dd73fb9d3247d53f9377b459504c6a42cc87436c","abstract_canon_sha256":"826ddae3c6ef29dc03ffabd507dd670829e7963fd85147146af74ad7fffb753d"},"schema_version":"1.0"},"canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.988266Z","signature_b64":"FUXIRThorBVMh7UaDE0lFSxtOVat6cJvD7wCsJ1zajHTIA7P3by5wZn0+tSIqd3iQXqRBVL5wwzOF9ucWtGAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","last_reissued_at":"2026-05-18T00:31:16.987688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.987688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01744","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:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMAF1fA8bWr3KCuMA+FhfWfKpBqrJL4nGCGb4FIHWEPeGNRD9iC2w/3qJL00ydSqQjJZ9Jgll55le/sWs2aeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:52:29.525016Z"},"content_sha256":"9f7cebb39d4a3a8512f29532949654d47c737f77af7de74a31a3639e7748fcab","schema_version":"1.0","event_id":"sha256:9f7cebb39d4a3a8512f29532949654d47c737f77af7de74a31a3639e7748fcab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KKE4T7I67QDBC5YMHGYAHV5H6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KGAN: How to Break The Minimax Game in GAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dinh Phung, Trung Le, Tu Dinh Nguyen","submitted_at":"2017-11-06T06:33:01Z","abstract_excerpt":"Generative Adversarial Networks (GANs) were intuitively and attractively explained under the perspective of game theory, wherein two involving parties are a discriminator and a generator. In this game, the task of the discriminator is to discriminate the real and generated (i.e., fake) data, whilst the task of the generator is to generate the fake data that maximally confuses the discriminator. In this paper, we propose a new viewpoint for GANs, which is termed as the minimizing general loss viewpoint. This viewpoint shows a connection between the general loss of a classification problem regar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01744","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:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgBfx1LJeLtg+/GAA8g/fGGbH7hIbLM4Eb+kge5TUbK37Vc8AmJumegQNnjgdh91t3rh+b42KzxZz1WjUBoBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:52:29.525648Z"},"content_sha256":"8aff1e2371c080c1efb1686487ff96aa39fe53bd386c72c7531fbd878aa56c44","schema_version":"1.0","event_id":"sha256:8aff1e2371c080c1efb1686487ff96aa39fe53bd386c72c7531fbd878aa56c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/bundle.json","state_url":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/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-04T20:52:29Z","links":{"resolver":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I","bundle":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/bundle.json","state":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KKE4T7I67QDBC5YMHGYAHV5H6I","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":"826ddae3c6ef29dc03ffabd507dd670829e7963fd85147146af74ad7fffb753d","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T06:33:01Z","title_canon_sha256":"bae662e2e12c1f2722d949c1dd73fb9d3247d53f9377b459504c6a42cc87436c"},"schema_version":"1.0","source":{"id":"1711.01744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01744","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01744v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01744","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"KKE4T7I67QDB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKE4T7I67QDBC5YM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKE4T7I6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8aff1e2371c080c1efb1686487ff96aa39fe53bd386c72c7531fbd878aa56c44","target":"graph","created_at":"2026-05-18T00:31:16Z","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) were intuitively and attractively explained under the perspective of game theory, wherein two involving parties are a discriminator and a generator. In this game, the task of the discriminator is to discriminate the real and generated (i.e., fake) data, whilst the task of the generator is to generate the fake data that maximally confuses the discriminator. In this paper, we propose a new viewpoint for GANs, which is termed as the minimizing general loss viewpoint. This viewpoint shows a connection between the general loss of a classification problem regar","authors_text":"Dinh Phung, Trung Le, Tu Dinh Nguyen","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T06:33:01Z","title":"KGAN: How to Break The Minimax Game in GAN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01744","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:9f7cebb39d4a3a8512f29532949654d47c737f77af7de74a31a3639e7748fcab","target":"record","created_at":"2026-05-18T00:31:16Z","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":"826ddae3c6ef29dc03ffabd507dd670829e7963fd85147146af74ad7fffb753d","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T06:33:01Z","title_canon_sha256":"bae662e2e12c1f2722d949c1dd73fb9d3247d53f9377b459504c6a42cc87436c"},"schema_version":"1.0","source":{"id":"1711.01744","kind":"arxiv","version":1}},"canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","first_computed_at":"2026-05-18T00:31:16.987688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:16.987688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FUXIRThorBVMh7UaDE0lFSxtOVat6cJvD7wCsJ1zajHTIA7P3by5wZn0+tSIqd3iQXqRBVL5wwzOF9ucWtGAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:16.988266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f7cebb39d4a3a8512f29532949654d47c737f77af7de74a31a3639e7748fcab","sha256:8aff1e2371c080c1efb1686487ff96aa39fe53bd386c72c7531fbd878aa56c44"],"state_sha256":"6360a3c7280e6b509a914d72169da3f7141689d90800c72dfe4be75fabf56d22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bsD6iozxZqsQhZzvOXgV+67Kygp6kHs1dSVX+jZI+FxVFmgzFKsPzmj44Vjdy8kQyv9Id0fZHk7tQfYgY8DBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:52:29.528958Z","bundle_sha256":"b284f5830da5e64a810bc7789bf6a4aa7bed9abc0b48769b398e7c7894846b5d"}}