{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BX6ZJKX4KTHN6CLWR4PIAKHGDP","short_pith_number":"pith:BX6ZJKX4","schema_version":"1.0","canonical_sha256":"0dfd94aafc54cedf09768f1e8028e61bf8ae6c1b241624bfe03920c570812599","source":{"kind":"arxiv","id":"1706.01807","version":1},"attestation_state":"computed","paper":{"title":"GAN and VAE from an Optimal Transport Point of View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Aude Genevay, Gabriel Peyr\\'e, Marco Cuturi","submitted_at":"2017-06-06T15:03:15Z","abstract_excerpt":"This short article revisits some of the ideas introduced in arXiv:1701.07875 and arXiv:1705.07642 in a simple setup. This sheds some lights on the connexions between Variational Autoencoders (VAE), Generative Adversarial Networks (GAN) and Minimum Kantorovitch Estimators (MKE)."},"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":"1706.01807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-06T15:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"ab6ecb55ab19c06e78b013da1b2e65bb85a30dd2fa34989b3dd1c71b657260a3","abstract_canon_sha256":"22a085762540c78fa8f4bf4650a7f83bf990edeb4fd4a37c9b034e85ad95bd55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:55.905325Z","signature_b64":"AzHCyOL202uDnBCTMZMusvWfXrM/O9RrUZblxUMCAfEKnNBRzJW23NglIMZrVov7d2zWoG1H8pB9kiQOh+Y1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dfd94aafc54cedf09768f1e8028e61bf8ae6c1b241624bfe03920c570812599","last_reissued_at":"2026-05-18T00:42:55.904626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:55.904626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GAN and VAE from an Optimal Transport Point of View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Aude Genevay, Gabriel Peyr\\'e, Marco Cuturi","submitted_at":"2017-06-06T15:03:15Z","abstract_excerpt":"This short article revisits some of the ideas introduced in arXiv:1701.07875 and arXiv:1705.07642 in a simple setup. This sheds some lights on the connexions between Variational Autoencoders (VAE), Generative Adversarial Networks (GAN) and Minimum Kantorovitch Estimators (MKE)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01807","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":"1706.01807","created_at":"2026-05-18T00:42:55.904725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01807v1","created_at":"2026-05-18T00:42:55.904725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01807","created_at":"2026-05-18T00:42:55.904725+00:00"},{"alias_kind":"pith_short_12","alias_value":"BX6ZJKX4KTHN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BX6ZJKX4KTHN6CLW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BX6ZJKX4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04050","citing_title":"k-GANs: Ensemble of Generative Models with Semi-Discrete Optimal Transport","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP","json":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP.json","graph_json":"https://pith.science/api/pith-number/BX6ZJKX4KTHN6CLWR4PIAKHGDP/graph.json","events_json":"https://pith.science/api/pith-number/BX6ZJKX4KTHN6CLWR4PIAKHGDP/events.json","paper":"https://pith.science/paper/BX6ZJKX4"},"agent_actions":{"view_html":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP","download_json":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP.json","view_paper":"https://pith.science/paper/BX6ZJKX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01807&json=true","fetch_graph":"https://pith.science/api/pith-number/BX6ZJKX4KTHN6CLWR4PIAKHGDP/graph.json","fetch_events":"https://pith.science/api/pith-number/BX6ZJKX4KTHN6CLWR4PIAKHGDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP/action/storage_attestation","attest_author":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP/action/author_attestation","sign_citation":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP/action/citation_signature","submit_replication":"https://pith.science/pith/BX6ZJKX4KTHN6CLWR4PIAKHGDP/action/replication_record"}},"created_at":"2026-05-18T00:42:55.904725+00:00","updated_at":"2026-05-18T00:42:55.904725+00:00"}