{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C5H5WDH6POAYDMXZJDJS2CH4SP","short_pith_number":"pith:C5H5WDH6","schema_version":"1.0","canonical_sha256":"174fdb0cfe7b8181b2f948d32d08fc93fb38801061c282ba2f1667e6abb7e59f","source":{"kind":"arxiv","id":"1711.01249","version":1},"attestation_state":"computed","paper":{"title":"Distributed Unmixing of Hyperspectral Data With Sparsity Constraint","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":"2017-11-03T17:23:49Z","abstract_excerpt":"Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which was added to NMF is sparsity constraint that was regularized by L 1/2 norm. In this paper, a new algorithm based on distributed optimization has been used for spectral unmixing. In the proposed algorithm,"},"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":"1711.01249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-03T17:23:49Z","cross_cats_sorted":[],"title_canon_sha256":"316c47a2f2e1609130d2d7cd4d67aa7a9aeb81d198c89c7f3a87582dbf7f33be","abstract_canon_sha256":"31098ad536a81d4a5c5c5dfa1affae2bcf1c084919a6e0759d66266ba700053a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.083575Z","signature_b64":"2EWbbczOdmt3hKCcEuakx2sOsY5+iNEDpccvGuXQO3N2g6oUFSsAtd/DKoUlmr0ZhKTT3T/+aYWzotw2jobrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"174fdb0cfe7b8181b2f948d32d08fc93fb38801061c282ba2f1667e6abb7e59f","last_reissued_at":"2026-05-18T00:31:23.082977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.082977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Unmixing of Hyperspectral Data With Sparsity Constraint","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":"2017-11-03T17:23:49Z","abstract_excerpt":"Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which was added to NMF is sparsity constraint that was regularized by L 1/2 norm. In this paper, a new algorithm based on distributed optimization has been used for spectral unmixing. In the proposed algorithm,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01249","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":"1711.01249","created_at":"2026-05-18T00:31:23.083067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01249v1","created_at":"2026-05-18T00:31:23.083067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01249","created_at":"2026-05-18T00:31:23.083067+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5H5WDH6POAY","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5H5WDH6POAYDMXZ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5H5WDH6","created_at":"2026-05-18T12:31:08.081275+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/C5H5WDH6POAYDMXZJDJS2CH4SP","json":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP.json","graph_json":"https://pith.science/api/pith-number/C5H5WDH6POAYDMXZJDJS2CH4SP/graph.json","events_json":"https://pith.science/api/pith-number/C5H5WDH6POAYDMXZJDJS2CH4SP/events.json","paper":"https://pith.science/paper/C5H5WDH6"},"agent_actions":{"view_html":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP","download_json":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP.json","view_paper":"https://pith.science/paper/C5H5WDH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01249&json=true","fetch_graph":"https://pith.science/api/pith-number/C5H5WDH6POAYDMXZJDJS2CH4SP/graph.json","fetch_events":"https://pith.science/api/pith-number/C5H5WDH6POAYDMXZJDJS2CH4SP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP/action/storage_attestation","attest_author":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP/action/author_attestation","sign_citation":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP/action/citation_signature","submit_replication":"https://pith.science/pith/C5H5WDH6POAYDMXZJDJS2CH4SP/action/replication_record"}},"created_at":"2026-05-18T00:31:23.083067+00:00","updated_at":"2026-05-18T00:31:23.083067+00:00"}