{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NDPSEJDIZM2LMFKF7UAEBA6SV6","short_pith_number":"pith:NDPSEJDI","schema_version":"1.0","canonical_sha256":"68df222468cb34b61545fd004083d2af958a3a3739eb84b5b13cc3172fd3d4fb","source":{"kind":"arxiv","id":"1301.3527","version":2},"attestation_state":"computed","paper":{"title":"Block Coordinate Descent for Sparse NMF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Barak A. Pearlmutter, Jonathan Le Roux, Sergey M. Plis, Thomas P. Hayes, Vamsi K. Potluru, Vince D. Calhoun","submitted_at":"2013-01-15T23:11:05Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a ubiquitous tool for data analysis. An important variant is the sparse NMF problem which arises when we explicitly require the learnt features to be sparse. A natural measure of sparsity is the L$_0$ norm, however its optimization is NP-hard. Mixed norms, such as L$_1$/L$_2$ measure, have been shown to model sparsity robustly, based on intuitive attributes that such measures need to satisfy. This is in contrast to computationally cheaper alternatives such as the plain L$_1$ norm. However, present algorithms designed for optimizing the mixed no"},"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":"1301.3527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-15T23:11:05Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"33e6ed20bf46e64364ddd25fafd51d666473e7394737bff9b69fc92d37f9148d","abstract_canon_sha256":"c5296e335fafbd9c706a9e43c93fb2d246bb147d72c5ded9b051ab35ac347d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.539601Z","signature_b64":"rgCLT+ywtwjxDAXRJBMDov3XfEIn+az6Ij3rU8o2FWlj4+3JNAcBglbZbN0c/58IqJXm31kO/fXjdCJRYjNSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68df222468cb34b61545fd004083d2af958a3a3739eb84b5b13cc3172fd3d4fb","last_reissued_at":"2026-05-18T03:30:27.538828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.538828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Coordinate Descent for Sparse NMF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Barak A. Pearlmutter, Jonathan Le Roux, Sergey M. Plis, Thomas P. Hayes, Vamsi K. Potluru, Vince D. Calhoun","submitted_at":"2013-01-15T23:11:05Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a ubiquitous tool for data analysis. An important variant is the sparse NMF problem which arises when we explicitly require the learnt features to be sparse. A natural measure of sparsity is the L$_0$ norm, however its optimization is NP-hard. Mixed norms, such as L$_1$/L$_2$ measure, have been shown to model sparsity robustly, based on intuitive attributes that such measures need to satisfy. This is in contrast to computationally cheaper alternatives such as the plain L$_1$ norm. However, present algorithms designed for optimizing the mixed no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3527","kind":"arxiv","version":2},"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":"1301.3527","created_at":"2026-05-18T03:30:27.538950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3527v2","created_at":"2026-05-18T03:30:27.538950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3527","created_at":"2026-05-18T03:30:27.538950+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDPSEJDIZM2L","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDPSEJDIZM2LMFKF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDPSEJDI","created_at":"2026-05-18T12:27:52.871228+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/NDPSEJDIZM2LMFKF7UAEBA6SV6","json":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6.json","graph_json":"https://pith.science/api/pith-number/NDPSEJDIZM2LMFKF7UAEBA6SV6/graph.json","events_json":"https://pith.science/api/pith-number/NDPSEJDIZM2LMFKF7UAEBA6SV6/events.json","paper":"https://pith.science/paper/NDPSEJDI"},"agent_actions":{"view_html":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6","download_json":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6.json","view_paper":"https://pith.science/paper/NDPSEJDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3527&json=true","fetch_graph":"https://pith.science/api/pith-number/NDPSEJDIZM2LMFKF7UAEBA6SV6/graph.json","fetch_events":"https://pith.science/api/pith-number/NDPSEJDIZM2LMFKF7UAEBA6SV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6/action/storage_attestation","attest_author":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6/action/author_attestation","sign_citation":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6/action/citation_signature","submit_replication":"https://pith.science/pith/NDPSEJDIZM2LMFKF7UAEBA6SV6/action/replication_record"}},"created_at":"2026-05-18T03:30:27.538950+00:00","updated_at":"2026-05-18T03:30:27.538950+00:00"}