{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WM5YR4FCWKD7FXAYOM65AJUHYR","short_pith_number":"pith:WM5YR4FC","canonical_record":{"source":{"id":"1707.05840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-18T19:56:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"419e7a7f381d7a16fa0f936c38ce84f543d6db8859f5dcfa3609a9d2d78a30c2","abstract_canon_sha256":"7426ca6b2843282d4bee38ad7f4eb02219caa6aa5b4ff959ece66e4e5cc4c87d"},"schema_version":"1.0"},"canonical_sha256":"b33b88f0a2b287f2dc18733dd02687c476dd7f60d71a3d0accb5d280da42c470","source":{"kind":"arxiv","id":"1707.05840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05840","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05840v1","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05840","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"WM5YR4FCWKD7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WM5YR4FCWKD7FXAY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WM5YR4FC","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WM5YR4FCWKD7FXAYOM65AJUHYR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-18T19:56:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"419e7a7f381d7a16fa0f936c38ce84f543d6db8859f5dcfa3609a9d2d78a30c2","abstract_canon_sha256":"7426ca6b2843282d4bee38ad7f4eb02219caa6aa5b4ff959ece66e4e5cc4c87d"},"schema_version":"1.0"},"canonical_sha256":"b33b88f0a2b287f2dc18733dd02687c476dd7f60d71a3d0accb5d280da42c470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:59.157266Z","signature_b64":"D+oSxFeZK419269qfDmaTr/qNQ15L2oKhQ3WlHBQ8IFwRKmSWB6mxY1zu6j0a8vIIG8UI2HjBJBJYg1pWiCBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b33b88f0a2b287f2dc18733dd02687c476dd7f60d71a3d0accb5d280da42c470","last_reissued_at":"2026-05-18T00:39:59.156690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:59.156690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05840","source_version":1,"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-18T00:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iNTMYhwQ0cVK9yfobwzE1fGrnEnHZyZj76Wujg6Se3aJUXLKvx2UejV2qQdAbSiKYxsrBatpWntuCjVpr99Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:21:21.041764Z"},"content_sha256":"68b031d9e4d490b2fce7284fb9cfe80998b044a755353996afe0fdbd27cc24ec","schema_version":"1.0","event_id":"sha256:68b031d9e4d490b2fce7284fb9cfe80998b044a755353996afe0fdbd27cc24ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WM5YR4FCWKD7FXAYOM65AJUHYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiscale Residual Mixture of PCA: Dynamic Dictionaries for Optimal Basis Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Randall Balestriero","submitted_at":"2017-07-18T19:56:05Z","abstract_excerpt":"In this paper we are interested in the problem of learning an over-complete basis and a methodology such that the reconstruction or inverse problem does not need optimization. We analyze the optimality of the presented approaches, their link to popular already known techniques s.a. Artificial Neural Networks,k-means or Oja's learning rule. Finally, we will see that one approach to reach the optimal dictionary is a factorial and hierarchical approach. The derived approach lead to a formulation of a Deep Oja Network. We present results on different tasks and present the resulting very efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05840","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQLjmLMk4pRpGWK/pQQn9XjLMI9gbm7P03BtyXxQKtE6uCAHNtbcpb0+QAiRRSg2UYKx6J9wXyqA6AJG6nBvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:21:21.042111Z"},"content_sha256":"375a05624a183cbbab5058de1789f2195d117d9a1d1ce2d14d826b32832791d4","schema_version":"1.0","event_id":"sha256:375a05624a183cbbab5058de1789f2195d117d9a1d1ce2d14d826b32832791d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/bundle.json","state_url":"https://pith.science/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/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-06-01T08:21:21Z","links":{"resolver":"https://pith.science/pith/WM5YR4FCWKD7FXAYOM65AJUHYR","bundle":"https://pith.science/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/bundle.json","state":"https://pith.science/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WM5YR4FCWKD7FXAYOM65AJUHYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WM5YR4FCWKD7FXAYOM65AJUHYR","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":"7426ca6b2843282d4bee38ad7f4eb02219caa6aa5b4ff959ece66e4e5cc4c87d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-18T19:56:05Z","title_canon_sha256":"419e7a7f381d7a16fa0f936c38ce84f543d6db8859f5dcfa3609a9d2d78a30c2"},"schema_version":"1.0","source":{"id":"1707.05840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05840","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05840v1","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05840","created_at":"2026-05-18T00:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"WM5YR4FCWKD7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WM5YR4FCWKD7FXAY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WM5YR4FC","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:375a05624a183cbbab5058de1789f2195d117d9a1d1ce2d14d826b32832791d4","target":"graph","created_at":"2026-05-18T00:39:59Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we are interested in the problem of learning an over-complete basis and a methodology such that the reconstruction or inverse problem does not need optimization. We analyze the optimality of the presented approaches, their link to popular already known techniques s.a. Artificial Neural Networks,k-means or Oja's learning rule. Finally, we will see that one approach to reach the optimal dictionary is a factorial and hierarchical approach. The derived approach lead to a formulation of a Deep Oja Network. We present results on different tasks and present the resulting very efficient ","authors_text":"Randall Balestriero","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-18T19:56:05Z","title":"Multiscale Residual Mixture of PCA: Dynamic Dictionaries for Optimal Basis Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:68b031d9e4d490b2fce7284fb9cfe80998b044a755353996afe0fdbd27cc24ec","target":"record","created_at":"2026-05-18T00:39:59Z","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":"7426ca6b2843282d4bee38ad7f4eb02219caa6aa5b4ff959ece66e4e5cc4c87d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-18T19:56:05Z","title_canon_sha256":"419e7a7f381d7a16fa0f936c38ce84f543d6db8859f5dcfa3609a9d2d78a30c2"},"schema_version":"1.0","source":{"id":"1707.05840","kind":"arxiv","version":1}},"canonical_sha256":"b33b88f0a2b287f2dc18733dd02687c476dd7f60d71a3d0accb5d280da42c470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b33b88f0a2b287f2dc18733dd02687c476dd7f60d71a3d0accb5d280da42c470","first_computed_at":"2026-05-18T00:39:59.156690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:59.156690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D+oSxFeZK419269qfDmaTr/qNQ15L2oKhQ3WlHBQ8IFwRKmSWB6mxY1zu6j0a8vIIG8UI2HjBJBJYg1pWiCBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:59.157266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68b031d9e4d490b2fce7284fb9cfe80998b044a755353996afe0fdbd27cc24ec","sha256:375a05624a183cbbab5058de1789f2195d117d9a1d1ce2d14d826b32832791d4"],"state_sha256":"bb38266c96ac4298dc64c3370c66d03950185ec09af05b6c803c7f777ce39b54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrEYu8Lh69y63HqcGpdgC9YYBgNg0byNFniicdYKPOu/lumae0resKor8JCdJSbMatVcIrXD9YKJZ8Aid6LJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:21:21.044014Z","bundle_sha256":"77d87ee75529110a89e7621042f04c99a33bafbf556eff1a6a537bfde64b7cf0"}}