{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IME2GJEEYTOIG5WWDESKET6I74","short_pith_number":"pith:IME2GJEE","canonical_record":{"source":{"id":"1802.08249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T04:11:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e9fbe7e6c4b70dcac4d49d24a58de528bbb597915c2cd2c3d2f713248326ca57","abstract_canon_sha256":"6eecb3419b346a60857f9f65086a7a58cf4fd44e846f3f8925a0817915ecea24"},"schema_version":"1.0"},"canonical_sha256":"4309a32484c4dc8376d61924a24fc8ff2c5ce20e44865d9587682288642591fb","source":{"kind":"arxiv","id":"1802.08249","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08249","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08249v2","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08249","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"IME2GJEEYTOI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IME2GJEEYTOIG5WW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IME2GJEE","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IME2GJEEYTOIG5WWDESKET6I74","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T04:11:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e9fbe7e6c4b70dcac4d49d24a58de528bbb597915c2cd2c3d2f713248326ca57","abstract_canon_sha256":"6eecb3419b346a60857f9f65086a7a58cf4fd44e846f3f8925a0817915ecea24"},"schema_version":"1.0"},"canonical_sha256":"4309a32484c4dc8376d61924a24fc8ff2c5ce20e44865d9587682288642591fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:28.039061Z","signature_b64":"V813RALzVrjmQAYIVLeuzSvFZ1KO8RWLl2fRpwNdszoKZsslZYRthvTFCToEK9DT7bzlb11l0BM7MH+tg1i9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4309a32484c4dc8376d61924a24fc8ff2c5ce20e44865d9587682288642591fb","last_reissued_at":"2026-05-18T00:15:28.038191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:28.038191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08249","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:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikJ3ehtnVDD0QAU0tchQcei+IMJPMBSryBR0dZhZZdQb+KNBrsI237+39omEB+8rEikvo5r90USUYPAD8uAdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:25.016420Z"},"content_sha256":"74469a13e550133f9cde5bf6cd69e8c1cfac4a9dc49476a029356e33402e649b","schema_version":"1.0","event_id":"sha256:74469a13e550133f9cde5bf6cd69e8c1cfac4a9dc49476a029356e33402e649b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IME2GJEEYTOIG5WWDESKET6I74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Convergence and Robustness of Training GANs with Regularized Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jason D. Lee, Jimmy Ba, Maziar Sanjabi, Meisam Razaviyayn","submitted_at":"2018-02-22T04:11:58Z","abstract_excerpt":"Generative Adversarial Networks (GANs) are one of the most practical methods for learning data distributions. A popular GAN formulation is based on the use of Wasserstein distance as a metric between probability distributions. Unfortunately, minimizing the Wasserstein distance between the data distribution and the generative model distribution is a computationally challenging problem as its objective is non-convex, non-smooth, and even hard to compute. In this work, we show that obtaining gradient information of the smoothed Wasserstein GAN formulation, which is based on regularized Optimal Tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08249","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:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cGAZ8sRnfx5xdQKtg7Qua8GZf8Q9On0yqKxITnim7KKWhWbNdui9DofWYGyVK/6hrabANTgZYfyG6cdQKjcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:25.016795Z"},"content_sha256":"3e0b6ca9d7b6e610bae9e7c9d993e204df8bdaaaee201da9fa369310f2722111","schema_version":"1.0","event_id":"sha256:3e0b6ca9d7b6e610bae9e7c9d993e204df8bdaaaee201da9fa369310f2722111"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IME2GJEEYTOIG5WWDESKET6I74/bundle.json","state_url":"https://pith.science/pith/IME2GJEEYTOIG5WWDESKET6I74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IME2GJEEYTOIG5WWDESKET6I74/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-05-26T06:14:25Z","links":{"resolver":"https://pith.science/pith/IME2GJEEYTOIG5WWDESKET6I74","bundle":"https://pith.science/pith/IME2GJEEYTOIG5WWDESKET6I74/bundle.json","state":"https://pith.science/pith/IME2GJEEYTOIG5WWDESKET6I74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IME2GJEEYTOIG5WWDESKET6I74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IME2GJEEYTOIG5WWDESKET6I74","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":"6eecb3419b346a60857f9f65086a7a58cf4fd44e846f3f8925a0817915ecea24","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T04:11:58Z","title_canon_sha256":"e9fbe7e6c4b70dcac4d49d24a58de528bbb597915c2cd2c3d2f713248326ca57"},"schema_version":"1.0","source":{"id":"1802.08249","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08249","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08249v2","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08249","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"IME2GJEEYTOI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IME2GJEEYTOIG5WW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IME2GJEE","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:3e0b6ca9d7b6e610bae9e7c9d993e204df8bdaaaee201da9fa369310f2722111","target":"graph","created_at":"2026-05-18T00:15:28Z","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) are one of the most practical methods for learning data distributions. A popular GAN formulation is based on the use of Wasserstein distance as a metric between probability distributions. Unfortunately, minimizing the Wasserstein distance between the data distribution and the generative model distribution is a computationally challenging problem as its objective is non-convex, non-smooth, and even hard to compute. In this work, we show that obtaining gradient information of the smoothed Wasserstein GAN formulation, which is based on regularized Optimal Tr","authors_text":"Jason D. Lee, Jimmy Ba, Maziar Sanjabi, Meisam Razaviyayn","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T04:11:58Z","title":"On the Convergence and Robustness of Training GANs with Regularized Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08249","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:74469a13e550133f9cde5bf6cd69e8c1cfac4a9dc49476a029356e33402e649b","target":"record","created_at":"2026-05-18T00:15:28Z","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":"6eecb3419b346a60857f9f65086a7a58cf4fd44e846f3f8925a0817915ecea24","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T04:11:58Z","title_canon_sha256":"e9fbe7e6c4b70dcac4d49d24a58de528bbb597915c2cd2c3d2f713248326ca57"},"schema_version":"1.0","source":{"id":"1802.08249","kind":"arxiv","version":2}},"canonical_sha256":"4309a32484c4dc8376d61924a24fc8ff2c5ce20e44865d9587682288642591fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4309a32484c4dc8376d61924a24fc8ff2c5ce20e44865d9587682288642591fb","first_computed_at":"2026-05-18T00:15:28.038191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:28.038191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V813RALzVrjmQAYIVLeuzSvFZ1KO8RWLl2fRpwNdszoKZsslZYRthvTFCToEK9DT7bzlb11l0BM7MH+tg1i9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:28.039061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08249","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74469a13e550133f9cde5bf6cd69e8c1cfac4a9dc49476a029356e33402e649b","sha256:3e0b6ca9d7b6e610bae9e7c9d993e204df8bdaaaee201da9fa369310f2722111"],"state_sha256":"a47f48468eab499824b6addc770ff323c4330123e951b73ae21ed85d435a7fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QStPk5GS8vw6zaqYZVjxi5VMIFH1OT5kBoTEh8ueuTp31M49vHNyR60qKa1tTFIp4EaCJPLi39OroAmE1nYSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:14:25.019159Z","bundle_sha256":"adf71807576390a5fb78e31976a0670082de0de926569f4a5f85311270b2e1cc"}}