{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H2SLBTIVKH2GDAKJJAX2YZZMPC","short_pith_number":"pith:H2SLBTIV","schema_version":"1.0","canonical_sha256":"3ea4b0cd1551f4618149482fac672c7895dba8bcdab593843c18bed988be0e41","source":{"kind":"arxiv","id":"2302.06945","version":3},"attestation_state":"computed","paper":{"title":"Polynomial argmin for recovery and approximation of multivariate discontinuous functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Didier Henrion (LAAS-POP), Jean-Bernard Lasserre (LAAS-POP), Milan Korda (LAAS-POP)","submitted_at":"2023-02-14T10:02:41Z","abstract_excerpt":"We propose to approximate a (possibly discontinuous) multivariate function f (x) on a compact set by the partial minimizer arg miny p(x, y) of an appropriate polynomial p whose construction can be cast in a univariate sum of squares (SOS) framework, resulting in a highly structured convex semidefinite program. In a number of non-trivial cases (e.g. when f is a piecewise polynomial) we prove that the approximation is exact with a low-degree polynomial p. Our approach has three distinguishing features: (i) It is mesh-free and does not require the knowledge of the discontinuity locations. (ii) It"},"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":"2302.06945","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-02-14T10:02:41Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"13d7408767e3a903b24f11e7db13e2ecce2f951278de254b4dea73a30646da6c","abstract_canon_sha256":"47a985c94037e19b0dc931cfcef4c4b1a774c247b4acca6f5e9c75a42531188d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:29.004739Z","signature_b64":"tIF9uIHksSYhm1FaqlFp8NgW6MYvMO9J1jN4nE/xSVDwbx/MDqM8fn0Jsw6TIBHuWip/GIHy8o9JFFou5z3NAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea4b0cd1551f4618149482fac672c7895dba8bcdab593843c18bed988be0e41","last_reissued_at":"2026-07-05T11:40:29.004198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:29.004198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial argmin for recovery and approximation of multivariate discontinuous functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Didier Henrion (LAAS-POP), Jean-Bernard Lasserre (LAAS-POP), Milan Korda (LAAS-POP)","submitted_at":"2023-02-14T10:02:41Z","abstract_excerpt":"We propose to approximate a (possibly discontinuous) multivariate function f (x) on a compact set by the partial minimizer arg miny p(x, y) of an appropriate polynomial p whose construction can be cast in a univariate sum of squares (SOS) framework, resulting in a highly structured convex semidefinite program. In a number of non-trivial cases (e.g. when f is a piecewise polynomial) we prove that the approximation is exact with a low-degree polynomial p. Our approach has three distinguishing features: (i) It is mesh-free and does not require the knowledge of the discontinuity locations. (ii) It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06945","kind":"arxiv","version":3},"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/2302.06945/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":"2302.06945","created_at":"2026-07-05T11:40:29.004259+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06945v3","created_at":"2026-07-05T11:40:29.004259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06945","created_at":"2026-07-05T11:40:29.004259+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2SLBTIVKH2G","created_at":"2026-07-05T11:40:29.004259+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2SLBTIVKH2GDAKJ","created_at":"2026-07-05T11:40:29.004259+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2SLBTIV","created_at":"2026-07-05T11:40:29.004259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03800","citing_title":"Spectrahedral relaxations of Eulerian rigidly convex sets","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC","json":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC.json","graph_json":"https://pith.science/api/pith-number/H2SLBTIVKH2GDAKJJAX2YZZMPC/graph.json","events_json":"https://pith.science/api/pith-number/H2SLBTIVKH2GDAKJJAX2YZZMPC/events.json","paper":"https://pith.science/paper/H2SLBTIV"},"agent_actions":{"view_html":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC","download_json":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC.json","view_paper":"https://pith.science/paper/H2SLBTIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06945&json=true","fetch_graph":"https://pith.science/api/pith-number/H2SLBTIVKH2GDAKJJAX2YZZMPC/graph.json","fetch_events":"https://pith.science/api/pith-number/H2SLBTIVKH2GDAKJJAX2YZZMPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC/action/storage_attestation","attest_author":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC/action/author_attestation","sign_citation":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC/action/citation_signature","submit_replication":"https://pith.science/pith/H2SLBTIVKH2GDAKJJAX2YZZMPC/action/replication_record"}},"created_at":"2026-07-05T11:40:29.004259+00:00","updated_at":"2026-07-05T11:40:29.004259+00:00"}