{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PRAZJHBQU2C5SU3RUNX27RT6PK","short_pith_number":"pith:PRAZJHBQ","canonical_record":{"source":{"id":"1306.1875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-08T04:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"e5619e148161b0f365bddfd82159385927cd021dc34aa0729df10bbed32da3e6","abstract_canon_sha256":"e2b888c571b3eb7fb3150d2b76f3429036372e59373edf186443a3407280497e"},"schema_version":"1.0"},"canonical_sha256":"7c41949c30a685d95371a36fafc67e7a93712d1fab83265ce2769b2ad7ef30da","source":{"kind":"arxiv","id":"1306.1875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1875","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1875v1","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1875","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRAZJHBQU2C5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PRAZJHBQU2C5SU3R","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PRAZJHBQ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PRAZJHBQU2C5SU3RUNX27RT6PK","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-08T04:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"e5619e148161b0f365bddfd82159385927cd021dc34aa0729df10bbed32da3e6","abstract_canon_sha256":"e2b888c571b3eb7fb3150d2b76f3429036372e59373edf186443a3407280497e"},"schema_version":"1.0"},"canonical_sha256":"7c41949c30a685d95371a36fafc67e7a93712d1fab83265ce2769b2ad7ef30da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.026096Z","signature_b64":"OFWYC4FlR0dtmmZ1+DHfot0iOVvTa3xD/osfq6SwKWnQiTqAUEGOAxjj2De5hl5T9TTkknNweRTEIoB3Ox3lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c41949c30a685d95371a36fafc67e7a93712d1fab83265ce2769b2ad7ef30da","last_reissued_at":"2026-05-18T03:21:23.025255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.025255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1875","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:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7qCcWoo7Wn20bHW7qTI/eDY9Rom+U8xgYwbIf1HCa246lYlRWydJGw8wc7Jb+EqCH7u/pQYmxnPNk9zaSJaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:15.101174Z"},"content_sha256":"ec33232407244cd8836469417beaa5c6873c7fb31f9f7a3ec6441f79467d9e7f","schema_version":"1.0","event_id":"sha256:ec33232407244cd8836469417beaa5c6873c7fb31f9f7a3ec6441f79467d9e7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PRAZJHBQU2C5SU3RUNX27RT6PK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite relaxations for semi-infinite polynomial programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Feng Guo, Li Wang","submitted_at":"2013-06-08T04:22:28Z","abstract_excerpt":"This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints. Then we propose an exchange algorithm with SDP relaxations to solve SIPP problems with compact index set. At last, we extend the proposed method to SIPP problems with noncompact index set via homogenization. Numerical results show that the algorithm is efficient in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1875","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:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yYP49TbpFDh5RoGgzbymcgxmyKlpGoj5Qe2KWTQKCj/FwnrytVL/BTk9bKigo7CvuP8AbjqXQjOliVN2OukCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:15.101907Z"},"content_sha256":"a045fcf1a53a752183f44fbceadbdc96a3e481fd2dbbc21b8b28574ba6b9ce77","schema_version":"1.0","event_id":"sha256:a045fcf1a53a752183f44fbceadbdc96a3e481fd2dbbc21b8b28574ba6b9ce77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/bundle.json","state_url":"https://pith.science/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/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-08T06:24:15Z","links":{"resolver":"https://pith.science/pith/PRAZJHBQU2C5SU3RUNX27RT6PK","bundle":"https://pith.science/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/bundle.json","state":"https://pith.science/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRAZJHBQU2C5SU3RUNX27RT6PK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PRAZJHBQU2C5SU3RUNX27RT6PK","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":"e2b888c571b3eb7fb3150d2b76f3429036372e59373edf186443a3407280497e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-08T04:22:28Z","title_canon_sha256":"e5619e148161b0f365bddfd82159385927cd021dc34aa0729df10bbed32da3e6"},"schema_version":"1.0","source":{"id":"1306.1875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1875","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1875v1","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1875","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRAZJHBQU2C5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PRAZJHBQU2C5SU3R","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PRAZJHBQ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a045fcf1a53a752183f44fbceadbdc96a3e481fd2dbbc21b8b28574ba6b9ce77","target":"graph","created_at":"2026-05-18T03:21:23Z","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":"This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints. Then we propose an exchange algorithm with SDP relaxations to solve SIPP problems with compact index set. At last, we extend the proposed method to SIPP problems with noncompact index set via homogenization. Numerical results show that the algorithm is efficient in practice.","authors_text":"Feng Guo, Li Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-08T04:22:28Z","title":"Semidefinite relaxations for semi-infinite polynomial programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1875","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:ec33232407244cd8836469417beaa5c6873c7fb31f9f7a3ec6441f79467d9e7f","target":"record","created_at":"2026-05-18T03:21:23Z","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":"e2b888c571b3eb7fb3150d2b76f3429036372e59373edf186443a3407280497e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-08T04:22:28Z","title_canon_sha256":"e5619e148161b0f365bddfd82159385927cd021dc34aa0729df10bbed32da3e6"},"schema_version":"1.0","source":{"id":"1306.1875","kind":"arxiv","version":1}},"canonical_sha256":"7c41949c30a685d95371a36fafc67e7a93712d1fab83265ce2769b2ad7ef30da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c41949c30a685d95371a36fafc67e7a93712d1fab83265ce2769b2ad7ef30da","first_computed_at":"2026-05-18T03:21:23.025255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.025255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFWYC4FlR0dtmmZ1+DHfot0iOVvTa3xD/osfq6SwKWnQiTqAUEGOAxjj2De5hl5T9TTkknNweRTEIoB3Ox3lAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.026096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec33232407244cd8836469417beaa5c6873c7fb31f9f7a3ec6441f79467d9e7f","sha256:a045fcf1a53a752183f44fbceadbdc96a3e481fd2dbbc21b8b28574ba6b9ce77"],"state_sha256":"8ad341443524ee2fd00b8407a3a58302bcb7909d883ff37a5c371d9cd69e6f02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6N3HTH6mZ9DouToersr8n4zhsO+IsLgbEHMfuZtl986rKVWH4wGJXRjwV2cstoGMbnxYlmMVh1RsSC5C3YF/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:24:15.106613Z","bundle_sha256":"d8e82b4c1b96aa457277686246a9991c6d35c4517d549c9ef020d018dfdf43b6"}}