{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U5QMBH33G5BTAXZB7LRZSD4HMA","short_pith_number":"pith:U5QMBH33","schema_version":"1.0","canonical_sha256":"a760c09f7b3743305f21fae3990f876029e858b67f882067d2fc6e990d1c055b","source":{"kind":"arxiv","id":"1807.04020","version":1},"attestation_state":"computed","paper":{"title":"Improved SVD-based Initialization for Nonnegative Matrix Factorization using Low-Rank Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Atif Muhammad Syed, Nicolas Gillis, Sameer Qazi","submitted_at":"2018-07-11T09:21:31Z","abstract_excerpt":"Due to the iterative nature of most nonnegative matrix factorization (\\textsc{NMF}) algorithms, initialization is a key aspect as it significantly influences both the convergence and the final solution obtained. Many initialization schemes have been proposed for NMF, among which one of the most popular class of methods are based on the singular value decomposition (SVD). However, these SVD-based initializations do not satisfy a rather natural condition, namely that the error should decrease as the rank of factorization increases. In this paper, we propose a novel SVD-based \\textsc{NMF} initial"},"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":"1807.04020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-07-11T09:21:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"82aba09a4dffaa65fbcd5687590006db778e4186f1b9bb8131f2ebc68cfb9ab7","abstract_canon_sha256":"6a477627285fb50139a47f66c4ecf7723a793eb9e79b7049d39455d4fe5cac9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:59.055830Z","signature_b64":"QoXzWHB99/K1bF3rRy/E6Hill2So8PWD0YxTZvQM8IKsyfVMaXCYcjao9/EWUn6iwJ+iXOM92o4qp1Njv1uXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a760c09f7b3743305f21fae3990f876029e858b67f882067d2fc6e990d1c055b","last_reissued_at":"2026-05-17T23:52:59.055339Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:59.055339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved SVD-based Initialization for Nonnegative Matrix Factorization using Low-Rank Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Atif Muhammad Syed, Nicolas Gillis, Sameer Qazi","submitted_at":"2018-07-11T09:21:31Z","abstract_excerpt":"Due to the iterative nature of most nonnegative matrix factorization (\\textsc{NMF}) algorithms, initialization is a key aspect as it significantly influences both the convergence and the final solution obtained. Many initialization schemes have been proposed for NMF, among which one of the most popular class of methods are based on the singular value decomposition (SVD). However, these SVD-based initializations do not satisfy a rather natural condition, namely that the error should decrease as the rank of factorization increases. In this paper, we propose a novel SVD-based \\textsc{NMF} initial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04020","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":"1807.04020","created_at":"2026-05-17T23:52:59.055415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04020v1","created_at":"2026-05-17T23:52:59.055415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04020","created_at":"2026-05-17T23:52:59.055415+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5QMBH33G5BT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5QMBH33G5BTAXZB","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5QMBH33","created_at":"2026-05-18T12:32:56.356000+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/U5QMBH33G5BTAXZB7LRZSD4HMA","json":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA.json","graph_json":"https://pith.science/api/pith-number/U5QMBH33G5BTAXZB7LRZSD4HMA/graph.json","events_json":"https://pith.science/api/pith-number/U5QMBH33G5BTAXZB7LRZSD4HMA/events.json","paper":"https://pith.science/paper/U5QMBH33"},"agent_actions":{"view_html":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA","download_json":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA.json","view_paper":"https://pith.science/paper/U5QMBH33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04020&json=true","fetch_graph":"https://pith.science/api/pith-number/U5QMBH33G5BTAXZB7LRZSD4HMA/graph.json","fetch_events":"https://pith.science/api/pith-number/U5QMBH33G5BTAXZB7LRZSD4HMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA/action/storage_attestation","attest_author":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA/action/author_attestation","sign_citation":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA/action/citation_signature","submit_replication":"https://pith.science/pith/U5QMBH33G5BTAXZB7LRZSD4HMA/action/replication_record"}},"created_at":"2026-05-17T23:52:59.055415+00:00","updated_at":"2026-05-17T23:52:59.055415+00:00"}