{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DRX2EUQ4TYBVEGYIOXJEMD5GY2","short_pith_number":"pith:DRX2EUQ4","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"},"canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","source":{"kind":"arxiv","id":"1602.06916","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06916","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06916v2","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06916","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"DRX2EUQ4TYBV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRX2EUQ4TYBVEGYI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRX2EUQ4","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DRX2EUQ4TYBVEGYIOXJEMD5GY2","target":"record","payload":{"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"},"canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","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"},"source_kind":"arxiv","source_id":"1602.06916","source_version":2,"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-18T01:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdedWMrF1+50v/KtvlWbl/j8hzAnMVHfHsGrwvTQtVUB/3NVwdZXICBlkIzdtvoeyQc5MBla5OmoOHPDarQtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:27:22.119007Z"},"content_sha256":"311bc3899b99eebe8e7624604890065856e202f0b65b6f1504bb4087127e0fc6","schema_version":"1.0","event_id":"sha256:311bc3899b99eebe8e7624604890065856e202f0b65b6f1504bb4087127e0fc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DRX2EUQ4TYBVEGYIOXJEMD5GY2","target":"graph","payload":{"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"},"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-18T01:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KPR/t+CA7ZYFSHlfYIN/nIAwY3+T1mHaY0BWJ2QjOn2RO+HO4vZ3P3MXDdbj+gk0sapJDzgq1++bEOPaBPvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:27:22.119364Z"},"content_sha256":"1fc3f52954d9921478dff15152f9c8343c2307e65f35154de6a78f954db90e4c","schema_version":"1.0","event_id":"sha256:1fc3f52954d9921478dff15152f9c8343c2307e65f35154de6a78f954db90e4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/bundle.json","state_url":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/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-06-12T07:27:22Z","links":{"resolver":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2","bundle":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/bundle.json","state":"https://pith.science/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRX2EUQ4TYBVEGYIOXJEMD5GY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DRX2EUQ4TYBVEGYIOXJEMD5GY2","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":"b27890615e88608ef5c27fea292bb084b1c892c14281bae31579d57b8edb0a54","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-22T19:55:01Z","title_canon_sha256":"82b87f0b01985ea1a1c09df7ba7fce857f91c2f3a195515274bd3b17e1e14186"},"schema_version":"1.0","source":{"id":"1602.06916","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06916","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06916v2","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06916","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"DRX2EUQ4TYBV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRX2EUQ4TYBVEGYI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRX2EUQ4","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1fc3f52954d9921478dff15152f9c8343c2307e65f35154de6a78f954db90e4c","target":"graph","created_at":"2026-05-18T01:10:18Z","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":"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","authors_text":"Abolfazl Hashemi, Haris Vikalo","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-22T19:55:01Z","title":"Sparse Linear Regression via Generalized Orthogonal Least-Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06916","kind":"arxiv","version":2},"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:311bc3899b99eebe8e7624604890065856e202f0b65b6f1504bb4087127e0fc6","target":"record","created_at":"2026-05-18T01:10:18Z","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":"b27890615e88608ef5c27fea292bb084b1c892c14281bae31579d57b8edb0a54","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-22T19:55:01Z","title_canon_sha256":"82b87f0b01985ea1a1c09df7ba7fce857f91c2f3a195515274bd3b17e1e14186"},"schema_version":"1.0","source":{"id":"1602.06916","kind":"arxiv","version":2}},"canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c6fa2521c9e03521b0875d2460fa6c6b3f0c4552279806cc93a98b26e134822","first_computed_at":"2026-05-18T01:10:18.083884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:18.083884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aRpIkYNjtYjdVxqiUM2O/cvNe291drnIzczUNXq4Cok/afQGQVwH42NruYrrL+g9M8NlYPZpikYVkletWmp2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:18.084521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06916","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:311bc3899b99eebe8e7624604890065856e202f0b65b6f1504bb4087127e0fc6","sha256:1fc3f52954d9921478dff15152f9c8343c2307e65f35154de6a78f954db90e4c"],"state_sha256":"f64eb881168c2d04d8c66fd1b667862c699e47973c1e591b2030378efa87246f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwgFS5w8NKQ5Epoj1HstvZMQYXjWkK6h7yJNLN/quBV1uOUANTj4eD+tDpCpOLr+nr7zDaKxgwH1NfmswWgkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T07:27:22.121268Z","bundle_sha256":"74f1aa83da34f3c6602f8fd3d64138f9dc2abcae2856e5462ea0aa3c5580ee74"}}