{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CZX35VY7BWUG3BLBZBDIODX35U","short_pith_number":"pith:CZX35VY7","canonical_record":{"source":{"id":"1904.13036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-04-30T03:26:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"978c40ab8e320c66b22ec698091fee830590bc8677c9b1dcc62d529cd5df4c60","abstract_canon_sha256":"7f589063a8d3c8c20f2cecfdeed0d8f7dbbc8fbcae4ab97278807025c972b597"},"schema_version":"1.0"},"canonical_sha256":"166fbed71f0da86d8561c846870efbed050abc6d3d743d67baea24db90330568","source":{"kind":"arxiv","id":"1904.13036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13036","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13036v1","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13036","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"CZX35VY7BWUG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CZX35VY7BWUG3BLB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CZX35VY7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CZX35VY7BWUG3BLBZBDIODX35U","target":"record","payload":{"canonical_record":{"source":{"id":"1904.13036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-04-30T03:26:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"978c40ab8e320c66b22ec698091fee830590bc8677c9b1dcc62d529cd5df4c60","abstract_canon_sha256":"7f589063a8d3c8c20f2cecfdeed0d8f7dbbc8fbcae4ab97278807025c972b597"},"schema_version":"1.0"},"canonical_sha256":"166fbed71f0da86d8561c846870efbed050abc6d3d743d67baea24db90330568","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:24.115186Z","signature_b64":"FvW/vta9CQ3audLfIKMkHnlsQhNntwTTzAT2eXIoFy760MDi5rr5ZSn7xjWQI62TGOdEdlQmEv/u8mncjz5yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166fbed71f0da86d8561c846870efbed050abc6d3d743d67baea24db90330568","last_reissued_at":"2026-05-17T23:47:24.114654Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:24.114654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.13036","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-17T23:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5smNCn5R/tTJqfW7uC/7nkuC8pyM7KfV54Ii1RjM2Rw+b3NByqLmrwKmdltHPupajtHZp9aZLI7fgZVfezqyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:41:32.944142Z"},"content_sha256":"cdb8d54ceaad2ba1069daf27b88c2d8e52fffb1fbfb4805445109afd5e13a212","schema_version":"1.0","event_id":"sha256:cdb8d54ceaad2ba1069daf27b88c2d8e52fffb1fbfb4805445109afd5e13a212"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CZX35VY7BWUG3BLBZBDIODX35U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Clustering Framework for Hyperspectral Band Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.IV","authors_text":"Fahong Zhang, Qi Wang, Xuelong Li","submitted_at":"2019-04-30T03:26:44Z","abstract_excerpt":"Band selection, by choosing a set of representative bands in hyperspectral image (HSI), is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms which can only obtain suboptimal solutions toward a specific objective function. This paper focuses on clustering-based band selection, and proposes a new framework to solve the above dilemma, claiming the following contributions: 1) An optimal clustering framework (OCF), which c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13036","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-17T23:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xANn0HcU/uYanb3cmHNW0tdxo6KFnNn3Ub9g0GDgaPvpx+Wyp+vjWGPF6wGqe8kMDi49mnAZUcVviFT9OgqPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:41:32.944904Z"},"content_sha256":"6a6a2d1aa6baacb5c6a0df76054c9ae0477527b85c1e2307c89d2c1833b0c80a","schema_version":"1.0","event_id":"sha256:6a6a2d1aa6baacb5c6a0df76054c9ae0477527b85c1e2307c89d2c1833b0c80a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZX35VY7BWUG3BLBZBDIODX35U/bundle.json","state_url":"https://pith.science/pith/CZX35VY7BWUG3BLBZBDIODX35U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZX35VY7BWUG3BLBZBDIODX35U/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-10T07:41:32Z","links":{"resolver":"https://pith.science/pith/CZX35VY7BWUG3BLBZBDIODX35U","bundle":"https://pith.science/pith/CZX35VY7BWUG3BLBZBDIODX35U/bundle.json","state":"https://pith.science/pith/CZX35VY7BWUG3BLBZBDIODX35U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZX35VY7BWUG3BLBZBDIODX35U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CZX35VY7BWUG3BLBZBDIODX35U","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":"7f589063a8d3c8c20f2cecfdeed0d8f7dbbc8fbcae4ab97278807025c972b597","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-04-30T03:26:44Z","title_canon_sha256":"978c40ab8e320c66b22ec698091fee830590bc8677c9b1dcc62d529cd5df4c60"},"schema_version":"1.0","source":{"id":"1904.13036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13036","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13036v1","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13036","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"CZX35VY7BWUG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CZX35VY7BWUG3BLB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CZX35VY7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6a6a2d1aa6baacb5c6a0df76054c9ae0477527b85c1e2307c89d2c1833b0c80a","target":"graph","created_at":"2026-05-17T23:47:24Z","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":"Band selection, by choosing a set of representative bands in hyperspectral image (HSI), is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms which can only obtain suboptimal solutions toward a specific objective function. This paper focuses on clustering-based band selection, and proposes a new framework to solve the above dilemma, claiming the following contributions: 1) An optimal clustering framework (OCF), which c","authors_text":"Fahong Zhang, Qi Wang, Xuelong Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-04-30T03:26:44Z","title":"Optimal Clustering Framework for Hyperspectral Band Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13036","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:cdb8d54ceaad2ba1069daf27b88c2d8e52fffb1fbfb4805445109afd5e13a212","target":"record","created_at":"2026-05-17T23:47:24Z","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":"7f589063a8d3c8c20f2cecfdeed0d8f7dbbc8fbcae4ab97278807025c972b597","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-04-30T03:26:44Z","title_canon_sha256":"978c40ab8e320c66b22ec698091fee830590bc8677c9b1dcc62d529cd5df4c60"},"schema_version":"1.0","source":{"id":"1904.13036","kind":"arxiv","version":1}},"canonical_sha256":"166fbed71f0da86d8561c846870efbed050abc6d3d743d67baea24db90330568","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"166fbed71f0da86d8561c846870efbed050abc6d3d743d67baea24db90330568","first_computed_at":"2026-05-17T23:47:24.114654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:24.114654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvW/vta9CQ3audLfIKMkHnlsQhNntwTTzAT2eXIoFy760MDi5rr5ZSn7xjWQI62TGOdEdlQmEv/u8mncjz5yDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:24.115186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.13036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdb8d54ceaad2ba1069daf27b88c2d8e52fffb1fbfb4805445109afd5e13a212","sha256:6a6a2d1aa6baacb5c6a0df76054c9ae0477527b85c1e2307c89d2c1833b0c80a"],"state_sha256":"00ce101e9d8eada01e00a040922241e995e532e1d48a94d6219b06fbcbea8666"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTqYVBqat54/qlcmcn/RApPQVACh1C6VGFGDZkMgl45QMTRIctjU4HqUOFIAoC1YHNkg7DE15iAeUYCe6rQiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:41:32.949247Z","bundle_sha256":"d7200febd1302e92c908579ee787f5365ae8cb53e07b25062e9ca544b43b8c66"}}