{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DRGOOYT4FSHJ2D2PCOWFB4ZEIW","short_pith_number":"pith:DRGOOYT4","canonical_record":{"source":{"id":"1410.0993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-10-03T23:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"316f7ec512dd052c3706005f2c39d570e9d0b2a5e20d069e1cde1321e087201c","abstract_canon_sha256":"492b3e37e9b3d9cd7723794dc506d96d02c3acca17bcbbd979f73ef2c47ec540"},"schema_version":"1.0"},"canonical_sha256":"1c4ce7627c2c8e9d0f4f13ac50f32445b2fc920f72a4696aa5907d3ac14903d1","source":{"kind":"arxiv","id":"1410.0993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0993","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0993v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0993","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"DRGOOYT4FSHJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DRGOOYT4FSHJ2D2P","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DRGOOYT4","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DRGOOYT4FSHJ2D2PCOWFB4ZEIW","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-10-03T23:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"316f7ec512dd052c3706005f2c39d570e9d0b2a5e20d069e1cde1321e087201c","abstract_canon_sha256":"492b3e37e9b3d9cd7723794dc506d96d02c3acca17bcbbd979f73ef2c47ec540"},"schema_version":"1.0"},"canonical_sha256":"1c4ce7627c2c8e9d0f4f13ac50f32445b2fc920f72a4696aa5907d3ac14903d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.055426Z","signature_b64":"XZDR+5hnB9GChKQ4qlCvw44ddHQXVpS5NApCF6T6T2taSMEpylfrTyos/L85biyNVAZljV4OBPcVQNGbYBKVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c4ce7627c2c8e9d0f4f13ac50f32445b2fc920f72a4696aa5907d3ac14903d1","last_reissued_at":"2026-05-18T02:41:03.054981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.054981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0993","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ldRJi7GhHOE/UbbbD4Aiq/LswsoiS84VI4DSzE4rgTuLF5h3eLZiXK7ilwDMZP7cq0OKB2zgFZoDE+i1D/PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:37:15.689270Z"},"content_sha256":"d468018492b047f8e1e91034faaec55acd0d2b6ef89929e1a3e8fa6615aa11b3","schema_version":"1.0","event_id":"sha256:d468018492b047f8e1e91034faaec55acd0d2b6ef89929e1a3e8fa6615aa11b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DRGOOYT4FSHJ2D2PCOWFB4ZEIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Document Clustering Based On Max-Correntropy Non-Negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Honggang Zhang, Jianjun Yang, Le Li, Yang Xu, Zhen Qin","submitted_at":"2014-10-03T23:09:09Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has been successfully applied to many areas for classification and clustering. Commonly-used NMF algorithms mainly target on minimizing the $l_2$ distance or Kullback-Leibler (KL) divergence, which may not be suitable for nonlinear case. In this paper, we propose a new decomposition method by maximizing the correntropy between the original and the product of two low-rank matrices for document clustering. This method also allows us to learn the new basis vectors of the semantic feature space from the data. To our knowledge, we haven't seen any work has bee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0993","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txy9C6Q+5+a5wdqEq5AGOYd0+mmR9uLs14+KvJJE9HW0e7ngzoVZVrSIJx37HztG6hMAtqKFHol1Dab4w28qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:37:15.689834Z"},"content_sha256":"5c4f817a01ef1c1f04cd60dd645f439bd680fbcdbb3720da3dd17347fe5a3655","schema_version":"1.0","event_id":"sha256:5c4f817a01ef1c1f04cd60dd645f439bd680fbcdbb3720da3dd17347fe5a3655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/bundle.json","state_url":"https://pith.science/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/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-05T01:37:15Z","links":{"resolver":"https://pith.science/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW","bundle":"https://pith.science/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/bundle.json","state":"https://pith.science/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRGOOYT4FSHJ2D2PCOWFB4ZEIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DRGOOYT4FSHJ2D2PCOWFB4ZEIW","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":"492b3e37e9b3d9cd7723794dc506d96d02c3acca17bcbbd979f73ef2c47ec540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-10-03T23:09:09Z","title_canon_sha256":"316f7ec512dd052c3706005f2c39d570e9d0b2a5e20d069e1cde1321e087201c"},"schema_version":"1.0","source":{"id":"1410.0993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0993","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0993v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0993","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"DRGOOYT4FSHJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DRGOOYT4FSHJ2D2P","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DRGOOYT4","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:5c4f817a01ef1c1f04cd60dd645f439bd680fbcdbb3720da3dd17347fe5a3655","target":"graph","created_at":"2026-05-18T02:41:03Z","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":"Nonnegative matrix factorization (NMF) has been successfully applied to many areas for classification and clustering. Commonly-used NMF algorithms mainly target on minimizing the $l_2$ distance or Kullback-Leibler (KL) divergence, which may not be suitable for nonlinear case. In this paper, we propose a new decomposition method by maximizing the correntropy between the original and the product of two low-rank matrices for document clustering. This method also allows us to learn the new basis vectors of the semantic feature space from the data. To our knowledge, we haven't seen any work has bee","authors_text":"Honggang Zhang, Jianjun Yang, Le Li, Yang Xu, Zhen Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-10-03T23:09:09Z","title":"Document Clustering Based On Max-Correntropy Non-Negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0993","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:d468018492b047f8e1e91034faaec55acd0d2b6ef89929e1a3e8fa6615aa11b3","target":"record","created_at":"2026-05-18T02:41:03Z","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":"492b3e37e9b3d9cd7723794dc506d96d02c3acca17bcbbd979f73ef2c47ec540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-10-03T23:09:09Z","title_canon_sha256":"316f7ec512dd052c3706005f2c39d570e9d0b2a5e20d069e1cde1321e087201c"},"schema_version":"1.0","source":{"id":"1410.0993","kind":"arxiv","version":1}},"canonical_sha256":"1c4ce7627c2c8e9d0f4f13ac50f32445b2fc920f72a4696aa5907d3ac14903d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c4ce7627c2c8e9d0f4f13ac50f32445b2fc920f72a4696aa5907d3ac14903d1","first_computed_at":"2026-05-18T02:41:03.054981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:03.054981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XZDR+5hnB9GChKQ4qlCvw44ddHQXVpS5NApCF6T6T2taSMEpylfrTyos/L85biyNVAZljV4OBPcVQNGbYBKVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:03.055426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d468018492b047f8e1e91034faaec55acd0d2b6ef89929e1a3e8fa6615aa11b3","sha256:5c4f817a01ef1c1f04cd60dd645f439bd680fbcdbb3720da3dd17347fe5a3655"],"state_sha256":"5b965f921b5e28153c3a3d18c97ca99e047d6ad029b756ec16e1a8bbe48fa70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F96jdt2frgAlWhhzau74+oz7GoVpIpQo0sw6vi1XRc9Enne30rbm8ig0/tJL+OYEuGrXesgTukbR3f2unS+WDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:37:15.693151Z","bundle_sha256":"6ed7929aba5b61a360b39e61726951ae3785ab7a7da92ddca851dc445ef8f720"}}