{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SKSUTPNRFCQCGESOKIQ53SCY5V","short_pith_number":"pith:SKSUTPNR","schema_version":"1.0","canonical_sha256":"92a549bdb128a023124e5221ddc858ed45586865572dee0aa13cfa9c354bfa75","source":{"kind":"arxiv","id":"1901.10334","version":2},"attestation_state":"computed","paper":{"title":"Rank-one Convexification for Sparse Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alper Atamturk, Andres Gomez","submitted_at":"2019-01-29T15:12:59Z","abstract_excerpt":"Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an $\\ell_0$ constraint restricting the support of the estimators is a challenging (\\NP-hard) non-convex optimization problem. In this paper, we derive new strong convex relaxations for sparse regression. These relaxations are based on the ideal (convex-hull) formulations for rank-one quadratic terms with indicator variables. The new relaxations can be formulated as semidefinite optimization problems in an extended s"},"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":"1901.10334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-29T15:12:59Z","cross_cats_sorted":["cs.LG","math.OC","stat.ME"],"title_canon_sha256":"d11f7e5ee0c925ae61bd317007294661a75f85788593ce5c702c9d443039c535","abstract_canon_sha256":"c9cc0246cd555372260c6bc4832426a8961ed506d286edd212996adac59d7199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:54.180105Z","signature_b64":"X/11ytScE2CFAS+oe54C6qtnpg3r3sMWGYzrzDe+3XZzUBcX8lj7g4KUt6PLy9D5LVJvzGLpcDbeXXygfRCZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a549bdb128a023124e5221ddc858ed45586865572dee0aa13cfa9c354bfa75","last_reissued_at":"2026-07-05T01:43:54.179706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:54.179706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank-one Convexification for Sparse Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alper Atamturk, Andres Gomez","submitted_at":"2019-01-29T15:12:59Z","abstract_excerpt":"Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an $\\ell_0$ constraint restricting the support of the estimators is a challenging (\\NP-hard) non-convex optimization problem. In this paper, we derive new strong convex relaxations for sparse regression. These relaxations are based on the ideal (convex-hull) formulations for rank-one quadratic terms with indicator variables. The new relaxations can be formulated as semidefinite optimization problems in an extended s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10334","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.10334/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.10334","created_at":"2026-07-05T01:43:54.179763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10334v2","created_at":"2026-07-05T01:43:54.179763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10334","created_at":"2026-07-05T01:43:54.179763+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKSUTPNRFCQC","created_at":"2026-07-05T01:43:54.179763+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKSUTPNRFCQCGESO","created_at":"2026-07-05T01:43:54.179763+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKSUTPNR","created_at":"2026-07-05T01:43:54.179763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17116","citing_title":"Fair and Accurate Regression: Strong Formulations and Algorithms","ref_index":2000,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V","json":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V.json","graph_json":"https://pith.science/api/pith-number/SKSUTPNRFCQCGESOKIQ53SCY5V/graph.json","events_json":"https://pith.science/api/pith-number/SKSUTPNRFCQCGESOKIQ53SCY5V/events.json","paper":"https://pith.science/paper/SKSUTPNR"},"agent_actions":{"view_html":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V","download_json":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V.json","view_paper":"https://pith.science/paper/SKSUTPNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10334&json=true","fetch_graph":"https://pith.science/api/pith-number/SKSUTPNRFCQCGESOKIQ53SCY5V/graph.json","fetch_events":"https://pith.science/api/pith-number/SKSUTPNRFCQCGESOKIQ53SCY5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V/action/storage_attestation","attest_author":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V/action/author_attestation","sign_citation":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V/action/citation_signature","submit_replication":"https://pith.science/pith/SKSUTPNRFCQCGESOKIQ53SCY5V/action/replication_record"}},"created_at":"2026-07-05T01:43:54.179763+00:00","updated_at":"2026-07-05T01:43:54.179763+00:00"}