{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MKH3ACI5RUPDLAAQCNFYRBBHM","short_pith_number":"pith:2MKH3ACI","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"},"canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","source":{"kind":"arxiv","id":"1401.2305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2305","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2305v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2305","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"2MKH3ACI5RUP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MKH3ACI5RUPDLAA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MKH3ACI","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MKH3ACI5RUPDLAAQCNFYRBBHM","target":"record","payload":{"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"},"canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","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"},"source_kind":"arxiv","source_id":"1401.2305","source_version":1,"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2WdFa2ziXJxXyy/KBLKgspmo9lOAQNEP4VM29rdFpjQwmQiIN9vkVbh6J+Vz3rkO7NxrPaWkc+Pxij7YxxyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:20:01.837943Z"},"content_sha256":"be57a5a9c94342dfea10d0ad1630cde8649dfdc86d81335000859f61fd943585","schema_version":"1.0","event_id":"sha256:be57a5a9c94342dfea10d0ad1630cde8649dfdc86d81335000859f61fd943585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MKH3ACI5RUPDLAAQCNFYRBBHM","target":"graph","payload":{"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"},"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BycqMWVspS+dyr7305kzOShqEs+gzfHHm1Amy4nWQqnJa7B+9MFIe17ScS3QRnY/3GkBQi5uZbS/VDZcWTskCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:20:01.838281Z"},"content_sha256":"94493fc8369c91117afee2ffbd1b04c84637cf81ca0741a384f35b8afec28b75","schema_version":"1.0","event_id":"sha256:94493fc8369c91117afee2ffbd1b04c84637cf81ca0741a384f35b8afec28b75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/bundle.json","state_url":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/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-28T16:20:01Z","links":{"resolver":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM","bundle":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/bundle.json","state":"https://pith.science/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MKH3ACI5RUPDLAAQCNFYRBBHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MKH3ACI5RUPDLAAQCNFYRBBHM","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":"1a8382dfcfe5181af09f3827d174ec1aa4b6f75acc73ab8b949e15f8d4e70427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-10T12:26:19Z","title_canon_sha256":"9ba79b78377acb41398396d6c0ede219faa6a763c531c637f705ea31b2b8e4d8"},"schema_version":"1.0","source":{"id":"1401.2305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2305","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2305v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2305","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"2MKH3ACI5RUP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MKH3ACI5RUPDLAA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MKH3ACI","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:94493fc8369c91117afee2ffbd1b04c84637cf81ca0741a384f35b8afec28b75","target":"graph","created_at":"2026-05-18T03:02:45Z","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 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","authors_text":"Bogdan C. Sicleru, Bogdan Dumitrescu, Florin Avram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-10T12:26:19Z","title":"Semi-infinite optimization with sums of exponentials via polynomial approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2305","kind":"arxiv","version":1},"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:be57a5a9c94342dfea10d0ad1630cde8649dfdc86d81335000859f61fd943585","target":"record","created_at":"2026-05-18T03:02:45Z","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":"1a8382dfcfe5181af09f3827d174ec1aa4b6f75acc73ab8b949e15f8d4e70427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-10T12:26:19Z","title_canon_sha256":"9ba79b78377acb41398396d6c0ede219faa6a763c531c637f705ea31b2b8e4d8"},"schema_version":"1.0","source":{"id":"1401.2305","kind":"arxiv","version":1}},"canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3147d8048ec68f1ac00809a5c44213b2f659f9156b2420300c8218f16055a81","first_computed_at":"2026-05-18T03:02:45.685110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:45.685110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnbBlljQnIAg8Z/WT+ORlmpaNeQxKgF2zfDZcGCN6+VQ3S6cqUbytqeYeN5eJ+2me0XkRSptvnf0/Xzek0KwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:45.685678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be57a5a9c94342dfea10d0ad1630cde8649dfdc86d81335000859f61fd943585","sha256:94493fc8369c91117afee2ffbd1b04c84637cf81ca0741a384f35b8afec28b75"],"state_sha256":"a81aaeeeb2da827f8085c2db1dfd3be9cd4f51b172fcb2102b51ee9f2cc67065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWDCfw3x+wofjtiDDU6XyhBsWrgIhsr/SdT7irIL+D33mApU7Y0x7nwOK+jKhCxJ/WBgsDUeYvcUeAmw0JA+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:20:01.840225Z","bundle_sha256":"3efbaa35098186bb5f444d3961b97c6e8139d2198f7c32af2f3c2e7a4ea1df97"}}