{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7XLD6UQJVOGCQ4MM47O26WTOLS","short_pith_number":"pith:7XLD6UQJ","schema_version":"1.0","canonical_sha256":"fdd63f5209ab8c28718ce7ddaf5a6e5c9f0e1e94d8be74ea224511e613bb52ce","source":{"kind":"arxiv","id":"2506.04183","version":1},"attestation_state":"computed","paper":{"title":"Learning Parametric Convex Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Maximilian Schaller, Stephen Boyd","submitted_at":"2025-06-04T17:28:45Z","abstract_excerpt":"A parametrized convex function depends on a variable and a parameter, and is convex in the variable for any valid value of the parameter. Such functions can be used to specify parametrized convex optimization problems, i.e., a convex optimization family, in domain specific languages for convex optimization. In this paper we address the problem of fitting a parametrized convex function that is compatible with disciplined programming, to some given data. This allows us to fit a function arising in a convex optimization formulation directly to observed or simulated data. We demonstrate our open-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":"2506.04183","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T17:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"a58a091f271a9eb37a53b62b68af3d4a020a04fc35f4376fa846e68ee72ab73c","abstract_canon_sha256":"9df635e48b4de491b2becd8a60722ddc344371551c72b78acb88a77567935d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:58.494436Z","signature_b64":"GHrVFxdjZEt1dmmhQxxVwVBmeR4zVaDA9zVaB+tpDeyDx4Ps81tcurwMIsJ8oOVQiDxC93LcuxivugSlR2zsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd63f5209ab8c28718ce7ddaf5a6e5c9f0e1e94d8be74ea224511e613bb52ce","last_reissued_at":"2026-07-05T11:15:58.494017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:58.494017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Parametric Convex Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Maximilian Schaller, Stephen Boyd","submitted_at":"2025-06-04T17:28:45Z","abstract_excerpt":"A parametrized convex function depends on a variable and a parameter, and is convex in the variable for any valid value of the parameter. Such functions can be used to specify parametrized convex optimization problems, i.e., a convex optimization family, in domain specific languages for convex optimization. In this paper we address the problem of fitting a parametrized convex function that is compatible with disciplined programming, to some given data. This allows us to fit a function arising in a convex optimization formulation directly to observed or simulated data. We demonstrate our open-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04183","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/2506.04183/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":"2506.04183","created_at":"2026-07-05T11:15:58.494072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04183v1","created_at":"2026-07-05T11:15:58.494072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04183","created_at":"2026-07-05T11:15:58.494072+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XLD6UQJVOGC","created_at":"2026-07-05T11:15:58.494072+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XLD6UQJVOGCQ4MM","created_at":"2026-07-05T11:15:58.494072+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XLD6UQJ","created_at":"2026-07-05T11:15:58.494072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05840","citing_title":"Amortized Nonlinear Model Predictive Control","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2601.12334","citing_title":"Worst-case Nonlinear Regression with Error Bounds","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22355","citing_title":"SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05640","citing_title":"Parametric Nonconvex Optimization via Convex Surrogates","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04722","citing_title":"Exact Dual Geometry of SOC-ICNN Value Functions","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS","json":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS.json","graph_json":"https://pith.science/api/pith-number/7XLD6UQJVOGCQ4MM47O26WTOLS/graph.json","events_json":"https://pith.science/api/pith-number/7XLD6UQJVOGCQ4MM47O26WTOLS/events.json","paper":"https://pith.science/paper/7XLD6UQJ"},"agent_actions":{"view_html":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS","download_json":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS.json","view_paper":"https://pith.science/paper/7XLD6UQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04183&json=true","fetch_graph":"https://pith.science/api/pith-number/7XLD6UQJVOGCQ4MM47O26WTOLS/graph.json","fetch_events":"https://pith.science/api/pith-number/7XLD6UQJVOGCQ4MM47O26WTOLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS/action/storage_attestation","attest_author":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS/action/author_attestation","sign_citation":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS/action/citation_signature","submit_replication":"https://pith.science/pith/7XLD6UQJVOGCQ4MM47O26WTOLS/action/replication_record"}},"created_at":"2026-07-05T11:15:58.494072+00:00","updated_at":"2026-07-05T11:15:58.494072+00:00"}