{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:333LF7LZMB6XAH4OLHAP4ZNFXC","short_pith_number":"pith:333LF7LZ","canonical_record":{"source":{"id":"1112.5407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"838f25670db41f7b0a55cc86a3f10fa335ed88137b892dbce848a4d529b314fb","abstract_canon_sha256":"f2ac4ac4b5aeb7a6aaae3ef273cac7035beb152c9ff52369cdf305bf443e7f58"},"schema_version":"1.0"},"canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","source":{"kind":"arxiv","id":"1112.5407","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:333LF7LZMB6XAH4OLHAP4ZNFXC","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"838f25670db41f7b0a55cc86a3f10fa335ed88137b892dbce848a4d529b314fb","abstract_canon_sha256":"f2ac4ac4b5aeb7a6aaae3ef273cac7035beb152c9ff52369cdf305bf443e7f58"},"schema_version":"1.0"},"canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:03.415663Z","signature_b64":"vihjwJ2dWUzQWZ/EMY0EyP2jKMnmi1J+LwJpy3JVXHrt+e6TD6tOWhACfOCcUoIqKujupBWTWUTeuz+K+kHdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","last_reissued_at":"2026-05-18T03:34:03.414841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:03.414841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5407","source_version":3,"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-18T03:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8NQW+rg8GrSHNVpVCPuLKvad7jCV11zKsEDzdq6WhjIthzHlJZh157nbmeW1XWeTX9KscaRiJ+v2qPMEqn0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:26:15.933057Z"},"content_sha256":"b4d2884a6b3374d8fff0c92d8510b3d8eb4567b9571a65e93eaeacb00653292d","schema_version":"1.0","event_id":"sha256:b4d2884a6b3374d8fff0c92d8510b3d8eb4567b9571a65e93eaeacb00653292d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:333LF7LZMB6XAH4OLHAP4ZNFXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating proximal gradient method for nonnegative matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Yangyang Xu","submitted_at":"2011-12-22T18:22:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5407","kind":"arxiv","version":3},"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-18T03:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a73YGTBstqDTHbsBNMwxKbB4rT90sJh4rKqbjWfrU0zESwZzqkYFdDuCgeIJOAonUhZtV2xZ7J6A1qjuhdhsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:26:15.933438Z"},"content_sha256":"128026e4b27e4e9987556b111ae9d837f0beb59e714a2eaf5d271f318840d1a4","schema_version":"1.0","event_id":"sha256:128026e4b27e4e9987556b111ae9d837f0beb59e714a2eaf5d271f318840d1a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/bundle.json","state_url":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/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-05-27T18:26:15Z","links":{"resolver":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC","bundle":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/bundle.json","state":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSam8qrG/jMmupQYxtxSN+h7DSbCB9k0UjwlnJGxuIqOCElUTaO5KKXUzsIXRiCEmUuMLSuQxt0dNChvT35PCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:26:15.935718Z","bundle_sha256":"f9f69e7a256f1f4d111febe2ae50724ecb64c1a32ebbad7130b5071cdaba5691"}}