{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JEG5N77UJI6QEPMYMS3A64OCAU","short_pith_number":"pith:JEG5N77U","schema_version":"1.0","canonical_sha256":"490dd6fff44a3d023d9864b60f71c2051a905f7c2e27976abd8524fd2c7f04d2","source":{"kind":"arxiv","id":"2306.09780","version":2},"attestation_state":"computed","paper":{"title":"Understanding Deep Generative Models with Generalized Empirical Likelihoods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Marc Deisenroth, M\\'elanie Rey, Shakir Mohamed, Suman Ravuri","submitted_at":"2023-06-16T11:33:47Z","abstract_excerpt":"Understanding how well a deep generative model captures a distribution of high-dimensional data remains an important open challenge. It is especially difficult for certain model classes, such as Generative Adversarial Networks and Diffusion Models, whose models do not admit exact likelihoods. In this work, we demonstrate that generalized empirical likelihood (GEL) methods offer a family of diagnostic tools that can identify many deficiencies of deep generative models (DGMs). We show, with appropriate specification of moment conditions, that the proposed method can identify which modes have bee"},"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":"2306.09780","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-16T11:33:47Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7b1e580b20bb3ed8b06851f74ca3d1e81b0c162f67a50ff25adfeaf53b20238a","abstract_canon_sha256":"112f5c28c7a1e7c3a4d34c0d540bf3d6ef555ab30d4fefe6178abc765ea4cfc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:38:00.994577Z","signature_b64":"Mnp/aw3HhuX60z9Pr0FtrbbdOQr6Zk/ONQTj4L+1irEG4TeN7ZSWVgourJAa1EXKbjZsaRUqpWRLitCDYxyzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"490dd6fff44a3d023d9864b60f71c2051a905f7c2e27976abd8524fd2c7f04d2","last_reissued_at":"2026-07-05T06:38:00.994157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:38:00.994157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Deep Generative Models with Generalized Empirical Likelihoods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Marc Deisenroth, M\\'elanie Rey, Shakir Mohamed, Suman Ravuri","submitted_at":"2023-06-16T11:33:47Z","abstract_excerpt":"Understanding how well a deep generative model captures a distribution of high-dimensional data remains an important open challenge. It is especially difficult for certain model classes, such as Generative Adversarial Networks and Diffusion Models, whose models do not admit exact likelihoods. In this work, we demonstrate that generalized empirical likelihood (GEL) methods offer a family of diagnostic tools that can identify many deficiencies of deep generative models (DGMs). We show, with appropriate specification of moment conditions, that the proposed method can identify which modes have bee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09780","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.09780/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":"2306.09780","created_at":"2026-07-05T06:38:00.994212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.09780v2","created_at":"2026-07-05T06:38:00.994212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09780","created_at":"2026-07-05T06:38:00.994212+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEG5N77UJI6Q","created_at":"2026-07-05T06:38:00.994212+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEG5N77UJI6QEPMY","created_at":"2026-07-05T06:38:00.994212+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEG5N77U","created_at":"2026-07-05T06:38:00.994212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU","json":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU.json","graph_json":"https://pith.science/api/pith-number/JEG5N77UJI6QEPMYMS3A64OCAU/graph.json","events_json":"https://pith.science/api/pith-number/JEG5N77UJI6QEPMYMS3A64OCAU/events.json","paper":"https://pith.science/paper/JEG5N77U"},"agent_actions":{"view_html":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU","download_json":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU.json","view_paper":"https://pith.science/paper/JEG5N77U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.09780&json=true","fetch_graph":"https://pith.science/api/pith-number/JEG5N77UJI6QEPMYMS3A64OCAU/graph.json","fetch_events":"https://pith.science/api/pith-number/JEG5N77UJI6QEPMYMS3A64OCAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU/action/storage_attestation","attest_author":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU/action/author_attestation","sign_citation":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU/action/citation_signature","submit_replication":"https://pith.science/pith/JEG5N77UJI6QEPMYMS3A64OCAU/action/replication_record"}},"created_at":"2026-07-05T06:38:00.994212+00:00","updated_at":"2026-07-05T06:38:00.994212+00:00"}