{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HCEWYHTDQW7JC57JGH2SVCLGOF","short_pith_number":"pith:HCEWYHTD","canonical_record":{"source":{"id":"1712.08244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T23:13:27Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"10ec707de1c05e9634c4080d8de2c919a8bc070a28cd73669525ce987e48e794","abstract_canon_sha256":"a548aa0d9b2b59089c8074857f3ab16e31c2dee1992249711b81eb9feb59b039"},"schema_version":"1.0"},"canonical_sha256":"38896c1e6385be9177e931f52a896671553a9cecb507ac6bbb73fd6b468abce7","source":{"kind":"arxiv","id":"1712.08244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08244","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08244v2","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08244","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"HCEWYHTDQW7J","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCEWYHTDQW7JC57J","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCEWYHTD","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HCEWYHTDQW7JC57JGH2SVCLGOF","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T23:13:27Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"10ec707de1c05e9634c4080d8de2c919a8bc070a28cd73669525ce987e48e794","abstract_canon_sha256":"a548aa0d9b2b59089c8074857f3ab16e31c2dee1992249711b81eb9feb59b039"},"schema_version":"1.0"},"canonical_sha256":"38896c1e6385be9177e931f52a896671553a9cecb507ac6bbb73fd6b468abce7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:07.942489Z","signature_b64":"Whm7fLirUBS6olnT7ysaQixE8uYmtRAAImLT3slLRU1M6V4eS0D7GeQvhocZk6011Pp7/t4xtSQJGPhkdk1BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38896c1e6385be9177e931f52a896671553a9cecb507ac6bbb73fd6b468abce7","last_reissued_at":"2026-05-18T00:23:07.941878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:07.941878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08244","source_version":2,"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:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"983Byv4nDkRblr4yaOiM+2E0t9rvrv7UMA2ty+jID57MMtgMELhPwNjgegDcDAOGw08sUQDIyVvmcKwRhDoECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:24.244958Z"},"content_sha256":"2e22bc71a2877f8163a65030fc17aef3a8eadb173fd74ca6dbbfe098287d5157","schema_version":"1.0","event_id":"sha256:2e22bc71a2877f8163a65030fc17aef3a8eadb173fd74ca6dbbfe098287d5157"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HCEWYHTDQW7JC57JGH2SVCLGOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Well Can Generative Adversarial Networks Learn Densities: A Nonparametric View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Tengyuan Liang","submitted_at":"2017-12-21T23:13:27Z","abstract_excerpt":"We study in this paper the rate of convergence for learning densities under the Generative Adversarial Networks (GAN) framework, borrowing insights from nonparametric statistics. We introduce an improved GAN estimator that achieves a faster rate, through simultaneously leveraging the level of smoothness in the target density and the evaluation metric, which in theory remedies the mode collapse problem reported in the literature. A minimax lower bound is constructed to show that when the dimension is large, the exponent in the rate for the new GAN estimator is near optimal. One can view our res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08244","kind":"arxiv","version":2},"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:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76X3T9G2e569HHQvZl24Gvvn9nyyNubEHRYI6/CKNO1ouQBiVnjHGHnM/5IJZWurI4SixgEPBDUGEIDBA+QRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:24.245628Z"},"content_sha256":"861723216228c80e91f8eab66101528f74ed8686235d67f3377f2c9a3620304a","schema_version":"1.0","event_id":"sha256:861723216228c80e91f8eab66101528f74ed8686235d67f3377f2c9a3620304a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/bundle.json","state_url":"https://pith.science/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/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-26T18:53:24Z","links":{"resolver":"https://pith.science/pith/HCEWYHTDQW7JC57JGH2SVCLGOF","bundle":"https://pith.science/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/bundle.json","state":"https://pith.science/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCEWYHTDQW7JC57JGH2SVCLGOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HCEWYHTDQW7JC57JGH2SVCLGOF","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":"a548aa0d9b2b59089c8074857f3ab16e31c2dee1992249711b81eb9feb59b039","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T23:13:27Z","title_canon_sha256":"10ec707de1c05e9634c4080d8de2c919a8bc070a28cd73669525ce987e48e794"},"schema_version":"1.0","source":{"id":"1712.08244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08244","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08244v2","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08244","created_at":"2026-05-18T00:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"HCEWYHTDQW7J","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCEWYHTDQW7JC57J","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCEWYHTD","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:861723216228c80e91f8eab66101528f74ed8686235d67f3377f2c9a3620304a","target":"graph","created_at":"2026-05-18T00:23:07Z","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 in this paper the rate of convergence for learning densities under the Generative Adversarial Networks (GAN) framework, borrowing insights from nonparametric statistics. We introduce an improved GAN estimator that achieves a faster rate, through simultaneously leveraging the level of smoothness in the target density and the evaluation metric, which in theory remedies the mode collapse problem reported in the literature. A minimax lower bound is constructed to show that when the dimension is large, the exponent in the rate for the new GAN estimator is near optimal. One can view our res","authors_text":"Tengyuan Liang","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T23:13:27Z","title":"How Well Can Generative Adversarial Networks Learn Densities: A Nonparametric View"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08244","kind":"arxiv","version":2},"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:2e22bc71a2877f8163a65030fc17aef3a8eadb173fd74ca6dbbfe098287d5157","target":"record","created_at":"2026-05-18T00:23:07Z","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":"a548aa0d9b2b59089c8074857f3ab16e31c2dee1992249711b81eb9feb59b039","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T23:13:27Z","title_canon_sha256":"10ec707de1c05e9634c4080d8de2c919a8bc070a28cd73669525ce987e48e794"},"schema_version":"1.0","source":{"id":"1712.08244","kind":"arxiv","version":2}},"canonical_sha256":"38896c1e6385be9177e931f52a896671553a9cecb507ac6bbb73fd6b468abce7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38896c1e6385be9177e931f52a896671553a9cecb507ac6bbb73fd6b468abce7","first_computed_at":"2026-05-18T00:23:07.941878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:07.941878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Whm7fLirUBS6olnT7ysaQixE8uYmtRAAImLT3slLRU1M6V4eS0D7GeQvhocZk6011Pp7/t4xtSQJGPhkdk1BBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:07.942489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e22bc71a2877f8163a65030fc17aef3a8eadb173fd74ca6dbbfe098287d5157","sha256:861723216228c80e91f8eab66101528f74ed8686235d67f3377f2c9a3620304a"],"state_sha256":"943f5fbc239953c4c85bc5156d621bbabf50f7150390a5112f1972462947ec36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNhatZbjVrW8R2Ggbay9nDxckl8KS3bCKU5jKHQSVKNXk5AvPFhTqeNFj1PuBwrpATDZZi4k/MCTnVl7zZ19DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:53:24.249175Z","bundle_sha256":"b579ebef7f911abb049063fc42f1209237ed0f72530537c53acf413797c9a819"}}