{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L4COXGFTTJ6BMTFYDJISIL2KVQ","short_pith_number":"pith:L4COXGFT","schema_version":"1.0","canonical_sha256":"5f04eb98b39a7c164cb81a51242f4aac215b520ada8989609c0a1ecfb971db83","source":{"kind":"arxiv","id":"1301.3389","version":2},"attestation_state":"computed","paper":{"title":"The Diagonalized Newton Algorithm for Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Hugo Van hamme","submitted_at":"2013-01-15T15:59:46Z","abstract_excerpt":"Non-negative matrix factorization (NMF) has become a popular machine learning approach to many problems in text mining, speech and image processing, bio-informatics and seismic data analysis to name a few. In NMF, a matrix of non-negative data is approximated by the low-rank product of two matrices with non-negative entries. In this paper, the approximation quality is measured by the Kullback-Leibler divergence between the data and its low-rank reconstruction. The existence of the simple multiplicative update (MU) algorithm for computing the matrix factors has contributed to the success of NMF"},"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":"1301.3389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-15T15:59:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6ea93d797d9028f01b67f218d701597c839ad0c0953007f4c442ba8b577580c0","abstract_canon_sha256":"418c379aea881884be88ef3d878a2ca959fa810f8630f932321f20832357ee96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:41.053607Z","signature_b64":"v6heJUfBSBEa5/uaeK6ZIm+z95gX1gzK393/+SAirpOlLWHU+gjk4EPku11/nttIUsRBKgyiExF6rK7dvfzuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f04eb98b39a7c164cb81a51242f4aac215b520ada8989609c0a1ecfb971db83","last_reissued_at":"2026-05-18T03:30:41.052793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:41.052793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Diagonalized Newton Algorithm for Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Hugo Van hamme","submitted_at":"2013-01-15T15:59:46Z","abstract_excerpt":"Non-negative matrix factorization (NMF) has become a popular machine learning approach to many problems in text mining, speech and image processing, bio-informatics and seismic data analysis to name a few. In NMF, a matrix of non-negative data is approximated by the low-rank product of two matrices with non-negative entries. In this paper, the approximation quality is measured by the Kullback-Leibler divergence between the data and its low-rank reconstruction. The existence of the simple multiplicative update (MU) algorithm for computing the matrix factors has contributed to the success of NMF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3389","kind":"arxiv","version":2},"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":"1301.3389","created_at":"2026-05-18T03:30:41.052928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3389v2","created_at":"2026-05-18T03:30:41.052928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3389","created_at":"2026-05-18T03:30:41.052928+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4COXGFTTJ6B","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4COXGFTTJ6BMTFY","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4COXGFT","created_at":"2026-05-18T12:27:51.066281+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/L4COXGFTTJ6BMTFYDJISIL2KVQ","json":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ.json","graph_json":"https://pith.science/api/pith-number/L4COXGFTTJ6BMTFYDJISIL2KVQ/graph.json","events_json":"https://pith.science/api/pith-number/L4COXGFTTJ6BMTFYDJISIL2KVQ/events.json","paper":"https://pith.science/paper/L4COXGFT"},"agent_actions":{"view_html":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ","download_json":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ.json","view_paper":"https://pith.science/paper/L4COXGFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3389&json=true","fetch_graph":"https://pith.science/api/pith-number/L4COXGFTTJ6BMTFYDJISIL2KVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/L4COXGFTTJ6BMTFYDJISIL2KVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ/action/storage_attestation","attest_author":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ/action/author_attestation","sign_citation":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ/action/citation_signature","submit_replication":"https://pith.science/pith/L4COXGFTTJ6BMTFYDJISIL2KVQ/action/replication_record"}},"created_at":"2026-05-18T03:30:41.052928+00:00","updated_at":"2026-05-18T03:30:41.052928+00:00"}