{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SAAZRLYV6T4IUEDTMLZPZ7GZ5U","short_pith_number":"pith:SAAZRLYV","schema_version":"1.0","canonical_sha256":"900198af15f4f88a107362f2fcfcd9ed3a6e76f74c7415c10c3c65cf20641381","source":{"kind":"arxiv","id":"1703.00641","version":2},"attestation_state":"computed","paper":{"title":"Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Yin, Kannan Ramchandran, Ramtin Pedarsani, Yudong Chen","submitted_at":"2017-03-02T07:15:41Z","abstract_excerpt":"In this paper, we consider the mixture of sparse linear regressions model. Let ${\\beta}^{(1)},\\ldots,{\\beta}^{(L)}\\in\\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear measurements are obtained in the form $y_i={x}_i^H {\\beta}^{(\\ell_i)} + w_i$, each of which is generated randomly from one of the sparse vectors with the label $ \\ell_i $ unknown. The goal is to estimate the parameter vectors efficiently with low sample and computational costs. This problem presents significant challenges as one needs to simultaneously solve the demi"},"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":"1703.00641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T07:15:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b3a3231bc54db0adba970bbd5df450de049e6259a9cd4767f58555cb36caf60d","abstract_canon_sha256":"12d50aee90476fa5bde5be31d3f19d5096b552bcfc18b2e50cc88d4dca89d8c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.869796Z","signature_b64":"h9zvvsDeBEPOStDyFsVIiq4nCcNvRMhpj9X51ccTIET8OaWgytKiKwuKtonguKyYWlpVVFl+sPdIC26JA7a7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"900198af15f4f88a107362f2fcfcd9ed3a6e76f74c7415c10c3c65cf20641381","last_reissued_at":"2026-05-18T00:09:05.869277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.869277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Yin, Kannan Ramchandran, Ramtin Pedarsani, Yudong Chen","submitted_at":"2017-03-02T07:15:41Z","abstract_excerpt":"In this paper, we consider the mixture of sparse linear regressions model. Let ${\\beta}^{(1)},\\ldots,{\\beta}^{(L)}\\in\\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear measurements are obtained in the form $y_i={x}_i^H {\\beta}^{(\\ell_i)} + w_i$, each of which is generated randomly from one of the sparse vectors with the label $ \\ell_i $ unknown. The goal is to estimate the parameter vectors efficiently with low sample and computational costs. This problem presents significant challenges as one needs to simultaneously solve the demi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00641","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":"1703.00641","created_at":"2026-05-18T00:09:05.869348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00641v2","created_at":"2026-05-18T00:09:05.869348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00641","created_at":"2026-05-18T00:09:05.869348+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAAZRLYV6T4I","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAAZRLYV6T4IUEDT","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAAZRLYV","created_at":"2026-05-18T12:31:43.269735+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/SAAZRLYV6T4IUEDTMLZPZ7GZ5U","json":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U.json","graph_json":"https://pith.science/api/pith-number/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/graph.json","events_json":"https://pith.science/api/pith-number/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/events.json","paper":"https://pith.science/paper/SAAZRLYV"},"agent_actions":{"view_html":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U","download_json":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U.json","view_paper":"https://pith.science/paper/SAAZRLYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00641&json=true","fetch_graph":"https://pith.science/api/pith-number/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/graph.json","fetch_events":"https://pith.science/api/pith-number/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/action/storage_attestation","attest_author":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/action/author_attestation","sign_citation":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/action/citation_signature","submit_replication":"https://pith.science/pith/SAAZRLYV6T4IUEDTMLZPZ7GZ5U/action/replication_record"}},"created_at":"2026-05-18T00:09:05.869348+00:00","updated_at":"2026-05-18T00:09:05.869348+00:00"}