{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6K52RN23SFTDJSEFLNXX7TKPRC","short_pith_number":"pith:6K52RN23","schema_version":"1.0","canonical_sha256":"f2bba8b75b916634c8855b6f7fcd4f88a927ba7d5772e58c77064ea610c86f55","source":{"kind":"arxiv","id":"1606.08009","version":2},"attestation_state":"computed","paper":{"title":"Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arash Amini, Ashkan Esmaeili, Farokh Marvasti","submitted_at":"2016-06-26T08:27:45Z","abstract_excerpt":"In this paper, we investigate the recovery of a sparse weight vector (parameters vector) from a set of noisy linear combinations. However, only partial information about the matrix representing the linear combinations is available. Assuming a low-rank structure for the matrix, one natural solution would be to first apply a matrix completion on the data, and then to solve the resulting compressed sensing problem. In big data applications such as massive MIMO and medical data, the matrix completion step imposes a huge computational burden. Here, we propose to reduce the computational cost of the"},"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":"1606.08009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-26T08:27:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"494240db23a5f5cb267a73ccf3087b6e7ae0985ea90ea3ef608293be3564ffb2","abstract_canon_sha256":"af3a1d4d5e853f0df7e9aabbf999c71a0f5113db2a50367f84969ca3154c5520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.010698Z","signature_b64":"GlAA90ym/ozVlvEDAsOQP+CYUiwS5zSp2OcGNvCH/gdKlQWcxzP+xuP/2wCyCNJShx/ZIA/lXotBjZCQgJdhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2bba8b75b916634c8855b6f7fcd4f88a927ba7d5772e58c77064ea610c86f55","last_reissued_at":"2026-05-18T00:58:04.010037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.010037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arash Amini, Ashkan Esmaeili, Farokh Marvasti","submitted_at":"2016-06-26T08:27:45Z","abstract_excerpt":"In this paper, we investigate the recovery of a sparse weight vector (parameters vector) from a set of noisy linear combinations. However, only partial information about the matrix representing the linear combinations is available. Assuming a low-rank structure for the matrix, one natural solution would be to first apply a matrix completion on the data, and then to solve the resulting compressed sensing problem. In big data applications such as massive MIMO and medical data, the matrix completion step imposes a huge computational burden. Here, we propose to reduce the computational cost of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08009","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":"1606.08009","created_at":"2026-05-18T00:58:04.010121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08009v2","created_at":"2026-05-18T00:58:04.010121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08009","created_at":"2026-05-18T00:58:04.010121+00:00"},{"alias_kind":"pith_short_12","alias_value":"6K52RN23SFTD","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6K52RN23SFTDJSEF","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6K52RN23","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/6K52RN23SFTDJSEFLNXX7TKPRC","json":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC.json","graph_json":"https://pith.science/api/pith-number/6K52RN23SFTDJSEFLNXX7TKPRC/graph.json","events_json":"https://pith.science/api/pith-number/6K52RN23SFTDJSEFLNXX7TKPRC/events.json","paper":"https://pith.science/paper/6K52RN23"},"agent_actions":{"view_html":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC","download_json":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC.json","view_paper":"https://pith.science/paper/6K52RN23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08009&json=true","fetch_graph":"https://pith.science/api/pith-number/6K52RN23SFTDJSEFLNXX7TKPRC/graph.json","fetch_events":"https://pith.science/api/pith-number/6K52RN23SFTDJSEFLNXX7TKPRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC/action/storage_attestation","attest_author":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC/action/author_attestation","sign_citation":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC/action/citation_signature","submit_replication":"https://pith.science/pith/6K52RN23SFTDJSEFLNXX7TKPRC/action/replication_record"}},"created_at":"2026-05-18T00:58:04.010121+00:00","updated_at":"2026-05-18T00:58:04.010121+00:00"}