{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KNCXVIMV43RV7GOZR7JVTYQ2VL","short_pith_number":"pith:KNCXVIMV","canonical_record":{"source":{"id":"1511.01776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T15:19:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c005ad0ff8cc5f421fbc6984c4eda919e9b6c17fea53e0812e2b4e41d332180","abstract_canon_sha256":"3659ceaf5894d777428cf49925df1d70ff6e10282eef990f77ac34196cf95b5d"},"schema_version":"1.0"},"canonical_sha256":"53457aa195e6e35f99d98fd359e21aaae1132d85efd82aaaf48da343dbab9e51","source":{"kind":"arxiv","id":"1511.01776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01776","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01776v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01776","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"KNCXVIMV43RV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KNCXVIMV43RV7GOZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KNCXVIMV","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KNCXVIMV43RV7GOZR7JVTYQ2VL","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T15:19:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c005ad0ff8cc5f421fbc6984c4eda919e9b6c17fea53e0812e2b4e41d332180","abstract_canon_sha256":"3659ceaf5894d777428cf49925df1d70ff6e10282eef990f77ac34196cf95b5d"},"schema_version":"1.0"},"canonical_sha256":"53457aa195e6e35f99d98fd359e21aaae1132d85efd82aaaf48da343dbab9e51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.839988Z","signature_b64":"7IxxZiNU2TTWyoaV6f9dd7nwAUt0kOLYoG9iNxXRJp58GqfTup21RaJxHzZbbtjUOdmxE2au1uVx26HP/LPzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53457aa195e6e35f99d98fd359e21aaae1132d85efd82aaaf48da343dbab9e51","last_reissued_at":"2026-05-18T01:27:39.839422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.839422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01776","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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8O3IWy219cl9wY0vlWvOustDnZAeYSdEseB4Gs0e8OVp9O4nSLAIT+JcIqgpgcIPRVgBeBhqb0/d5QjygxhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:01.065649Z"},"content_sha256":"7d6f8308ce3b5d64f717c2d1a83ca52e78aaa13e96458bf90a780bebfae28e5c","schema_version":"1.0","event_id":"sha256:7d6f8308ce3b5d64f717c2d1a83ca52e78aaa13e96458bf90a780bebfae28e5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KNCXVIMV43RV7GOZR7JVTYQ2VL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Intractability of Dictionary Learning for Sparse Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hung-Wei Tseng, Meisam Razaviyayn, Zhi-Quan Luo","submitted_at":"2015-11-05T15:19:42Z","abstract_excerpt":"In this paper we consider the dictionary learning problem for sparse representation. We first show that this problem is NP-hard by polynomial time reduction of the densest cut problem. Then, using successive convex approximation strategies, we propose efficient dictionary learning schemes to solve several practical formulations of this problem to stationary points. Unlike many existing algorithms in the literature, such as K-SVD, our proposed dictionary learning scheme is theoretically guaranteed to converge to the set of stationary points under certain mild assumptions. For the image denoisin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01776","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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2Fr/X7qKz8DmTLNzNKMOyz/LAIw8dXVT1Mva3m+KUu79ZO0HVOC+FL3sac9mZO/dOUG+hT3GI8DG97tgBlMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:01.066363Z"},"content_sha256":"5523ea00099708c1b7e57ed7f45d9d94453f5328ee33f41ac1a3849023a4a3c7","schema_version":"1.0","event_id":"sha256:5523ea00099708c1b7e57ed7f45d9d94453f5328ee33f41ac1a3849023a4a3c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/bundle.json","state_url":"https://pith.science/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/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-29T22:48:01Z","links":{"resolver":"https://pith.science/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL","bundle":"https://pith.science/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/bundle.json","state":"https://pith.science/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNCXVIMV43RV7GOZR7JVTYQ2VL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KNCXVIMV43RV7GOZR7JVTYQ2VL","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":"3659ceaf5894d777428cf49925df1d70ff6e10282eef990f77ac34196cf95b5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T15:19:42Z","title_canon_sha256":"6c005ad0ff8cc5f421fbc6984c4eda919e9b6c17fea53e0812e2b4e41d332180"},"schema_version":"1.0","source":{"id":"1511.01776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01776","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01776v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01776","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"KNCXVIMV43RV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KNCXVIMV43RV7GOZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KNCXVIMV","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:5523ea00099708c1b7e57ed7f45d9d94453f5328ee33f41ac1a3849023a4a3c7","target":"graph","created_at":"2026-05-18T01:27:39Z","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 consider the dictionary learning problem for sparse representation. We first show that this problem is NP-hard by polynomial time reduction of the densest cut problem. Then, using successive convex approximation strategies, we propose efficient dictionary learning schemes to solve several practical formulations of this problem to stationary points. Unlike many existing algorithms in the literature, such as K-SVD, our proposed dictionary learning scheme is theoretically guaranteed to converge to the set of stationary points under certain mild assumptions. For the image denoisin","authors_text":"Hung-Wei Tseng, Meisam Razaviyayn, Zhi-Quan Luo","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T15:19:42Z","title":"Computational Intractability of Dictionary Learning for Sparse Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01776","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:7d6f8308ce3b5d64f717c2d1a83ca52e78aaa13e96458bf90a780bebfae28e5c","target":"record","created_at":"2026-05-18T01:27:39Z","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":"3659ceaf5894d777428cf49925df1d70ff6e10282eef990f77ac34196cf95b5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T15:19:42Z","title_canon_sha256":"6c005ad0ff8cc5f421fbc6984c4eda919e9b6c17fea53e0812e2b4e41d332180"},"schema_version":"1.0","source":{"id":"1511.01776","kind":"arxiv","version":1}},"canonical_sha256":"53457aa195e6e35f99d98fd359e21aaae1132d85efd82aaaf48da343dbab9e51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53457aa195e6e35f99d98fd359e21aaae1132d85efd82aaaf48da343dbab9e51","first_computed_at":"2026-05-18T01:27:39.839422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.839422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7IxxZiNU2TTWyoaV6f9dd7nwAUt0kOLYoG9iNxXRJp58GqfTup21RaJxHzZbbtjUOdmxE2au1uVx26HP/LPzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.839988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d6f8308ce3b5d64f717c2d1a83ca52e78aaa13e96458bf90a780bebfae28e5c","sha256:5523ea00099708c1b7e57ed7f45d9d94453f5328ee33f41ac1a3849023a4a3c7"],"state_sha256":"af7bb890e0ecc88476fe77edade7c29a750f3bec86ecc67b573e15ddf72c59fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cn+Qb5Vji+BAIt6RR5NnHK6aBXrWN3bi8rkrubDrTDEZREgNexxzEzTTV11L53QdfmNB62rZi/Lny0vEs9JVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:48:01.070256Z","bundle_sha256":"ba48a364f5659a79d1b9f7a2798f446e96577f4a6fcefe7a007bd4dace392087"}}