{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DUHHJL4XFNYJXRUAROUDX6BHRQ","short_pith_number":"pith:DUHHJL4X","schema_version":"1.0","canonical_sha256":"1d0e74af972b709bc6808ba83bf8278c11b9810ed3ead86b80a8a2be5aa1e2da","source":{"kind":"arxiv","id":"2011.12087","version":4},"attestation_state":"computed","paper":{"title":"A Convenient Infinite Dimensional Framework for Generative Adversarial Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Hanno Gottschalk, Hayk Asatryan, Marieke Lippert, Matthias Rottmann","submitted_at":"2020-11-24T13:45:17Z","abstract_excerpt":"In recent years, generative adversarial networks (GANs) have demonstrated impressive experimental results while there are only a few works that foster statistical learning theory for GANs. In this work, we propose an infinite dimensional theoretical framework for generative adversarial learning. We assume that the probability density functions of the underlying measure are uniformly bounded, $k$-times $\\alpha$-H\\\"{o}lder differentiable ($C^{k,\\alpha}$) and uniformly bounded away from zero. Under these assumptions, we show that the Rosenblatt transformation induces an optimal generator, which i"},"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":"2011.12087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-24T13:45:17Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"f463c438d01d7a2180dee3d102ae946d7d9b68c57e07573d247fac1b4e0b6874","abstract_canon_sha256":"5876a03a9dd3be2ac8cb859441677fd0afd96db1f477b808ea8e881ba62079f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:12.998322Z","signature_b64":"ba6pevmogNdvKWmOIfB7zHmqGUNqgnuoW94vhCg64lZCPfrhyBjiCeA+Yy3Y2ee/+WtgUb+BfOzsq6e8t26gAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d0e74af972b709bc6808ba83bf8278c11b9810ed3ead86b80a8a2be5aa1e2da","last_reissued_at":"2026-07-05T05:34:12.997890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:12.997890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convenient Infinite Dimensional Framework for Generative Adversarial Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Hanno Gottschalk, Hayk Asatryan, Marieke Lippert, Matthias Rottmann","submitted_at":"2020-11-24T13:45:17Z","abstract_excerpt":"In recent years, generative adversarial networks (GANs) have demonstrated impressive experimental results while there are only a few works that foster statistical learning theory for GANs. In this work, we propose an infinite dimensional theoretical framework for generative adversarial learning. We assume that the probability density functions of the underlying measure are uniformly bounded, $k$-times $\\alpha$-H\\\"{o}lder differentiable ($C^{k,\\alpha}$) and uniformly bounded away from zero. Under these assumptions, we show that the Rosenblatt transformation induces an optimal generator, which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.12087","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.12087/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.12087","created_at":"2026-07-05T05:34:12.997944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.12087v4","created_at":"2026-07-05T05:34:12.997944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.12087","created_at":"2026-07-05T05:34:12.997944+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUHHJL4XFNYJ","created_at":"2026-07-05T05:34:12.997944+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUHHJL4XFNYJXRUA","created_at":"2026-07-05T05:34:12.997944+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUHHJL4X","created_at":"2026-07-05T05:34:12.997944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19779","citing_title":"Learning Brenier Potentials with Convex Generative Adversarial Neural Networks","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ","json":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ.json","graph_json":"https://pith.science/api/pith-number/DUHHJL4XFNYJXRUAROUDX6BHRQ/graph.json","events_json":"https://pith.science/api/pith-number/DUHHJL4XFNYJXRUAROUDX6BHRQ/events.json","paper":"https://pith.science/paper/DUHHJL4X"},"agent_actions":{"view_html":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ","download_json":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ.json","view_paper":"https://pith.science/paper/DUHHJL4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.12087&json=true","fetch_graph":"https://pith.science/api/pith-number/DUHHJL4XFNYJXRUAROUDX6BHRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DUHHJL4XFNYJXRUAROUDX6BHRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ/action/storage_attestation","attest_author":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ/action/author_attestation","sign_citation":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ/action/citation_signature","submit_replication":"https://pith.science/pith/DUHHJL4XFNYJXRUAROUDX6BHRQ/action/replication_record"}},"created_at":"2026-07-05T05:34:12.997944+00:00","updated_at":"2026-07-05T05:34:12.997944+00:00"}