{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LH36FQDNXYGJF3CWGKAI43NM3C","short_pith_number":"pith:LH36FQDN","schema_version":"1.0","canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","source":{"kind":"arxiv","id":"1111.0952","version":1},"attestation_state":"computed","paper":{"title":"Computing a Nonnegative Matrix Factorization -- Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ankur Moitra, Ravi Kannan, Rong Ge, Sanjeev Arora","submitted_at":"2011-11-03T19:15:56Z","abstract_excerpt":"In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \\times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \\times r$ and $r \\times m$ respectively. In some applications, it makes sense to ask instead for the product $AW$ to approximate $M$ -- i.e. (approximately) minimize $\\norm{M - AW}_F$ where $\\norm{}_F$ denotes the Frobenius norm; we refer to this as Approximate NMF. This problem has a rich history spanning quantum mechanics, probability theory, data analysis, polyhedral combina"},"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":"1111.0952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-03T19:15:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e377f8c40790a6c6b5d64c433a1011345d8129e929b529906f475e2506c929b","abstract_canon_sha256":"c0c9270bc3e5b229b482ee6cb428a32ee30fe99ece9cb5cfb49b980e2545c7e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.563686Z","signature_b64":"CC31VqaTx2arKXGphRL1XGQqkgOHmGjMBVyDC1ARNXVIA/DKebeZSi+UhmLibCMoYGgoBOjSQkM0zffnHZJ6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","last_reissued_at":"2026-05-18T04:09:36.563170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.563170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a Nonnegative Matrix Factorization -- Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ankur Moitra, Ravi Kannan, Rong Ge, Sanjeev Arora","submitted_at":"2011-11-03T19:15:56Z","abstract_excerpt":"In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \\times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \\times r$ and $r \\times m$ respectively. In some applications, it makes sense to ask instead for the product $AW$ to approximate $M$ -- i.e. (approximately) minimize $\\norm{M - AW}_F$ where $\\norm{}_F$ denotes the Frobenius norm; we refer to this as Approximate NMF. This problem has a rich history spanning quantum mechanics, probability theory, data analysis, polyhedral combina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0952","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":"1111.0952","created_at":"2026-05-18T04:09:36.563220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0952v1","created_at":"2026-05-18T04:09:36.563220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0952","created_at":"2026-05-18T04:09:36.563220+00:00"},{"alias_kind":"pith_short_12","alias_value":"LH36FQDNXYGJ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LH36FQDNXYGJF3CW","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LH36FQDN","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09133","citing_title":"Complexity of Contextuality","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C","json":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C.json","graph_json":"https://pith.science/api/pith-number/LH36FQDNXYGJF3CWGKAI43NM3C/graph.json","events_json":"https://pith.science/api/pith-number/LH36FQDNXYGJF3CWGKAI43NM3C/events.json","paper":"https://pith.science/paper/LH36FQDN"},"agent_actions":{"view_html":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C","download_json":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C.json","view_paper":"https://pith.science/paper/LH36FQDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0952&json=true","fetch_graph":"https://pith.science/api/pith-number/LH36FQDNXYGJF3CWGKAI43NM3C/graph.json","fetch_events":"https://pith.science/api/pith-number/LH36FQDNXYGJF3CWGKAI43NM3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/action/storage_attestation","attest_author":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/action/author_attestation","sign_citation":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/action/citation_signature","submit_replication":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/action/replication_record"}},"created_at":"2026-05-18T04:09:36.563220+00:00","updated_at":"2026-05-18T04:09:36.563220+00:00"}