{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MKH3ACI5RUPDLAAQCNFYRBBHM","short_pith_number":"pith:2MKH3ACI","schema_version":"1.0","canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","source":{"kind":"arxiv","id":"1401.2305","version":1},"attestation_state":"computed","paper":{"title":"Semi-infinite optimization with sums of exponentials via polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bogdan C. Sicleru, Bogdan Dumitrescu, Florin Avram","submitted_at":"2014-01-10T12:26:19Z","abstract_excerpt":"We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by low-degree polynomials. Thus, the constraints can be approximated with polynomial inequalities that can be implemented with linear matrix inequalities. Convexity is preserved, but the problem has now a finite number of constraints. We show how to take advantage of the properties of the exponential function in order to build quickly accurate approximations. The pr"},"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":"1401.2305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-10T12:26:19Z","cross_cats_sorted":[],"title_canon_sha256":"9ba79b78377acb41398396d6c0ede219faa6a763c531c637f705ea31b2b8e4d8","abstract_canon_sha256":"1a8382dfcfe5181af09f3827d174ec1aa4b6f75acc73ab8b949e15f8d4e70427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.685678Z","signature_b64":"JnbBlljQnIAg8Z/WT+ORlmpaNeQxKgF2zfDZcGCN6+VQ3S6cqUbytqeYeN5eJ+2me0XkRSptvnf0/Xzek0KwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","last_reissued_at":"2026-05-18T03:02:45.685110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.685110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-infinite optimization with sums of exponentials via polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bogdan C. Sicleru, Bogdan Dumitrescu, Florin Avram","submitted_at":"2014-01-10T12:26:19Z","abstract_excerpt":"We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by low-degree polynomials. Thus, the constraints can be approximated with polynomial inequalities that can be implemented with linear matrix inequalities. Convexity is preserved, but the problem has now a finite number of constraints. We show how to take advantage of the properties of the exponential function in order to build quickly accurate approximations. The pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2305","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":"1401.2305","created_at":"2026-05-18T03:02:45.685209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2305v1","created_at":"2026-05-18T03:02:45.685209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2305","created_at":"2026-05-18T03:02:45.685209+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MKH3ACI5RUP","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MKH3ACI5RUPDLAA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MKH3ACI","created_at":"2026-05-18T12:28:11.866339+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/2MKH3ACI5RUPDLAAQCNFYRBBHM","json":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM.json","graph_json":"https://pith.science/api/pith-number/2MKH3ACI5RUPDLAAQCNFYRBBHM/graph.json","events_json":"https://pith.science/api/pith-number/2MKH3ACI5RUPDLAAQCNFYRBBHM/events.json","paper":"https://pith.science/paper/2MKH3ACI"},"agent_actions":{"view_html":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM","download_json":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM.json","view_paper":"https://pith.science/paper/2MKH3ACI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2305&json=true","fetch_graph":"https://pith.science/api/pith-number/2MKH3ACI5RUPDLAAQCNFYRBBHM/graph.json","fetch_events":"https://pith.science/api/pith-number/2MKH3ACI5RUPDLAAQCNFYRBBHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/action/storage_attestation","attest_author":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/action/author_attestation","sign_citation":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/action/citation_signature","submit_replication":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/action/replication_record"}},"created_at":"2026-05-18T03:02:45.685209+00:00","updated_at":"2026-05-18T03:02:45.685209+00:00"}