{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IZH22MRXXRFUEW2H6C7WKL5VUQ","short_pith_number":"pith:IZH22MRX","canonical_record":{"source":{"id":"1009.0881","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-04T22:55:34Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"05bb0da55a430692edb6049e3fda1530f124d7f885d5ed84db57fa82a7617f71","abstract_canon_sha256":"8d7a0aba53194afc827c6d4fbf632aae5855e045bd8375f5ba7a04a39bff0004"},"schema_version":"1.0"},"canonical_sha256":"464fad3237bc4b425b47f0bf652fb5a41bef22cc04705200ccc1e64b652006ec","source":{"kind":"arxiv","id":"1009.0881","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0881","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0881v3","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0881","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"IZH22MRXXRFU","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IZH22MRXXRFUEW2H","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IZH22MRX","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IZH22MRXXRFUEW2H6C7WKL5VUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0881","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-04T22:55:34Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"05bb0da55a430692edb6049e3fda1530f124d7f885d5ed84db57fa82a7617f71","abstract_canon_sha256":"8d7a0aba53194afc827c6d4fbf632aae5855e045bd8375f5ba7a04a39bff0004"},"schema_version":"1.0"},"canonical_sha256":"464fad3237bc4b425b47f0bf652fb5a41bef22cc04705200ccc1e64b652006ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:01.295366Z","signature_b64":"mSUwitPCP5r0TjzMGr1FmouSBt/Yj4bkeIaBCs0attZuIexQOk00EbZZk0Ner1y4VG7tpcotf80p5uGzrDzhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464fad3237bc4b425b47f0bf652fb5a41bef22cc04705200ccc1e64b652006ec","last_reissued_at":"2026-05-18T03:49:01.294485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:01.294485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0881","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:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1k9c91SfnOn3Qg6kHGaB12WRGEBxi67wP+v7WNzdIc5RUwCX6KNXGI6nuSq1j5uX8kQJSVLSipZGWNNzJEgIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:32.662369Z"},"content_sha256":"f24ea3241bcc9e6297b8c81e9b75c3c3e53fbccf3891aff55e4f49f949e68105","schema_version":"1.0","event_id":"sha256:f24ea3241bcc9e6297b8c81e9b75c3c3e53fbccf3891aff55e4f49f949e68105"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IZH22MRXXRFUEW2H6C7WKL5VUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multilevel Approach For Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2010-09-04T22:55:34Z","abstract_excerpt":"Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image processing, computational biology, etc. In this paper, we explain how algorithms for NMF can be embedded into the framework of multilevel methods in order to accelerate their convergence. This technique can be applied in situations where data admit a good approximate representation in a lower dimensional space through linear transformations preserving nonne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0881","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:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jgyw1Mj1atibI68hmvD5dQw+JPjL27/lCLFx31bjBZXW5aEA7hjSHEBX5h5QVdA4uv9qaDFd9RMhiwTK61LqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:32.662709Z"},"content_sha256":"e6e2bd8a0d932646c14d80b3bdf6f8f41609390f984fa34227362ad4ac474e13","schema_version":"1.0","event_id":"sha256:e6e2bd8a0d932646c14d80b3bdf6f8f41609390f984fa34227362ad4ac474e13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/bundle.json","state_url":"https://pith.science/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/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-29T15:00:32Z","links":{"resolver":"https://pith.science/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ","bundle":"https://pith.science/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/bundle.json","state":"https://pith.science/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZH22MRXXRFUEW2H6C7WKL5VUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IZH22MRXXRFUEW2H6C7WKL5VUQ","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":"8d7a0aba53194afc827c6d4fbf632aae5855e045bd8375f5ba7a04a39bff0004","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-04T22:55:34Z","title_canon_sha256":"05bb0da55a430692edb6049e3fda1530f124d7f885d5ed84db57fa82a7617f71"},"schema_version":"1.0","source":{"id":"1009.0881","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0881","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0881v3","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0881","created_at":"2026-05-18T03:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"IZH22MRXXRFU","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IZH22MRXXRFUEW2H","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IZH22MRX","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:e6e2bd8a0d932646c14d80b3bdf6f8f41609390f984fa34227362ad4ac474e13","target":"graph","created_at":"2026-05-18T03:49:01Z","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 (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image processing, computational biology, etc. In this paper, we explain how algorithms for NMF can be embedded into the framework of multilevel methods in order to accelerate their convergence. This technique can be applied in situations where data admit a good approximate representation in a lower dimensional space through linear transformations preserving nonne","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-04T22:55:34Z","title":"A Multilevel Approach For Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0881","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:f24ea3241bcc9e6297b8c81e9b75c3c3e53fbccf3891aff55e4f49f949e68105","target":"record","created_at":"2026-05-18T03:49:01Z","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":"8d7a0aba53194afc827c6d4fbf632aae5855e045bd8375f5ba7a04a39bff0004","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-04T22:55:34Z","title_canon_sha256":"05bb0da55a430692edb6049e3fda1530f124d7f885d5ed84db57fa82a7617f71"},"schema_version":"1.0","source":{"id":"1009.0881","kind":"arxiv","version":3}},"canonical_sha256":"464fad3237bc4b425b47f0bf652fb5a41bef22cc04705200ccc1e64b652006ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"464fad3237bc4b425b47f0bf652fb5a41bef22cc04705200ccc1e64b652006ec","first_computed_at":"2026-05-18T03:49:01.294485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:01.294485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSUwitPCP5r0TjzMGr1FmouSBt/Yj4bkeIaBCs0attZuIexQOk00EbZZk0Ner1y4VG7tpcotf80p5uGzrDzhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:01.295366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0881","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24ea3241bcc9e6297b8c81e9b75c3c3e53fbccf3891aff55e4f49f949e68105","sha256:e6e2bd8a0d932646c14d80b3bdf6f8f41609390f984fa34227362ad4ac474e13"],"state_sha256":"e29623fc891fe86fea9f7833d3e7d69c5c269c567b68cfe859806e461043f65a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0vL1QzLmUDAl9z2j/WSvpKh3i5RQsjmGmsDLrjPrGfRsEr+XoMB+1/XmMaz7O/d3MGBzz1F1NrVkW8MkPbTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:00:32.664842Z","bundle_sha256":"041225e118ccbeb4ddf81ff75ae27954641932e1cc3a792d42cf24774c7495a7"}}