{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QIKAH7FPDQLUNBP4BRS7E2PDCF","short_pith_number":"pith:QIKAH7FP","canonical_record":{"source":{"id":"1705.07642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"070206de853b920710c45705ceab72934c39bd8c92f68a550d6834d372491155","abstract_canon_sha256":"b9aee0cd95e943d833b5727a2f39be63689da1d34503613c80c94d9ac46be991"},"schema_version":"1.0"},"canonical_sha256":"821403fcaf1c174685fc0c65f269e31159fa688aae44235d33d82a40487e7ee8","source":{"kind":"arxiv","id":"1705.07642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07642","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07642v1","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07642","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"QIKAH7FPDQLU","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIKAH7FPDQLUNBP4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIKAH7FP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QIKAH7FPDQLUNBP4BRS7E2PDCF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"070206de853b920710c45705ceab72934c39bd8c92f68a550d6834d372491155","abstract_canon_sha256":"b9aee0cd95e943d833b5727a2f39be63689da1d34503613c80c94d9ac46be991"},"schema_version":"1.0"},"canonical_sha256":"821403fcaf1c174685fc0c65f269e31159fa688aae44235d33d82a40487e7ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:04.956283Z","signature_b64":"ueXYEvGl+Pyade3P/qriQojysv8+YMPaNNSXI0JMrf9RxN5lOHx2Jeyq6lRX+9u/1xuemIjBtA5AtAAdSfmCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"821403fcaf1c174685fc0c65f269e31159fa688aae44235d33d82a40487e7ee8","last_reissued_at":"2026-05-18T00:44:04.955795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:04.955795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07642","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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4odA1NELfKG19bcnkhsaG+g6UpAtKpc0J5S7HMJSPEleiwEWL2DB/JB9P1uGMaTlCwrBI9dp1qH6FATFMngEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:31.938495Z"},"content_sha256":"842db0071e1e6aedccdcff0bd99cbe41d8f180cf354bb6fe4808a7a635671b09","schema_version":"1.0","event_id":"sha256:842db0071e1e6aedccdcff0bd99cbe41d8f180cf354bb6fe4808a7a635671b09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QIKAH7FPDQLUNBP4BRS7E2PDCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From optimal transport to generative modeling: the VEGAN cookbook","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bernhard Schoelkopf, Carl-Johann Simon-Gabriel, Ilya Tolstikhin, Olivier Bousquet, Sylvain Gelly","submitted_at":"2017-05-22T10:14:05Z","abstract_excerpt":"We study unsupervised generative modeling in terms of the optimal transport (OT) problem between true (but unknown) data distribution $P_X$ and the latent variable model distribution $P_G$. We show that the OT problem can be equivalently written in terms of probabilistic encoders, which are constrained to match the posterior and prior distributions over the latent space. When relaxed, this constrained optimization problem leads to a penalized optimal transport (POT) objective, which can be efficiently minimized using stochastic gradient descent by sampling from $P_X$ and $P_G$. We show that PO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07642","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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPjqw+L9DnpsuBTDMhIF6Q4uh/Z/jNzKL/Ibq2l80m8lv63iAiduJcsj/KCwlFQwSUMYnZg9r+nV8gSKc5hQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:31.939239Z"},"content_sha256":"cafcc97296caff2b4cb6ddd3602db5f9fed0f8273601fafaeec93a4d073da6c4","schema_version":"1.0","event_id":"sha256:cafcc97296caff2b4cb6ddd3602db5f9fed0f8273601fafaeec93a4d073da6c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/bundle.json","state_url":"https://pith.science/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/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-31T22:25:31Z","links":{"resolver":"https://pith.science/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF","bundle":"https://pith.science/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/bundle.json","state":"https://pith.science/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIKAH7FPDQLUNBP4BRS7E2PDCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QIKAH7FPDQLUNBP4BRS7E2PDCF","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":"b9aee0cd95e943d833b5727a2f39be63689da1d34503613c80c94d9ac46be991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:14:05Z","title_canon_sha256":"070206de853b920710c45705ceab72934c39bd8c92f68a550d6834d372491155"},"schema_version":"1.0","source":{"id":"1705.07642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07642","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07642v1","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07642","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"QIKAH7FPDQLU","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIKAH7FPDQLUNBP4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIKAH7FP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:cafcc97296caff2b4cb6ddd3602db5f9fed0f8273601fafaeec93a4d073da6c4","target":"graph","created_at":"2026-05-18T00:44:04Z","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":"We study unsupervised generative modeling in terms of the optimal transport (OT) problem between true (but unknown) data distribution $P_X$ and the latent variable model distribution $P_G$. We show that the OT problem can be equivalently written in terms of probabilistic encoders, which are constrained to match the posterior and prior distributions over the latent space. When relaxed, this constrained optimization problem leads to a penalized optimal transport (POT) objective, which can be efficiently minimized using stochastic gradient descent by sampling from $P_X$ and $P_G$. We show that PO","authors_text":"Bernhard Schoelkopf, Carl-Johann Simon-Gabriel, Ilya Tolstikhin, Olivier Bousquet, Sylvain Gelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:14:05Z","title":"From optimal transport to generative modeling: the VEGAN cookbook"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07642","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:842db0071e1e6aedccdcff0bd99cbe41d8f180cf354bb6fe4808a7a635671b09","target":"record","created_at":"2026-05-18T00:44:04Z","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":"b9aee0cd95e943d833b5727a2f39be63689da1d34503613c80c94d9ac46be991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:14:05Z","title_canon_sha256":"070206de853b920710c45705ceab72934c39bd8c92f68a550d6834d372491155"},"schema_version":"1.0","source":{"id":"1705.07642","kind":"arxiv","version":1}},"canonical_sha256":"821403fcaf1c174685fc0c65f269e31159fa688aae44235d33d82a40487e7ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"821403fcaf1c174685fc0c65f269e31159fa688aae44235d33d82a40487e7ee8","first_computed_at":"2026-05-18T00:44:04.955795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:04.955795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ueXYEvGl+Pyade3P/qriQojysv8+YMPaNNSXI0JMrf9RxN5lOHx2Jeyq6lRX+9u/1xuemIjBtA5AtAAdSfmCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:04.956283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:842db0071e1e6aedccdcff0bd99cbe41d8f180cf354bb6fe4808a7a635671b09","sha256:cafcc97296caff2b4cb6ddd3602db5f9fed0f8273601fafaeec93a4d073da6c4"],"state_sha256":"1c2cbf80bc227c348791e22cb96011ad10f6f633a656b2a026d69b7c89b1ee29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tajXPcLhVrnYE3N+IWvGDtSEoVnQErTz9lceOyN/nsNjejilAFtvBnRs8Ikb550UivWr0ebtJNLVtxMyqsIvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:25:31.942482Z","bundle_sha256":"5a93119d981b945422943c09685b352f3ad94246985cb02ddb5079bec2d4aec8"}}