{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H6Z7K6IBNEFF7ABP7LLKLXVKLT","short_pith_number":"pith:H6Z7K6IB","schema_version":"1.0","canonical_sha256":"3fb3f57901690a5f802ffad6a5deaa5ced85836ab75df1dc44835d2ac014fd13","source":{"kind":"arxiv","id":"1811.07296","version":4},"attestation_state":"computed","paper":{"title":"GAN-QP: A Novel GAN Framework without Gradient Vanishing and Lipschitz Constraint","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jianlin Su","submitted_at":"2018-11-18T08:36:03Z","abstract_excerpt":"We know SGAN may have a risk of gradient vanishing. A significant improvement is WGAN, with the help of 1-Lipschitz constraint on discriminator to prevent from gradient vanishing. Is there any GAN having no gradient vanishing and no 1-Lipschitz constraint on discriminator? We do find one, called GAN-QP.\n  To construct a new framework of Generative Adversarial Network (GAN) usually includes three steps: 1. choose a probability divergence; 2. convert it into a dual form; 3. play a min-max game. In this articles, we demonstrate that the first step is not necessary. We can analyse the property of "},"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":"1811.07296","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-18T08:36:03Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"f35bff44154de7e3fc50b3a84e5cf42aed6cde476cc3157d3103e6361ea3c59a","abstract_canon_sha256":"6d781900195ca914e276e7ec218812243d4d5d935828a115e5ec8949468b716c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:13.423086Z","signature_b64":"Rq5JFWmlvp7WsF1gGSemNFJZNCI3fqLjyo8OV97TLxa2iWo8oQYFbizTuY1NuXhRVhDmBzrcYfWG8rp8Lo/cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb3f57901690a5f802ffad6a5deaa5ced85836ab75df1dc44835d2ac014fd13","last_reissued_at":"2026-05-17T23:58:13.422667Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:13.422667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GAN-QP: A Novel GAN Framework without Gradient Vanishing and Lipschitz Constraint","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jianlin Su","submitted_at":"2018-11-18T08:36:03Z","abstract_excerpt":"We know SGAN may have a risk of gradient vanishing. A significant improvement is WGAN, with the help of 1-Lipschitz constraint on discriminator to prevent from gradient vanishing. Is there any GAN having no gradient vanishing and no 1-Lipschitz constraint on discriminator? We do find one, called GAN-QP.\n  To construct a new framework of Generative Adversarial Network (GAN) usually includes three steps: 1. choose a probability divergence; 2. convert it into a dual form; 3. play a min-max game. In this articles, we demonstrate that the first step is not necessary. We can analyse the property of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07296","kind":"arxiv","version":4},"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":"1811.07296","created_at":"2026-05-17T23:58:13.422733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07296v4","created_at":"2026-05-17T23:58:13.422733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07296","created_at":"2026-05-17T23:58:13.422733+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6Z7K6IBNEFF","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6Z7K6IBNEFF7ABP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6Z7K6IB","created_at":"2026-05-18T12:32:28.185984+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/H6Z7K6IBNEFF7ABP7LLKLXVKLT","json":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT.json","graph_json":"https://pith.science/api/pith-number/H6Z7K6IBNEFF7ABP7LLKLXVKLT/graph.json","events_json":"https://pith.science/api/pith-number/H6Z7K6IBNEFF7ABP7LLKLXVKLT/events.json","paper":"https://pith.science/paper/H6Z7K6IB"},"agent_actions":{"view_html":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT","download_json":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT.json","view_paper":"https://pith.science/paper/H6Z7K6IB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07296&json=true","fetch_graph":"https://pith.science/api/pith-number/H6Z7K6IBNEFF7ABP7LLKLXVKLT/graph.json","fetch_events":"https://pith.science/api/pith-number/H6Z7K6IBNEFF7ABP7LLKLXVKLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT/action/storage_attestation","attest_author":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT/action/author_attestation","sign_citation":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT/action/citation_signature","submit_replication":"https://pith.science/pith/H6Z7K6IBNEFF7ABP7LLKLXVKLT/action/replication_record"}},"created_at":"2026-05-17T23:58:13.422733+00:00","updated_at":"2026-05-17T23:58:13.422733+00:00"}