{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J7DBXAT5RRYSEWU2B6CLKKE5K7","short_pith_number":"pith:J7DBXAT5","schema_version":"1.0","canonical_sha256":"4fc61b827d8c71225a9a0f84b5289d57c28e95140ba3fc2464cf716da0e31191","source":{"kind":"arxiv","id":"1201.0901","version":2},"attestation_state":"computed","paper":{"title":"Two Algorithms for Orthogonal Nonnegative Matrix Factorization with Application to Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"math.OC","authors_text":"Filippo Pompili, Fran\\c{c}ois Glineur, Nicolas Gillis, P.-A. Absil","submitted_at":"2012-01-04T14:39:39Z","abstract_excerpt":"Approximate matrix factorization techniques with both nonnegativity and orthogonality constraints, referred to as orthogonal nonnegative matrix factorization (ONMF), have been recently introduced and shown to work remarkably well for clustering tasks such as document classification. In this paper, we introduce two new methods to solve ONMF. First, we show athematical equivalence between ONMF and a weighted variant of spherical k-means, from which we derive our first method, a simple EM-like algorithm. This also allows us to determine when ONMF should be preferred to k-means and spherical k-mea"},"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":"1201.0901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-04T14:39:39Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e1fa8653d59b88f40893a5be16c087fbfa7ce238258112bbeef339668647f63d","abstract_canon_sha256":"c169c5536fd1f80c28613a93faf3d0ca2e61b4ac54d6649fcb128ffe88c396b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.735447Z","signature_b64":"vIfjXu+Ub/sXNE2740wo165nG7p63768/VtLbzxR5QtbZw9VimWbw8S41/NFOe1KaRrPCJ+qk0DYC8vxcEK9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc61b827d8c71225a9a0f84b5289d57c28e95140ba3fc2464cf716da0e31191","last_reissued_at":"2026-05-18T02:21:26.734654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.734654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Algorithms for Orthogonal Nonnegative Matrix Factorization with Application to Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"math.OC","authors_text":"Filippo Pompili, Fran\\c{c}ois Glineur, Nicolas Gillis, P.-A. Absil","submitted_at":"2012-01-04T14:39:39Z","abstract_excerpt":"Approximate matrix factorization techniques with both nonnegativity and orthogonality constraints, referred to as orthogonal nonnegative matrix factorization (ONMF), have been recently introduced and shown to work remarkably well for clustering tasks such as document classification. In this paper, we introduce two new methods to solve ONMF. First, we show athematical equivalence between ONMF and a weighted variant of spherical k-means, from which we derive our first method, a simple EM-like algorithm. This also allows us to determine when ONMF should be preferred to k-means and spherical k-mea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0901","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.0901","created_at":"2026-05-18T02:21:26.734759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0901v2","created_at":"2026-05-18T02:21:26.734759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0901","created_at":"2026-05-18T02:21:26.734759+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7DBXAT5RRYS","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7DBXAT5RRYSEWU2","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7DBXAT5","created_at":"2026-05-18T12:27:11.947152+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/J7DBXAT5RRYSEWU2B6CLKKE5K7","json":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7.json","graph_json":"https://pith.science/api/pith-number/J7DBXAT5RRYSEWU2B6CLKKE5K7/graph.json","events_json":"https://pith.science/api/pith-number/J7DBXAT5RRYSEWU2B6CLKKE5K7/events.json","paper":"https://pith.science/paper/J7DBXAT5"},"agent_actions":{"view_html":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7","download_json":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7.json","view_paper":"https://pith.science/paper/J7DBXAT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0901&json=true","fetch_graph":"https://pith.science/api/pith-number/J7DBXAT5RRYSEWU2B6CLKKE5K7/graph.json","fetch_events":"https://pith.science/api/pith-number/J7DBXAT5RRYSEWU2B6CLKKE5K7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7/action/storage_attestation","attest_author":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7/action/author_attestation","sign_citation":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7/action/citation_signature","submit_replication":"https://pith.science/pith/J7DBXAT5RRYSEWU2B6CLKKE5K7/action/replication_record"}},"created_at":"2026-05-18T02:21:26.734759+00:00","updated_at":"2026-05-18T02:21:26.734759+00:00"}