{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CGVATLWXTBCASMS4DAFVB4CIIS","short_pith_number":"pith:CGVATLWX","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"},"canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","source":{"kind":"arxiv","id":"1103.3284","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3284","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3284v3","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3284","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGVATLWXTBCA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGVATLWXTBCASMS4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGVATLWX","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CGVATLWXTBCASMS4DAFVB4CIIS","target":"record","payload":{"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"},"canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","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"},"source_kind":"arxiv","source_id":"1103.3284","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"maBr1NrmUNbqMTZkqkZs6KYA4rruO9ZsyWqa8ztzzEyrCZLhM0FaOjDAGHGoqnCiszwZUfyZJko8q1EcyeVbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:35:00.643474Z"},"content_sha256":"41887d9f0a3b816fd0ccb2162bd3d0d963f0c574ba3c3a42d00297579a320aa1","schema_version":"1.0","event_id":"sha256:41887d9f0a3b816fd0ccb2162bd3d0d963f0c574ba3c3a42d00297579a320aa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CGVATLWXTBCASMS4DAFVB4CIIS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYxor9j35iUMH3LqZBkg7GnNgxqbEmtzcFDj1APwRIHN8VRTlKQiBcA25PGZHyTqrOwl50qKQY2HJoC2Uqh1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:35:00.644211Z"},"content_sha256":"c13900d0ae73c2b62580bd7fa6035dd578ecbe4c41ca95daf7154d1a604314af","schema_version":"1.0","event_id":"sha256:c13900d0ae73c2b62580bd7fa6035dd578ecbe4c41ca95daf7154d1a604314af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/bundle.json","state_url":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGVATLWXTBCASMS4DAFVB4CIIS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T06:35:00Z","links":{"resolver":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS","bundle":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/bundle.json","state":"https://pith.science/pith/CGVATLWXTBCASMS4DAFVB4CIIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGVATLWXTBCASMS4DAFVB4CIIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CGVATLWXTBCASMS4DAFVB4CIIS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07e7ed6f1f45c89a6b3e1adcff875d5d2b6c0a6067ca653a340143c218658188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-16T20:05:36Z","title_canon_sha256":"445aa7fe1538745a02a33e093f6380448016cb307ff4a05abce51b1bd542c7e3"},"schema_version":"1.0","source":{"id":"1103.3284","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3284","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3284v3","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3284","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGVATLWXTBCA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGVATLWXTBCASMS4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGVATLWX","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:c13900d0ae73c2b62580bd7fa6035dd578ecbe4c41ca95daf7154d1a604314af","target":"graph","created_at":"2026-05-18T03:42:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jean-Bernard Lasserre (LAAS)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-16T20:05:36Z","title":"Inverse polynomial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3284","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:41887d9f0a3b816fd0ccb2162bd3d0d963f0c574ba3c3a42d00297579a320aa1","target":"record","created_at":"2026-05-18T03:42:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07e7ed6f1f45c89a6b3e1adcff875d5d2b6c0a6067ca653a340143c218658188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-16T20:05:36Z","title_canon_sha256":"445aa7fe1538745a02a33e093f6380448016cb307ff4a05abce51b1bd542c7e3"},"schema_version":"1.0","source":{"id":"1103.3284","kind":"arxiv","version":3}},"canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11aa09aed7984409325c180b50f04844a387a540dbff5578f36e8b7ded6dc96d","first_computed_at":"2026-05-18T03:42:32.365107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:32.365107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2kXFMOx8AbBj7aTVi+IgZCljHH374L/kHxGjIani+SheUufVktt+hc8Wovgh7j6xVXqNeVV06Dn3t/z/wWyrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:32.365601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3284","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41887d9f0a3b816fd0ccb2162bd3d0d963f0c574ba3c3a42d00297579a320aa1","sha256:c13900d0ae73c2b62580bd7fa6035dd578ecbe4c41ca95daf7154d1a604314af"],"state_sha256":"684539e718859eac10afbbc707d2c07f70a126b4ba3ab67f584a5b996d06ce18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ameNZpBT8Ru5H77VSGcBlWi7zFq3juIl1lLdtfuASqAm2vCqAIKDY+43PeiytjsmB/I1QpBlmXAUK+B9rSHUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:35:00.647449Z","bundle_sha256":"c11d48c4190e65786d22766edd318cc17cfaa479e1ed98fac12c0646e8cc263e"}}