{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QXT67EEBSK77HZLVLTGRBHHKFS","short_pith_number":"pith:QXT67EEB","canonical_record":{"source":{"id":"1509.01208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-03T18:55:28Z","cross_cats_sorted":["cs.IR","cs.NA"],"title_canon_sha256":"0c8191ece666634da97572c92287256a80740f57b401dea6c23286c30d376446","abstract_canon_sha256":"856317f0fbe8213116e6bb729e7170a4d60e1bab05642d25e50aba27b5acc3a4"},"schema_version":"1.0"},"canonical_sha256":"85e7ef908192bff3e5755ccd109cea2c8f612fcebd7f62ec2079f45ffe62e392","source":{"kind":"arxiv","id":"1509.01208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01208","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01208v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01208","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"QXT67EEBSK77","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXT67EEBSK77HZLV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXT67EEB","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QXT67EEBSK77HZLVLTGRBHHKFS","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-03T18:55:28Z","cross_cats_sorted":["cs.IR","cs.NA"],"title_canon_sha256":"0c8191ece666634da97572c92287256a80740f57b401dea6c23286c30d376446","abstract_canon_sha256":"856317f0fbe8213116e6bb729e7170a4d60e1bab05642d25e50aba27b5acc3a4"},"schema_version":"1.0"},"canonical_sha256":"85e7ef908192bff3e5755ccd109cea2c8f612fcebd7f62ec2079f45ffe62e392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:13.362293Z","signature_b64":"oUfZ/Cbxp9KfqO3c1bsBec5TrKgQd4YSBhycjGsMnmOAQIHsP6hW2e7JHU6URRAjs0V9lZAo4doZ9ZD+HWJpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85e7ef908192bff3e5755ccd109cea2c8f612fcebd7f62ec2079f45ffe62e392","last_reissued_at":"2026-05-18T01:31:13.361619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:13.361619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01208","source_version":3,"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moQnNXBEpg93VlgjdZiuin5+GUmrGnPkC8PLHtlbhrd+lbHVtNyCYp3tVLTYdisHR2bzGJpt7Cg2EYiMl1MOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:51:04.136933Z"},"content_sha256":"27ca83c539ce456ac6dd1ff115f5afb7577066831a3cb5a8544c901acfc854ae","schema_version":"1.0","event_id":"sha256:27ca83c539ce456ac6dd1ff115f5afb7577066831a3cb5a8544c901acfc854ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QXT67EEBSK77HZLVLTGRBHHKFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Clustering and Topic Modeling Based on Rank-2 Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.NA"],"primary_cat":"cs.LG","authors_text":"Barry Drake, Da Kuang, Haesun Park","submitted_at":"2015-09-03T18:55:28Z","abstract_excerpt":"The importance of unsupervised clustering and topic modeling is well recognized with ever-increasing volumes of text data. In this paper, we propose a fast method for hierarchical clustering and topic modeling called HierNMF2. Our method is based on fast Rank-2 nonnegative matrix factorization (NMF) that performs binary clustering and an efficient node splitting rule. Further utilizing the final leaf nodes generated in HierNMF2 and the idea of nonnegative least squares fitting, we propose a new clustering/topic modeling method called FlatNMF2 that recovers a flat clustering/topic modeling resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01208","kind":"arxiv","version":3},"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkS/7Arl2LA7pCiqRocqF5SRQzmYe0XLZ/pyau59f3xRndEvNF/mbSzSHHAAH4S+WtoBaLhR/CwIb0phXb4DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:51:04.137272Z"},"content_sha256":"d8b9f87442a23a24fb10852e5e88102b14c9a72de6a559aaaefa12655761bde1","schema_version":"1.0","event_id":"sha256:d8b9f87442a23a24fb10852e5e88102b14c9a72de6a559aaaefa12655761bde1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXT67EEBSK77HZLVLTGRBHHKFS/bundle.json","state_url":"https://pith.science/pith/QXT67EEBSK77HZLVLTGRBHHKFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXT67EEBSK77HZLVLTGRBHHKFS/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-26T21:51:04Z","links":{"resolver":"https://pith.science/pith/QXT67EEBSK77HZLVLTGRBHHKFS","bundle":"https://pith.science/pith/QXT67EEBSK77HZLVLTGRBHHKFS/bundle.json","state":"https://pith.science/pith/QXT67EEBSK77HZLVLTGRBHHKFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXT67EEBSK77HZLVLTGRBHHKFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QXT67EEBSK77HZLVLTGRBHHKFS","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":"856317f0fbe8213116e6bb729e7170a4d60e1bab05642d25e50aba27b5acc3a4","cross_cats_sorted":["cs.IR","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-03T18:55:28Z","title_canon_sha256":"0c8191ece666634da97572c92287256a80740f57b401dea6c23286c30d376446"},"schema_version":"1.0","source":{"id":"1509.01208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01208","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01208v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01208","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"QXT67EEBSK77","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXT67EEBSK77HZLV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXT67EEB","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:d8b9f87442a23a24fb10852e5e88102b14c9a72de6a559aaaefa12655761bde1","target":"graph","created_at":"2026-05-18T01:31:13Z","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":"The importance of unsupervised clustering and topic modeling is well recognized with ever-increasing volumes of text data. In this paper, we propose a fast method for hierarchical clustering and topic modeling called HierNMF2. Our method is based on fast Rank-2 nonnegative matrix factorization (NMF) that performs binary clustering and an efficient node splitting rule. Further utilizing the final leaf nodes generated in HierNMF2 and the idea of nonnegative least squares fitting, we propose a new clustering/topic modeling method called FlatNMF2 that recovers a flat clustering/topic modeling resu","authors_text":"Barry Drake, Da Kuang, Haesun Park","cross_cats":["cs.IR","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-03T18:55:28Z","title":"Fast Clustering and Topic Modeling Based on Rank-2 Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01208","kind":"arxiv","version":3},"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:27ca83c539ce456ac6dd1ff115f5afb7577066831a3cb5a8544c901acfc854ae","target":"record","created_at":"2026-05-18T01:31:13Z","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":"856317f0fbe8213116e6bb729e7170a4d60e1bab05642d25e50aba27b5acc3a4","cross_cats_sorted":["cs.IR","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-03T18:55:28Z","title_canon_sha256":"0c8191ece666634da97572c92287256a80740f57b401dea6c23286c30d376446"},"schema_version":"1.0","source":{"id":"1509.01208","kind":"arxiv","version":3}},"canonical_sha256":"85e7ef908192bff3e5755ccd109cea2c8f612fcebd7f62ec2079f45ffe62e392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85e7ef908192bff3e5755ccd109cea2c8f612fcebd7f62ec2079f45ffe62e392","first_computed_at":"2026-05-18T01:31:13.361619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:13.361619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oUfZ/Cbxp9KfqO3c1bsBec5TrKgQd4YSBhycjGsMnmOAQIHsP6hW2e7JHU6URRAjs0V9lZAo4doZ9ZD+HWJpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:13.362293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27ca83c539ce456ac6dd1ff115f5afb7577066831a3cb5a8544c901acfc854ae","sha256:d8b9f87442a23a24fb10852e5e88102b14c9a72de6a559aaaefa12655761bde1"],"state_sha256":"45891fe7ef5a20df8620dbd9926c506573342e9dbe736f569450be54d314a533"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0tzfnylmURPIRWeGCrozMXjlhNOf0bnlTGLV6cpT4ObwhxenEEqTwZ7PuO7v3rd6TS70fud06Jhw0YA1Gk0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:51:04.139213Z","bundle_sha256":"ecd4edf208c5ee5c6cfbbd04a0f326b1a2980a0cd6152ac8632fd8d9e836ed14"}}