{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RMGDUXKDNOQD2OWKDILGWI2WRM","short_pith_number":"pith:RMGDUXKD","schema_version":"1.0","canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","source":{"kind":"arxiv","id":"1805.11949","version":1},"attestation_state":"computed","paper":{"title":"Fast L1-Minimization Algorithm for Sparse Approximation Based on an Improved LPNN-LCA framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Chi-Sing Leung, Hao Wang, Ruibin Feng","submitted_at":"2018-05-30T13:39:58Z","abstract_excerpt":"The aim of sparse approximation is to estimate a sparse signal according to the measurement matrix and an observation vector. It is widely used in data analytics, image processing, and communication, etc. Up to now, a lot of research has been done in this area, and many off-the-shelf algorithms have been proposed. However, most of them cannot offer a real-time solution. To some extent, this shortcoming limits its application prospects. To address this issue, we devise a novel sparse approximation algorithm based on Lagrange programming neural network (LPNN), locally competitive algorithm (LCA)"},"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":"1805.11949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-30T13:39:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c32795d2f5503e69b557a7111c440f1e6c80bc3d53ebfe986c41beee4ee50b0d","abstract_canon_sha256":"5c20b36b8d036f44cadf1035a1434a5c908349c9c6b37d3f8df2529742e2155b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:35.667107Z","signature_b64":"wjA3hcH6VkVgASocUxHJDHGFgUKO8igA6c1c4j1Unni+XJuwgfkVZQcDjyS49TbUBXzDYSRZO8k0A321MneiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","last_reissued_at":"2026-05-18T00:14:35.666529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:35.666529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast L1-Minimization Algorithm for Sparse Approximation Based on an Improved LPNN-LCA framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Chi-Sing Leung, Hao Wang, Ruibin Feng","submitted_at":"2018-05-30T13:39:58Z","abstract_excerpt":"The aim of sparse approximation is to estimate a sparse signal according to the measurement matrix and an observation vector. It is widely used in data analytics, image processing, and communication, etc. Up to now, a lot of research has been done in this area, and many off-the-shelf algorithms have been proposed. However, most of them cannot offer a real-time solution. To some extent, this shortcoming limits its application prospects. To address this issue, we devise a novel sparse approximation algorithm based on Lagrange programming neural network (LPNN), locally competitive algorithm (LCA)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11949","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":"1805.11949","created_at":"2026-05-18T00:14:35.666624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11949v1","created_at":"2026-05-18T00:14:35.666624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11949","created_at":"2026-05-18T00:14:35.666624+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMGDUXKDNOQD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMGDUXKDNOQD2OWK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMGDUXKD","created_at":"2026-05-18T12:32:50.500415+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/RMGDUXKDNOQD2OWKDILGWI2WRM","json":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM.json","graph_json":"https://pith.science/api/pith-number/RMGDUXKDNOQD2OWKDILGWI2WRM/graph.json","events_json":"https://pith.science/api/pith-number/RMGDUXKDNOQD2OWKDILGWI2WRM/events.json","paper":"https://pith.science/paper/RMGDUXKD"},"agent_actions":{"view_html":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM","download_json":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM.json","view_paper":"https://pith.science/paper/RMGDUXKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11949&json=true","fetch_graph":"https://pith.science/api/pith-number/RMGDUXKDNOQD2OWKDILGWI2WRM/graph.json","fetch_events":"https://pith.science/api/pith-number/RMGDUXKDNOQD2OWKDILGWI2WRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/action/storage_attestation","attest_author":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/action/author_attestation","sign_citation":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/action/citation_signature","submit_replication":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/action/replication_record"}},"created_at":"2026-05-18T00:14:35.666624+00:00","updated_at":"2026-05-18T00:14:35.666624+00:00"}