{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EFJ6XA3U2JHU26C5H4DPDVMQPO","short_pith_number":"pith:EFJ6XA3U","schema_version":"1.0","canonical_sha256":"2153eb8374d24f4d785d3f06f1d5907bb02d381c2565dbc828c8c61f9460a604","source":{"kind":"arxiv","id":"2002.11410","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithms for multivariate shape-constrained convex regression problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Meixia Lin","submitted_at":"2020-02-26T11:18:43Z","abstract_excerpt":"Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a comprehensive mechanism for computing the least squares estimator of a multivariate shape-constrained convex regression function in $\\mathbb{R}^d$. We prove that the least squares estimator is computable via solving a constrained convex quadratic programming (QP) problem with $(n+1)d$ variables and at least $n(n-1)$ linear inequality constraints, where $n$ is t"},"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":"2002.11410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T11:18:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4349fcf536acbe9a9cc907e803083c0f884a73d91d540eff799307ae1f73855d","abstract_canon_sha256":"b1e01e8f4450685271c25511cf7f6cd9566d79a302b4de1aefe0e6802564e08b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:02.072669Z","signature_b64":"mqdsaXz+N7xm9ZB41pJBrKy+rjDQIp7f70rVJGrLUPVxkmQ6xedn/3zk95q3L3AviIGFPxYqE2m1Sk91lTMRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2153eb8374d24f4d785d3f06f1d5907bb02d381c2565dbc828c8c61f9460a604","last_reissued_at":"2026-07-05T00:44:02.072191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:02.072191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithms for multivariate shape-constrained convex regression problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Meixia Lin","submitted_at":"2020-02-26T11:18:43Z","abstract_excerpt":"Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a comprehensive mechanism for computing the least squares estimator of a multivariate shape-constrained convex regression function in $\\mathbb{R}^d$. We prove that the least squares estimator is computable via solving a constrained convex quadratic programming (QP) problem with $(n+1)d$ variables and at least $n(n-1)$ linear inequality constraints, where $n$ is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11410","kind":"arxiv","version":1},"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/2002.11410/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":"2002.11410","created_at":"2026-07-05T00:44:02.072255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.11410v1","created_at":"2026-07-05T00:44:02.072255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11410","created_at":"2026-07-05T00:44:02.072255+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFJ6XA3U2JHU","created_at":"2026-07-05T00:44:02.072255+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFJ6XA3U2JHU26C5","created_at":"2026-07-05T00:44:02.072255+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFJ6XA3U","created_at":"2026-07-05T00:44:02.072255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07694","citing_title":"Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity","ref_index":84,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO","json":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO.json","graph_json":"https://pith.science/api/pith-number/EFJ6XA3U2JHU26C5H4DPDVMQPO/graph.json","events_json":"https://pith.science/api/pith-number/EFJ6XA3U2JHU26C5H4DPDVMQPO/events.json","paper":"https://pith.science/paper/EFJ6XA3U"},"agent_actions":{"view_html":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO","download_json":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO.json","view_paper":"https://pith.science/paper/EFJ6XA3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.11410&json=true","fetch_graph":"https://pith.science/api/pith-number/EFJ6XA3U2JHU26C5H4DPDVMQPO/graph.json","fetch_events":"https://pith.science/api/pith-number/EFJ6XA3U2JHU26C5H4DPDVMQPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO/action/storage_attestation","attest_author":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO/action/author_attestation","sign_citation":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO/action/citation_signature","submit_replication":"https://pith.science/pith/EFJ6XA3U2JHU26C5H4DPDVMQPO/action/replication_record"}},"created_at":"2026-07-05T00:44:02.072255+00:00","updated_at":"2026-07-05T00:44:02.072255+00:00"}