{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SNYUBF4QCWHUIC7S57J6KAWNTC","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":"e50958a1aab76bdf88e81ff637cf195d5f264f7e1461181557445b1905c9ee56","cross_cats_sorted":["cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T02:33:01Z","title_canon_sha256":"4f18993136c2df5b23efbdf7d5308a3983e5fac8e72fc3ff84187c53f2491e2b"},"schema_version":"1.0","source":{"id":"2002.10043","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10043","created_at":"2026-07-05T01:19:26Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10043v3","created_at":"2026-07-05T01:19:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10043","created_at":"2026-07-05T01:19:26Z"},{"alias_kind":"pith_short_12","alias_value":"SNYUBF4QCWHU","created_at":"2026-07-05T01:19:26Z"},{"alias_kind":"pith_short_16","alias_value":"SNYUBF4QCWHUIC7S","created_at":"2026-07-05T01:19:26Z"},{"alias_kind":"pith_short_8","alias_value":"SNYUBF4Q","created_at":"2026-07-05T01:19:26Z"}],"graph_snapshots":[{"event_id":"sha256:a3c6b153d738d4ed658e4443c92cc49a25c5c16c14e4e0480729c1dfc75646be","target":"graph","created_at":"2026-07-05T01:19:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.10043/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dictionary learning is a classic representation learning method that has been widely applied in signal processing and data analytics. In this paper, we investigate a family of $\\ell_p$-norm ($p>2,p \\in \\mathbb{N}$) maximization approaches for the complete dictionary learning problem from theoretical and algorithmic aspects. Specifically, we prove that the global maximizers of these formulations are very close to the true dictionary with high probability, even when Gaussian noise is present. Based on the generalized power method (GPM), an efficient algorithm is then developed for the $\\ell_p$-b","authors_text":"Jun Zhang, Khaled B. Letaief, Vincent Lau, Ye Xue, Yifei Shen","cross_cats":["cs.IT","eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10043","kind":"arxiv","version":3},"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:26cb2450643c3aa6c4492575d58f9ae5583bd48f5c55e6b4f2d5e3650111c87f","target":"record","created_at":"2026-07-05T01:19:26Z","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":"e50958a1aab76bdf88e81ff637cf195d5f264f7e1461181557445b1905c9ee56","cross_cats_sorted":["cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T02:33:01Z","title_canon_sha256":"4f18993136c2df5b23efbdf7d5308a3983e5fac8e72fc3ff84187c53f2491e2b"},"schema_version":"1.0","source":{"id":"2002.10043","kind":"arxiv","version":3}},"canonical_sha256":"9371409790158f440bf2efd3e502cd98944138cdd354f5dcda46e4c1d01777b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9371409790158f440bf2efd3e502cd98944138cdd354f5dcda46e4c1d01777b5","first_computed_at":"2026-07-05T01:19:26.192643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:26.192643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M6Z6ovjScPLWZDf5Fe8LiyCGLXcx3dCykrGtV0ylyuBHREhEyZxl8tBCfTj+WZSDfTnFAv4GzmRhNGsuOLZ2CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:26.193110Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.10043","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26cb2450643c3aa6c4492575d58f9ae5583bd48f5c55e6b4f2d5e3650111c87f","sha256:a3c6b153d738d4ed658e4443c92cc49a25c5c16c14e4e0480729c1dfc75646be"],"state_sha256":"4cf0c5558fd1e974b94dc3bfb62dce6355f4c8c0b8746f8148179909dcd4081a"}