{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:4U24GCTJ2OINRSDCMEGUVTHQPA","short_pith_number":"pith:4U24GCTJ","canonical_record":{"source":{"id":"0902.1060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-02-06T11:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"5d65e20a8528756acc2b5cc987ef2bcfaf71aff3e1a3be2b7aee5530c1a8bac6","abstract_canon_sha256":"e7fcb953fce2fd3106c6c1a84ed2b8404952801c8382dd6a4713dbcc2827f086"},"schema_version":"1.0"},"canonical_sha256":"e535c30a69d390d8c862610d4accf078192439420a89ffe47d5a25cba35b6ea0","source":{"kind":"arxiv","id":"0902.1060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1060","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1060v2","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1060","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"4U24GCTJ2OIN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4U24GCTJ2OINRSDC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4U24GCTJ","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:4U24GCTJ2OINRSDCMEGUVTHQPA","target":"record","payload":{"canonical_record":{"source":{"id":"0902.1060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-02-06T11:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"5d65e20a8528756acc2b5cc987ef2bcfaf71aff3e1a3be2b7aee5530c1a8bac6","abstract_canon_sha256":"e7fcb953fce2fd3106c6c1a84ed2b8404952801c8382dd6a4713dbcc2827f086"},"schema_version":"1.0"},"canonical_sha256":"e535c30a69d390d8c862610d4accf078192439420a89ffe47d5a25cba35b6ea0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:09.471986Z","signature_b64":"JimvJ2QK8Hyo8J2VfCrNt9j8SDjsVtfgQCn59APm95ceZTdEht7yx6L0OVas4uGo5SovFOvLAs8Z/vhPnQCvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e535c30a69d390d8c862610d4accf078192439420a89ffe47d5a25cba35b6ea0","last_reissued_at":"2026-05-18T03:49:09.471434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:09.471434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.1060","source_version":2,"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:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKHxAGQp3NyUcEPWBVzXq0687vBlMhNRlF95KZr6KZyjOLQbbwKxTvcLGjhfyxD4WgfjBYz5f+U97aWaLnaxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:40:28.347780Z"},"content_sha256":"ed7e30862e10c33dccc5176456ff7d654790bb070e234b44b86a4509b42a23b2","schema_version":"1.0","event_id":"sha256:ed7e30862e10c33dccc5176456ff7d654790bb070e234b44b86a4509b42a23b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:4U24GCTJ2OINRSDCMEGUVTHQPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Underapproximations for Sparse Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2009-02-06T11:05:23Z","abstract_excerpt":"Nonnegative Matrix Factorization consists in (approximately) factorizing a nonnegative data matrix by the product of two low-rank nonnegative matrices. It has been successfully applied as a data analysis technique in numerous domains, e.g., text mining, image processing, microarray data analysis, collaborative filtering, etc.\n  We introduce a novel approach to solve NMF problems, based on the use of an underapproximation technique, and show its effectiveness to obtain sparse solutions. This approach, based on Lagrangian relaxation, allows the resolution of NMF problems in a recursive fashion. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1060","kind":"arxiv","version":2},"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:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUwed5D6ceuV4UIQ1bxkki4mFbX5p1R+54Q1xzF9IEkjkDPJWfFrA3FzCN91+5z60jnMcUtkErpxejzr1iQQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:40:28.348449Z"},"content_sha256":"4468325d906c25e54bad7a1283b1eaae9432a2e258cefb0209b365ea2373571e","schema_version":"1.0","event_id":"sha256:4468325d906c25e54bad7a1283b1eaae9432a2e258cefb0209b365ea2373571e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/bundle.json","state_url":"https://pith.science/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/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-28T22:40:28Z","links":{"resolver":"https://pith.science/pith/4U24GCTJ2OINRSDCMEGUVTHQPA","bundle":"https://pith.science/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/bundle.json","state":"https://pith.science/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4U24GCTJ2OINRSDCMEGUVTHQPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:4U24GCTJ2OINRSDCMEGUVTHQPA","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":"e7fcb953fce2fd3106c6c1a84ed2b8404952801c8382dd6a4713dbcc2827f086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-02-06T11:05:23Z","title_canon_sha256":"5d65e20a8528756acc2b5cc987ef2bcfaf71aff3e1a3be2b7aee5530c1a8bac6"},"schema_version":"1.0","source":{"id":"0902.1060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1060","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1060v2","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1060","created_at":"2026-05-18T03:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"4U24GCTJ2OIN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4U24GCTJ2OINRSDC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4U24GCTJ","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:4468325d906c25e54bad7a1283b1eaae9432a2e258cefb0209b365ea2373571e","target":"graph","created_at":"2026-05-18T03:49:09Z","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 consists in (approximately) factorizing a nonnegative data matrix by the product of two low-rank nonnegative matrices. It has been successfully applied as a data analysis technique in numerous domains, e.g., text mining, image processing, microarray data analysis, collaborative filtering, etc.\n  We introduce a novel approach to solve NMF problems, based on the use of an underapproximation technique, and show its effectiveness to obtain sparse solutions. This approach, based on Lagrangian relaxation, allows the resolution of NMF problems in a recursive fashion. ","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-02-06T11:05:23Z","title":"Using Underapproximations for Sparse Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1060","kind":"arxiv","version":2},"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:ed7e30862e10c33dccc5176456ff7d654790bb070e234b44b86a4509b42a23b2","target":"record","created_at":"2026-05-18T03:49:09Z","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":"e7fcb953fce2fd3106c6c1a84ed2b8404952801c8382dd6a4713dbcc2827f086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-02-06T11:05:23Z","title_canon_sha256":"5d65e20a8528756acc2b5cc987ef2bcfaf71aff3e1a3be2b7aee5530c1a8bac6"},"schema_version":"1.0","source":{"id":"0902.1060","kind":"arxiv","version":2}},"canonical_sha256":"e535c30a69d390d8c862610d4accf078192439420a89ffe47d5a25cba35b6ea0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e535c30a69d390d8c862610d4accf078192439420a89ffe47d5a25cba35b6ea0","first_computed_at":"2026-05-18T03:49:09.471434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:09.471434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JimvJ2QK8Hyo8J2VfCrNt9j8SDjsVtfgQCn59APm95ceZTdEht7yx6L0OVas4uGo5SovFOvLAs8Z/vhPnQCvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:09.471986Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.1060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed7e30862e10c33dccc5176456ff7d654790bb070e234b44b86a4509b42a23b2","sha256:4468325d906c25e54bad7a1283b1eaae9432a2e258cefb0209b365ea2373571e"],"state_sha256":"1a4981c0f39f53f93809a0af3731729727d942bf8dbb2d4a9413e3aee04f69c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjFDBY49ENLZ95zI9RcAsugR0KyaZVmOfQ/MZSQbsFiPYBEdoEjK0ckUXBTieiz89e2qePUrsu/g433kLzsUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:40:28.352071Z","bundle_sha256":"bbbab2ba5bceb5cfb4609f16e25f054f26c3d413b809a5cef84793d6060692d6"}}