{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LH36FQDNXYGJF3CWGKAI43NM3C","short_pith_number":"pith:LH36FQDN","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"},"canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","source":{"kind":"arxiv","id":"1111.0952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0952","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0952v1","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0952","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"LH36FQDNXYGJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LH36FQDNXYGJF3CW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LH36FQDN","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LH36FQDNXYGJF3CWGKAI43NM3C","target":"record","payload":{"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"},"canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","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"},"source_kind":"arxiv","source_id":"1111.0952","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2GhuZ/ZVU0O2RerYZ0XAPLiJyhNYXBA576qVPubRrbqCCX/+BaDnXJOoJPUWbsl93T46hdEVan0TEvLkYFzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:36:33.066961Z"},"content_sha256":"4f597ffc07fd5fa5f8b9540397f7255a49eb0c8058ede9492ce828e2196753e5","schema_version":"1.0","event_id":"sha256:4f597ffc07fd5fa5f8b9540397f7255a49eb0c8058ede9492ce828e2196753e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LH36FQDNXYGJF3CWGKAI43NM3C","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7m3WoKXyyw6Oor2L7kbjKMWbohwYxS/VfKj4FqUn53NPhGyVdKOUepu5LbHz2JLNgRaaJST3+yKg2/ALjec3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:36:33.067798Z"},"content_sha256":"d8b4079d192881aa4db9a433bacdfefd48964a9a583a6500c5172393bcb6de83","schema_version":"1.0","event_id":"sha256:d8b4079d192881aa4db9a433bacdfefd48964a9a583a6500c5172393bcb6de83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/bundle.json","state_url":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LH36FQDNXYGJF3CWGKAI43NM3C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T13:36:33Z","links":{"resolver":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C","bundle":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/bundle.json","state":"https://pith.science/pith/LH36FQDNXYGJF3CWGKAI43NM3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LH36FQDNXYGJF3CWGKAI43NM3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LH36FQDNXYGJF3CWGKAI43NM3C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c0c9270bc3e5b229b482ee6cb428a32ee30fe99ece9cb5cfb49b980e2545c7e3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-03T19:15:56Z","title_canon_sha256":"3e377f8c40790a6c6b5d64c433a1011345d8129e929b529906f475e2506c929b"},"schema_version":"1.0","source":{"id":"1111.0952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0952","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0952v1","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0952","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"LH36FQDNXYGJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LH36FQDNXYGJF3CW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LH36FQDN","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:d8b4079d192881aa4db9a433bacdfefd48964a9a583a6500c5172393bcb6de83","target":"graph","created_at":"2026-05-18T04:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ankur Moitra, Ravi Kannan, Rong Ge, Sanjeev Arora","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-03T19:15:56Z","title":"Computing a Nonnegative Matrix Factorization -- Provably"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0952","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f597ffc07fd5fa5f8b9540397f7255a49eb0c8058ede9492ce828e2196753e5","target":"record","created_at":"2026-05-18T04:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c0c9270bc3e5b229b482ee6cb428a32ee30fe99ece9cb5cfb49b980e2545c7e3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-03T19:15:56Z","title_canon_sha256":"3e377f8c40790a6c6b5d64c433a1011345d8129e929b529906f475e2506c929b"},"schema_version":"1.0","source":{"id":"1111.0952","kind":"arxiv","version":1}},"canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59f7e2c06dbe0c92ec5632808e6dacd883c7c5ba1dc13dfd4e56f6333128ee8d","first_computed_at":"2026-05-18T04:09:36.563170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:36.563170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CC31VqaTx2arKXGphRL1XGQqkgOHmGjMBVyDC1ARNXVIA/DKebeZSi+UhmLibCMoYGgoBOjSQkM0zffnHZJ6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:36.563686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f597ffc07fd5fa5f8b9540397f7255a49eb0c8058ede9492ce828e2196753e5","sha256:d8b4079d192881aa4db9a433bacdfefd48964a9a583a6500c5172393bcb6de83"],"state_sha256":"bc91b3a29ea495e0be455b7b88910d39017f16380c82683acd805a736d34e852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtviRcuxX0W5WG2qk5cHsfFPEVUTQ20pILY30zpJeh4cS9EOJ8qRp4EF6/Sd+ZyeVqie4yZFthd/2M55PMLYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:36:33.074991Z","bundle_sha256":"72fae21c2ecedd31d870fc56f3e214b3f6a675764f92cab1e143463cc91f7482"}}