{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GWYTPRT2SFRL5VQ5VGWQG525NA","short_pith_number":"pith:GWYTPRT2","canonical_record":{"source":{"id":"1310.7441","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-14T09:54:59Z","cross_cats_sorted":["cs.IR","math.OC"],"title_canon_sha256":"b3e2b515385f60cb7fec1c21d6dd51fffd7487cf75602b4d57116e58ffc46efb","abstract_canon_sha256":"f34dff7b5bb879acde39d4d30e57e820bc2679cbc0eda6d5c7617c77a6acfe57"},"schema_version":"1.0"},"canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","source":{"kind":"arxiv","id":"1310.7441","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7441","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7441v4","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7441","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"GWYTPRT2SFRL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GWYTPRT2SFRL5VQ5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GWYTPRT2","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GWYTPRT2SFRL5VQ5VGWQG525NA","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7441","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-14T09:54:59Z","cross_cats_sorted":["cs.IR","math.OC"],"title_canon_sha256":"b3e2b515385f60cb7fec1c21d6dd51fffd7487cf75602b4d57116e58ffc46efb","abstract_canon_sha256":"f34dff7b5bb879acde39d4d30e57e820bc2679cbc0eda6d5c7617c77a6acfe57"},"schema_version":"1.0"},"canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.017262Z","signature_b64":"+oGw+Rqd6Dw2mR3ktMRKXmWfWwuFwrl5yB8r+qV7QP3wjLUozSFqVbsBm/zT+6CFPE1Nm1nzTNrLx4fLzTObAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","last_reissued_at":"2026-05-18T02:26:59.016670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.016670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7441","source_version":4,"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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Er88NYbLX1s9gb6elEEqlKjSPmeuCGXg0xvh8MQ/82bW/WGRGfzYgjZ/YH/L1oHyPYQqNVIXl4HI2z2C+DClDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:07:00.133560Z"},"content_sha256":"168cd7cf51aaa91006574dec1340c458ea9811ab073d1fba2d5f16ee6805ec08","schema_version":"1.0","event_id":"sha256:168cd7cf51aaa91006574dec1340c458ea9811ab073d1fba2d5f16ee6805ec08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GWYTPRT2SFRL5VQ5VGWQG525NA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.OC"],"primary_cat":"cs.CV","authors_text":"Da Kuang, Haesun Park, Nicolas Gillis","submitted_at":"2013-09-14T09:54:59Z","abstract_excerpt":"In this paper, we design a hierarchical clustering algorithm for high-resolution hyperspectral images. At the core of the algorithm, a new rank-two nonnegative matrix factorizations (NMF) algorithm is used to split the clusters, which is motivated by convex geometry concepts. The method starts with a single cluster containing all pixels, and, at each step, (i) selects a cluster in such a way that the error at the next step is minimized, and (ii) splits the selected cluster into two disjoint clusters using rank-two NMF in such a way that the clusters are well balanced and stable. The proposed m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7441","kind":"arxiv","version":4},"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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pbSuOy1ZNGZbl15CbrizbG/RN97d2wO5X4YMw7Hr3/JRBqDv8Xv0dKN+AAGrOXpVRYhOF74azE4cpYP7nDxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:07:00.133901Z"},"content_sha256":"7eb214e5293bf79894dc69637b62e038a8db57bf723ff667bcc208335a41f033","schema_version":"1.0","event_id":"sha256:7eb214e5293bf79894dc69637b62e038a8db57bf723ff667bcc208335a41f033"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/bundle.json","state_url":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/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-26T20:07:00Z","links":{"resolver":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA","bundle":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/bundle.json","state":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GWYTPRT2SFRL5VQ5VGWQG525NA","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":"f34dff7b5bb879acde39d4d30e57e820bc2679cbc0eda6d5c7617c77a6acfe57","cross_cats_sorted":["cs.IR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-14T09:54:59Z","title_canon_sha256":"b3e2b515385f60cb7fec1c21d6dd51fffd7487cf75602b4d57116e58ffc46efb"},"schema_version":"1.0","source":{"id":"1310.7441","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7441","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7441v4","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7441","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"GWYTPRT2SFRL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GWYTPRT2SFRL5VQ5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GWYTPRT2","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:7eb214e5293bf79894dc69637b62e038a8db57bf723ff667bcc208335a41f033","target":"graph","created_at":"2026-05-18T02:26:59Z","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":"In this paper, we design a hierarchical clustering algorithm for high-resolution hyperspectral images. At the core of the algorithm, a new rank-two nonnegative matrix factorizations (NMF) algorithm is used to split the clusters, which is motivated by convex geometry concepts. The method starts with a single cluster containing all pixels, and, at each step, (i) selects a cluster in such a way that the error at the next step is minimized, and (ii) splits the selected cluster into two disjoint clusters using rank-two NMF in such a way that the clusters are well balanced and stable. The proposed m","authors_text":"Da Kuang, Haesun Park, Nicolas Gillis","cross_cats":["cs.IR","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-14T09:54:59Z","title":"Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7441","kind":"arxiv","version":4},"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:168cd7cf51aaa91006574dec1340c458ea9811ab073d1fba2d5f16ee6805ec08","target":"record","created_at":"2026-05-18T02:26:59Z","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":"f34dff7b5bb879acde39d4d30e57e820bc2679cbc0eda6d5c7617c77a6acfe57","cross_cats_sorted":["cs.IR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-14T09:54:59Z","title_canon_sha256":"b3e2b515385f60cb7fec1c21d6dd51fffd7487cf75602b4d57116e58ffc46efb"},"schema_version":"1.0","source":{"id":"1310.7441","kind":"arxiv","version":4}},"canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","first_computed_at":"2026-05-18T02:26:59.016670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:59.016670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+oGw+Rqd6Dw2mR3ktMRKXmWfWwuFwrl5yB8r+qV7QP3wjLUozSFqVbsBm/zT+6CFPE1Nm1nzTNrLx4fLzTObAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:59.017262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7441","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:168cd7cf51aaa91006574dec1340c458ea9811ab073d1fba2d5f16ee6805ec08","sha256:7eb214e5293bf79894dc69637b62e038a8db57bf723ff667bcc208335a41f033"],"state_sha256":"86ecb4e73e893bc410637ff10065323c608955830e04e0202a493b184e41d764"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAxY2Q19zkMsDl7eYlYIVCCqq6aqf/ZVnqUSXMtvXW/UzQYhfptZVg/p5MtLVrYCZJ+2lRtvaEj7IIJcv/nkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:07:00.135756Z","bundle_sha256":"1ab84bc42a114e9a783727c51c3b67a0afe70ed43c124c6cd14af12ad881552d"}}