{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:STOQPARDYJAHJKQ4FKJ7UT3S77","short_pith_number":"pith:STOQPARD","schema_version":"1.0","canonical_sha256":"94dd078223c24074aa1c2a93fa4f72fff5470650cb355c77cfb63dd91c44744e","source":{"kind":"arxiv","id":"1511.06333","version":4},"attestation_state":"computed","paper":{"title":"Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) and Its Application to Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jeffrey A. Fessler, Raj Rao Nadakuditi, Saiprasad Ravishankar","submitted_at":"2015-11-19T20:01:24Z","abstract_excerpt":"The sparsity of signals in a transform domain or dictionary has been exploited in applications such as compression, denoising and inverse problems. More recently, data-driven adaptation of synthesis dictionaries has shown promise compared to analytical dictionary models. However, dictionary learning problems are typically non-convex and NP-hard, and the usual alternating minimization approaches for these problems are often computationally expensive, with the computations dominated by the NP-hard synthesis sparse coding step. This paper exploits the ideas that drive algorithms such as K-SVD, an"},"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":"1511.06333","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T20:01:24Z","cross_cats_sorted":[],"title_canon_sha256":"e86356f6a1ca3e440bfdadcfc1733bc9c3e22c0a000f11efd9c235464dc91391","abstract_canon_sha256":"0e85626965c2128ee702ad6316218da3cc90e6b3dc9d82b0fd1c5686eedfe180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.853376Z","signature_b64":"QXGDE5NNrHpaOtGnJZ1oZLgq/x9Q4dQz74E1bdB/nER5vj+kDECdsTaEGg1VXtiaONfEMzM/B57T5/H+ZP+AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94dd078223c24074aa1c2a93fa4f72fff5470650cb355c77cfb63dd91c44744e","last_reissued_at":"2026-05-17T23:43:28.852678Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.852678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) and Its Application to Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jeffrey A. Fessler, Raj Rao Nadakuditi, Saiprasad Ravishankar","submitted_at":"2015-11-19T20:01:24Z","abstract_excerpt":"The sparsity of signals in a transform domain or dictionary has been exploited in applications such as compression, denoising and inverse problems. More recently, data-driven adaptation of synthesis dictionaries has shown promise compared to analytical dictionary models. However, dictionary learning problems are typically non-convex and NP-hard, and the usual alternating minimization approaches for these problems are often computationally expensive, with the computations dominated by the NP-hard synthesis sparse coding step. This paper exploits the ideas that drive algorithms such as K-SVD, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06333","kind":"arxiv","version":4},"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":"1511.06333","created_at":"2026-05-17T23:43:28.852817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06333v4","created_at":"2026-05-17T23:43:28.852817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06333","created_at":"2026-05-17T23:43:28.852817+00:00"},{"alias_kind":"pith_short_12","alias_value":"STOQPARDYJAH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"STOQPARDYJAHJKQ4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"STOQPARD","created_at":"2026-05-18T12:29:42.218222+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/STOQPARDYJAHJKQ4FKJ7UT3S77","json":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77.json","graph_json":"https://pith.science/api/pith-number/STOQPARDYJAHJKQ4FKJ7UT3S77/graph.json","events_json":"https://pith.science/api/pith-number/STOQPARDYJAHJKQ4FKJ7UT3S77/events.json","paper":"https://pith.science/paper/STOQPARD"},"agent_actions":{"view_html":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77","download_json":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77.json","view_paper":"https://pith.science/paper/STOQPARD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06333&json=true","fetch_graph":"https://pith.science/api/pith-number/STOQPARDYJAHJKQ4FKJ7UT3S77/graph.json","fetch_events":"https://pith.science/api/pith-number/STOQPARDYJAHJKQ4FKJ7UT3S77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77/action/storage_attestation","attest_author":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77/action/author_attestation","sign_citation":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77/action/citation_signature","submit_replication":"https://pith.science/pith/STOQPARDYJAHJKQ4FKJ7UT3S77/action/replication_record"}},"created_at":"2026-05-17T23:43:28.852817+00:00","updated_at":"2026-05-17T23:43:28.852817+00:00"}