{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IU6NF2VR3UPY3FHXYISBXRBVHR","short_pith_number":"pith:IU6NF2VR","canonical_record":{"source":{"id":"1803.10898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T02:11:12Z","cross_cats_sorted":[],"title_canon_sha256":"38182bc835c41882132da680095a0d90caf6d813de9ea88362912d41bb993b50","abstract_canon_sha256":"929aacaafb533320fb8b391ac7051dcd28225319e057cce675b0656ad47d28f3"},"schema_version":"1.0"},"canonical_sha256":"453cd2eab1dd1f8d94f7c2241bc4353c6b26011c69e3771626b9bca8c4b57637","source":{"kind":"arxiv","id":"1803.10898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10898","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10898v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10898","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"IU6NF2VR3UPY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IU6NF2VR3UPY3FHX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IU6NF2VR","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IU6NF2VR3UPY3FHXYISBXRBVHR","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T02:11:12Z","cross_cats_sorted":[],"title_canon_sha256":"38182bc835c41882132da680095a0d90caf6d813de9ea88362912d41bb993b50","abstract_canon_sha256":"929aacaafb533320fb8b391ac7051dcd28225319e057cce675b0656ad47d28f3"},"schema_version":"1.0"},"canonical_sha256":"453cd2eab1dd1f8d94f7c2241bc4353c6b26011c69e3771626b9bca8c4b57637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.120228Z","signature_b64":"CqmzvMQMmMFN949Gwl5QwdP4FN9L5mS9YNL/yL9++cFYAOPTrfCtxAymLhlizdBC3z+nneCQR37SJo+mYq5YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453cd2eab1dd1f8d94f7c2241bc4353c6b26011c69e3771626b9bca8c4b57637","last_reissued_at":"2026-05-17T23:56:25.119851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.119851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10898","source_version":2,"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-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6N8i1rvdDEWGReVM+Ux5tBXscGL+zYZrgm0NhgG5XMB2bgE2UQKlZ0NqJAkOMBWfj8nmc1UILietFXOb2+hxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:43.165127Z"},"content_sha256":"1a49a093af6d44ed51c8515b7977410145d4ae11e94636468714900884cbeea9","schema_version":"1.0","event_id":"sha256:1a49a093af6d44ed51c8515b7977410145d4ae11e94636468714900884cbeea9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IU6NF2VR3UPY3FHXYISBXRBVHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inexact Primal-Dual Algorithm for Semi-Infinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Wei, Sixiang Zhao, William B. Haskell","submitted_at":"2018-03-29T02:11:12Z","abstract_excerpt":"This paper considers an inexact primal-dual algorithm for semi-infinite programming (SIP) for which it provides general error bounds. To implement the dual variable update, we create a new prox function for nonnegative measures which turns out to be a generalization of the Kullback-Leibler divergence for probability distributions. We show that under suitable conditions on the error, this algorithm achieves an $\\mathcal{O}(1/\\sqrt{K})$ rate of convergence in terms of the optimality gap and constraint violation. We then use our general error bounds to analyze the convergence and sample complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10898","kind":"arxiv","version":2},"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-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3Eyqg6OBSAcZ6HKCEC7SrIafXAblDB/D7yQPAnrgVBGZAXXbblXgOfbPvipteZOjXv9sectP6pY6qzkzPT2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:43.165486Z"},"content_sha256":"69486442e6e23de55394fbc5382a794be77923d21f06edf4900c24d28e130323","schema_version":"1.0","event_id":"sha256:69486442e6e23de55394fbc5382a794be77923d21f06edf4900c24d28e130323"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/bundle.json","state_url":"https://pith.science/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/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-05-28T10:48:43Z","links":{"resolver":"https://pith.science/pith/IU6NF2VR3UPY3FHXYISBXRBVHR","bundle":"https://pith.science/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/bundle.json","state":"https://pith.science/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU6NF2VR3UPY3FHXYISBXRBVHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IU6NF2VR3UPY3FHXYISBXRBVHR","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":"929aacaafb533320fb8b391ac7051dcd28225319e057cce675b0656ad47d28f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T02:11:12Z","title_canon_sha256":"38182bc835c41882132da680095a0d90caf6d813de9ea88362912d41bb993b50"},"schema_version":"1.0","source":{"id":"1803.10898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10898","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10898v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10898","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"IU6NF2VR3UPY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IU6NF2VR3UPY3FHX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IU6NF2VR","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:69486442e6e23de55394fbc5382a794be77923d21f06edf4900c24d28e130323","target":"graph","created_at":"2026-05-17T23:56:25Z","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 considers an inexact primal-dual algorithm for semi-infinite programming (SIP) for which it provides general error bounds. To implement the dual variable update, we create a new prox function for nonnegative measures which turns out to be a generalization of the Kullback-Leibler divergence for probability distributions. We show that under suitable conditions on the error, this algorithm achieves an $\\mathcal{O}(1/\\sqrt{K})$ rate of convergence in terms of the optimality gap and constraint violation. We then use our general error bounds to analyze the convergence and sample complexit","authors_text":"Bo Wei, Sixiang Zhao, William B. Haskell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T02:11:12Z","title":"An Inexact Primal-Dual Algorithm for Semi-Infinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10898","kind":"arxiv","version":2},"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:1a49a093af6d44ed51c8515b7977410145d4ae11e94636468714900884cbeea9","target":"record","created_at":"2026-05-17T23:56:25Z","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":"929aacaafb533320fb8b391ac7051dcd28225319e057cce675b0656ad47d28f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T02:11:12Z","title_canon_sha256":"38182bc835c41882132da680095a0d90caf6d813de9ea88362912d41bb993b50"},"schema_version":"1.0","source":{"id":"1803.10898","kind":"arxiv","version":2}},"canonical_sha256":"453cd2eab1dd1f8d94f7c2241bc4353c6b26011c69e3771626b9bca8c4b57637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"453cd2eab1dd1f8d94f7c2241bc4353c6b26011c69e3771626b9bca8c4b57637","first_computed_at":"2026-05-17T23:56:25.119851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:25.119851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CqmzvMQMmMFN949Gwl5QwdP4FN9L5mS9YNL/yL9++cFYAOPTrfCtxAymLhlizdBC3z+nneCQR37SJo+mYq5YCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:25.120228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a49a093af6d44ed51c8515b7977410145d4ae11e94636468714900884cbeea9","sha256:69486442e6e23de55394fbc5382a794be77923d21f06edf4900c24d28e130323"],"state_sha256":"122e3a5e001d8694b5b633f4951e7cea48db287fc366c9c068173497c272a9d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USZf2atUNWd1uHaSZN2+Wu/lstn/z6Bx00/jVNCaPHDYUwlvP6x+bSTl54kAX00a/9Fv2WU8R5db0Oi9tOe8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:48:43.167803Z","bundle_sha256":"8999410bffa226e2996585a9c08ae46fcb33466174b0bfe6944017d02bb4d8b5"}}