{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TGSXQVPN55YQP2IMUTELMUUKF7","short_pith_number":"pith:TGSXQVPN","schema_version":"1.0","canonical_sha256":"99a57855edef7107e90ca4c8b6528a2fdc6cab38520dd15631458c7c21f106ce","source":{"kind":"arxiv","id":"1108.5037","version":2},"attestation_state":"computed","paper":{"title":"Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Cishen Zhang, Jun Deng, Wenmiao Lu, Zai Yang","submitted_at":"2011-08-25T08:35:39Z","abstract_excerpt":"Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is presented to reformulate the basis pursuit problem for noiseless compressed sensing. Two algorithms are proposed based on convex optimization: one exactly solves the problem and the other is a relaxed version of the first one. The latter can be considered as a modified iterative soft thresholding algorithm and is easy to implement. Numerical simulation shows th"},"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":"1108.5037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-25T08:35:39Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"9c031a278c0f591b04fdc5c1cb96a0fca61e76707a53915bc760fb840d52458a","abstract_canon_sha256":"63e78ff00fa431ef1d4b1b1ba1e18eb58d9114a79cc1d7fee3d1ec77207b88ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:48.278200Z","signature_b64":"LWYmg70eE0Jp3pEPIUMWvI+T4tZE3xA79xbKClUqTia7OaVZ3bgKEn3UTYSuvsj7OKv+UtSZc/U+EVr4j7WEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99a57855edef7107e90ca4c8b6528a2fdc6cab38520dd15631458c7c21f106ce","last_reissued_at":"2026-05-18T02:00:48.277485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:48.277485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Cishen Zhang, Jun Deng, Wenmiao Lu, Zai Yang","submitted_at":"2011-08-25T08:35:39Z","abstract_excerpt":"Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is presented to reformulate the basis pursuit problem for noiseless compressed sensing. Two algorithms are proposed based on convex optimization: one exactly solves the problem and the other is a relaxed version of the first one. The latter can be considered as a modified iterative soft thresholding algorithm and is easy to implement. Numerical simulation shows th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5037","kind":"arxiv","version":2},"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":"1108.5037","created_at":"2026-05-18T02:00:48.277612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5037v2","created_at":"2026-05-18T02:00:48.277612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5037","created_at":"2026-05-18T02:00:48.277612+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGSXQVPN55YQ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGSXQVPN55YQP2IM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGSXQVPN","created_at":"2026-05-18T12:26:42.757692+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/TGSXQVPN55YQP2IMUTELMUUKF7","json":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7.json","graph_json":"https://pith.science/api/pith-number/TGSXQVPN55YQP2IMUTELMUUKF7/graph.json","events_json":"https://pith.science/api/pith-number/TGSXQVPN55YQP2IMUTELMUUKF7/events.json","paper":"https://pith.science/paper/TGSXQVPN"},"agent_actions":{"view_html":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7","download_json":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7.json","view_paper":"https://pith.science/paper/TGSXQVPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5037&json=true","fetch_graph":"https://pith.science/api/pith-number/TGSXQVPN55YQP2IMUTELMUUKF7/graph.json","fetch_events":"https://pith.science/api/pith-number/TGSXQVPN55YQP2IMUTELMUUKF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7/action/storage_attestation","attest_author":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7/action/author_attestation","sign_citation":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7/action/citation_signature","submit_replication":"https://pith.science/pith/TGSXQVPN55YQP2IMUTELMUUKF7/action/replication_record"}},"created_at":"2026-05-18T02:00:48.277612+00:00","updated_at":"2026-05-18T02:00:48.277612+00:00"}