{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BGMJPD4SQKBQZZ26VGNIF4VJXP","short_pith_number":"pith:BGMJPD4S","schema_version":"1.0","canonical_sha256":"0998978f9282830ce75ea99a82f2a9bbc6ea94d40540413b42d8903040a7e48c","source":{"kind":"arxiv","id":"1803.04673","version":1},"attestation_state":"computed","paper":{"title":"Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco A. L\\'opez, Michel Volle, Miguel A. Goberna, Nguyen Dinh","submitted_at":"2018-03-13T08:09:45Z","abstract_excerpt":"We introduce a robust optimization model consisting in a family of perturbation functions giving rise to certain pairs of dual optimization problems in which the dual variable depends on the uncertainty parameter. The interest of our approach is illustrated by some examples, including uncertain conic optimization and infinite optimization via discretization. The main results characterize desirable robust duality relations (as robust zero-duality gap) by formulas involving the epsilon-minima or the epsilon-subdifferentials of the objective function. The two extreme cases, namely, the usual pert"},"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":"1803.04673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-13T08:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"5eaded68708fbeb2eb6ae3d1fd120fdb85c7e2b20e8e8879a6f47d169475ea3e","abstract_canon_sha256":"fff05eadac746232b19c7be1e1985280a7187368195c26d44ac9ae2b52da0d48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.195864Z","signature_b64":"WdB5jx2bF62FTlpHwjRIBuEIWcUzkYPiBhv2DoqDlWuVPkVdZGned88n8+AdV4KuGBoAqMC2fYzFt6nzPXp2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0998978f9282830ce75ea99a82f2a9bbc6ea94d40540413b42d8903040a7e48c","last_reissued_at":"2026-05-18T00:21:18.193695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.193695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco A. L\\'opez, Michel Volle, Miguel A. Goberna, Nguyen Dinh","submitted_at":"2018-03-13T08:09:45Z","abstract_excerpt":"We introduce a robust optimization model consisting in a family of perturbation functions giving rise to certain pairs of dual optimization problems in which the dual variable depends on the uncertainty parameter. The interest of our approach is illustrated by some examples, including uncertain conic optimization and infinite optimization via discretization. The main results characterize desirable robust duality relations (as robust zero-duality gap) by formulas involving the epsilon-minima or the epsilon-subdifferentials of the objective function. The two extreme cases, namely, the usual pert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04673","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":""},"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":"1803.04673","created_at":"2026-05-18T00:21:18.195178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04673v1","created_at":"2026-05-18T00:21:18.195178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04673","created_at":"2026-05-18T00:21:18.195178+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGMJPD4SQKBQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGMJPD4SQKBQZZ26","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGMJPD4S","created_at":"2026-05-18T12:32:16.446611+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/BGMJPD4SQKBQZZ26VGNIF4VJXP","json":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP.json","graph_json":"https://pith.science/api/pith-number/BGMJPD4SQKBQZZ26VGNIF4VJXP/graph.json","events_json":"https://pith.science/api/pith-number/BGMJPD4SQKBQZZ26VGNIF4VJXP/events.json","paper":"https://pith.science/paper/BGMJPD4S"},"agent_actions":{"view_html":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP","download_json":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP.json","view_paper":"https://pith.science/paper/BGMJPD4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04673&json=true","fetch_graph":"https://pith.science/api/pith-number/BGMJPD4SQKBQZZ26VGNIF4VJXP/graph.json","fetch_events":"https://pith.science/api/pith-number/BGMJPD4SQKBQZZ26VGNIF4VJXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP/action/storage_attestation","attest_author":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP/action/author_attestation","sign_citation":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP/action/citation_signature","submit_replication":"https://pith.science/pith/BGMJPD4SQKBQZZ26VGNIF4VJXP/action/replication_record"}},"created_at":"2026-05-18T00:21:18.195178+00:00","updated_at":"2026-05-18T00:21:18.195178+00:00"}