{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TCCR24O44ZZNF3LT35PP66DD5D","short_pith_number":"pith:TCCR24O4","schema_version":"1.0","canonical_sha256":"98851d71dce672d2ed73df5eff7863e8c605adfce2b9a292fda646800f360d88","source":{"kind":"arxiv","id":"1408.4837","version":2},"attestation_state":"computed","paper":{"title":"The Gaussian min-max theorem in the Presence of Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Christos Thrampoulidis, Samet Oymak","submitted_at":"2014-08-20T23:24:09Z","abstract_excerpt":"Gaussian comparison theorems are useful tools in probability theory; they are essential ingredients in the classical proofs of many results in empirical processes and extreme value theory. More recently, they have been used extensively in the analysis of non-smooth optimization problems that arise in the recovery of structured signals from noisy linear observations. We refer to such problems as Primary Optimization (PO) problems. A prominent role in the study of the (PO) problems is played by Gordon's Gaussian min-max theorem (GMT) which provides probabilistic lower bounds on the optimal cost "},"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":"1408.4837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T23:24:09Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"10bdc05b619e463b6c1e08fa2e11840bcc5c684421f453ef4a926b22f8401d70","abstract_canon_sha256":"989f13b9d27c2dfea5da84dbc2ca827e991a913f47bbe9d02dc6a7fd824efa3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:49.057605Z","signature_b64":"jdpnt8F2n6lKLQAUe8yZmEhTJvFQmsxE68ztoAn8rk6mX7LwF8LF3Ohhp7oAHrCJxglSz11eeVhKaQH4Xyn/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98851d71dce672d2ed73df5eff7863e8c605adfce2b9a292fda646800f360d88","last_reissued_at":"2026-05-18T02:25:49.057121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:49.057121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Gaussian min-max theorem in the Presence of Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Christos Thrampoulidis, Samet Oymak","submitted_at":"2014-08-20T23:24:09Z","abstract_excerpt":"Gaussian comparison theorems are useful tools in probability theory; they are essential ingredients in the classical proofs of many results in empirical processes and extreme value theory. More recently, they have been used extensively in the analysis of non-smooth optimization problems that arise in the recovery of structured signals from noisy linear observations. We refer to such problems as Primary Optimization (PO) problems. A prominent role in the study of the (PO) problems is played by Gordon's Gaussian min-max theorem (GMT) which provides probabilistic lower bounds on the optimal cost "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4837","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":"1408.4837","created_at":"2026-05-18T02:25:49.057197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4837v2","created_at":"2026-05-18T02:25:49.057197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4837","created_at":"2026-05-18T02:25:49.057197+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCCR24O44ZZN","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCCR24O44ZZNF3LT","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCCR24O4","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19364","citing_title":"Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03146","citing_title":"Characterization of Gaussian Universality Breakdown in High-Dimensional Empirical Risk Minimization","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06314","citing_title":"When Does $\\ell_2$-Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the $\\ell_1$ Implicit Bias","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06314","citing_title":"When Does $\\ell_2$-Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the $\\ell_1$ Implicit Bias","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19517","citing_title":"PRADAS: PRior-Assisted DAta Splitting for False Discovery Rate Control","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D","json":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D.json","graph_json":"https://pith.science/api/pith-number/TCCR24O44ZZNF3LT35PP66DD5D/graph.json","events_json":"https://pith.science/api/pith-number/TCCR24O44ZZNF3LT35PP66DD5D/events.json","paper":"https://pith.science/paper/TCCR24O4"},"agent_actions":{"view_html":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D","download_json":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D.json","view_paper":"https://pith.science/paper/TCCR24O4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4837&json=true","fetch_graph":"https://pith.science/api/pith-number/TCCR24O44ZZNF3LT35PP66DD5D/graph.json","fetch_events":"https://pith.science/api/pith-number/TCCR24O44ZZNF3LT35PP66DD5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D/action/storage_attestation","attest_author":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D/action/author_attestation","sign_citation":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D/action/citation_signature","submit_replication":"https://pith.science/pith/TCCR24O44ZZNF3LT35PP66DD5D/action/replication_record"}},"created_at":"2026-05-18T02:25:49.057197+00:00","updated_at":"2026-05-18T02:25:49.057197+00:00"}