{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JV7UGFLY2BWSYLTSNH5OP2YTX7","short_pith_number":"pith:JV7UGFLY","schema_version":"1.0","canonical_sha256":"4d7f431578d06d2c2e7269fae7eb13bfeeca8e0c6256562fb6b43b4f57b6ff39","source":{"kind":"arxiv","id":"1705.02994","version":1},"attestation_state":"computed","paper":{"title":"Non-negative Matrix Factorization via Archetypal Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrea Montanari, Hamid Javadi","submitted_at":"2017-05-08T17:53:36Z","abstract_excerpt":"Given a collection of data points, non-negative matrix factorization (NMF) suggests to express them as convex combinations of a small set of `archetypes' with non-negative entries. This decomposition is unique only if the true archetypes are non-negative and sufficiently sparse (or the weights are sufficiently sparse), a regime that is captured by the separability condition and its generalizations.\n  In this paper, we study an approach to NMF that can be traced back to the work of Cutler and Breiman (1994) and does not require the data to be separable, while providing a generally unique decomp"},"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":"1705.02994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-08T17:53:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8def4434792e0e7a954ad921ac67fb9dc11a991a4947849142459a799fb20261","abstract_canon_sha256":"ca36de41aedccdd041316383bd4031c7f1d43f93bf38554515adcea7388fbf0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:53.148337Z","signature_b64":"YUqYnuj+DLIWFv3GBoxXVmaOBiliuTP7hHOtJDO2WPa+Cr7ZdwYL56d6Lqk0iVN5dsRXjNA3H2JEG3q0aFbrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d7f431578d06d2c2e7269fae7eb13bfeeca8e0c6256562fb6b43b4f57b6ff39","last_reissued_at":"2026-05-18T00:44:53.147607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:53.147607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-negative Matrix Factorization via Archetypal Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrea Montanari, Hamid Javadi","submitted_at":"2017-05-08T17:53:36Z","abstract_excerpt":"Given a collection of data points, non-negative matrix factorization (NMF) suggests to express them as convex combinations of a small set of `archetypes' with non-negative entries. This decomposition is unique only if the true archetypes are non-negative and sufficiently sparse (or the weights are sufficiently sparse), a regime that is captured by the separability condition and its generalizations.\n  In this paper, we study an approach to NMF that can be traced back to the work of Cutler and Breiman (1994) and does not require the data to be separable, while providing a generally unique decomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02994","kind":"arxiv","version":1},"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":"1705.02994","created_at":"2026-05-18T00:44:53.147730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02994v1","created_at":"2026-05-18T00:44:53.147730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02994","created_at":"2026-05-18T00:44:53.147730+00:00"},{"alias_kind":"pith_short_12","alias_value":"JV7UGFLY2BWS","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JV7UGFLY2BWSYLTS","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JV7UGFLY","created_at":"2026-05-18T12:31:24.725408+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/JV7UGFLY2BWSYLTSNH5OP2YTX7","json":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7.json","graph_json":"https://pith.science/api/pith-number/JV7UGFLY2BWSYLTSNH5OP2YTX7/graph.json","events_json":"https://pith.science/api/pith-number/JV7UGFLY2BWSYLTSNH5OP2YTX7/events.json","paper":"https://pith.science/paper/JV7UGFLY"},"agent_actions":{"view_html":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7","download_json":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7.json","view_paper":"https://pith.science/paper/JV7UGFLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02994&json=true","fetch_graph":"https://pith.science/api/pith-number/JV7UGFLY2BWSYLTSNH5OP2YTX7/graph.json","fetch_events":"https://pith.science/api/pith-number/JV7UGFLY2BWSYLTSNH5OP2YTX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7/action/storage_attestation","attest_author":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7/action/author_attestation","sign_citation":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7/action/citation_signature","submit_replication":"https://pith.science/pith/JV7UGFLY2BWSYLTSNH5OP2YTX7/action/replication_record"}},"created_at":"2026-05-18T00:44:53.147730+00:00","updated_at":"2026-05-18T00:44:53.147730+00:00"}