{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RMGDUXKDNOQD2OWKDILGWI2WRM","short_pith_number":"pith:RMGDUXKD","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"},"canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","source":{"kind":"arxiv","id":"1805.11949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11949","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11949v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11949","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"RMGDUXKDNOQD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RMGDUXKDNOQD2OWK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RMGDUXKD","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RMGDUXKDNOQD2OWKDILGWI2WRM","target":"record","payload":{"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"},"canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","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"},"source_kind":"arxiv","source_id":"1805.11949","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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRmrWW2nTuMrpuWqTELHsQReSwP8J3x7emhQfJIiOaNH6wW4avtKgV3IYklilkUgFRnTIoACJ/gS69U3pJ58DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:43:06.631730Z"},"content_sha256":"ba12e4793854f349534c77c583e54fa9aa9d346e872a971eef6f7e6aa74a1a41","schema_version":"1.0","event_id":"sha256:ba12e4793854f349534c77c583e54fa9aa9d346e872a971eef6f7e6aa74a1a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RMGDUXKDNOQD2OWKDILGWI2WRM","target":"graph","payload":{"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"},"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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3R93+NYsgGIutqCM+8wY3pNezHM6KE/380hVMycZdwOSCgQqhpa7iDdrxctFZ1wUINRRsBw890lTJkTvSsyoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:43:06.632008Z"},"content_sha256":"322225755ab8743f8ded1a0099dba634b7a8e438961b10722a70f7373d8cdabd","schema_version":"1.0","event_id":"sha256:322225755ab8743f8ded1a0099dba634b7a8e438961b10722a70f7373d8cdabd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/bundle.json","state_url":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/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-08-14T20:43:06Z","links":{"resolver":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM","bundle":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/bundle.json","state":"https://pith.science/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMGDUXKDNOQD2OWKDILGWI2WRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RMGDUXKDNOQD2OWKDILGWI2WRM","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":"5c20b36b8d036f44cadf1035a1434a5c908349c9c6b37d3f8df2529742e2155b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-30T13:39:58Z","title_canon_sha256":"c32795d2f5503e69b557a7111c440f1e6c80bc3d53ebfe986c41beee4ee50b0d"},"schema_version":"1.0","source":{"id":"1805.11949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11949","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11949v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11949","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"RMGDUXKDNOQD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RMGDUXKDNOQD2OWK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RMGDUXKD","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:322225755ab8743f8ded1a0099dba634b7a8e438961b10722a70f7373d8cdabd","target":"graph","created_at":"2026-05-18T00:14:35Z","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":"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)","authors_text":"Chi-Sing Leung, Hao Wang, Ruibin Feng","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-30T13:39:58Z","title":"Fast L1-Minimization Algorithm for Sparse Approximation Based on an Improved LPNN-LCA framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11949","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:ba12e4793854f349534c77c583e54fa9aa9d346e872a971eef6f7e6aa74a1a41","target":"record","created_at":"2026-05-18T00:14:35Z","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":"5c20b36b8d036f44cadf1035a1434a5c908349c9c6b37d3f8df2529742e2155b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-05-30T13:39:58Z","title_canon_sha256":"c32795d2f5503e69b557a7111c440f1e6c80bc3d53ebfe986c41beee4ee50b0d"},"schema_version":"1.0","source":{"id":"1805.11949","kind":"arxiv","version":1}},"canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b0c3a5d436ba03d3aca1a166b23568b115baa986183ac3fc4765bb1844d622f","first_computed_at":"2026-05-18T00:14:35.666529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:35.666529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wjA3hcH6VkVgASocUxHJDHGFgUKO8igA6c1c4j1Unni+XJuwgfkVZQcDjyS49TbUBXzDYSRZO8k0A321MneiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:35.667107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba12e4793854f349534c77c583e54fa9aa9d346e872a971eef6f7e6aa74a1a41","sha256:322225755ab8743f8ded1a0099dba634b7a8e438961b10722a70f7373d8cdabd"],"state_sha256":"55c4b5d32bee45addfca20da88c7f523304a7633c90adeefbc2c76f99ae5b7ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqnsq0S3rdCZ00vkkZ9rrZfeIMm8ie19LuyOMH2LegJQ8pjEXwCWpvNkn36MFVD7WIcRnEXMAZ9exMS+b6VeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T20:43:06.634771Z","bundle_sha256":"a41cc11d166b550e28a8182c1123b1c1ab43510ecf9632716dceba5d8cb97479"}}