{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XHIESDCSDCDOIV4TKP2UY2GIZE","short_pith_number":"pith:XHIESDCS","schema_version":"1.0","canonical_sha256":"b9d0490c521886e4579353f54c68c8c928c744b0db0d1d6ed29ee69d2421bee6","source":{"kind":"arxiv","id":"1904.08994","version":1},"attestation_state":"computed","paper":{"title":"From GAN to WGAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lilian Weng","submitted_at":"2019-04-18T20:15:08Z","abstract_excerpt":"This paper explains the math behind a generative adversarial network (GAN) model and why it is hard to be trained. Wasserstein GAN is intended to improve GANs' training by adopting a smooth metric for measuring the distance between two probability distributions."},"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":"1904.08994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-18T20:15:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"39de366b6553d8d4381303f70f7e9b23b589bd73727c7b793e0110215e8824e2","abstract_canon_sha256":"3890d40ac09a38ce5bf1fd41b7f5bb2bc3b88b38736acded2e409bb1d46e117a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:08.701865Z","signature_b64":"xVQ1NO/extu5vxcBuYUChcI5k/8Ga/a3fE99m976bDPhyO4cucRi2NahhwiT8TUmuw4TxfP+hinA5VFfKB+GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d0490c521886e4579353f54c68c8c928c744b0db0d1d6ed29ee69d2421bee6","last_reissued_at":"2026-05-17T23:48:08.701240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:08.701240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From GAN to WGAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lilian Weng","submitted_at":"2019-04-18T20:15:08Z","abstract_excerpt":"This paper explains the math behind a generative adversarial network (GAN) model and why it is hard to be trained. Wasserstein GAN is intended to improve GANs' training by adopting a smooth metric for measuring the distance between two probability distributions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08994","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":"1904.08994","created_at":"2026-05-17T23:48:08.701352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08994v1","created_at":"2026-05-17T23:48:08.701352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08994","created_at":"2026-05-17T23:48:08.701352+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHIESDCSDCDO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHIESDCSDCDOIV4T","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHIESDCS","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13512","citing_title":"Physics-driven Comparative Analysis of Various Statistical Distance Metrics and Normalizing Functions","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE","json":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE.json","graph_json":"https://pith.science/api/pith-number/XHIESDCSDCDOIV4TKP2UY2GIZE/graph.json","events_json":"https://pith.science/api/pith-number/XHIESDCSDCDOIV4TKP2UY2GIZE/events.json","paper":"https://pith.science/paper/XHIESDCS"},"agent_actions":{"view_html":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE","download_json":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE.json","view_paper":"https://pith.science/paper/XHIESDCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08994&json=true","fetch_graph":"https://pith.science/api/pith-number/XHIESDCSDCDOIV4TKP2UY2GIZE/graph.json","fetch_events":"https://pith.science/api/pith-number/XHIESDCSDCDOIV4TKP2UY2GIZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE/action/storage_attestation","attest_author":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE/action/author_attestation","sign_citation":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE/action/citation_signature","submit_replication":"https://pith.science/pith/XHIESDCSDCDOIV4TKP2UY2GIZE/action/replication_record"}},"created_at":"2026-05-17T23:48:08.701352+00:00","updated_at":"2026-05-17T23:48:08.701352+00:00"}