{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CGVATLWXTBCASMS4DAFVB4CIIS","short_pith_number":"pith:CGVATLWX","schema_version":"1.0","canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","source":{"kind":"arxiv","id":"1103.3284","version":3},"attestation_state":"computed","paper":{"title":"Inverse polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (LAAS)","submitted_at":"2011-03-16T20:05:36Z","abstract_excerpt":"We consider the inverse optimization problem associated with the polynomial program f^*=\\min \\{f(x): x\\in K\\}$ and a given current feasible solution $y\\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution. That is, we compute a polynomial $\\tilde{f}$ (which may be of same degree as $f$ if desired) with the following properties: (a) $y$ is a global minimizer of $\\tilde{f}$ on $K$ with a Putinar's certificate with an a priori degree bound $d$ fixed, and (b), $\\tilde{f}$ minimizes $\\Vert f-\\tilde{f}\\Vert$ (which can be the $\\ell_1$, $\\ell_2$ or $\\ell_\\infty$-norm"},"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":"1103.3284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-16T20:05:36Z","cross_cats_sorted":[],"title_canon_sha256":"445aa7fe1538745a02a33e093f6380448016cb307ff4a05abce51b1bd542c7e3","abstract_canon_sha256":"07e7ed6f1f45c89a6b3e1adcff875d5d2b6c0a6067ca653a340143c218658188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:32.365601Z","signature_b64":"2kXFMOx8AbBj7aTVi+IgZCljHH374L/kHxGjIani+SheUufVktt+hc8Wovgh7j6xVXqNeVV06Dn3t/z/wWyrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","last_reissued_at":"2026-05-18T03:42:32.365107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:32.365107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (LAAS)","submitted_at":"2011-03-16T20:05:36Z","abstract_excerpt":"We consider the inverse optimization problem associated with the polynomial program f^*=\\min \\{f(x): x\\in K\\}$ and a given current feasible solution $y\\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution. That is, we compute a polynomial $\\tilde{f}$ (which may be of same degree as $f$ if desired) with the following properties: (a) $y$ is a global minimizer of $\\tilde{f}$ on $K$ with a Putinar's certificate with an a priori degree bound $d$ fixed, and (b), $\\tilde{f}$ minimizes $\\Vert f-\\tilde{f}\\Vert$ (which can be the $\\ell_1$, $\\ell_2$ or $\\ell_\\infty$-norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3284","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":""},"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":"1103.3284","created_at":"2026-05-18T03:42:32.365184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3284v3","created_at":"2026-05-18T03:42:32.365184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3284","created_at":"2026-05-18T03:42:32.365184+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGVATLWXTBCA","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGVATLWXTBCASMS4","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGVATLWX","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS","json":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS.json","graph_json":"https://pith.science/api/pith-number/CGVATLWXTBCASMS4DAFVB4CIIS/graph.json","events_json":"https://pith.science/api/pith-number/CGVATLWXTBCASMS4DAFVB4CIIS/events.json","paper":"https://pith.science/paper/CGVATLWX"},"agent_actions":{"view_html":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS","download_json":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS.json","view_paper":"https://pith.science/paper/CGVATLWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3284&json=true","fetch_graph":"https://pith.science/api/pith-number/CGVATLWXTBCASMS4DAFVB4CIIS/graph.json","fetch_events":"https://pith.science/api/pith-number/CGVATLWXTBCASMS4DAFVB4CIIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/action/storage_attestation","attest_author":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/action/author_attestation","sign_citation":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/action/citation_signature","submit_replication":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/action/replication_record"}},"created_at":"2026-05-18T03:42:32.365184+00:00","updated_at":"2026-05-18T03:42:32.365184+00:00"}