{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SQEQARWHZNGGACPJLXN6OYQTK7","short_pith_number":"pith:SQEQARWH","schema_version":"1.0","canonical_sha256":"94090046c7cb4c6009e95ddbe7621357edb6f40c7a1a487254886c14130a5f58","source":{"kind":"arxiv","id":"1302.5125","version":1},"attestation_state":"computed","paper":{"title":"High-Dimensional Probability Estimation with Deep Density Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Oren Rippel, Ryan Prescott Adams","submitted_at":"2013-02-20T21:20:30Z","abstract_excerpt":"One of the fundamental problems in machine learning is the estimation of a probability distribution from data. Many techniques have been proposed to study the structure of data, most often building around the assumption that observations lie on a lower-dimensional manifold of high probability. It has been more difficult, however, to exploit this insight to build explicit, tractable density models for high-dimensional data. In this paper, we introduce the deep density model (DDM), a new approach to density estimation. We exploit insights from deep learning to construct a bijective map to a repr"},"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":"1302.5125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-20T21:20:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0d73a2fe913758832171308caf0588231b3de722c4445923fcd3cf5173ebd155","abstract_canon_sha256":"d1b97ad9129fb9f531246d10af89a96133603eb1aca5983c856daa4a5da55a24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:59.625059Z","signature_b64":"W+eqHG78F7uAgkvHYky6nFAJQJC/yd0hBvCzQwWRf/q2TtSsLLekHfprufkSnHgrBN7CfUz5JwCtsNpP1FyYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94090046c7cb4c6009e95ddbe7621357edb6f40c7a1a487254886c14130a5f58","last_reissued_at":"2026-05-18T03:32:59.624195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:59.624195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Probability Estimation with Deep Density Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Oren Rippel, Ryan Prescott Adams","submitted_at":"2013-02-20T21:20:30Z","abstract_excerpt":"One of the fundamental problems in machine learning is the estimation of a probability distribution from data. Many techniques have been proposed to study the structure of data, most often building around the assumption that observations lie on a lower-dimensional manifold of high probability. It has been more difficult, however, to exploit this insight to build explicit, tractable density models for high-dimensional data. In this paper, we introduce the deep density model (DDM), a new approach to density estimation. We exploit insights from deep learning to construct a bijective map to a repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5125","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.5125","created_at":"2026-05-18T03:32:59.624342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5125v1","created_at":"2026-05-18T03:32:59.624342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5125","created_at":"2026-05-18T03:32:59.624342+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQEQARWHZNGG","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQEQARWHZNGGACPJ","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQEQARWH","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1410.8516","citing_title":"NICE: Non-linear Independent Components Estimation","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"1605.08803","citing_title":"Density estimation using Real NVP","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01221","citing_title":"Local Hessian Spectral Filtering for Robust Intrinsic Dimension Estimation","ref_index":230,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7","json":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7.json","graph_json":"https://pith.science/api/pith-number/SQEQARWHZNGGACPJLXN6OYQTK7/graph.json","events_json":"https://pith.science/api/pith-number/SQEQARWHZNGGACPJLXN6OYQTK7/events.json","paper":"https://pith.science/paper/SQEQARWH"},"agent_actions":{"view_html":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7","download_json":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7.json","view_paper":"https://pith.science/paper/SQEQARWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5125&json=true","fetch_graph":"https://pith.science/api/pith-number/SQEQARWHZNGGACPJLXN6OYQTK7/graph.json","fetch_events":"https://pith.science/api/pith-number/SQEQARWHZNGGACPJLXN6OYQTK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7/action/storage_attestation","attest_author":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7/action/author_attestation","sign_citation":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7/action/citation_signature","submit_replication":"https://pith.science/pith/SQEQARWHZNGGACPJLXN6OYQTK7/action/replication_record"}},"created_at":"2026-05-18T03:32:59.624342+00:00","updated_at":"2026-05-18T03:32:59.624342+00:00"}