{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6FIFWJN4V43LNFY6NVPLILQEUG","short_pith_number":"pith:6FIFWJN4","schema_version":"1.0","canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","source":{"kind":"arxiv","id":"1608.02549","version":2},"attestation_state":"computed","paper":{"title":"Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2016-08-08T18:36:30Z","abstract_excerpt":"We study the problem of inferring a sparse vector from random linear combinations of its components. We propose the Accelerated Orthogonal Least-Squares (AOLS) algorithm that improves performance of the well-known Orthogonal Least-Squares (OLS) algorithm while requiring significantly lower computational costs. While OLS greedily selects columns of the coefficient matrix that correspond to non-zero components of the sparse vector, AOLS employs a novel computationally efficient procedure that speeds up the search by anticipating future selections via choosing $L$ columns in each step, where $L$ "},"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":"1608.02549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-08T18:36:30Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a275bea133ee79e0c3fc19da3d247411b4c4cbf5cb887813c6baff3a62c732dc","abstract_canon_sha256":"b8d0c118b6c275f8754d1260ab077dde15df508a28534d56f37b9b6d9b169f08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:32.115702Z","signature_b64":"EfhfvYdnioPg+OYChW/7WbRvWQsnNpw5nrNqcAI0u9jzvcLfLXpK8OfH+gLRlSKl7LXy5R4F8qudX770okrMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","last_reissued_at":"2026-05-18T00:18:32.115309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:32.115309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2016-08-08T18:36:30Z","abstract_excerpt":"We study the problem of inferring a sparse vector from random linear combinations of its components. We propose the Accelerated Orthogonal Least-Squares (AOLS) algorithm that improves performance of the well-known Orthogonal Least-Squares (OLS) algorithm while requiring significantly lower computational costs. While OLS greedily selects columns of the coefficient matrix that correspond to non-zero components of the sparse vector, AOLS employs a novel computationally efficient procedure that speeds up the search by anticipating future selections via choosing $L$ columns in each step, where $L$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02549","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":"1608.02549","created_at":"2026-05-18T00:18:32.115378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02549v2","created_at":"2026-05-18T00:18:32.115378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02549","created_at":"2026-05-18T00:18:32.115378+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FIFWJN4V43L","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FIFWJN4V43LNFY6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FIFWJN4","created_at":"2026-05-18T12:30:01.593930+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/6FIFWJN4V43LNFY6NVPLILQEUG","json":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG.json","graph_json":"https://pith.science/api/pith-number/6FIFWJN4V43LNFY6NVPLILQEUG/graph.json","events_json":"https://pith.science/api/pith-number/6FIFWJN4V43LNFY6NVPLILQEUG/events.json","paper":"https://pith.science/paper/6FIFWJN4"},"agent_actions":{"view_html":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG","download_json":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG.json","view_paper":"https://pith.science/paper/6FIFWJN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02549&json=true","fetch_graph":"https://pith.science/api/pith-number/6FIFWJN4V43LNFY6NVPLILQEUG/graph.json","fetch_events":"https://pith.science/api/pith-number/6FIFWJN4V43LNFY6NVPLILQEUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/action/storage_attestation","attest_author":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/action/author_attestation","sign_citation":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/action/citation_signature","submit_replication":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/action/replication_record"}},"created_at":"2026-05-18T00:18:32.115378+00:00","updated_at":"2026-05-18T00:18:32.115378+00:00"}