{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4A2L7AAZZQ26B564C7X6ACOYG6","short_pith_number":"pith:4A2L7AAZ","schema_version":"1.0","canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","source":{"kind":"arxiv","id":"1906.03471","version":2},"attestation_state":"computed","paper":{"title":"A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bolton Bailey, Chao Zhang, Daniel Hsu, Jian Peng, Matus Telgarsky, Yucheng Chen","submitted_at":"2019-06-08T14:42:54Z","abstract_excerpt":"This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source randomness of the network is a continuous distribution (the \"semi-discrete\" setting), then the Wasserstein distance is realized by a deterministic optimal transport mapping; (b) given an optimal transport mapping between a generator network and a target distribution, the Wasserstein distance may be decreased via a regression between the generated data and the mapped"},"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":"1906.03471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T14:42:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"109761e46d42a14e8a69f265a010dec7404486ba8e07a87fdca5bd362a9834c2","abstract_canon_sha256":"27d85f7f2310a406198544328181e92a024b10c3a57b5e2fcd2ec99616831a4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.959578Z","signature_b64":"3ttYMemgjoW2FcCHsIlhw6OihHLezMwyKpihKHliRy5Q95yjlGgqsQjTfOIzhNymMNZdnEbPm8IpPp+HwiSqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","last_reissued_at":"2026-05-17T23:43:33.958973Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.958973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bolton Bailey, Chao Zhang, Daniel Hsu, Jian Peng, Matus Telgarsky, Yucheng Chen","submitted_at":"2019-06-08T14:42:54Z","abstract_excerpt":"This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source randomness of the network is a continuous distribution (the \"semi-discrete\" setting), then the Wasserstein distance is realized by a deterministic optimal transport mapping; (b) given an optimal transport mapping between a generator network and a target distribution, the Wasserstein distance may be decreased via a regression between the generated data and the mapped"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03471","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03471","created_at":"2026-05-17T23:43:33.959181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03471v2","created_at":"2026-05-17T23:43:33.959181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03471","created_at":"2026-05-17T23:43:33.959181+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A2L7AAZZQ26","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A2L7AAZZQ26B564","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A2L7AAZ","created_at":"2026-05-18T12:33:10.108867+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/4A2L7AAZZQ26B564C7X6ACOYG6","json":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6.json","graph_json":"https://pith.science/api/pith-number/4A2L7AAZZQ26B564C7X6ACOYG6/graph.json","events_json":"https://pith.science/api/pith-number/4A2L7AAZZQ26B564C7X6ACOYG6/events.json","paper":"https://pith.science/paper/4A2L7AAZ"},"agent_actions":{"view_html":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6","download_json":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6.json","view_paper":"https://pith.science/paper/4A2L7AAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03471&json=true","fetch_graph":"https://pith.science/api/pith-number/4A2L7AAZZQ26B564C7X6ACOYG6/graph.json","fetch_events":"https://pith.science/api/pith-number/4A2L7AAZZQ26B564C7X6ACOYG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/action/storage_attestation","attest_author":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/action/author_attestation","sign_citation":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/action/citation_signature","submit_replication":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/action/replication_record"}},"created_at":"2026-05-17T23:43:33.959181+00:00","updated_at":"2026-05-17T23:43:33.959181+00:00"}