{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DRX2EUQ4TYBVEGYIOXJEMD5GY2","short_pith_number":"pith:DRX2EUQ4","schema_version":"1.0","canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","source":{"kind":"arxiv","id":"1602.06916","version":2},"attestation_state":"computed","paper":{"title":"Sparse Linear Regression via Generalized Orthogonal Least-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2016-02-22T19:55:01Z","abstract_excerpt":"Sparse linear regression, which entails finding a sparse solution to an underdetermined system of linear equations, can formally be expressed as an $l_0$-constrained least-squares problem. The Orthogonal Least-Squares (OLS) algorithm sequentially selects the features (i.e., columns of the coefficient matrix) to greedily find an approximate sparse solution. In this paper, a generalization of Orthogonal Least-Squares which relies on a recursive relation between the components of the optimal solution to select L features at each step and solve the resulting overdetermined system of equations is p"},"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":"1602.06916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-22T19:55:01Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"82b87f0b01985ea1a1c09df7ba7fce857f91c2f3a195515274bd3b17e1e14186","abstract_canon_sha256":"b27890615e88608ef5c27fea292bb084b1c892c14281bae31579d57b8edb0a54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:18.084521Z","signature_b64":"aRpIkYNjtYjdVxqiUM2O/cvNe291drnIzczUNXq4Cok/afQGQVwH42NruYrrL+g9M8NlYPZpikYVkletWmp2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","last_reissued_at":"2026-05-18T01:10:18.083884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:18.083884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Linear Regression via Generalized Orthogonal Least-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2016-02-22T19:55:01Z","abstract_excerpt":"Sparse linear regression, which entails finding a sparse solution to an underdetermined system of linear equations, can formally be expressed as an $l_0$-constrained least-squares problem. The Orthogonal Least-Squares (OLS) algorithm sequentially selects the features (i.e., columns of the coefficient matrix) to greedily find an approximate sparse solution. In this paper, a generalization of Orthogonal Least-Squares which relies on a recursive relation between the components of the optimal solution to select L features at each step and solve the resulting overdetermined system of equations is p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06916","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":"1602.06916","created_at":"2026-05-18T01:10:18.083989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06916v2","created_at":"2026-05-18T01:10:18.083989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06916","created_at":"2026-05-18T01:10:18.083989+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRX2EUQ4TYBV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRX2EUQ4TYBVEGYI","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRX2EUQ4","created_at":"2026-05-18T12:30:12.583610+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/DRX2EUQ4TYBVEGYIOXJEMD5GY2","json":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2.json","graph_json":"https://pith.science/api/pith-number/DRX2EUQ4TYBVEGYIOXJEMD5GY2/graph.json","events_json":"https://pith.science/api/pith-number/DRX2EUQ4TYBVEGYIOXJEMD5GY2/events.json","paper":"https://pith.science/paper/DRX2EUQ4"},"agent_actions":{"view_html":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2","download_json":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2.json","view_paper":"https://pith.science/paper/DRX2EUQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06916&json=true","fetch_graph":"https://pith.science/api/pith-number/DRX2EUQ4TYBVEGYIOXJEMD5GY2/graph.json","fetch_events":"https://pith.science/api/pith-number/DRX2EUQ4TYBVEGYIOXJEMD5GY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/action/storage_attestation","attest_author":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/action/author_attestation","sign_citation":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/action/citation_signature","submit_replication":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/action/replication_record"}},"created_at":"2026-05-18T01:10:18.083989+00:00","updated_at":"2026-05-18T01:10:18.083989+00:00"}