{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TTLDKEU7JGIIT6NDGRS6LNPJ3A","short_pith_number":"pith:TTLDKEU7","schema_version":"1.0","canonical_sha256":"9cd635129f499089f9a33465e5b5e9d81d9e9ee5523df9bffe4bcf2da1c14858","source":{"kind":"arxiv","id":"1703.08267","version":1},"attestation_state":"computed","paper":{"title":"A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Songtao Lu, Zhengdao Wang","submitted_at":"2017-03-24T02:31:23Z","abstract_excerpt":"Symmetric nonnegative matrix factorization (SymNMF) has important applications in data analytics problems such as document clustering, community detection and image segmentation. In this paper, we propose a novel nonconvex variable splitting method for solving SymNMF. The proposed algorithm is guaranteed to converge to the set of Karush-Kuhn-Tucker (KKT) points of the nonconvex SymNMF problem. Furthermore, it achieves a global sublinear convergence rate. We also show that the algorithm can be efficiently implemented in parallel. Further, sufficient conditions are provided which guarantee the g"},"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":"1703.08267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-24T02:31:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"336c87e9713476ff42bde1e52b8d9d08846edf32396156c37fd66b0d89dc6641","abstract_canon_sha256":"706c5dacb3fe33f436acf8adfbb49e116975de065cd6c09b405328502add3ba8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:00.304984Z","signature_b64":"AdyP1rs1ne0T2YvFBME0aeLbsf3VNZF9NxrFIle/6r0BMclGnFAQ17aGMU8z6lAkm2OoRVEg/Ab9kpWm97SuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd635129f499089f9a33465e5b5e9d81d9e9ee5523df9bffe4bcf2da1c14858","last_reissued_at":"2026-05-18T00:48:00.304181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:00.304181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Songtao Lu, Zhengdao Wang","submitted_at":"2017-03-24T02:31:23Z","abstract_excerpt":"Symmetric nonnegative matrix factorization (SymNMF) has important applications in data analytics problems such as document clustering, community detection and image segmentation. In this paper, we propose a novel nonconvex variable splitting method for solving SymNMF. The proposed algorithm is guaranteed to converge to the set of Karush-Kuhn-Tucker (KKT) points of the nonconvex SymNMF problem. Furthermore, it achieves a global sublinear convergence rate. We also show that the algorithm can be efficiently implemented in parallel. Further, sufficient conditions are provided which guarantee the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08267","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":""},"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":"1703.08267","created_at":"2026-05-18T00:48:00.304329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08267v1","created_at":"2026-05-18T00:48:00.304329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08267","created_at":"2026-05-18T00:48:00.304329+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTLDKEU7JGII","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTLDKEU7JGIIT6ND","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTLDKEU7","created_at":"2026-05-18T12:31:46.661854+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/TTLDKEU7JGIIT6NDGRS6LNPJ3A","json":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A.json","graph_json":"https://pith.science/api/pith-number/TTLDKEU7JGIIT6NDGRS6LNPJ3A/graph.json","events_json":"https://pith.science/api/pith-number/TTLDKEU7JGIIT6NDGRS6LNPJ3A/events.json","paper":"https://pith.science/paper/TTLDKEU7"},"agent_actions":{"view_html":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A","download_json":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A.json","view_paper":"https://pith.science/paper/TTLDKEU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08267&json=true","fetch_graph":"https://pith.science/api/pith-number/TTLDKEU7JGIIT6NDGRS6LNPJ3A/graph.json","fetch_events":"https://pith.science/api/pith-number/TTLDKEU7JGIIT6NDGRS6LNPJ3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A/action/storage_attestation","attest_author":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A/action/author_attestation","sign_citation":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A/action/citation_signature","submit_replication":"https://pith.science/pith/TTLDKEU7JGIIT6NDGRS6LNPJ3A/action/replication_record"}},"created_at":"2026-05-18T00:48:00.304329+00:00","updated_at":"2026-05-18T00:48:00.304329+00:00"}