{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V33DCX7ICJOK3NJMI63QSFLOMX","short_pith_number":"pith:V33DCX7I","canonical_record":{"source":{"id":"1907.04050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-09T08:57:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"90b7c6e14d4a200972dddc174c6bb163716780f891d2fe287cae7c48b556789c","abstract_canon_sha256":"7f5611ea843c2debfd97406fea4ea4aeb7475465b6d94919d7f728364a78e4f0"},"schema_version":"1.0"},"canonical_sha256":"aef6315fe8125cadb52c47b709156e65e14de029c3e60d94e14680a937b6e946","source":{"kind":"arxiv","id":"1907.04050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04050","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04050v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04050","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"V33DCX7ICJOK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V33DCX7ICJOK3NJM","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V33DCX7I","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V33DCX7ICJOK3NJMI63QSFLOMX","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-09T08:57:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"90b7c6e14d4a200972dddc174c6bb163716780f891d2fe287cae7c48b556789c","abstract_canon_sha256":"7f5611ea843c2debfd97406fea4ea4aeb7475465b6d94919d7f728364a78e4f0"},"schema_version":"1.0"},"canonical_sha256":"aef6315fe8125cadb52c47b709156e65e14de029c3e60d94e14680a937b6e946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:05.841208Z","signature_b64":"yhwoUMAa4RuEWM/pQQcaWHVIlY8YJIke7BT3JlR0GGhI9AiHkXt3FevCa/w/Zy9Hnwj0ajkIIK/2FQF9W9RjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef6315fe8125cadb52c47b709156e65e14de029c3e60d94e14680a937b6e946","last_reissued_at":"2026-05-17T23:41:05.840441Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:05.840441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04050","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:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlwcGTBqylGAeXNehiGeRq13hfq+o4k1ehvpb5i8Db7rdV6IeBbSc8tOheMwf81KUbxK+u4XsWHnRHOxsowABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:20:54.701782Z"},"content_sha256":"2f96b33e999b820a265d2a0d536bc1a78a202ef56db20339f651f54579214c81","schema_version":"1.0","event_id":"sha256:2f96b33e999b820a265d2a0d536bc1a78a202ef56db20339f651f54579214c81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V33DCX7ICJOK3NJMI63QSFLOMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-GANs: Ensemble of Generative Models with Semi-Discrete Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Luca Ambrogioni, Marcel van Gerven, Umut G\\\"u\\c{c}l\\\"u","submitted_at":"2019-07-09T08:57:49Z","abstract_excerpt":"Generative adversarial networks (GANs) are the state of the art in generative modeling. Unfortunately, most GAN methods are susceptible to mode collapse, meaning that they tend to capture only a subset of the modes of the true distribution. A possible way of dealing with this problem is to use an ensemble of GANs, where (ideally) each network models a single mode. In this paper, we introduce a principled method for training an ensemble of GANs using semi-discrete optimal transport theory. In our approach, each generative network models the transportation map between a point mass (Dirac measure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04050","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:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La1EzmpmVCsTcVu3GdnfFzvldA/JbZv5AvOUvq8VLsFvMFUiMeEBmG4wBXk+gq8IH3GFPzpNLADGbX/uqxNvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:20:54.702243Z"},"content_sha256":"749947078413c3524e8faab19870ca06e19baf192ff6ca0409165b8e0a41635c","schema_version":"1.0","event_id":"sha256:749947078413c3524e8faab19870ca06e19baf192ff6ca0409165b8e0a41635c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V33DCX7ICJOK3NJMI63QSFLOMX/bundle.json","state_url":"https://pith.science/pith/V33DCX7ICJOK3NJMI63QSFLOMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V33DCX7ICJOK3NJMI63QSFLOMX/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-25T19:20:54Z","links":{"resolver":"https://pith.science/pith/V33DCX7ICJOK3NJMI63QSFLOMX","bundle":"https://pith.science/pith/V33DCX7ICJOK3NJMI63QSFLOMX/bundle.json","state":"https://pith.science/pith/V33DCX7ICJOK3NJMI63QSFLOMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V33DCX7ICJOK3NJMI63QSFLOMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V33DCX7ICJOK3NJMI63QSFLOMX","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":"7f5611ea843c2debfd97406fea4ea4aeb7475465b6d94919d7f728364a78e4f0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-09T08:57:49Z","title_canon_sha256":"90b7c6e14d4a200972dddc174c6bb163716780f891d2fe287cae7c48b556789c"},"schema_version":"1.0","source":{"id":"1907.04050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04050","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04050v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04050","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"V33DCX7ICJOK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V33DCX7ICJOK3NJM","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V33DCX7I","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:749947078413c3524e8faab19870ca06e19baf192ff6ca0409165b8e0a41635c","target":"graph","created_at":"2026-05-17T23:41:05Z","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":"Generative adversarial networks (GANs) are the state of the art in generative modeling. Unfortunately, most GAN methods are susceptible to mode collapse, meaning that they tend to capture only a subset of the modes of the true distribution. A possible way of dealing with this problem is to use an ensemble of GANs, where (ideally) each network models a single mode. In this paper, we introduce a principled method for training an ensemble of GANs using semi-discrete optimal transport theory. In our approach, each generative network models the transportation map between a point mass (Dirac measure","authors_text":"Luca Ambrogioni, Marcel van Gerven, Umut G\\\"u\\c{c}l\\\"u","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-09T08:57:49Z","title":"k-GANs: Ensemble of Generative Models with Semi-Discrete Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04050","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:2f96b33e999b820a265d2a0d536bc1a78a202ef56db20339f651f54579214c81","target":"record","created_at":"2026-05-17T23:41:05Z","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":"7f5611ea843c2debfd97406fea4ea4aeb7475465b6d94919d7f728364a78e4f0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-09T08:57:49Z","title_canon_sha256":"90b7c6e14d4a200972dddc174c6bb163716780f891d2fe287cae7c48b556789c"},"schema_version":"1.0","source":{"id":"1907.04050","kind":"arxiv","version":1}},"canonical_sha256":"aef6315fe8125cadb52c47b709156e65e14de029c3e60d94e14680a937b6e946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aef6315fe8125cadb52c47b709156e65e14de029c3e60d94e14680a937b6e946","first_computed_at":"2026-05-17T23:41:05.840441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:05.840441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhwoUMAa4RuEWM/pQQcaWHVIlY8YJIke7BT3JlR0GGhI9AiHkXt3FevCa/w/Zy9Hnwj0ajkIIK/2FQF9W9RjCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:05.841208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f96b33e999b820a265d2a0d536bc1a78a202ef56db20339f651f54579214c81","sha256:749947078413c3524e8faab19870ca06e19baf192ff6ca0409165b8e0a41635c"],"state_sha256":"c7c9641efb07b38d5adb48c4c912160fc29d9a93a3b5ccf310d918ea06b542e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by91iZ3UwPWowgM6hhdHv9RqhHHU3Hn81I5ime5kO1ky5SxIupO2BmfcmsEUnZncZHd8w76QLYapMdHWGXjPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:20:54.704912Z","bundle_sha256":"e69faca7f8e9f9a4fcd2f091d5ca55eae99cd6b5f95e848fd858be0b32718e5e"}}