{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:COHP2W227SU43ITMYKT3U5ZTSS","short_pith_number":"pith:COHP2W22","schema_version":"1.0","canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","source":{"kind":"arxiv","id":"1604.02181","version":6},"attestation_state":"computed","paper":{"title":"A Unified Framework for Sparse Non-Negative Least Squares using Multiplicative Updates and the Non-Negative Matrix Factorization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alican Nalci, Bhaskar D. Rao, Harinath Garudadri, Igor Fedorov, Ritwik Giri, Truong Q. Nguyen","submitted_at":"2016-04-07T21:35:42Z","abstract_excerpt":"We study the sparse non-negative least squares (S-NNLS) problem. S-NNLS occurs naturally in a wide variety of applications where an unknown, non-negative quantity must be recovered from linear measurements. We present a unified framework for S-NNLS based on a rectified power exponential scale mixture prior on the sparse codes. We show that the proposed framework encompasses a large class of S-NNLS algorithms and provide a computationally efficient inference procedure based on multiplicative update rules. Such update rules are convenient for solving large sets of S-NNLS problems simultaneously,"},"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":"1604.02181","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T21:35:42Z","cross_cats_sorted":[],"title_canon_sha256":"4360f6c92b7ea1fa4fc9ec50389110f7fcd1e7f7bee407f687d8d35b969e8d77","abstract_canon_sha256":"16503203283f4f8777c06e1752232508c20b78ffc3681fb09b8057acf5b12459"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:57.892282Z","signature_b64":"idcNa6ZyU6UgIh+iSMANruGecvFXEGbs48dQlSC5VV+MU2TDa0DRTFQ5F2hZwRDwrRFw1hT28IavXbyKGSq8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","last_reissued_at":"2026-05-18T00:26:57.891611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:57.891611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Sparse Non-Negative Least Squares using Multiplicative Updates and the Non-Negative Matrix Factorization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alican Nalci, Bhaskar D. Rao, Harinath Garudadri, Igor Fedorov, Ritwik Giri, Truong Q. Nguyen","submitted_at":"2016-04-07T21:35:42Z","abstract_excerpt":"We study the sparse non-negative least squares (S-NNLS) problem. S-NNLS occurs naturally in a wide variety of applications where an unknown, non-negative quantity must be recovered from linear measurements. We present a unified framework for S-NNLS based on a rectified power exponential scale mixture prior on the sparse codes. We show that the proposed framework encompasses a large class of S-NNLS algorithms and provide a computationally efficient inference procedure based on multiplicative update rules. Such update rules are convenient for solving large sets of S-NNLS problems simultaneously,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02181","kind":"arxiv","version":6},"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":"1604.02181","created_at":"2026-05-18T00:26:57.891710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02181v6","created_at":"2026-05-18T00:26:57.891710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02181","created_at":"2026-05-18T00:26:57.891710+00:00"},{"alias_kind":"pith_short_12","alias_value":"COHP2W227SU4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"COHP2W227SU43ITM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"COHP2W22","created_at":"2026-05-18T12:30:09.641336+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/COHP2W227SU43ITMYKT3U5ZTSS","json":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS.json","graph_json":"https://pith.science/api/pith-number/COHP2W227SU43ITMYKT3U5ZTSS/graph.json","events_json":"https://pith.science/api/pith-number/COHP2W227SU43ITMYKT3U5ZTSS/events.json","paper":"https://pith.science/paper/COHP2W22"},"agent_actions":{"view_html":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS","download_json":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS.json","view_paper":"https://pith.science/paper/COHP2W22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02181&json=true","fetch_graph":"https://pith.science/api/pith-number/COHP2W227SU43ITMYKT3U5ZTSS/graph.json","fetch_events":"https://pith.science/api/pith-number/COHP2W227SU43ITMYKT3U5ZTSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/action/storage_attestation","attest_author":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/action/author_attestation","sign_citation":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/action/citation_signature","submit_replication":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/action/replication_record"}},"created_at":"2026-05-18T00:26:57.891710+00:00","updated_at":"2026-05-18T00:26:57.891710+00:00"}