{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YT7NCWT7QLCJAEN5WPLG4TC4B2","short_pith_number":"pith:YT7NCWT7","schema_version":"1.0","canonical_sha256":"c4fed15a7f82c49011bdb3d66e4c5c0e93bd3f12cd09e7a953bf8eb6b5895df1","source":{"kind":"arxiv","id":"1902.07593","version":1},"attestation_state":"computed","paper":{"title":"Sparsity Constrained Distributed 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-02-20T15:16:06Z","abstract_excerpt":"Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by Lq norm. In this paper, a new algorithm based on distributed optimization is suggested for spectral unmixing. In the proposed algorithm, a "},"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":"1902.07593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-20T15:16:06Z","cross_cats_sorted":[],"title_canon_sha256":"9a66d2d3c3adfd7a9cdd57387d944bf6b2c622895b828a08b4424bdebecbdb14","abstract_canon_sha256":"6073a3ac8a8e730b216eab48c242b3c8b378f814cb9dbabb0aa01c845d499012"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:07.419918Z","signature_b64":"QnPo9cDF+Ug07YTngGPqjnNGKmQ4UyF97M2W/Nfk/uclrpa8xcbgt0346I7KbI/zjLvhEEgcBprjvYSsmDdbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4fed15a7f82c49011bdb3d66e4c5c0e93bd3f12cd09e7a953bf8eb6b5895df1","last_reissued_at":"2026-05-17T23:53:07.419397Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:07.419397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity Constrained Distributed 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-02-20T15:16:06Z","abstract_excerpt":"Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by Lq norm. In this paper, a new algorithm based on distributed optimization is suggested for spectral unmixing. In the proposed algorithm, a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07593","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.07593","created_at":"2026-05-17T23:53:07.419479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07593v1","created_at":"2026-05-17T23:53:07.419479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07593","created_at":"2026-05-17T23:53:07.419479+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT7NCWT7QLCJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT7NCWT7QLCJAEN5","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT7NCWT7","created_at":"2026-05-18T12:33:33.725879+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/YT7NCWT7QLCJAEN5WPLG4TC4B2","json":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2.json","graph_json":"https://pith.science/api/pith-number/YT7NCWT7QLCJAEN5WPLG4TC4B2/graph.json","events_json":"https://pith.science/api/pith-number/YT7NCWT7QLCJAEN5WPLG4TC4B2/events.json","paper":"https://pith.science/paper/YT7NCWT7"},"agent_actions":{"view_html":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2","download_json":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2.json","view_paper":"https://pith.science/paper/YT7NCWT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07593&json=true","fetch_graph":"https://pith.science/api/pith-number/YT7NCWT7QLCJAEN5WPLG4TC4B2/graph.json","fetch_events":"https://pith.science/api/pith-number/YT7NCWT7QLCJAEN5WPLG4TC4B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2/action/storage_attestation","attest_author":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2/action/author_attestation","sign_citation":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2/action/citation_signature","submit_replication":"https://pith.science/pith/YT7NCWT7QLCJAEN5WPLG4TC4B2/action/replication_record"}},"created_at":"2026-05-17T23:53:07.419479+00:00","updated_at":"2026-05-17T23:53:07.419479+00:00"}