{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WLT4NPD7NPEJS73JWGS25NYMJK","short_pith_number":"pith:WLT4NPD7","canonical_record":{"source":{"id":"1912.01075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-02T21:02:28Z","cross_cats_sorted":[],"title_canon_sha256":"d2600ba05935d05a3eab05788c6d039b28b48aa76abf976eddc35a0a01da8bca","abstract_canon_sha256":"5ff7a6c7a67750c4b7dd23a98fbac7e0c4d2f02cf3db731ddd4cc6a81f54674d"},"schema_version":"1.0"},"canonical_sha256":"b2e7c6bc7f6bc8997f69b1a5aeb70c4ab266323838981c5b6821f586969d58e6","source":{"kind":"arxiv","id":"1912.01075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.01075","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1912.01075v1","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01075","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"WLT4NPD7NPEJ","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"WLT4NPD7NPEJS73J","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"WLT4NPD7","created_at":"2026-07-05T00:23:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WLT4NPD7NPEJS73JWGS25NYMJK","target":"record","payload":{"canonical_record":{"source":{"id":"1912.01075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-02T21:02:28Z","cross_cats_sorted":[],"title_canon_sha256":"d2600ba05935d05a3eab05788c6d039b28b48aa76abf976eddc35a0a01da8bca","abstract_canon_sha256":"5ff7a6c7a67750c4b7dd23a98fbac7e0c4d2f02cf3db731ddd4cc6a81f54674d"},"schema_version":"1.0"},"canonical_sha256":"b2e7c6bc7f6bc8997f69b1a5aeb70c4ab266323838981c5b6821f586969d58e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:26.591435Z","signature_b64":"2mbPKU0NXaJLYpKCssLRV1bN2WGwO5Ekq6+Nc+Juz/VOVtJ+AdwBY2WGKbdLZXYuuEhwnbtRLT07f5KKzn7eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e7c6bc7f6bc8997f69b1a5aeb70c4ab266323838981c5b6821f586969d58e6","last_reissued_at":"2026-07-05T00:23:26.591007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:26.591007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.01075","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-07-05T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BcGI9TU1wu8KzfD2owUcA0iW1MB2MeSwK2BqUBElaLNRPJIx9ZFodYgRGGKUO3npMQkRqTq3aAxBQrI3WYVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:16:42.483056Z"},"content_sha256":"3c039900a9ba7ca893489d6f06acbd9cba79e7827af64c3d63e60b0b559af2cf","schema_version":"1.0","event_id":"sha256:3c039900a9ba7ca893489d6f06acbd9cba79e7827af64c3d63e60b0b559af2cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WLT4NPD7NPEJS73JWGS25NYMJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on generalized semi-infinite program bounding methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stuart M. Harwood","submitted_at":"2019-12-02T21:02:28Z","abstract_excerpt":"Generalized semi-infinite programs (GSIP) are a class of mathematical optimization problems that generalize semi-infinite programs, which have a finite number of decision variables and infinite constraints. Mitsos et al. (Mitsos and Tsoukalas. \"Global optimization of generalized semi-infinite programs via restriction of the right hand side.\" Journal of Global Optimization 61.1 (2015): 1-17.) present a method for global optimization of GSIP. This method involves a lower bounding method, and they claim that these lower bounds converge to the optimal objective value of the GSIP. A counterexample "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.01075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icNfiUQh+jt6AN7Yjn42athlHOxWmkD2kLwsbZXVOUWmDPLgQlR1sxhYM8UEczyiJuLmH4VBJjx3yilXWbHQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:16:42.483441Z"},"content_sha256":"dca4141efaf48e3a774170987437a26d600281c7d7395b88d64589bc9d9b1568","schema_version":"1.0","event_id":"sha256:dca4141efaf48e3a774170987437a26d600281c7d7395b88d64589bc9d9b1568"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLT4NPD7NPEJS73JWGS25NYMJK/bundle.json","state_url":"https://pith.science/pith/WLT4NPD7NPEJS73JWGS25NYMJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLT4NPD7NPEJS73JWGS25NYMJK/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-07-10T12:16:42Z","links":{"resolver":"https://pith.science/pith/WLT4NPD7NPEJS73JWGS25NYMJK","bundle":"https://pith.science/pith/WLT4NPD7NPEJS73JWGS25NYMJK/bundle.json","state":"https://pith.science/pith/WLT4NPD7NPEJS73JWGS25NYMJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLT4NPD7NPEJS73JWGS25NYMJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WLT4NPD7NPEJS73JWGS25NYMJK","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":"5ff7a6c7a67750c4b7dd23a98fbac7e0c4d2f02cf3db731ddd4cc6a81f54674d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-02T21:02:28Z","title_canon_sha256":"d2600ba05935d05a3eab05788c6d039b28b48aa76abf976eddc35a0a01da8bca"},"schema_version":"1.0","source":{"id":"1912.01075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.01075","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1912.01075v1","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01075","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"WLT4NPD7NPEJ","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"WLT4NPD7NPEJS73J","created_at":"2026-07-05T00:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"WLT4NPD7","created_at":"2026-07-05T00:23:26Z"}],"graph_snapshots":[{"event_id":"sha256:dca4141efaf48e3a774170987437a26d600281c7d7395b88d64589bc9d9b1568","target":"graph","created_at":"2026-07-05T00:23:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.01075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generalized semi-infinite programs (GSIP) are a class of mathematical optimization problems that generalize semi-infinite programs, which have a finite number of decision variables and infinite constraints. Mitsos et al. (Mitsos and Tsoukalas. \"Global optimization of generalized semi-infinite programs via restriction of the right hand side.\" Journal of Global Optimization 61.1 (2015): 1-17.) present a method for global optimization of GSIP. This method involves a lower bounding method, and they claim that these lower bounds converge to the optimal objective value of the GSIP. A counterexample ","authors_text":"Stuart M. Harwood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-02T21:02:28Z","title":"A note on generalized semi-infinite program bounding methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01075","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:3c039900a9ba7ca893489d6f06acbd9cba79e7827af64c3d63e60b0b559af2cf","target":"record","created_at":"2026-07-05T00:23:26Z","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":"5ff7a6c7a67750c4b7dd23a98fbac7e0c4d2f02cf3db731ddd4cc6a81f54674d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-02T21:02:28Z","title_canon_sha256":"d2600ba05935d05a3eab05788c6d039b28b48aa76abf976eddc35a0a01da8bca"},"schema_version":"1.0","source":{"id":"1912.01075","kind":"arxiv","version":1}},"canonical_sha256":"b2e7c6bc7f6bc8997f69b1a5aeb70c4ab266323838981c5b6821f586969d58e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2e7c6bc7f6bc8997f69b1a5aeb70c4ab266323838981c5b6821f586969d58e6","first_computed_at":"2026-07-05T00:23:26.591007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:23:26.591007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mbPKU0NXaJLYpKCssLRV1bN2WGwO5Ekq6+Nc+Juz/VOVtJ+AdwBY2WGKbdLZXYuuEhwnbtRLT07f5KKzn7eAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:23:26.591435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.01075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c039900a9ba7ca893489d6f06acbd9cba79e7827af64c3d63e60b0b559af2cf","sha256:dca4141efaf48e3a774170987437a26d600281c7d7395b88d64589bc9d9b1568"],"state_sha256":"41e886f604fc1d9a3fc6653004ba8e1c29a0f0ba279fd05d17e5e7f38ab8fc61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eK4RntAryAdfdu6XfHmVz14NXzQp/bfUBCSf6O64x5J2++qAEavskb0XJncacenJvpAdf6rjmYSJkwkyXxcdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T12:16:42.485267Z","bundle_sha256":"184d97be4eef92a363460622a85103e514df567c768a16353ac36ae8e497b996"}}