{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UHBYNVUWTAY2GH5YB32NU3SECI","short_pith_number":"pith:UHBYNVUW","schema_version":"1.0","canonical_sha256":"a1c386d6969831a31fb80ef4da6e441224ed41d106aa0f4630151f438d120b18","source":{"kind":"arxiv","id":"1212.2513","version":1},"attestation_state":"computed","paper":{"title":"Efficient Parametric Projection Pursuit Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Geoffrey E. Hinton, Max Welling, Richard S. Zemel","submitted_at":"2012-10-19T15:08:28Z","abstract_excerpt":"Product models of low dimensional experts are a powerful way to avoid the     curse of dimensionality. We present the ``under-complete product of experts'     (UPoE), where each expert models a one dimensional projection of the data. The     UPoE is fully tractable and may be interpreted as a parametric probabilistic     model for projection pursuit. Its ML learning rules are identical to the     approximate learning rules proposed before for under-complete ICA. We also     derive an efficient sequential learning algorithm and discuss its relationship     to projection pursuit density estimati"},"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":"1212.2513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:08:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ab91c02306283d459a4909d55d95c9f46b15a0df2aaaf1fc73973bf80464b5a0","abstract_canon_sha256":"b837f22c21f1a4ce301a42a36f5f16f6f04b4e7177e744dc98ebd82eff5ce666"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.413477Z","signature_b64":"96K0QLqKOp3wH241Sve4a2UW0jbLhQcoKVRkOCKpZhrOBAjJK663t3v7Wneh4g5c82A/Vh2vuMde0HvpkHgeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c386d6969831a31fb80ef4da6e441224ed41d106aa0f4630151f438d120b18","last_reissued_at":"2026-05-18T03:38:44.412900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.412900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Parametric Projection Pursuit Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Geoffrey E. Hinton, Max Welling, Richard S. Zemel","submitted_at":"2012-10-19T15:08:28Z","abstract_excerpt":"Product models of low dimensional experts are a powerful way to avoid the     curse of dimensionality. We present the ``under-complete product of experts'     (UPoE), where each expert models a one dimensional projection of the data. The     UPoE is fully tractable and may be interpreted as a parametric probabilistic     model for projection pursuit. Its ML learning rules are identical to the     approximate learning rules proposed before for under-complete ICA. We also     derive an efficient sequential learning algorithm and discuss its relationship     to projection pursuit density estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2513","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":"1212.2513","created_at":"2026-05-18T03:38:44.412988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2513v1","created_at":"2026-05-18T03:38:44.412988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2513","created_at":"2026-05-18T03:38:44.412988+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHBYNVUWTAY2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHBYNVUWTAY2GH5Y","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHBYNVUW","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI","json":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI.json","graph_json":"https://pith.science/api/pith-number/UHBYNVUWTAY2GH5YB32NU3SECI/graph.json","events_json":"https://pith.science/api/pith-number/UHBYNVUWTAY2GH5YB32NU3SECI/events.json","paper":"https://pith.science/paper/UHBYNVUW"},"agent_actions":{"view_html":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI","download_json":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI.json","view_paper":"https://pith.science/paper/UHBYNVUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2513&json=true","fetch_graph":"https://pith.science/api/pith-number/UHBYNVUWTAY2GH5YB32NU3SECI/graph.json","fetch_events":"https://pith.science/api/pith-number/UHBYNVUWTAY2GH5YB32NU3SECI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI/action/storage_attestation","attest_author":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI/action/author_attestation","sign_citation":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI/action/citation_signature","submit_replication":"https://pith.science/pith/UHBYNVUWTAY2GH5YB32NU3SECI/action/replication_record"}},"created_at":"2026-05-18T03:38:44.412988+00:00","updated_at":"2026-05-18T03:38:44.412988+00:00"}