{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XFGHHGRNLX3KOAI7SZD6DJBW4S","short_pith_number":"pith:XFGHHGRN","canonical_record":{"source":{"id":"1611.03819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"22721ff745708bfb0423decca6ec693235403b59c9c1ee97b69e2dcef7c66bf3","abstract_canon_sha256":"3ed417a4d32ecfb4fd86b21dbab9d9ac6b521133d56941f73e25d46268c80ad5"},"schema_version":"1.0"},"canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","source":{"kind":"arxiv","id":"1611.03819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03819","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03819v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03819","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"XFGHHGRNLX3K","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XFGHHGRNLX3KOAI7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XFGHHGRN","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XFGHHGRNLX3KOAI7SZD6DJBW4S","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"22721ff745708bfb0423decca6ec693235403b59c9c1ee97b69e2dcef7c66bf3","abstract_canon_sha256":"3ed417a4d32ecfb4fd86b21dbab9d9ac6b521133d56941f73e25d46268c80ad5"},"schema_version":"1.0"},"canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:18.218830Z","signature_b64":"PEnN+o9TgVCrZZGYNHdhQFMrGWRF4DwgcRiHG1F/htSTtSDvlsoX+IdycNDM0Iyo59F+oTywLRmSpOQBDjvIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","last_reissued_at":"2026-05-18T00:59:18.218239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:18.218239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03819","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osKqMpMITPL3lgeURByz2smN9F4Cz3XjyIj7Wl7acqtPUDe2TqyF/84+SVjnOrTdHUVMEGRuNe6x+iBI7RCqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:57:49.957360Z"},"content_sha256":"1ed099a30ae460f075f780b448f36ce964787e20afeb498be8ed5409864c45b7","schema_version":"1.0","event_id":"sha256:1ed099a30ae460f075f780b448f36ce964787e20afeb498be8ed5409864c45b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XFGHHGRNLX3KOAI7SZD6DJBW4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Yingyu Liang, Yuanzhi Li","submitted_at":"2016-11-11T19:13:37Z","abstract_excerpt":"Non-negative matrix factorization is a popular tool for decomposing data into feature and weight matrices under non-negativity constraints. It enjoys practical success but is poorly understood theoretically. This paper proposes an algorithm that alternates between decoding the weights and updating the features, and shows that assuming a generative model of the data, it provably recovers the ground-truth under fairly mild conditions. In particular, its only essential requirement on features is linear independence. Furthermore, the algorithm uses ReLU to exploit the non-negativity for decoding t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03819","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1/WXkndXnLBVtqwV3QHwAVgQ6HtFdktlJAx0QWZoSlF/UrfI+jLPvzdMDr/t224cGfLd92fc8Lzvk28Ee9EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:57:49.957730Z"},"content_sha256":"22720ce56b2c97ae1d5c5500a859696081220af5a52bd7f5f3dc6ace2f75df5a","schema_version":"1.0","event_id":"sha256:22720ce56b2c97ae1d5c5500a859696081220af5a52bd7f5f3dc6ace2f75df5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/bundle.json","state_url":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/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-06-04T03:57:49Z","links":{"resolver":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S","bundle":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/bundle.json","state":"https://pith.science/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFGHHGRNLX3KOAI7SZD6DJBW4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XFGHHGRNLX3KOAI7SZD6DJBW4S","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":"3ed417a4d32ecfb4fd86b21dbab9d9ac6b521133d56941f73e25d46268c80ad5","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","title_canon_sha256":"22721ff745708bfb0423decca6ec693235403b59c9c1ee97b69e2dcef7c66bf3"},"schema_version":"1.0","source":{"id":"1611.03819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03819","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03819v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03819","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"XFGHHGRNLX3K","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XFGHHGRNLX3KOAI7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XFGHHGRN","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:22720ce56b2c97ae1d5c5500a859696081220af5a52bd7f5f3dc6ace2f75df5a","target":"graph","created_at":"2026-05-18T00:59:18Z","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":"Non-negative matrix factorization is a popular tool for decomposing data into feature and weight matrices under non-negativity constraints. It enjoys practical success but is poorly understood theoretically. This paper proposes an algorithm that alternates between decoding the weights and updating the features, and shows that assuming a generative model of the data, it provably recovers the ground-truth under fairly mild conditions. In particular, its only essential requirement on features is linear independence. Furthermore, the algorithm uses ReLU to exploit the non-negativity for decoding t","authors_text":"Andrej Risteski, Yingyu Liang, Yuanzhi Li","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","title":"Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03819","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:1ed099a30ae460f075f780b448f36ce964787e20afeb498be8ed5409864c45b7","target":"record","created_at":"2026-05-18T00:59:18Z","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":"3ed417a4d32ecfb4fd86b21dbab9d9ac6b521133d56941f73e25d46268c80ad5","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T19:13:37Z","title_canon_sha256":"22721ff745708bfb0423decca6ec693235403b59c9c1ee97b69e2dcef7c66bf3"},"schema_version":"1.0","source":{"id":"1611.03819","kind":"arxiv","version":1}},"canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b94c739a2d5df6a7011f9647e1a436e480f5a5e3cf549c93ce601f9e39d3505e","first_computed_at":"2026-05-18T00:59:18.218239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:18.218239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PEnN+o9TgVCrZZGYNHdhQFMrGWRF4DwgcRiHG1F/htSTtSDvlsoX+IdycNDM0Iyo59F+oTywLRmSpOQBDjvIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:18.218830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ed099a30ae460f075f780b448f36ce964787e20afeb498be8ed5409864c45b7","sha256:22720ce56b2c97ae1d5c5500a859696081220af5a52bd7f5f3dc6ace2f75df5a"],"state_sha256":"15d1f9140a377726afa4e42e3952155684f62ae5ce31ee4c09687591a5d9c1cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etVU3CxbaddLsfukg/UyLIoHL+BO9eXNiQjIhrC4AxX+K14ES+/CpVcuRhzonv8Tugl2kONVKNRGxe/dRADbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:57:49.959788Z","bundle_sha256":"3e6dd8fed30437606e7b5cadaf4ab90c106f4e608d838932d7a3d1e0036192de"}}