{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6JZSWPLTKSKE4YM4GMIIUXLF6T","short_pith_number":"pith:6JZSWPLT","canonical_record":{"source":{"id":"1509.01404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-04T11:19:35Z","cross_cats_sorted":["cs.CV","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"44089c0ca234ce793a02adc8e773f80de482149a17399b73f8a5c00b8dd019ae","abstract_canon_sha256":"a54e097d8fbfd19b906e068cc14df48e5fda21321c0d4dc3e82c425795d6b991"},"schema_version":"1.0"},"canonical_sha256":"f2732b3d7354944e619c33108a5d65f4c47110070092ae6e6d27a6c23e9d448b","source":{"kind":"arxiv","id":"1509.01404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01404","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01404v2","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01404","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"6JZSWPLTKSKE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6JZSWPLTKSKE4YM4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6JZSWPLT","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6JZSWPLTKSKE4YM4GMIIUXLF6T","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-04T11:19:35Z","cross_cats_sorted":["cs.CV","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"44089c0ca234ce793a02adc8e773f80de482149a17399b73f8a5c00b8dd019ae","abstract_canon_sha256":"a54e097d8fbfd19b906e068cc14df48e5fda21321c0d4dc3e82c425795d6b991"},"schema_version":"1.0"},"canonical_sha256":"f2732b3d7354944e619c33108a5d65f4c47110070092ae6e6d27a6c23e9d448b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.423847Z","signature_b64":"p5fBDIU3BbSYLwMgU4/VUKK9aKKKpQIvQiot3BziQV4gErw/8RnXx0O7uv4J8GyMvrPYkZhYJuadsBjNChu+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2732b3d7354944e619c33108a5d65f4c47110070092ae6e6d27a6c23e9d448b","last_reissued_at":"2026-05-18T01:03:06.423426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.423426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01404","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-18T01:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sp4pV7UYQXRAZSN4mqGvzDuXJT8j8oTnMtAbsBkB/vygs4Rtyy9dgVbMx+i5OS5RhI5shqk4Nyjn1k9w5HELCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:03:13.087485Z"},"content_sha256":"974f891a54d418e51fd38a28c46f6e183b173e9248e7ec5b2d8b0f738b4371ca","schema_version":"1.0","event_id":"sha256:974f891a54d418e51fd38a28c46f6e183b173e9248e7ec5b2d8b0f738b4371ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6JZSWPLTKSKE4YM4GMIIUXLF6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.NA","authors_text":"Arnaud Vandaele, Inderjit Dhillon, Kai Zhong, Nicolas Gillis, Qi Lei","submitted_at":"2015-09-04T11:19:35Z","abstract_excerpt":"Given a symmetric nonnegative matrix $A$, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix $H$, usually with much fewer columns than $A$, such that $A \\approx HH^T$. SymNMF can be used for data analysis and in particular for various clustering tasks. In this paper, we propose simple and very efficient coordinate descent schemes to solve this problem, and that can handle large and sparse input matrices. The effectiveness of our methods is illustrated on synthetic and real-world data sets, and we show that they perform favorably compared to recen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01404","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-18T01:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtY/IwdQ22vvREoccSADbdvL3KXE5o6JftTqgnHudFMca3SkHJ2E3+flkNi1vDzA6f57xfAOeFTIEsy1DxPLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:03:13.088265Z"},"content_sha256":"510eba17cc44afde4de10b6ac2818235254504027ec3c07cb5f6a8ff16934843","schema_version":"1.0","event_id":"sha256:510eba17cc44afde4de10b6ac2818235254504027ec3c07cb5f6a8ff16934843"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/bundle.json","state_url":"https://pith.science/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/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-27T00:03:13Z","links":{"resolver":"https://pith.science/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T","bundle":"https://pith.science/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/bundle.json","state":"https://pith.science/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JZSWPLTKSKE4YM4GMIIUXLF6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6JZSWPLTKSKE4YM4GMIIUXLF6T","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":"a54e097d8fbfd19b906e068cc14df48e5fda21321c0d4dc3e82c425795d6b991","cross_cats_sorted":["cs.CV","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-04T11:19:35Z","title_canon_sha256":"44089c0ca234ce793a02adc8e773f80de482149a17399b73f8a5c00b8dd019ae"},"schema_version":"1.0","source":{"id":"1509.01404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01404","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01404v2","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01404","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"6JZSWPLTKSKE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6JZSWPLTKSKE4YM4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6JZSWPLT","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:510eba17cc44afde4de10b6ac2818235254504027ec3c07cb5f6a8ff16934843","target":"graph","created_at":"2026-05-18T01:03:06Z","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":"Given a symmetric nonnegative matrix $A$, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix $H$, usually with much fewer columns than $A$, such that $A \\approx HH^T$. SymNMF can be used for data analysis and in particular for various clustering tasks. In this paper, we propose simple and very efficient coordinate descent schemes to solve this problem, and that can handle large and sparse input matrices. The effectiveness of our methods is illustrated on synthetic and real-world data sets, and we show that they perform favorably compared to recen","authors_text":"Arnaud Vandaele, Inderjit Dhillon, Kai Zhong, Nicolas Gillis, Qi Lei","cross_cats":["cs.CV","cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-04T11:19:35Z","title":"Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01404","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:974f891a54d418e51fd38a28c46f6e183b173e9248e7ec5b2d8b0f738b4371ca","target":"record","created_at":"2026-05-18T01:03:06Z","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":"a54e097d8fbfd19b906e068cc14df48e5fda21321c0d4dc3e82c425795d6b991","cross_cats_sorted":["cs.CV","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-04T11:19:35Z","title_canon_sha256":"44089c0ca234ce793a02adc8e773f80de482149a17399b73f8a5c00b8dd019ae"},"schema_version":"1.0","source":{"id":"1509.01404","kind":"arxiv","version":2}},"canonical_sha256":"f2732b3d7354944e619c33108a5d65f4c47110070092ae6e6d27a6c23e9d448b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2732b3d7354944e619c33108a5d65f4c47110070092ae6e6d27a6c23e9d448b","first_computed_at":"2026-05-18T01:03:06.423426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:06.423426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p5fBDIU3BbSYLwMgU4/VUKK9aKKKpQIvQiot3BziQV4gErw/8RnXx0O7uv4J8GyMvrPYkZhYJuadsBjNChu+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:06.423847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:974f891a54d418e51fd38a28c46f6e183b173e9248e7ec5b2d8b0f738b4371ca","sha256:510eba17cc44afde4de10b6ac2818235254504027ec3c07cb5f6a8ff16934843"],"state_sha256":"43504bd84e0282b91f54546b52dc887b827cd27985a140fe41fe7f9b205f4211"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KP4WEmIYjQCSsaKzk0UA4Xn/nTmlwYmCddzLpbVserLsxoJfAIR9AwoRuLH9UHb26ioQnUAj6NiEe4onMiCiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:03:13.092070Z","bundle_sha256":"bb16004f97e8f914125ecb6405622c82fa22ae1b6bee894acee6a9066c76d9ea"}}