{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MVQWBXKVZQAMYBF56CPTNSBUZX","short_pith_number":"pith:MVQWBXKV","canonical_record":{"source":{"id":"1703.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-28T15:56:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dc803b39780810211d3507f7fb373604f86ed977bcd77b81d2dd0eb205b79618","abstract_canon_sha256":"4bee78d54aec3ec7e036e1cdd39840ad3d6804caaf55a9bf2c6e55e026c9ae9b"},"schema_version":"1.0"},"canonical_sha256":"656160dd55cc00cc04bdf09f36c834cdc4c947bb18195c4b20408344374322ce","source":{"kind":"arxiv","id":"1703.09646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09646","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09646v1","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09646","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"MVQWBXKVZQAM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVQWBXKVZQAMYBF5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVQWBXKV","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MVQWBXKVZQAMYBF56CPTNSBUZX","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-28T15:56:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dc803b39780810211d3507f7fb373604f86ed977bcd77b81d2dd0eb205b79618","abstract_canon_sha256":"4bee78d54aec3ec7e036e1cdd39840ad3d6804caaf55a9bf2c6e55e026c9ae9b"},"schema_version":"1.0"},"canonical_sha256":"656160dd55cc00cc04bdf09f36c834cdc4c947bb18195c4b20408344374322ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:43.941722Z","signature_b64":"NDwpv4rqMKmcFsHsyt6nL3dVJxwHazz/0A+BxdZwWoOPo/sgWll+LapBpOFASirHuTn4bKv2bnLsM+al++PCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656160dd55cc00cc04bdf09f36c834cdc4c947bb18195c4b20408344374322ce","last_reissued_at":"2026-05-18T00:47:43.941213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:43.941213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09646","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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXbKhB+Cni4zxOFDZQ206pHSJ9YMTct0JD2g2hYdEufilRCB8bsKm1uco6dDVuDA1/psvdHTGUI+PU1lJKu4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:18:19.349156Z"},"content_sha256":"8b9388d24f03cdd85fdf9fd023715d0799194a7d56145d51f793e22db8ba4408","schema_version":"1.0","event_id":"sha256:8b9388d24f03cdd85fdf9fd023715d0799194a7d56145d51f793e22db8ba4408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MVQWBXKVZQAMYBF56CPTNSBUZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Barry Drake, Haesun Park, Rundong Du","submitted_at":"2017-03-28T15:56:53Z","abstract_excerpt":"We present a hybrid method for latent information discovery on the data sets containing both text content and connection structure based on constrained low rank approximation. The new method jointly optimizes the Nonnegative Matrix Factorization (NMF) objective function for text clustering and the Symmetric NMF (SymNMF) objective function for graph clustering. We propose an effective algorithm for the joint NMF objective function, based on a block coordinate descent (BCD) framework. The proposed hybrid method discovers content associations via latent connections found using SymNMF. The method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09646","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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85W5OuTcqFAyeLtn8Eze4bbKYjyw3fDmpVXRb1lLURTQ83xnXF+dc6xvhxVBfpJ7i7g0VSqvFvrMOfR+14W+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:18:19.349524Z"},"content_sha256":"b3bdb45e59b85a8d2bc31ba07655dad5f9b6ba49866d6027136cc7c606f1f90e","schema_version":"1.0","event_id":"sha256:b3bdb45e59b85a8d2bc31ba07655dad5f9b6ba49866d6027136cc7c606f1f90e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/bundle.json","state_url":"https://pith.science/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/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-27T03:18:19Z","links":{"resolver":"https://pith.science/pith/MVQWBXKVZQAMYBF56CPTNSBUZX","bundle":"https://pith.science/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/bundle.json","state":"https://pith.science/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVQWBXKVZQAMYBF56CPTNSBUZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MVQWBXKVZQAMYBF56CPTNSBUZX","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":"4bee78d54aec3ec7e036e1cdd39840ad3d6804caaf55a9bf2c6e55e026c9ae9b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-28T15:56:53Z","title_canon_sha256":"dc803b39780810211d3507f7fb373604f86ed977bcd77b81d2dd0eb205b79618"},"schema_version":"1.0","source":{"id":"1703.09646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09646","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09646v1","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09646","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"MVQWBXKVZQAM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVQWBXKVZQAMYBF5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVQWBXKV","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:b3bdb45e59b85a8d2bc31ba07655dad5f9b6ba49866d6027136cc7c606f1f90e","target":"graph","created_at":"2026-05-18T00:47:43Z","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":"We present a hybrid method for latent information discovery on the data sets containing both text content and connection structure based on constrained low rank approximation. The new method jointly optimizes the Nonnegative Matrix Factorization (NMF) objective function for text clustering and the Symmetric NMF (SymNMF) objective function for graph clustering. We propose an effective algorithm for the joint NMF objective function, based on a block coordinate descent (BCD) framework. The proposed hybrid method discovers content associations via latent connections found using SymNMF. The method ","authors_text":"Barry Drake, Haesun Park, Rundong Du","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-28T15:56:53Z","title":"Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09646","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:8b9388d24f03cdd85fdf9fd023715d0799194a7d56145d51f793e22db8ba4408","target":"record","created_at":"2026-05-18T00:47:43Z","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":"4bee78d54aec3ec7e036e1cdd39840ad3d6804caaf55a9bf2c6e55e026c9ae9b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-28T15:56:53Z","title_canon_sha256":"dc803b39780810211d3507f7fb373604f86ed977bcd77b81d2dd0eb205b79618"},"schema_version":"1.0","source":{"id":"1703.09646","kind":"arxiv","version":1}},"canonical_sha256":"656160dd55cc00cc04bdf09f36c834cdc4c947bb18195c4b20408344374322ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656160dd55cc00cc04bdf09f36c834cdc4c947bb18195c4b20408344374322ce","first_computed_at":"2026-05-18T00:47:43.941213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:43.941213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NDwpv4rqMKmcFsHsyt6nL3dVJxwHazz/0A+BxdZwWoOPo/sgWll+LapBpOFASirHuTn4bKv2bnLsM+al++PCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:43.941722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9388d24f03cdd85fdf9fd023715d0799194a7d56145d51f793e22db8ba4408","sha256:b3bdb45e59b85a8d2bc31ba07655dad5f9b6ba49866d6027136cc7c606f1f90e"],"state_sha256":"e3885b5227c70fda59db22d8fd9ac45913479ef368c49929f2b0de213810b87c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNXeYDx/U/dXrr480P614BYN9x0SZF9RK43Tlm4Wy0wJrGdDliyTKTN1z/ET1smr5uckNgr9bHN7ogE94zD7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:18:19.351370Z","bundle_sha256":"4a73bc26d996a35fbc070a19bdbdb1e7b4a503e0d3ce2c3266ed42793ce3ab2c"}}