{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:COHP2W227SU43ITMYKT3U5ZTSS","short_pith_number":"pith:COHP2W22","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"},"canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","source":{"kind":"arxiv","id":"1604.02181","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02181","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02181v6","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02181","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"COHP2W227SU4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COHP2W227SU43ITM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COHP2W22","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:COHP2W227SU43ITMYKT3U5ZTSS","target":"record","payload":{"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"},"canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","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"},"source_kind":"arxiv","source_id":"1604.02181","source_version":6,"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-18T00:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRR412HAyybV6J8IibtjgFgqH/ofR4xy4hzDDHVFvfPzeWQ3AcckOiaBt8P5oe4nqZgpD9Zi4rx7nIbpEanpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:16:39.791194Z"},"content_sha256":"e32a44df7e40181bcb7cb844ec548ba66702fa4d6db0a12a787e1baf42ad4bc2","schema_version":"1.0","event_id":"sha256:e32a44df7e40181bcb7cb844ec548ba66702fa4d6db0a12a787e1baf42ad4bc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:COHP2W227SU43ITMYKT3U5ZTSS","target":"graph","payload":{"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"},"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-18T00:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nw2YAeA5D+/BqSZX3Koq9dauUNAg+Wet/K34JwWROcAZFBeVPWpqWfUYVwH7izU+bUjIodDuKVK/NMvg8XFHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:16:39.791564Z"},"content_sha256":"8097a7c378285b042292286b45f5665ef6b503c46ba429c9267166f2a9cc8a80","schema_version":"1.0","event_id":"sha256:8097a7c378285b042292286b45f5665ef6b503c46ba429c9267166f2a9cc8a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/bundle.json","state_url":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COHP2W227SU43ITMYKT3U5ZTSS/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-06-10T21:16:39Z","links":{"resolver":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS","bundle":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/bundle.json","state":"https://pith.science/pith/COHP2W227SU43ITMYKT3U5ZTSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COHP2W227SU43ITMYKT3U5ZTSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:COHP2W227SU43ITMYKT3U5ZTSS","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":"16503203283f4f8777c06e1752232508c20b78ffc3681fb09b8057acf5b12459","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T21:35:42Z","title_canon_sha256":"4360f6c92b7ea1fa4fc9ec50389110f7fcd1e7f7bee407f687d8d35b969e8d77"},"schema_version":"1.0","source":{"id":"1604.02181","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02181","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02181v6","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02181","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"COHP2W227SU4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COHP2W227SU43ITM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COHP2W22","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:8097a7c378285b042292286b45f5665ef6b503c46ba429c9267166f2a9cc8a80","target":"graph","created_at":"2026-05-18T00:26:57Z","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":"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,","authors_text":"Alican Nalci, Bhaskar D. Rao, Harinath Garudadri, Igor Fedorov, Ritwik Giri, Truong Q. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T21:35:42Z","title":"A Unified Framework for Sparse Non-Negative Least Squares using Multiplicative Updates and the Non-Negative Matrix Factorization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02181","kind":"arxiv","version":6},"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:e32a44df7e40181bcb7cb844ec548ba66702fa4d6db0a12a787e1baf42ad4bc2","target":"record","created_at":"2026-05-18T00:26:57Z","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":"16503203283f4f8777c06e1752232508c20b78ffc3681fb09b8057acf5b12459","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T21:35:42Z","title_canon_sha256":"4360f6c92b7ea1fa4fc9ec50389110f7fcd1e7f7bee407f687d8d35b969e8d77"},"schema_version":"1.0","source":{"id":"1604.02181","kind":"arxiv","version":6}},"canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"138efd5b5afca9cda26cc2a7ba773394be7af5e810919387a19647b175ee3f17","first_computed_at":"2026-05-18T00:26:57.891611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:57.891611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"idcNa6ZyU6UgIh+iSMANruGecvFXEGbs48dQlSC5VV+MU2TDa0DRTFQ5F2hZwRDwrRFw1hT28IavXbyKGSq8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:57.892282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02181","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e32a44df7e40181bcb7cb844ec548ba66702fa4d6db0a12a787e1baf42ad4bc2","sha256:8097a7c378285b042292286b45f5665ef6b503c46ba429c9267166f2a9cc8a80"],"state_sha256":"958fb0a6a74a1edf95b716058bdcfb1a525321cafa572534ca4af3da6872d945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHN5tDbxnOJGs3v1oYhRyZYljDNtZSlKRllFBAMREaSpG5pL63TkYTJF/BiufZBfxRXmI98bkCIDuH7wNkNABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:16:39.793546Z","bundle_sha256":"cbe2acf4fb99a24fb52dcf22372aa36cad97ae8421c3746db41fb5b267e323cf"}}