{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DHDMSLLMOCQR6UWRD5AUSEA26U","short_pith_number":"pith:DHDMSLLM","schema_version":"1.0","canonical_sha256":"19c6c92d6c70a11f52d11f4149101af53a590dfc9ba7a6cc740b742d70f889a8","source":{"kind":"arxiv","id":"1912.01763","version":1},"attestation_state":"computed","paper":{"title":"A note on semi-infinite program bounding methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitri J. Papageorgiou, Francisco Trespalacios, Stuart M. Harwood","submitted_at":"2019-12-04T01:41:46Z","abstract_excerpt":"Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blankenship and Falk. \"Infinitely constrained optimization problems.\" Journal of Optimization Theory and Applications 19.2 (1976): 261-281.), a sequence of lower bounds which converges to the optimal objective value may be obtained with specially constructed finite approximations of the constraint set. In (Mitsos. \"Global optimization of semi-infinite programs via restriction of the right-hand side.\" Optimization 60.10-1"},"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":"1912.01763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-04T01:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"f1bc73a741c2247a3e523ed1da330822882bd14df89f417a1451233b4b2a7574","abstract_canon_sha256":"85a783b33338fd53dce71634bf7192285e405cd80918cb88ed224f9517bfde52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:15.815776Z","signature_b64":"z3kvZBd3b3W0/fwDt8JRmY9GmeUFi33PIzmHGiLB4dG4MfdeNZ/36n+2I3XJ3dJTpB/pLbhWUx+2z/cgGB9OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c6c92d6c70a11f52d11f4149101af53a590dfc9ba7a6cc740b742d70f889a8","last_reissued_at":"2026-07-05T01:36:15.815414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:15.815414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on semi-infinite program bounding methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitri J. Papageorgiou, Francisco Trespalacios, Stuart M. Harwood","submitted_at":"2019-12-04T01:41:46Z","abstract_excerpt":"Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blankenship and Falk. \"Infinitely constrained optimization problems.\" Journal of Optimization Theory and Applications 19.2 (1976): 261-281.), a sequence of lower bounds which converges to the optimal objective value may be obtained with specially constructed finite approximations of the constraint set. In (Mitsos. \"Global optimization of semi-infinite programs via restriction of the right-hand side.\" Optimization 60.10-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01763","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.01763/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1912.01763","created_at":"2026-07-05T01:36:15.815475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.01763v1","created_at":"2026-07-05T01:36:15.815475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01763","created_at":"2026-07-05T01:36:15.815475+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHDMSLLMOCQR","created_at":"2026-07-05T01:36:15.815475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHDMSLLMOCQR6UWR","created_at":"2026-07-05T01:36:15.815475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHDMSLLM","created_at":"2026-07-05T01:36:15.815475+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/DHDMSLLMOCQR6UWRD5AUSEA26U","json":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U.json","graph_json":"https://pith.science/api/pith-number/DHDMSLLMOCQR6UWRD5AUSEA26U/graph.json","events_json":"https://pith.science/api/pith-number/DHDMSLLMOCQR6UWRD5AUSEA26U/events.json","paper":"https://pith.science/paper/DHDMSLLM"},"agent_actions":{"view_html":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U","download_json":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U.json","view_paper":"https://pith.science/paper/DHDMSLLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.01763&json=true","fetch_graph":"https://pith.science/api/pith-number/DHDMSLLMOCQR6UWRD5AUSEA26U/graph.json","fetch_events":"https://pith.science/api/pith-number/DHDMSLLMOCQR6UWRD5AUSEA26U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U/action/storage_attestation","attest_author":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U/action/author_attestation","sign_citation":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U/action/citation_signature","submit_replication":"https://pith.science/pith/DHDMSLLMOCQR6UWRD5AUSEA26U/action/replication_record"}},"created_at":"2026-07-05T01:36:15.815475+00:00","updated_at":"2026-07-05T01:36:15.815475+00:00"}