{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6FIFWJN4V43LNFY6NVPLILQEUG","short_pith_number":"pith:6FIFWJN4","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"},"canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","source":{"kind":"arxiv","id":"1608.02549","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02549","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02549v2","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02549","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"6FIFWJN4V43L","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6FIFWJN4V43LNFY6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6FIFWJN4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6FIFWJN4V43LNFY6NVPLILQEUG","target":"record","payload":{"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"},"canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","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"},"source_kind":"arxiv","source_id":"1608.02549","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-18T00:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"By/FzFwEg+9w7/NCZgVzVzuRGMp0mHR7D8lZANwaWRw6ZeHTX8NGivaDfvRvwwV/P4yG/eq/AxKJKGMN7rIlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:23:06.903233Z"},"content_sha256":"3e23254c15daedb4a8bd54829f5a3e22c07a54ae688f7be9962b87c6c2599d58","schema_version":"1.0","event_id":"sha256:3e23254c15daedb4a8bd54829f5a3e22c07a54ae688f7be9962b87c6c2599d58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6FIFWJN4V43LNFY6NVPLILQEUG","target":"graph","payload":{"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"},"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-18T00:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7pZ2khGYLExN2t3ym2SOdqCx62skpihbcFC+40fGlndb17wMEkgC9VMQepZZG7tWWcbVgWFort1i0B+vgJDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:23:06.903599Z"},"content_sha256":"15f5c6dc2173c60a0502304a0b746f01fbbb6d2058e8c22daf4026b28d054d89","schema_version":"1.0","event_id":"sha256:15f5c6dc2173c60a0502304a0b746f01fbbb6d2058e8c22daf4026b28d054d89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/bundle.json","state_url":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FIFWJN4V43LNFY6NVPLILQEUG/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-12T10:23:06Z","links":{"resolver":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG","bundle":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/bundle.json","state":"https://pith.science/pith/6FIFWJN4V43LNFY6NVPLILQEUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FIFWJN4V43LNFY6NVPLILQEUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6FIFWJN4V43LNFY6NVPLILQEUG","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":"b8d0c118b6c275f8754d1260ab077dde15df508a28534d56f37b9b6d9b169f08","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-08T18:36:30Z","title_canon_sha256":"a275bea133ee79e0c3fc19da3d247411b4c4cbf5cb887813c6baff3a62c732dc"},"schema_version":"1.0","source":{"id":"1608.02549","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02549","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02549v2","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02549","created_at":"2026-05-18T00:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"6FIFWJN4V43L","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6FIFWJN4V43LNFY6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6FIFWJN4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:15f5c6dc2173c60a0502304a0b746f01fbbb6d2058e8c22daf4026b28d054d89","target":"graph","created_at":"2026-05-18T00:18:32Z","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":"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$ ","authors_text":"Abolfazl Hashemi, Haris Vikalo","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-08T18:36:30Z","title":"Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02549","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:3e23254c15daedb4a8bd54829f5a3e22c07a54ae688f7be9962b87c6c2599d58","target":"record","created_at":"2026-05-18T00:18:32Z","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":"b8d0c118b6c275f8754d1260ab077dde15df508a28534d56f37b9b6d9b169f08","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-08T18:36:30Z","title_canon_sha256":"a275bea133ee79e0c3fc19da3d247411b4c4cbf5cb887813c6baff3a62c732dc"},"schema_version":"1.0","source":{"id":"1608.02549","kind":"arxiv","version":2}},"canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1505b25bcaf36b6971e6d5eb42e04a1b04c340bb3cf807a8b7e2d6878035eb2","first_computed_at":"2026-05-18T00:18:32.115309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:32.115309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EfhfvYdnioPg+OYChW/7WbRvWQsnNpw5nrNqcAI0u9jzvcLfLXpK8OfH+gLRlSKl7LXy5R4F8qudX770okrMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:32.115702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02549","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e23254c15daedb4a8bd54829f5a3e22c07a54ae688f7be9962b87c6c2599d58","sha256:15f5c6dc2173c60a0502304a0b746f01fbbb6d2058e8c22daf4026b28d054d89"],"state_sha256":"2e0241124c583e658fbfbe11c161f2c41b5d4e19927c937b2974f13e763b2e4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nY37xBYC1HXmTZgt84k4DlE0Bd7ayx1Zz4WaJCgxuLBRsswl1e/ECyYvfLVgMGkqG3U6neI8aZ/aVg0DwXrVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:23:06.905561Z","bundle_sha256":"9414a668c10767ed0f5594f0e630b01f5cf88bedd1c215c50ca20a18bc7659d9"}}