{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4A2L7AAZZQ26B564C7X6ACOYG6","short_pith_number":"pith:4A2L7AAZ","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"},"canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","source":{"kind":"arxiv","id":"1906.03471","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03471","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03471v2","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03471","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"4A2L7AAZZQ26","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4A2L7AAZZQ26B564","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4A2L7AAZ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4A2L7AAZZQ26B564C7X6ACOYG6","target":"record","payload":{"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"},"canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","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"},"source_kind":"arxiv","source_id":"1906.03471","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-17T23:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPKSzv5I5p8ZnFe0hNXyyfR+b7sSlFSS8uIKEiIIIAezRIA4YgKS4xdndok3kw0gFpw00NCp+VdYVqROnUcuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:02:31.796131Z"},"content_sha256":"83b377a12e83d51e6df8582b1dd8a2f2772ed4596d7c572c0edae9e8746011ea","schema_version":"1.0","event_id":"sha256:83b377a12e83d51e6df8582b1dd8a2f2772ed4596d7c572c0edae9e8746011ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4A2L7AAZZQ26B564C7X6ACOYG6","target":"graph","payload":{"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"},"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-17T23:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1bWEgLQC2KcokdzkNCZyRqjqzNEdWjOsxb8w1oaPOH1ykOdsWuy58hulTXtCC+ImQxWqK7CDsUFkXN7BGzjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:02:31.796799Z"},"content_sha256":"841c10ad9b770b366d4095bdb985bfd3da5a895268c3fbff7781fc1d75cd575e","schema_version":"1.0","event_id":"sha256:841c10ad9b770b366d4095bdb985bfd3da5a895268c3fbff7781fc1d75cd575e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/bundle.json","state_url":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4A2L7AAZZQ26B564C7X6ACOYG6/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-27T18:02:31Z","links":{"resolver":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6","bundle":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/bundle.json","state":"https://pith.science/pith/4A2L7AAZZQ26B564C7X6ACOYG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4A2L7AAZZQ26B564C7X6ACOYG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4A2L7AAZZQ26B564C7X6ACOYG6","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":"27d85f7f2310a406198544328181e92a024b10c3a57b5e2fcd2ec99616831a4f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T14:42:54Z","title_canon_sha256":"109761e46d42a14e8a69f265a010dec7404486ba8e07a87fdca5bd362a9834c2"},"schema_version":"1.0","source":{"id":"1906.03471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03471","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03471v2","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03471","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"4A2L7AAZZQ26","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4A2L7AAZZQ26B564","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4A2L7AAZ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:841c10ad9b770b366d4095bdb985bfd3da5a895268c3fbff7781fc1d75cd575e","target":"graph","created_at":"2026-05-17T23:43:33Z","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":"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","authors_text":"Bolton Bailey, Chao Zhang, Daniel Hsu, Jian Peng, Matus Telgarsky, Yucheng Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T14:42:54Z","title":"A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03471","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:83b377a12e83d51e6df8582b1dd8a2f2772ed4596d7c572c0edae9e8746011ea","target":"record","created_at":"2026-05-17T23:43:33Z","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":"27d85f7f2310a406198544328181e92a024b10c3a57b5e2fcd2ec99616831a4f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-08T14:42:54Z","title_canon_sha256":"109761e46d42a14e8a69f265a010dec7404486ba8e07a87fdca5bd362a9834c2"},"schema_version":"1.0","source":{"id":"1906.03471","kind":"arxiv","version":2}},"canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e034bf8019cc35e0f7dc17efe009d837934598c701dc89a9d29ca0dc40cbc06a","first_computed_at":"2026-05-17T23:43:33.958973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.958973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ttYMemgjoW2FcCHsIlhw6OihHLezMwyKpihKHliRy5Q95yjlGgqsQjTfOIzhNymMNZdnEbPm8IpPp+HwiSqDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.959578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b377a12e83d51e6df8582b1dd8a2f2772ed4596d7c572c0edae9e8746011ea","sha256:841c10ad9b770b366d4095bdb985bfd3da5a895268c3fbff7781fc1d75cd575e"],"state_sha256":"d5edaa4c6e704b35dc7c9782a254af93c320e07452d752d674cdefb924cccdef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4nY5IMQ1MnQ32epnaSSFw+iOKue11XHKDL8DfLp8+cH/eLFVt0Z5GRzqQG9dyKc/MHmkS7npFaeBPwc4pcPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:02:31.800299Z","bundle_sha256":"fb166251620a5682a5dd0354f1cbab54526515be1f2c6e2f1fa49c50860ad95e"}}