{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LWZ5OF6QJHINZ4LQJWZ4JWRZQM","short_pith_number":"pith:LWZ5OF6Q","schema_version":"1.0","canonical_sha256":"5db3d717d049d0dcf1704db3c4da398315c06b2e7d7fbb5586513046c5d3d6b1","source":{"kind":"arxiv","id":"1510.05237","version":1},"attestation_state":"computed","paper":{"title":"Large Enforced Sparse Non-Negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SI"],"primary_cat":"cs.LG","authors_text":"Brendan Gavin, Jeremy Kepner, Vijay Gadepally","submitted_at":"2015-10-18T12:53:38Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is a common method for generating topic models from text data. NMF is widely accepted for producing good results despite its relative simplicity of implementation and ease of computation. One challenge with applying NMF to large datasets is that intermediate matrix products often become dense, stressing the memory and compute elements of a system. In this article, we investigate a simple but powerful modification of a common NMF algorithm that enforces the generation of sparse intermediate and output matrices. This method enables the application of NMF t"},"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":"1510.05237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-18T12:53:38Z","cross_cats_sorted":["cs.NA","cs.SI"],"title_canon_sha256":"c95e69ee3f8dbac99090f6341dcfbaff591344bb7008052ebdba8c867fcb8893","abstract_canon_sha256":"321029cb9ec7f81cf6f536b8e1b935218400064c7e90c5c123dcd0f1a507ed69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:39.974451Z","signature_b64":"VluiG5eJ5RIaFevROG2ZpDfVmPZ1IDfSIQo90wttGAADLfJacRCCcElHzLp4UOrenmjZb6t3rCiBcfRulnfbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db3d717d049d0dcf1704db3c4da398315c06b2e7d7fbb5586513046c5d3d6b1","last_reissued_at":"2026-05-18T01:09:39.973961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:39.973961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Enforced Sparse Non-Negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SI"],"primary_cat":"cs.LG","authors_text":"Brendan Gavin, Jeremy Kepner, Vijay Gadepally","submitted_at":"2015-10-18T12:53:38Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is a common method for generating topic models from text data. NMF is widely accepted for producing good results despite its relative simplicity of implementation and ease of computation. One challenge with applying NMF to large datasets is that intermediate matrix products often become dense, stressing the memory and compute elements of a system. In this article, we investigate a simple but powerful modification of a common NMF algorithm that enforces the generation of sparse intermediate and output matrices. This method enables the application of NMF t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05237","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":"1510.05237","created_at":"2026-05-18T01:09:39.974023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05237v1","created_at":"2026-05-18T01:09:39.974023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05237","created_at":"2026-05-18T01:09:39.974023+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWZ5OF6QJHIN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWZ5OF6QJHINZ4LQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWZ5OF6Q","created_at":"2026-05-18T12:29:29.992203+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/LWZ5OF6QJHINZ4LQJWZ4JWRZQM","json":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM.json","graph_json":"https://pith.science/api/pith-number/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/graph.json","events_json":"https://pith.science/api/pith-number/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/events.json","paper":"https://pith.science/paper/LWZ5OF6Q"},"agent_actions":{"view_html":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM","download_json":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM.json","view_paper":"https://pith.science/paper/LWZ5OF6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05237&json=true","fetch_graph":"https://pith.science/api/pith-number/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/graph.json","fetch_events":"https://pith.science/api/pith-number/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/action/storage_attestation","attest_author":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/action/author_attestation","sign_citation":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/action/citation_signature","submit_replication":"https://pith.science/pith/LWZ5OF6QJHINZ4LQJWZ4JWRZQM/action/replication_record"}},"created_at":"2026-05-18T01:09:39.974023+00:00","updated_at":"2026-05-18T01:09:39.974023+00:00"}