{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GL6ULUS2WVF235ZLFCYQWEQIHB","short_pith_number":"pith:GL6ULUS2","schema_version":"1.0","canonical_sha256":"32fd45d25ab54badf72b28b10b1208385d2212fd77b530d30de8616c2762438b","source":{"kind":"arxiv","id":"1511.08575","version":4},"attestation_state":"computed","paper":{"title":"A Modified Multiple OLS (m$^2$OLS) Algorithm for Signal Recovery in Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Mrityunjoy Chakraborty, Samrat Mukhopadhyay, Siddhartha Satpathi","submitted_at":"2015-11-27T07:39:05Z","abstract_excerpt":"Orthogonal least square (OLS) is an important sparse signal recovery algorithm for compressive sensing, which enjoys superior probability of success over other well-known recovery algorithms under conditions of correlated measurement matrices. Multiple OLS (mOLS) is a recently proposed improved version of OLS which selects multiple candidates per iteration by generalizing the greedy selection principle used in OLS and enjoys faster convergence than OLS. In this paper, we present a refined version of the mOLS algorithm where at each step of the iteration, we first preselect a submatrix of the m"},"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":"1511.08575","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-27T07:39:05Z","cross_cats_sorted":["math.IT","stat.ME"],"title_canon_sha256":"87e784ccf204e37a3ec13473f269f23d5daa997f4d0efa977f870c812e7a5d3d","abstract_canon_sha256":"c3729aab3f86c71ca521bc3cc4e9f2d6fd951392033c48f2db3378b66cbfb2eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:10.455693Z","signature_b64":"xf7VyVCL0g8BiJ6jzOmmk+H0yZh/OcLxQPPvzZlTATEfIpbs2GQQfmYXME//BUGabNOJJtl3M7eba+gVaecyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fd45d25ab54badf72b28b10b1208385d2212fd77b530d30de8616c2762438b","last_reissued_at":"2026-05-18T00:09:10.455041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:10.455041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Modified Multiple OLS (m$^2$OLS) Algorithm for Signal Recovery in Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Mrityunjoy Chakraborty, Samrat Mukhopadhyay, Siddhartha Satpathi","submitted_at":"2015-11-27T07:39:05Z","abstract_excerpt":"Orthogonal least square (OLS) is an important sparse signal recovery algorithm for compressive sensing, which enjoys superior probability of success over other well-known recovery algorithms under conditions of correlated measurement matrices. Multiple OLS (mOLS) is a recently proposed improved version of OLS which selects multiple candidates per iteration by generalizing the greedy selection principle used in OLS and enjoys faster convergence than OLS. In this paper, we present a refined version of the mOLS algorithm where at each step of the iteration, we first preselect a submatrix of the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08575","kind":"arxiv","version":4},"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":"1511.08575","created_at":"2026-05-18T00:09:10.455143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08575v4","created_at":"2026-05-18T00:09:10.455143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08575","created_at":"2026-05-18T00:09:10.455143+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL6ULUS2WVF2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL6ULUS2WVF235ZL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL6ULUS2","created_at":"2026-05-18T12:29:22.688609+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/GL6ULUS2WVF235ZLFCYQWEQIHB","json":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB.json","graph_json":"https://pith.science/api/pith-number/GL6ULUS2WVF235ZLFCYQWEQIHB/graph.json","events_json":"https://pith.science/api/pith-number/GL6ULUS2WVF235ZLFCYQWEQIHB/events.json","paper":"https://pith.science/paper/GL6ULUS2"},"agent_actions":{"view_html":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB","download_json":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB.json","view_paper":"https://pith.science/paper/GL6ULUS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08575&json=true","fetch_graph":"https://pith.science/api/pith-number/GL6ULUS2WVF235ZLFCYQWEQIHB/graph.json","fetch_events":"https://pith.science/api/pith-number/GL6ULUS2WVF235ZLFCYQWEQIHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB/action/storage_attestation","attest_author":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB/action/author_attestation","sign_citation":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB/action/citation_signature","submit_replication":"https://pith.science/pith/GL6ULUS2WVF235ZLFCYQWEQIHB/action/replication_record"}},"created_at":"2026-05-18T00:09:10.455143+00:00","updated_at":"2026-05-18T00:09:10.455143+00:00"}