{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:BWOEMRQBHRM64RCVSXXHP6ZZ4K","short_pith_number":"pith:BWOEMRQB","schema_version":"1.0","canonical_sha256":"0d9c4646013c59ee445595ee77fb39e2b2ec21ddbc64ba32f63aaefaf66c3285","source":{"kind":"arxiv","id":"0810.4225","version":1},"attestation_state":"computed","paper":{"title":"Nonnegative Factorization and The Maximum Edge Biclique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2008-10-23T08:08:36Z","abstract_excerpt":"Nonnegative Matrix Factorization (NMF) is a data analysis technique which allows compression and interpretation of nonnegative data. NMF became widely studied after the publication of the seminal paper by Lee and Seung (Learning the Parts of Objects by Nonnegative Matrix Factorization, Nature, 1999, vol. 401, pp. 788--791), which introduced an algorithm based on Multiplicative Updates (MU). More recently, another class of methods called Hierarchical Alternating Least Squares (HALS) was introduced that seems to be much more efficient in practice.\n  In this paper, we consider the problem of appr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0810.4225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-10-23T08:08:36Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"3ef56c3e69d327ad44bd187b49afe113a1928c2108913b13f1a2abf45b66bb15","abstract_canon_sha256":"179297eb15a244bb17d7b69c59bd8c76b85d3f85577347cdec5b57d63f7fba73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:08.276843Z","signature_b64":"EzBijwuEIFPZ5uumSvNig9bg5aYNl3DD+FI78rSl+e9chDjMHyt8QTVCJ0xtRtqMFIItpRgbhFgV3UbP5+4ZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9c4646013c59ee445595ee77fb39e2b2ec21ddbc64ba32f63aaefaf66c3285","last_reissued_at":"2026-06-03T23:06:08.276378Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:08.276378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonnegative Factorization and The Maximum Edge Biclique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2008-10-23T08:08:36Z","abstract_excerpt":"Nonnegative Matrix Factorization (NMF) is a data analysis technique which allows compression and interpretation of nonnegative data. NMF became widely studied after the publication of the seminal paper by Lee and Seung (Learning the Parts of Objects by Nonnegative Matrix Factorization, Nature, 1999, vol. 401, pp. 788--791), which introduced an algorithm based on Multiplicative Updates (MU). More recently, another class of methods called Hierarchical Alternating Least Squares (HALS) was introduced that seems to be much more efficient in practice.\n  In this paper, we consider the problem of appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4225","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0810.4225/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.4225","created_at":"2026-06-03T23:06:08.276440+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4225v1","created_at":"2026-06-03T23:06:08.276440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4225","created_at":"2026-06-03T23:06:08.276440+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWOEMRQBHRM6","created_at":"2026-06-03T23:06:08.276440+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWOEMRQBHRM64RCV","created_at":"2026-06-03T23:06:08.276440+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWOEMRQB","created_at":"2026-06-03T23:06:08.276440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K","json":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K.json","graph_json":"https://pith.science/api/pith-number/BWOEMRQBHRM64RCVSXXHP6ZZ4K/graph.json","events_json":"https://pith.science/api/pith-number/BWOEMRQBHRM64RCVSXXHP6ZZ4K/events.json","paper":"https://pith.science/paper/BWOEMRQB"},"agent_actions":{"view_html":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K","download_json":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K.json","view_paper":"https://pith.science/paper/BWOEMRQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4225&json=true","fetch_graph":"https://pith.science/api/pith-number/BWOEMRQBHRM64RCVSXXHP6ZZ4K/graph.json","fetch_events":"https://pith.science/api/pith-number/BWOEMRQBHRM64RCVSXXHP6ZZ4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K/action/storage_attestation","attest_author":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K/action/author_attestation","sign_citation":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K/action/citation_signature","submit_replication":"https://pith.science/pith/BWOEMRQBHRM64RCVSXXHP6ZZ4K/action/replication_record"}},"created_at":"2026-06-03T23:06:08.276440+00:00","updated_at":"2026-06-03T23:06:08.276440+00:00"}