{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XE5ESTTSYG6NKYJDLZPPYYD2AF","short_pith_number":"pith:XE5ESTTS","schema_version":"1.0","canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","source":{"kind":"arxiv","id":"1610.01349","version":3},"attestation_state":"computed","paper":{"title":"A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Nicolas Gillis, Robert Luce","submitted_at":"2016-10-05T10:29:10Z","abstract_excerpt":"A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth op"},"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":"1610.01349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"0f188fda40e953d1aabdee70bc93378fbc5bc570036712253ac90e400162ee92","abstract_canon_sha256":"341219ce39114733e07c09e6fd5f0edf0ed2bcb1887025dc4d0181dfaa53fde9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:08.660158Z","signature_b64":"3E9DHUrw48kbre6GZnyZgkdPAWt2y99vehSHsqxgKN4SP8s07cUAfGWDMdILS18eNQz6gfeWiJEI15outSmkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","last_reissued_at":"2026-05-18T00:30:08.658941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:08.658941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Nicolas Gillis, Robert Luce","submitted_at":"2016-10-05T10:29:10Z","abstract_excerpt":"A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01349","kind":"arxiv","version":3},"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":"1610.01349","created_at":"2026-05-18T00:30:08.659463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01349v3","created_at":"2026-05-18T00:30:08.659463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01349","created_at":"2026-05-18T00:30:08.659463+00:00"},{"alias_kind":"pith_short_12","alias_value":"XE5ESTTSYG6N","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XE5ESTTSYG6NKYJD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XE5ESTTS","created_at":"2026-05-18T12:30:51.357362+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/XE5ESTTSYG6NKYJDLZPPYYD2AF","json":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF.json","graph_json":"https://pith.science/api/pith-number/XE5ESTTSYG6NKYJDLZPPYYD2AF/graph.json","events_json":"https://pith.science/api/pith-number/XE5ESTTSYG6NKYJDLZPPYYD2AF/events.json","paper":"https://pith.science/paper/XE5ESTTS"},"agent_actions":{"view_html":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF","download_json":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF.json","view_paper":"https://pith.science/paper/XE5ESTTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01349&json=true","fetch_graph":"https://pith.science/api/pith-number/XE5ESTTSYG6NKYJDLZPPYYD2AF/graph.json","fetch_events":"https://pith.science/api/pith-number/XE5ESTTSYG6NKYJDLZPPYYD2AF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/action/storage_attestation","attest_author":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/action/author_attestation","sign_citation":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/action/citation_signature","submit_replication":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/action/replication_record"}},"created_at":"2026-05-18T00:30:08.659463+00:00","updated_at":"2026-05-18T00:30:08.659463+00:00"}