{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TCSG3NF4M4J5PCXAGM7JJ5TMVP","short_pith_number":"pith:TCSG3NF4","canonical_record":{"source":{"id":"1711.10337","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-28T15:19:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"88f877e328aec7010da7ef557b0c183d823ce0f301c45986004998ac8a0f3718","abstract_canon_sha256":"d52a77a6f51b923cc3a393122c55f6ac8964a5412480db1d861e8803bf2c8a27"},"schema_version":"1.0"},"canonical_sha256":"98a46db4bc6713d78ae0333e94f66cabcf9c29465c1c560a36ced7a10fdd4661","source":{"kind":"arxiv","id":"1711.10337","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10337","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10337v4","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10337","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"TCSG3NF4M4J5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCSG3NF4M4J5PCXA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCSG3NF4","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TCSG3NF4M4J5PCXAGM7JJ5TMVP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10337","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-28T15:19:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"88f877e328aec7010da7ef557b0c183d823ce0f301c45986004998ac8a0f3718","abstract_canon_sha256":"d52a77a6f51b923cc3a393122c55f6ac8964a5412480db1d861e8803bf2c8a27"},"schema_version":"1.0"},"canonical_sha256":"98a46db4bc6713d78ae0333e94f66cabcf9c29465c1c560a36ced7a10fdd4661","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.118973Z","signature_b64":"ct4h8/omR3OjVoHDFKQgcv2yhvdvs2g/BOJm0VVaZ3bqaOuu4CNUbyPv0NQHJWlKzJS6Fe+jV9TFzRgC006pCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a46db4bc6713d78ae0333e94f66cabcf9c29465c1c560a36ced7a10fdd4661","last_reissued_at":"2026-05-18T00:02:13.118330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.118330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10337","source_version":4,"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:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYESLHrpTvgBX+cTYBD/1C+zCuGKSFwFVFPOPydNtgP/d/UD2ODKU65H5jh+7ncqYPCgk13qyPQDt2alZUBFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:30:20.972006Z"},"content_sha256":"33d995a09d35913d7a0b58aaa99068209e4b0f1ce24c4142159d9e915c1ca2dc","schema_version":"1.0","event_id":"sha256:33d995a09d35913d7a0b58aaa99068209e4b0f1ce24c4142159d9e915c1ca2dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TCSG3NF4M4J5PCXAGM7JJ5TMVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are GANs Created Equal? A Large-Scale Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Karol Kurach, Marcin Michalski, Mario Lucic, Olivier Bousquet, Sylvain Gelly","submitted_at":"2017-11-28T15:19:53Z","abstract_excerpt":"Generative adversarial networks (GAN) are a powerful subclass of generative models. Despite a very rich research activity leading to numerous interesting GAN algorithms, it is still very hard to assess which algorithm(s) perform better than others. We conduct a neutral, multi-faceted large-scale empirical study on state-of-the art models and evaluation measures. We find that most models can reach similar scores with enough hyperparameter optimization and random restarts. This suggests that improvements can arise from a higher computational budget and tuning more than fundamental algorithmic ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10337","kind":"arxiv","version":4},"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:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxjTEV4i/W2Xm70SG0VP0XxM6l3zoakQD60+mq4rH8nMPfFypptx7WihfhS35lqUEhI+/35ky67B+7f5V+svBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:30:20.972658Z"},"content_sha256":"2ee76a00621470f5672197226249830c6f45a8ae2b1bb33bf1d878b0c4957f52","schema_version":"1.0","event_id":"sha256:2ee76a00621470f5672197226249830c6f45a8ae2b1bb33bf1d878b0c4957f52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/bundle.json","state_url":"https://pith.science/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/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-27T15:30:20Z","links":{"resolver":"https://pith.science/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP","bundle":"https://pith.science/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/bundle.json","state":"https://pith.science/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCSG3NF4M4J5PCXAGM7JJ5TMVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TCSG3NF4M4J5PCXAGM7JJ5TMVP","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":"d52a77a6f51b923cc3a393122c55f6ac8964a5412480db1d861e8803bf2c8a27","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-28T15:19:53Z","title_canon_sha256":"88f877e328aec7010da7ef557b0c183d823ce0f301c45986004998ac8a0f3718"},"schema_version":"1.0","source":{"id":"1711.10337","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10337","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10337v4","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10337","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"TCSG3NF4M4J5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCSG3NF4M4J5PCXA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCSG3NF4","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:2ee76a00621470f5672197226249830c6f45a8ae2b1bb33bf1d878b0c4957f52","target":"graph","created_at":"2026-05-18T00:02:13Z","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 (GAN) are a powerful subclass of generative models. Despite a very rich research activity leading to numerous interesting GAN algorithms, it is still very hard to assess which algorithm(s) perform better than others. We conduct a neutral, multi-faceted large-scale empirical study on state-of-the art models and evaluation measures. We find that most models can reach similar scores with enough hyperparameter optimization and random restarts. This suggests that improvements can arise from a higher computational budget and tuning more than fundamental algorithmic ch","authors_text":"Karol Kurach, Marcin Michalski, Mario Lucic, Olivier Bousquet, Sylvain Gelly","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-28T15:19:53Z","title":"Are GANs Created Equal? A Large-Scale Study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10337","kind":"arxiv","version":4},"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:33d995a09d35913d7a0b58aaa99068209e4b0f1ce24c4142159d9e915c1ca2dc","target":"record","created_at":"2026-05-18T00:02:13Z","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":"d52a77a6f51b923cc3a393122c55f6ac8964a5412480db1d861e8803bf2c8a27","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-28T15:19:53Z","title_canon_sha256":"88f877e328aec7010da7ef557b0c183d823ce0f301c45986004998ac8a0f3718"},"schema_version":"1.0","source":{"id":"1711.10337","kind":"arxiv","version":4}},"canonical_sha256":"98a46db4bc6713d78ae0333e94f66cabcf9c29465c1c560a36ced7a10fdd4661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98a46db4bc6713d78ae0333e94f66cabcf9c29465c1c560a36ced7a10fdd4661","first_computed_at":"2026-05-18T00:02:13.118330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:13.118330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ct4h8/omR3OjVoHDFKQgcv2yhvdvs2g/BOJm0VVaZ3bqaOuu4CNUbyPv0NQHJWlKzJS6Fe+jV9TFzRgC006pCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:13.118973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10337","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33d995a09d35913d7a0b58aaa99068209e4b0f1ce24c4142159d9e915c1ca2dc","sha256:2ee76a00621470f5672197226249830c6f45a8ae2b1bb33bf1d878b0c4957f52"],"state_sha256":"96fee1cbff5e07e244f06dd4f1e441f9b793d30df6028b176c6da4ee2bf50848"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaLNz8FpdOwmwrNZe25ocU0dv3GxcHov21Z7gikI8K4BOfh4JSQE8Czs+9Q1TLYYK5AOo+DqMlaiJYIV4y+oBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:30:20.975939Z","bundle_sha256":"4990e4507acb22541c28eb23a808824afc5c068909b3a1fbbad7062851c66bff"}}