{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VPTZREY3CKPEMPO4PQ3HIELJIZ","short_pith_number":"pith:VPTZREY3","schema_version":"1.0","canonical_sha256":"abe798931b129e463ddc7c36741169465cf275419b2796e97af8ab0123401cdb","source":{"kind":"arxiv","id":"1612.06067","version":2},"attestation_state":"computed","paper":{"title":"A Convex Program for Mixed Linear Regression with a Recovery Guarantee for Well-Separated Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Babhru Joshi, Paul Hand","submitted_at":"2016-12-19T07:58:00Z","abstract_excerpt":"We introduce a convex approach for mixed linear regression over $d$ features. This approach is a second-order cone program, based on L1 minimization, which assigns an estimate regression coefficient in $\\mathbb{R}^{d}$ for each data point. These estimates can then be clustered using, for example, $k$-means. For problems with two or more mixture classes, we prove that the convex program exactly recovers all of the mixture components in the noiseless setting under technical conditions that include a well-separation assumption on the data. Under these assumptions, recovery is possible if each cla"},"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":"1612.06067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-19T07:58:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"abc0d7101b9fa799205da65d8b454dceb5fe7271970cc7ad0a974f5eacfc8e9a","abstract_canon_sha256":"3b241e41e0f0e8659ee032d0084c351f536a68e46dc8eafb5b89ddb964c43e42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:48.760818Z","signature_b64":"HvYdGbOVsYFjcgmpGy73wkytY4NQ2MK2E3G1TIj1RzVjffP2WS4KF6UPbLug9xnXU7+9dnEvdqMe1zttqjUnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe798931b129e463ddc7c36741169465cf275419b2796e97af8ab0123401cdb","last_reissued_at":"2026-05-17T23:56:48.760375Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:48.760375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convex Program for Mixed Linear Regression with a Recovery Guarantee for Well-Separated Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Babhru Joshi, Paul Hand","submitted_at":"2016-12-19T07:58:00Z","abstract_excerpt":"We introduce a convex approach for mixed linear regression over $d$ features. This approach is a second-order cone program, based on L1 minimization, which assigns an estimate regression coefficient in $\\mathbb{R}^{d}$ for each data point. These estimates can then be clustered using, for example, $k$-means. For problems with two or more mixture classes, we prove that the convex program exactly recovers all of the mixture components in the noiseless setting under technical conditions that include a well-separation assumption on the data. Under these assumptions, recovery is possible if each cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06067","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":"1612.06067","created_at":"2026-05-17T23:56:48.760441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06067v2","created_at":"2026-05-17T23:56:48.760441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06067","created_at":"2026-05-17T23:56:48.760441+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPTZREY3CKPE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPTZREY3CKPEMPO4","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPTZREY3","created_at":"2026-05-18T12:30:48.956258+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/VPTZREY3CKPEMPO4PQ3HIELJIZ","json":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ.json","graph_json":"https://pith.science/api/pith-number/VPTZREY3CKPEMPO4PQ3HIELJIZ/graph.json","events_json":"https://pith.science/api/pith-number/VPTZREY3CKPEMPO4PQ3HIELJIZ/events.json","paper":"https://pith.science/paper/VPTZREY3"},"agent_actions":{"view_html":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ","download_json":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ.json","view_paper":"https://pith.science/paper/VPTZREY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06067&json=true","fetch_graph":"https://pith.science/api/pith-number/VPTZREY3CKPEMPO4PQ3HIELJIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VPTZREY3CKPEMPO4PQ3HIELJIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ/action/storage_attestation","attest_author":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ/action/author_attestation","sign_citation":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ/action/citation_signature","submit_replication":"https://pith.science/pith/VPTZREY3CKPEMPO4PQ3HIELJIZ/action/replication_record"}},"created_at":"2026-05-17T23:56:48.760441+00:00","updated_at":"2026-05-17T23:56:48.760441+00:00"}