{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ASOMQZXTBCJNLOOT3RAMYOJ7MQ","short_pith_number":"pith:ASOMQZXT","canonical_record":{"source":{"id":"1811.05642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:09:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0f9741147d37703216e7afa82d1978dfc4bf75efda19ea6aac8ec91594996229","abstract_canon_sha256":"564f7af662d09c2f0be3f548dcdd3d62b65896cfec58f8e01d307c19af26d359"},"schema_version":"1.0"},"canonical_sha256":"049cc866f30892d5b9d3dc40cc393f6435ddf1416fbb4f0a7ea463a39157b00d","source":{"kind":"arxiv","id":"1811.05642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05642","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05642v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05642","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"ASOMQZXTBCJN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASOMQZXTBCJNLOOT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASOMQZXT","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ASOMQZXTBCJNLOOT3RAMYOJ7MQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:09:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0f9741147d37703216e7afa82d1978dfc4bf75efda19ea6aac8ec91594996229","abstract_canon_sha256":"564f7af662d09c2f0be3f548dcdd3d62b65896cfec58f8e01d307c19af26d359"},"schema_version":"1.0"},"canonical_sha256":"049cc866f30892d5b9d3dc40cc393f6435ddf1416fbb4f0a7ea463a39157b00d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.450136Z","signature_b64":"0aGjgbkkxcHSy6x4OGpmKerFfSDCnkIu6APJ55eVXiywZ/7K9ZN6RMAdUXH6zJ8ggY1Y+EWiYpGaIPk5wFf4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"049cc866f30892d5b9d3dc40cc393f6435ddf1416fbb4f0a7ea463a39157b00d","last_reissued_at":"2026-05-18T00:00:42.449723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.449723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05642","source_version":1,"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Mt3LYhHAruuwIRdrOyL8+wulluYFFHf+SfvUiK1fNcfurxPUzxHM1hocCmepSicUW0V1ibmWUe3ytYCIjLRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:14:43.130096Z"},"content_sha256":"172cf28991f1e0018a9d7368b150e5f286ca1d5b4d44061dce387c7f30860ca7","schema_version":"1.0","event_id":"sha256:172cf28991f1e0018a9d7368b150e5f286ca1d5b4d44061dce387c7f30860ca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ASOMQZXTBCJNLOOT3RAMYOJ7MQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dropping Symmetry for Fast Symmetric Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kai Liu, Qiuwei Li, Xiao Li, Zhihui Zhu","submitted_at":"2018-11-14T05:09:33Z","abstract_excerpt":"Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for Symmetric NMF is not as easy as for the nonsymmetric counterpart, the latter admitting the splitting property that allows efficient alternating-type algorithms. To overcome this issue, we transfer the symmetric NMF to a nonsymmetric one, then we can adopt the idea from the state-of-the-art algorithms for nonsymmetric NMF to design fast algorithms solving sym"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05642","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"},"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sc6YBp7C2Y2Z5ACy0sEiuKgjETIHx6Z8IFPSUS3+KRiReLVYoKYM++HgOW9bqykFc+Qm9w+OjYiwbmjxh0fZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:14:43.130465Z"},"content_sha256":"f8b7f7ec57cf04bc4bb40c9d96f3fd71c015041396387da9ff61a07deb1a0e3e","schema_version":"1.0","event_id":"sha256:f8b7f7ec57cf04bc4bb40c9d96f3fd71c015041396387da9ff61a07deb1a0e3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/bundle.json","state_url":"https://pith.science/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/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-06-27T05:14:43Z","links":{"resolver":"https://pith.science/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ","bundle":"https://pith.science/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/bundle.json","state":"https://pith.science/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASOMQZXTBCJNLOOT3RAMYOJ7MQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ASOMQZXTBCJNLOOT3RAMYOJ7MQ","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":"564f7af662d09c2f0be3f548dcdd3d62b65896cfec58f8e01d307c19af26d359","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:09:33Z","title_canon_sha256":"0f9741147d37703216e7afa82d1978dfc4bf75efda19ea6aac8ec91594996229"},"schema_version":"1.0","source":{"id":"1811.05642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05642","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05642v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05642","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"ASOMQZXTBCJN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASOMQZXTBCJNLOOT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASOMQZXT","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:f8b7f7ec57cf04bc4bb40c9d96f3fd71c015041396387da9ff61a07deb1a0e3e","target":"graph","created_at":"2026-05-18T00:00:42Z","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":"Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for Symmetric NMF is not as easy as for the nonsymmetric counterpart, the latter admitting the splitting property that allows efficient alternating-type algorithms. To overcome this issue, we transfer the symmetric NMF to a nonsymmetric one, then we can adopt the idea from the state-of-the-art algorithms for nonsymmetric NMF to design fast algorithms solving sym","authors_text":"Kai Liu, Qiuwei Li, Xiao Li, Zhihui Zhu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:09:33Z","title":"Dropping Symmetry for Fast Symmetric Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05642","kind":"arxiv","version":1},"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:172cf28991f1e0018a9d7368b150e5f286ca1d5b4d44061dce387c7f30860ca7","target":"record","created_at":"2026-05-18T00:00:42Z","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":"564f7af662d09c2f0be3f548dcdd3d62b65896cfec58f8e01d307c19af26d359","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T05:09:33Z","title_canon_sha256":"0f9741147d37703216e7afa82d1978dfc4bf75efda19ea6aac8ec91594996229"},"schema_version":"1.0","source":{"id":"1811.05642","kind":"arxiv","version":1}},"canonical_sha256":"049cc866f30892d5b9d3dc40cc393f6435ddf1416fbb4f0a7ea463a39157b00d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"049cc866f30892d5b9d3dc40cc393f6435ddf1416fbb4f0a7ea463a39157b00d","first_computed_at":"2026-05-18T00:00:42.449723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.449723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0aGjgbkkxcHSy6x4OGpmKerFfSDCnkIu6APJ55eVXiywZ/7K9ZN6RMAdUXH6zJ8ggY1Y+EWiYpGaIPk5wFf4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.450136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:172cf28991f1e0018a9d7368b150e5f286ca1d5b4d44061dce387c7f30860ca7","sha256:f8b7f7ec57cf04bc4bb40c9d96f3fd71c015041396387da9ff61a07deb1a0e3e"],"state_sha256":"9e50d5bddc2a799d6af20c90bf350443365f58b911e4a4ccdb3a80899701d35e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlNf7jv0APgDih+rMPcnDhwHFb4q0HFTYFGWaBO+kQ8NM7GD+lgjTuTUY5mlOGwUR+1LmGJ1FLPhIOXuoxvqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:14:43.132369Z","bundle_sha256":"098b2626ce42deb0d8fce56ddc501e667e98d6a23ad301996dab018ab3f8fe87"}}