{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KKE4T7I67QDBC5YMHGYAHV5H6I","short_pith_number":"pith:KKE4T7I6","schema_version":"1.0","canonical_sha256":"5289c9fd1efc0611770c39b003d7a7f230c3a0a4bc4c72a17a97f65a64f97437","source":{"kind":"arxiv","id":"1711.01744","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01744","created_at":"2026-05-18T00:31:16.987772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01744v1","created_at":"2026-05-18T00:31:16.987772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01744","created_at":"2026-05-18T00:31:16.987772+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKE4T7I67QDB","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKE4T7I67QDBC5YM","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKE4T7I6","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I","json":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I.json","graph_json":"https://pith.science/api/pith-number/KKE4T7I67QDBC5YMHGYAHV5H6I/graph.json","events_json":"https://pith.science/api/pith-number/KKE4T7I67QDBC5YMHGYAHV5H6I/events.json","paper":"https://pith.science/paper/KKE4T7I6"},"agent_actions":{"view_html":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I","download_json":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I.json","view_paper":"https://pith.science/paper/KKE4T7I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01744&json=true","fetch_graph":"https://pith.science/api/pith-number/KKE4T7I67QDBC5YMHGYAHV5H6I/graph.json","fetch_events":"https://pith.science/api/pith-number/KKE4T7I67QDBC5YMHGYAHV5H6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/action/storage_attestation","attest_author":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/action/author_attestation","sign_citation":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/action/citation_signature","submit_replication":"https://pith.science/pith/KKE4T7I67QDBC5YMHGYAHV5H6I/action/replication_record"}},"created_at":"2026-05-18T00:31:16.987772+00:00","updated_at":"2026-05-18T00:31:16.987772+00:00"}