{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T77PCZSFVOCERFD4WKSLSKUU3A","short_pith_number":"pith:T77PCZSF","canonical_record":{"source":{"id":"1410.8516","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-30T19:44:20Z","cross_cats_sorted":[],"title_canon_sha256":"3a84268e3097cae2e1731db974aa88b083ee7cfd3135bf182d0f9f939a8af702","abstract_canon_sha256":"588006fc4b87ba2e3f6fe1845c0d6a9d660db1a20677045c5394583d6e92a66d"},"schema_version":"1.0"},"canonical_sha256":"9ffef16645ab8448947cb2a4b92a94d8303c29ad2bebaa481a2a565929eaa26c","source":{"kind":"arxiv","id":"1410.8516","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8516","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8516v6","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8516","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"T77PCZSFVOCE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T77PCZSFVOCERFD4","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T77PCZSF","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T77PCZSFVOCERFD4WKSLSKUU3A","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8516","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-30T19:44:20Z","cross_cats_sorted":[],"title_canon_sha256":"3a84268e3097cae2e1731db974aa88b083ee7cfd3135bf182d0f9f939a8af702","abstract_canon_sha256":"588006fc4b87ba2e3f6fe1845c0d6a9d660db1a20677045c5394583d6e92a66d"},"schema_version":"1.0"},"canonical_sha256":"9ffef16645ab8448947cb2a4b92a94d8303c29ad2bebaa481a2a565929eaa26c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:12.911139Z","signature_b64":"2KY50cBGquHS2rIGTt8OT2uPpcH0fzYO0X8ITSVAwiEDVfi2s1WXVWmEckFlUiGAshzfjp+pu1gA7EoruzyqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ffef16645ab8448947cb2a4b92a94d8303c29ad2bebaa481a2a565929eaa26c","last_reissued_at":"2026-05-18T02:56:12.910105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:12.910105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8516","source_version":6,"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-18T02:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XllDI4+elDt9X2LgRnC+uARmm3XWLJ3k68+WMkZIggGOu+TiJXI/EnvRQ07i8cfRU3HVj0Rw4gYjN21HD0oXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:00:16.225388Z"},"content_sha256":"61b9643901e6e8faa1a182a426b6102278ce1fc592137382abf356106b486c27","schema_version":"1.0","event_id":"sha256:61b9643901e6e8faa1a182a426b6102278ce1fc592137382abf356106b486c27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T77PCZSFVOCERFD4WKSLSKUU3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NICE: Non-linear Independent Components Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Krueger, Laurent Dinh, Yoshua Bengio","submitted_at":"2014-10-30T19:44:20Z","abstract_excerpt":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). It is based on the idea that a good representation is one in which the data has a distribution that is easy to model. For this purpose, a non-linear deterministic transformation of the data is learned that maps it to a latent space so as to make the transformed data conform to a factorized distribution, i.e., resulting in independent latent variables. We parametrize this transformation so that computing the Jacobian determinant and inverse transform is"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). ... The training criterion is simply the exact log-likelihood, which is tractable. Unbiased ancestral sampling is also easy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a composition of the proposed coupling layers (each based on a deep neural network) can represent sufficiently complex non-linear transformations while preserving trivial Jacobian determinant and inverse.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NICE learns a composition of invertible neural-network layers that transform data into independent latent variables, enabling exact log-likelihood training and sampling for density estimation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5c454cd940a3af71351344f59944b0eaa37d41de0ea1074271164448b2ade80a"},"source":{"id":"1410.8516","kind":"arxiv","version":6},"verdict":{"id":"ba08ea7d-28c9-4256-9882-3ba1dcc2df6e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T01:18:38.464346Z","strongest_claim":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). ... The training criterion is simply the exact log-likelihood, which is tractable. Unbiased ancestral sampling is also easy.","one_line_summary":"NICE learns a composition of invertible neural-network layers that transform data into independent latent variables, enabling exact log-likelihood training and sampling for density estimation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a composition of the proposed coupling layers (each based on a deep neural network) can represent sufficiently complex non-linear transformations while preserving trivial Jacobian determinant and inverse.","pith_extraction_headline":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training."},"references":{"count":33,"sample":[{"doi":"","year":2012,"title":"J., Bergeron, A., Bouchard, N., and Bengio, Y","work_id":"b37aac9a-cbd5-4153-9c72-c29c2f40ff18","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1991,"title":"Bengio, Y. (1991). Artificial Neural Networks and their Application to Sequence Recognition . PhD thesis, McGill University, (Computer Science), Montreal, Canada","work_id":"b0a5c649-8d83-40f0-a6f4-f000ca1e52b3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Bengio, Y. (2009). Learning deep architectures for AI . Now Publishers","work_id":"b60e0d3b-6787-42e5-b5db-1f5fd9561fe2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"arXiv preprint arXiv:1407.7906 , year =","work_id":"3837ddfa-70a7-4a68-8bb1-309a0ba7c349","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2000,"title":"Bengio, Y. and Bengio, S. (2000). Modeling high-dimensional discrete data with multi-layer neural networks. In Solla, S., Leen, T., and M \\\"u ller, K.-R., editors, Advances in Neural Information Proce","work_id":"44a249e3-a243-4e1f-b78d-87517d275cd0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":33,"snapshot_sha256":"a87047053490196ab9761fbc0abf4f94a604a87b51e6079cf3e644a0453386c5","internal_anchors":5},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3e8f228c2993a47a6b042b333a84addc7ba309a3a50bde468251939912614c82"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"ba08ea7d-28c9-4256-9882-3ba1dcc2df6e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8yaKc9/Feq03DjAeH62KDwllgb8iRMCEV8/FqyVceBbutD1zsm/gBTabH+4LO52sQSlw5mfCpMOr/OlF6aoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:00:16.226389Z"},"content_sha256":"1939bd81e7c17cf09d9b24f938dae8369c6aea24cda605c1aaa04abe79d3e950","schema_version":"1.0","event_id":"sha256:1939bd81e7c17cf09d9b24f938dae8369c6aea24cda605c1aaa04abe79d3e950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T77PCZSFVOCERFD4WKSLSKUU3A/bundle.json","state_url":"https://pith.science/pith/T77PCZSFVOCERFD4WKSLSKUU3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T77PCZSFVOCERFD4WKSLSKUU3A/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-26T23:00:16Z","links":{"resolver":"https://pith.science/pith/T77PCZSFVOCERFD4WKSLSKUU3A","bundle":"https://pith.science/pith/T77PCZSFVOCERFD4WKSLSKUU3A/bundle.json","state":"https://pith.science/pith/T77PCZSFVOCERFD4WKSLSKUU3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T77PCZSFVOCERFD4WKSLSKUU3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T77PCZSFVOCERFD4WKSLSKUU3A","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":"588006fc4b87ba2e3f6fe1845c0d6a9d660db1a20677045c5394583d6e92a66d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-30T19:44:20Z","title_canon_sha256":"3a84268e3097cae2e1731db974aa88b083ee7cfd3135bf182d0f9f939a8af702"},"schema_version":"1.0","source":{"id":"1410.8516","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8516","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8516v6","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8516","created_at":"2026-05-18T02:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"T77PCZSFVOCE","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T77PCZSFVOCERFD4","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T77PCZSF","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:1939bd81e7c17cf09d9b24f938dae8369c6aea24cda605c1aaa04abe79d3e950","target":"graph","created_at":"2026-05-18T02:56:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). ... The training criterion is simply the exact log-likelihood, which is tractable. Unbiased ancestral sampling is also easy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a composition of the proposed coupling layers (each based on a deep neural network) can represent sufficiently complex non-linear transformations while preserving trivial Jacobian determinant and inverse."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NICE learns a composition of invertible neural-network layers that transform data into independent latent variables, enabling exact log-likelihood training and sampling for density estimation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training."}],"snapshot_sha256":"5c454cd940a3af71351344f59944b0eaa37d41de0ea1074271164448b2ade80a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3e8f228c2993a47a6b042b333a84addc7ba309a3a50bde468251939912614c82"},"paper":{"abstract_excerpt":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). It is based on the idea that a good representation is one in which the data has a distribution that is easy to model. For this purpose, a non-linear deterministic transformation of the data is learned that maps it to a latent space so as to make the transformed data conform to a factorized distribution, i.e., resulting in independent latent variables. We parametrize this transformation so that computing the Jacobian determinant and inverse transform is","authors_text":"David Krueger, Laurent Dinh, Yoshua Bengio","cross_cats":[],"headline":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-30T19:44:20Z","title":"NICE: Non-linear Independent Components Estimation"},"references":{"count":33,"internal_anchors":5,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"J., Bergeron, A., Bouchard, N., and Bengio, Y","work_id":"b37aac9a-cbd5-4153-9c72-c29c2f40ff18","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bengio, Y. (1991). Artificial Neural Networks and their Application to Sequence Recognition . PhD thesis, McGill University, (Computer Science), Montreal, Canada","work_id":"b0a5c649-8d83-40f0-a6f4-f000ca1e52b3","year":1991},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Bengio, Y. (2009). Learning deep architectures for AI . Now Publishers","work_id":"b60e0d3b-6787-42e5-b5db-1f5fd9561fe2","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"arXiv preprint arXiv:1407.7906 , year =","work_id":"3837ddfa-70a7-4a68-8bb1-309a0ba7c349","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bengio, Y. and Bengio, S. (2000). Modeling high-dimensional discrete data with multi-layer neural networks. In Solla, S., Leen, T., and M \\\"u ller, K.-R., editors, Advances in Neural Information Proce","work_id":"44a249e3-a243-4e1f-b78d-87517d275cd0","year":2000}],"snapshot_sha256":"a87047053490196ab9761fbc0abf4f94a604a87b51e6079cf3e644a0453386c5"},"source":{"id":"1410.8516","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-14T01:18:38.464346Z","id":"ba08ea7d-28c9-4256-9882-3ba1dcc2df6e","model_set":{"reader":"grok-4.3"},"one_line_summary":"NICE learns a composition of invertible neural-network layers that transform data into independent latent variables, enabling exact log-likelihood training and sampling for density estimation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A composition of coupling layers learns an invertible non-linear map that turns high-dimensional data into independent latent factors for exact likelihood training.","strongest_claim":"We propose a deep learning framework for modeling complex high-dimensional densities called Non-linear Independent Component Estimation (NICE). ... The training criterion is simply the exact log-likelihood, which is tractable. Unbiased ancestral sampling is also easy.","weakest_assumption":"That a composition of the proposed coupling layers (each based on a deep neural network) can represent sufficiently complex non-linear transformations while preserving trivial Jacobian determinant and inverse."}},"verdict_id":"ba08ea7d-28c9-4256-9882-3ba1dcc2df6e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61b9643901e6e8faa1a182a426b6102278ce1fc592137382abf356106b486c27","target":"record","created_at":"2026-05-18T02:56:12Z","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":"588006fc4b87ba2e3f6fe1845c0d6a9d660db1a20677045c5394583d6e92a66d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-30T19:44:20Z","title_canon_sha256":"3a84268e3097cae2e1731db974aa88b083ee7cfd3135bf182d0f9f939a8af702"},"schema_version":"1.0","source":{"id":"1410.8516","kind":"arxiv","version":6}},"canonical_sha256":"9ffef16645ab8448947cb2a4b92a94d8303c29ad2bebaa481a2a565929eaa26c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ffef16645ab8448947cb2a4b92a94d8303c29ad2bebaa481a2a565929eaa26c","first_computed_at":"2026-05-18T02:56:12.910105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:12.910105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2KY50cBGquHS2rIGTt8OT2uPpcH0fzYO0X8ITSVAwiEDVfi2s1WXVWmEckFlUiGAshzfjp+pu1gA7EoruzyqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:12.911139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8516","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61b9643901e6e8faa1a182a426b6102278ce1fc592137382abf356106b486c27","sha256:1939bd81e7c17cf09d9b24f938dae8369c6aea24cda605c1aaa04abe79d3e950"],"state_sha256":"ae5b1e03174c7a731be6dadceb2bb6dcf2c14068847c2ca80d16ad04d4a1ed38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IfnFGv0Qm6GYzSh/2uOdMv/teTDGWyJKHkC9gAC+cVsBnyDJoTWYhkrvQ9ODlSeqOdkGR8k93cfIRwVlKh6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:00:16.230777Z","bundle_sha256":"5cc4a3e8710f5cd9bd2d8db06b605d19a6998a34a596d02a3463e21a4b332d77"}}