{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WRYIDCCVUXPSBLHA3BCKABWXSK","short_pith_number":"pith:WRYIDCCV","schema_version":"1.0","canonical_sha256":"b470818855a5df20ace0d844a006d7928fc7875a1c619cf0e277286dd52cbb7d","source":{"kind":"arxiv","id":"1512.09227","version":1},"attestation_state":"computed","paper":{"title":"Denoising and Completion of 3D Data via Multidimensional Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.LG","authors_text":"Shuchin Aeron, Zemin Zhang","submitted_at":"2015-12-31T06:37:54Z","abstract_excerpt":"In this paper a new dictionary learning algorithm for multidimensional data is proposed. Unlike most conventional dictionary learning methods which are derived for dealing with vectors or matrices, our algorithm, named KTSVD, learns a multidimensional dictionary directly via a novel algebraic approach for tensor factorization as proposed in [3, 12, 13]. Using this approach one can define a tensor-SVD and we propose to extend K-SVD algorithm used for 1-D data to a K-TSVD algorithm for handling 2-D and 3-D data. Our algorithm, based on the idea of sparse coding (using group-sparsity over multidi"},"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":"1512.09227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T06:37:54Z","cross_cats_sorted":["cs.CV","cs.DS"],"title_canon_sha256":"5f6fb91e853693de39645e80a9ade0b6d98172a49e857621c27d7b93457bef11","abstract_canon_sha256":"234ee78e470b73f9e9c72a222a276c198ab9dd8ec594638b8b1d356e7ef8f318"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:32.952121Z","signature_b64":"Ssmcxgscnx9MbuoFRPQWOOJPEiSHuLZgTnbXOgWL8MSoh2V0mO8O+bp5eEIzfOKpQT3EjNP5jeHpVZaq6/3jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b470818855a5df20ace0d844a006d7928fc7875a1c619cf0e277286dd52cbb7d","last_reissued_at":"2026-05-18T01:23:32.951242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:32.951242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Denoising and Completion of 3D Data via Multidimensional Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.LG","authors_text":"Shuchin Aeron, Zemin Zhang","submitted_at":"2015-12-31T06:37:54Z","abstract_excerpt":"In this paper a new dictionary learning algorithm for multidimensional data is proposed. Unlike most conventional dictionary learning methods which are derived for dealing with vectors or matrices, our algorithm, named KTSVD, learns a multidimensional dictionary directly via a novel algebraic approach for tensor factorization as proposed in [3, 12, 13]. Using this approach one can define a tensor-SVD and we propose to extend K-SVD algorithm used for 1-D data to a K-TSVD algorithm for handling 2-D and 3-D data. Our algorithm, based on the idea of sparse coding (using group-sparsity over multidi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09227","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":"1512.09227","created_at":"2026-05-18T01:23:32.951410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09227v1","created_at":"2026-05-18T01:23:32.951410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09227","created_at":"2026-05-18T01:23:32.951410+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRYIDCCVUXPS","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRYIDCCVUXPSBLHA","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRYIDCCV","created_at":"2026-05-18T12:29:47.479230+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/WRYIDCCVUXPSBLHA3BCKABWXSK","json":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK.json","graph_json":"https://pith.science/api/pith-number/WRYIDCCVUXPSBLHA3BCKABWXSK/graph.json","events_json":"https://pith.science/api/pith-number/WRYIDCCVUXPSBLHA3BCKABWXSK/events.json","paper":"https://pith.science/paper/WRYIDCCV"},"agent_actions":{"view_html":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK","download_json":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK.json","view_paper":"https://pith.science/paper/WRYIDCCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09227&json=true","fetch_graph":"https://pith.science/api/pith-number/WRYIDCCVUXPSBLHA3BCKABWXSK/graph.json","fetch_events":"https://pith.science/api/pith-number/WRYIDCCVUXPSBLHA3BCKABWXSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK/action/storage_attestation","attest_author":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK/action/author_attestation","sign_citation":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK/action/citation_signature","submit_replication":"https://pith.science/pith/WRYIDCCVUXPSBLHA3BCKABWXSK/action/replication_record"}},"created_at":"2026-05-18T01:23:32.951410+00:00","updated_at":"2026-05-18T01:23:32.951410+00:00"}