{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YOYGIBZ7BPEHKAYJFUMEOMGID4","short_pith_number":"pith:YOYGIBZ7","schema_version":"1.0","canonical_sha256":"c3b064073f0bc87503092d184730c81f26c4539a1170a5a19fe2b73d080d4c7f","source":{"kind":"arxiv","id":"1807.05497","version":1},"attestation_state":"computed","paper":{"title":"Fast and Robust High-Dimensional Sparse Representation Recovery Using Generalized SL0","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali Mehrpooya, Mehdi Nayebi, M.Hassan Bastani, Milad Nazari, Zahra Abbasi","submitted_at":"2018-07-15T06:44:14Z","abstract_excerpt":"Sparse representation can be described in high dimensions and used in many applications, including MRI imaging and radar imaging. In some cases, methods have been proposed to solve the high-dimensional sparse representation problem, but main solution is converting high-dimensional problem into one-dimension. Solving the equivalent problem had very high computational complexity. In this paper, the problem of high-dimensional sparse representation is formulated generally based on the theory of tensors, and a method for solving it based on SL0 (Smoothed Least zero-nor) is presented. Also, the uni"},"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":"1807.05497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-15T06:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"0078171d5cfc7c56d545c0f3446dfcc0c133bd08b6bcf9d8d7962acda853fb9a","abstract_canon_sha256":"27ebeb4e5e7a73c7a67d99cbc0a54dbbf8560d4a2679fe7485a2e98db4383db1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:43.421949Z","signature_b64":"drCp4N34er/E70GyUgsgO5wRkdtaRn4wvFqx9Neaj7KwBwn/L45TDV9B+H1cI3d+MTSGWfG6OP2lsitVgN4IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3b064073f0bc87503092d184730c81f26c4539a1170a5a19fe2b73d080d4c7f","last_reissued_at":"2026-05-18T00:10:43.421401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:43.421401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Robust High-Dimensional Sparse Representation Recovery Using Generalized SL0","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali Mehrpooya, Mehdi Nayebi, M.Hassan Bastani, Milad Nazari, Zahra Abbasi","submitted_at":"2018-07-15T06:44:14Z","abstract_excerpt":"Sparse representation can be described in high dimensions and used in many applications, including MRI imaging and radar imaging. In some cases, methods have been proposed to solve the high-dimensional sparse representation problem, but main solution is converting high-dimensional problem into one-dimension. Solving the equivalent problem had very high computational complexity. In this paper, the problem of high-dimensional sparse representation is formulated generally based on the theory of tensors, and a method for solving it based on SL0 (Smoothed Least zero-nor) is presented. Also, the uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05497","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":"1807.05497","created_at":"2026-05-18T00:10:43.421486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05497v1","created_at":"2026-05-18T00:10:43.421486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05497","created_at":"2026-05-18T00:10:43.421486+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOYGIBZ7BPEH","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOYGIBZ7BPEHKAYJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOYGIBZ7","created_at":"2026-05-18T12:33:04.347982+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/YOYGIBZ7BPEHKAYJFUMEOMGID4","json":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4.json","graph_json":"https://pith.science/api/pith-number/YOYGIBZ7BPEHKAYJFUMEOMGID4/graph.json","events_json":"https://pith.science/api/pith-number/YOYGIBZ7BPEHKAYJFUMEOMGID4/events.json","paper":"https://pith.science/paper/YOYGIBZ7"},"agent_actions":{"view_html":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4","download_json":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4.json","view_paper":"https://pith.science/paper/YOYGIBZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05497&json=true","fetch_graph":"https://pith.science/api/pith-number/YOYGIBZ7BPEHKAYJFUMEOMGID4/graph.json","fetch_events":"https://pith.science/api/pith-number/YOYGIBZ7BPEHKAYJFUMEOMGID4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4/action/storage_attestation","attest_author":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4/action/author_attestation","sign_citation":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4/action/citation_signature","submit_replication":"https://pith.science/pith/YOYGIBZ7BPEHKAYJFUMEOMGID4/action/replication_record"}},"created_at":"2026-05-18T00:10:43.421486+00:00","updated_at":"2026-05-18T00:10:43.421486+00:00"}