{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:STL7XTUEANSDKEIV36BEFPBTBZ","short_pith_number":"pith:STL7XTUE","canonical_record":{"source":{"id":"1906.09691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T02:12:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8461abc80b20a3544c6f6d54456d251140917081315180dca97d44555e774d6c","abstract_canon_sha256":"a5ca03e323e0314bbc1e19e81df041f3c8a4e2baf9ee73bc73898a4832ae5d24"},"schema_version":"1.0"},"canonical_sha256":"94d7fbce840364351115df8242bc330e777a3f4e4e9a3e4b373e092172390112","source":{"kind":"arxiv","id":"1906.09691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09691","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09691v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09691","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"STL7XTUEANSD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"STL7XTUEANSDKEIV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"STL7XTUE","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:STL7XTUEANSDKEIV36BEFPBTBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T02:12:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8461abc80b20a3544c6f6d54456d251140917081315180dca97d44555e774d6c","abstract_canon_sha256":"a5ca03e323e0314bbc1e19e81df041f3c8a4e2baf9ee73bc73898a4832ae5d24"},"schema_version":"1.0"},"canonical_sha256":"94d7fbce840364351115df8242bc330e777a3f4e4e9a3e4b373e092172390112","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:37.109861Z","signature_b64":"Z98+9NsKL0k1c0A2jvAknDm1D7a/SsUZMpKOk4DusZLpJ6x9puySxNfAwXLiT7iDEoVSDeQgmjFcXu/lxuPoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94d7fbce840364351115df8242bc330e777a3f4e4e9a3e4b373e092172390112","last_reissued_at":"2026-05-17T23:42:37.109083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:37.109083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09691","source_version":1,"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrrpM+DzTAybmRuUjzbQytehyz2irSUb1xxkWDNBg3lY1wcmq1H7IjuKlK+2Hjo+gUdA3ia5BDNsNKEDuaXMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:35.548813Z"},"content_sha256":"c855013309fbd2b7192281841ecccfd37ff3625383a780f009aa580911713492","schema_version":"1.0","event_id":"sha256:c855013309fbd2b7192281841ecccfd37ff3625383a780f009aa580911713492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:STL7XTUEANSDKEIV36BEFPBTBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Computation of Optimal Transport Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Courville, Amjad Almahairi, Jacob Leygonie, Jennifer She, Sai Rajeswar","submitted_at":"2019-06-24T02:12:26Z","abstract_excerpt":"Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) are powerful generative models which have been successfully applied to learn maps across high-dimensional domains. However, little is known about the nature of the map learned with a GAN objective. To address this problem, we propose a generative adversarial model in which the discriminator's objective is the $2$-Wasserstein metric. We show that during training, our generator follows the $W_2$-geodesic between the init"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09691","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"},"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvaV42MkMsX02bpjbUu9KibZ55Pn8M+wL08AClHuoiQLDVP6uz9//+BrLPii4zV7o/okuCQj8clyp0QsIqK7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:35.549498Z"},"content_sha256":"dd1c7e07d21833d15e71d7c6d7b176a1057a23998a52fa2de26aab40948f62a6","schema_version":"1.0","event_id":"sha256:dd1c7e07d21833d15e71d7c6d7b176a1057a23998a52fa2de26aab40948f62a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STL7XTUEANSDKEIV36BEFPBTBZ/bundle.json","state_url":"https://pith.science/pith/STL7XTUEANSDKEIV36BEFPBTBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STL7XTUEANSDKEIV36BEFPBTBZ/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-25T18:51:35Z","links":{"resolver":"https://pith.science/pith/STL7XTUEANSDKEIV36BEFPBTBZ","bundle":"https://pith.science/pith/STL7XTUEANSDKEIV36BEFPBTBZ/bundle.json","state":"https://pith.science/pith/STL7XTUEANSDKEIV36BEFPBTBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STL7XTUEANSDKEIV36BEFPBTBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:STL7XTUEANSDKEIV36BEFPBTBZ","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":"a5ca03e323e0314bbc1e19e81df041f3c8a4e2baf9ee73bc73898a4832ae5d24","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T02:12:26Z","title_canon_sha256":"8461abc80b20a3544c6f6d54456d251140917081315180dca97d44555e774d6c"},"schema_version":"1.0","source":{"id":"1906.09691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09691","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09691v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09691","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"STL7XTUEANSD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"STL7XTUEANSDKEIV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"STL7XTUE","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:dd1c7e07d21833d15e71d7c6d7b176a1057a23998a52fa2de26aab40948f62a6","target":"graph","created_at":"2026-05-17T23:42:37Z","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":"Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) are powerful generative models which have been successfully applied to learn maps across high-dimensional domains. However, little is known about the nature of the map learned with a GAN objective. To address this problem, we propose a generative adversarial model in which the discriminator's objective is the $2$-Wasserstein metric. We show that during training, our generator follows the $W_2$-geodesic between the init","authors_text":"Aaron Courville, Amjad Almahairi, Jacob Leygonie, Jennifer She, Sai Rajeswar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T02:12:26Z","title":"Adversarial Computation of Optimal Transport Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09691","kind":"arxiv","version":1},"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:c855013309fbd2b7192281841ecccfd37ff3625383a780f009aa580911713492","target":"record","created_at":"2026-05-17T23:42:37Z","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":"a5ca03e323e0314bbc1e19e81df041f3c8a4e2baf9ee73bc73898a4832ae5d24","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T02:12:26Z","title_canon_sha256":"8461abc80b20a3544c6f6d54456d251140917081315180dca97d44555e774d6c"},"schema_version":"1.0","source":{"id":"1906.09691","kind":"arxiv","version":1}},"canonical_sha256":"94d7fbce840364351115df8242bc330e777a3f4e4e9a3e4b373e092172390112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94d7fbce840364351115df8242bc330e777a3f4e4e9a3e4b373e092172390112","first_computed_at":"2026-05-17T23:42:37.109083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:37.109083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z98+9NsKL0k1c0A2jvAknDm1D7a/SsUZMpKOk4DusZLpJ6x9puySxNfAwXLiT7iDEoVSDeQgmjFcXu/lxuPoCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:37.109861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c855013309fbd2b7192281841ecccfd37ff3625383a780f009aa580911713492","sha256:dd1c7e07d21833d15e71d7c6d7b176a1057a23998a52fa2de26aab40948f62a6"],"state_sha256":"79ab263f6c6bfa85df5c3234e8ecfb8b5125fb9d4df5daec014edcec9cc304e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZ7XxLpsppZLRae4bk/9EB4+x309t5Jw/y7lH3iQ9r7SfcMdM+mgh2il+apXZSaOPWLBkI5PqcH60Jro9YQqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:51:35.553198Z","bundle_sha256":"828d26df5e7285ed9897652bcab4c59e74306720c4790259e5c3986a9a8836f0"}}