{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IJZKONMKD3TGCVXAZSIMOH4WZY","short_pith_number":"pith:IJZKONMK","schema_version":"1.0","canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","source":{"kind":"arxiv","id":"2403.08966","version":8},"attestation_state":"computed","paper":{"title":"Minimizing Upper Confidence Bounds: A Data-Driven Framework for Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian Hu, Ming Gao, Shixin Liu","submitted_at":"2024-03-13T21:12:24Z","abstract_excerpt":"Stochastic programming is often challenged by epistemic uncertainty, where critical probability distributions are poorly characterized or unknown due to a lack of data. To address this, we pioneer a novel framework for stochastic programming that minimizes an upper confidence bound (UCB) on the expected random cost, acting as a robustness-seeking strategy. Our central contribution is the Average Percentile Upper Bound (APUB), a new statistical construct that serves as both a statistically rigorous upper bound for population means and an approximate risk metric for sample means. We rigorously p"},"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":"2403.08966","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-13T21:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"2074cf614dc3a9644b112cde2a1a87fd4140d0cc63d6523c6d96027ecf495f3d","abstract_canon_sha256":"f73d96c4a54bea032110380b7c3a2c702badf6914a111ca3b00fb2e472f5762c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:04.199039Z","signature_b64":"q/vKRu62RbnTxwJgs7/UStPc7P+Xuf+iygWLmGGfzRl3SfHTHG4+aa+gVUPuUnCNdksQ+CZhi01n/TTqqayvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","last_reissued_at":"2026-05-20T00:04:04.197906Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:04.197906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Upper Confidence Bounds: A Data-Driven Framework for Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian Hu, Ming Gao, Shixin Liu","submitted_at":"2024-03-13T21:12:24Z","abstract_excerpt":"Stochastic programming is often challenged by epistemic uncertainty, where critical probability distributions are poorly characterized or unknown due to a lack of data. To address this, we pioneer a novel framework for stochastic programming that minimizes an upper confidence bound (UCB) on the expected random cost, acting as a robustness-seeking strategy. Our central contribution is the Average Percentile Upper Bound (APUB), a new statistical construct that serves as both a statistically rigorous upper bound for population means and an approximate risk metric for sample means. We rigorously p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08966","kind":"arxiv","version":8},"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/2403.08966/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":"2403.08966","created_at":"2026-05-20T00:04:04.198235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.08966v8","created_at":"2026-05-20T00:04:04.198235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08966","created_at":"2026-05-20T00:04:04.198235+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJZKONMKD3TG","created_at":"2026-05-20T00:04:04.198235+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJZKONMKD3TGCVXA","created_at":"2026-05-20T00:04:04.198235+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJZKONMK","created_at":"2026-05-20T00:04:04.198235+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/IJZKONMKD3TGCVXAZSIMOH4WZY","json":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY.json","graph_json":"https://pith.science/api/pith-number/IJZKONMKD3TGCVXAZSIMOH4WZY/graph.json","events_json":"https://pith.science/api/pith-number/IJZKONMKD3TGCVXAZSIMOH4WZY/events.json","paper":"https://pith.science/paper/IJZKONMK"},"agent_actions":{"view_html":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY","download_json":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY.json","view_paper":"https://pith.science/paper/IJZKONMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.08966&json=true","fetch_graph":"https://pith.science/api/pith-number/IJZKONMKD3TGCVXAZSIMOH4WZY/graph.json","fetch_events":"https://pith.science/api/pith-number/IJZKONMKD3TGCVXAZSIMOH4WZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/action/storage_attestation","attest_author":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/action/author_attestation","sign_citation":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/action/citation_signature","submit_replication":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/action/replication_record"}},"created_at":"2026-05-20T00:04:04.198235+00:00","updated_at":"2026-05-20T00:04:04.198235+00:00"}