{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:333LF7LZMB6XAH4OLHAP4ZNFXC","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":"f2ac4ac4b5aeb7a6aaae3ef273cac7035beb152c9ff52369cdf305bf443e7f58","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","title_canon_sha256":"838f25670db41f7b0a55cc86a3f10fa335ed88137b892dbce848a4d529b314fb"},"schema_version":"1.0","source":{"id":"1112.5407","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5407","created_at":"2026-05-18T03:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5407v3","created_at":"2026-05-18T03:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5407","created_at":"2026-05-18T03:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"333LF7LZMB6X","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"333LF7LZMB6XAH4O","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"333LF7LZ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:128026e4b27e4e9987556b111ae9d837f0beb59e714a2eaf5d271f318840d1a4","target":"graph","created_at":"2026-05-18T03:34:03Z","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":"Nonnegative matrix factorization has been widely applied in face recognition, text mining, as well as spectral analysis. This paper proposes an alternating proximal gradient method for solving this problem. With a uniformly positive lower bound assumption on the iterates, any limit point can be proved to satisfy the first-order optimality conditions. A Nesterov-type extrapolation technique is then applied to accelerate the algorithm. Though this technique is at first used for convex program, it turns out to work very well for the non-convex nonnegative matrix factorization problem. Extensive n","authors_text":"Yangyang Xu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","title":"Alternating proximal gradient method for nonnegative matrix factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5407","kind":"arxiv","version":3},"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:b4d2884a6b3374d8fff0c92d8510b3d8eb4567b9571a65e93eaeacb00653292d","target":"record","created_at":"2026-05-18T03:34:03Z","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":"f2ac4ac4b5aeb7a6aaae3ef273cac7035beb152c9ff52369cdf305bf443e7f58","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","title_canon_sha256":"838f25670db41f7b0a55cc86a3f10fa335ed88137b892dbce848a4d529b314fb"},"schema_version":"1.0","source":{"id":"1112.5407","kind":"arxiv","version":3}},"canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","first_computed_at":"2026-05-18T03:34:03.414841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:03.414841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vihjwJ2dWUzQWZ/EMY0EyP2jKMnmi1J+LwJpy3JVXHrt+e6TD6tOWhACfOCcUoIqKujupBWTWUTeuz+K+kHdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:03.415663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5407","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4d2884a6b3374d8fff0c92d8510b3d8eb4567b9571a65e93eaeacb00653292d","sha256:128026e4b27e4e9987556b111ae9d837f0beb59e714a2eaf5d271f318840d1a4"],"state_sha256":"5cfd93a6dce67ead5461e772af28d8e9992933659f97652f72b99f75282eae64"}