{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GWYTPRT2SFRL5VQ5VGWQG525NA","short_pith_number":"pith:GWYTPRT2","schema_version":"1.0","canonical_sha256":"35b137c67a9162bed61da9ad03775d680e986b0f845b98723e8448ba2a46b4eb","source":{"kind":"arxiv","id":"1310.7441","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.7441","created_at":"2026-05-18T02:26:59.016760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7441v4","created_at":"2026-05-18T02:26:59.016760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7441","created_at":"2026-05-18T02:26:59.016760+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWYTPRT2SFRL","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWYTPRT2SFRL5VQ5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWYTPRT2","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA","json":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA.json","graph_json":"https://pith.science/api/pith-number/GWYTPRT2SFRL5VQ5VGWQG525NA/graph.json","events_json":"https://pith.science/api/pith-number/GWYTPRT2SFRL5VQ5VGWQG525NA/events.json","paper":"https://pith.science/paper/GWYTPRT2"},"agent_actions":{"view_html":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA","download_json":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA.json","view_paper":"https://pith.science/paper/GWYTPRT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7441&json=true","fetch_graph":"https://pith.science/api/pith-number/GWYTPRT2SFRL5VQ5VGWQG525NA/graph.json","fetch_events":"https://pith.science/api/pith-number/GWYTPRT2SFRL5VQ5VGWQG525NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/action/storage_attestation","attest_author":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/action/author_attestation","sign_citation":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/action/citation_signature","submit_replication":"https://pith.science/pith/GWYTPRT2SFRL5VQ5VGWQG525NA/action/replication_record"}},"created_at":"2026-05-18T02:26:59.016760+00:00","updated_at":"2026-05-18T02:26:59.016760+00:00"}