{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OWMVXAFOYLWS2YGR2QAHSM3WXG","short_pith_number":"pith:OWMVXAFO","canonical_record":{"source":{"id":"1905.08032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-16T20:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"571bb78e3a403192502a27d1314d038a44f94a65f5f7b09b4aa259497ced1130","abstract_canon_sha256":"465ae6492322de06f2b2beef587ae05507ab5301fbb0aa07dbee6d27e82aa93b"},"schema_version":"1.0"},"canonical_sha256":"75995b80aec2ed2d60d1d400793376b9b159ce4c9d31c083ee622ba05a501bf8","source":{"kind":"arxiv","id":"1905.08032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08032","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08032v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08032","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"OWMVXAFOYLWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OWMVXAFOYLWS2YGR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OWMVXAFO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OWMVXAFOYLWS2YGR2QAHSM3WXG","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-16T20:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"571bb78e3a403192502a27d1314d038a44f94a65f5f7b09b4aa259497ced1130","abstract_canon_sha256":"465ae6492322de06f2b2beef587ae05507ab5301fbb0aa07dbee6d27e82aa93b"},"schema_version":"1.0"},"canonical_sha256":"75995b80aec2ed2d60d1d400793376b9b159ce4c9d31c083ee622ba05a501bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.812383Z","signature_b64":"R00quPV3819wD61ePadZ+rcgYcvAcaDsnlvsBWD5yrzKZC/feZJHOke4Hqunc0Y0XeY1DKUWQ1b20xWNV4uzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75995b80aec2ed2d60d1d400793376b9b159ce4c9d31c083ee622ba05a501bf8","last_reissued_at":"2026-05-17T23:45:47.811534Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.811534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08032","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:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T82wZ6LXC+dVk4EPR5B4hmwo96ZRKQgAPJdfOR6x3ZlkJAblO5i/Zyw9IPK47WjDEidvWLkAbSnDGzqaiE0FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:17:52.374203Z"},"content_sha256":"349a6da27d967cee29d39b34b3123cd2ffe2fdf464781f306081906fbee728c2","schema_version":"1.0","event_id":"sha256:349a6da27d967cee29d39b34b3123cd2ffe2fdf464781f306081906fbee728c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OWMVXAFOYLWS2YGR2QAHSM3WXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hadi Zayyani, Roozbeh Rajabi, Sara Khoshsokhan","submitted_at":"2019-05-16T20:22:37Z","abstract_excerpt":"In this paper, the new algorithm based on clustered multitask network is proposed to solve spectral unmixing problem in hyperspectral imagery. In the proposed algorithm, the clustered network is employed. Each pixel in the hyperspectral image considered as a node in this network. The nodes in the network are clustered using the fuzzy c-means clustering method. Diffusion least mean square strategy has been used to optimize the proposed cost function. To evaluate the proposed method, experiments are conducted on synthetic and real datasets. Simulation results based on spectral angle distance, ab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08032","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:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JK7gyCJbRX5SOo1repL9yuffZsNIF/jnwRj8zC4sOCUTdQFIbqTxdx6gkfGw2tsShw/lt/wyyvK2pPipG0r7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:17:52.374769Z"},"content_sha256":"fd22c00ff44763d1a0d013faf8fbdc0832d82cbdf1df2744de187d1a5823481e","schema_version":"1.0","event_id":"sha256:fd22c00ff44763d1a0d013faf8fbdc0832d82cbdf1df2744de187d1a5823481e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/bundle.json","state_url":"https://pith.science/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/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-04T23:17:52Z","links":{"resolver":"https://pith.science/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG","bundle":"https://pith.science/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/bundle.json","state":"https://pith.science/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWMVXAFOYLWS2YGR2QAHSM3WXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OWMVXAFOYLWS2YGR2QAHSM3WXG","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":"465ae6492322de06f2b2beef587ae05507ab5301fbb0aa07dbee6d27e82aa93b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-16T20:22:37Z","title_canon_sha256":"571bb78e3a403192502a27d1314d038a44f94a65f5f7b09b4aa259497ced1130"},"schema_version":"1.0","source":{"id":"1905.08032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08032","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08032v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08032","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"OWMVXAFOYLWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OWMVXAFOYLWS2YGR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OWMVXAFO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:fd22c00ff44763d1a0d013faf8fbdc0832d82cbdf1df2744de187d1a5823481e","target":"graph","created_at":"2026-05-17T23:45:47Z","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, the new algorithm based on clustered multitask network is proposed to solve spectral unmixing problem in hyperspectral imagery. In the proposed algorithm, the clustered network is employed. Each pixel in the hyperspectral image considered as a node in this network. The nodes in the network are clustered using the fuzzy c-means clustering method. Diffusion least mean square strategy has been used to optimize the proposed cost function. To evaluate the proposed method, experiments are conducted on synthetic and real datasets. Simulation results based on spectral angle distance, ab","authors_text":"Hadi Zayyani, Roozbeh Rajabi, Sara Khoshsokhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-16T20:22:37Z","title":"Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08032","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:349a6da27d967cee29d39b34b3123cd2ffe2fdf464781f306081906fbee728c2","target":"record","created_at":"2026-05-17T23:45:47Z","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":"465ae6492322de06f2b2beef587ae05507ab5301fbb0aa07dbee6d27e82aa93b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-16T20:22:37Z","title_canon_sha256":"571bb78e3a403192502a27d1314d038a44f94a65f5f7b09b4aa259497ced1130"},"schema_version":"1.0","source":{"id":"1905.08032","kind":"arxiv","version":1}},"canonical_sha256":"75995b80aec2ed2d60d1d400793376b9b159ce4c9d31c083ee622ba05a501bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75995b80aec2ed2d60d1d400793376b9b159ce4c9d31c083ee622ba05a501bf8","first_computed_at":"2026-05-17T23:45:47.811534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.811534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R00quPV3819wD61ePadZ+rcgYcvAcaDsnlvsBWD5yrzKZC/feZJHOke4Hqunc0Y0XeY1DKUWQ1b20xWNV4uzCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.812383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349a6da27d967cee29d39b34b3123cd2ffe2fdf464781f306081906fbee728c2","sha256:fd22c00ff44763d1a0d013faf8fbdc0832d82cbdf1df2744de187d1a5823481e"],"state_sha256":"e63772e8c8303948633511610cba3dc77102cff4c9a8c812db8684644bde5cc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65JTApgqwZiBWPBy8jiMjTcMWz02pCfll1KZVA30icTYwBN6BentXhsjqeUoOaKoYudijDsk0lMUdEh8a3u4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:17:52.377463Z","bundle_sha256":"882c6a164774e5f7cdb25341d0a7d270522f3b46ffa6a89bf956b9148a787646"}}