{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IJZKONMKD3TGCVXAZSIMOH4WZY","short_pith_number":"pith:IJZKONMK","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"},"canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","source":{"kind":"arxiv","id":"2403.08966","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.08966","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.08966v8","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08966","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"IJZKONMKD3TG","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"IJZKONMKD3TGCVXA","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"IJZKONMK","created_at":"2026-05-20T00:04:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IJZKONMKD3TGCVXAZSIMOH4WZY","target":"record","payload":{"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"},"canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","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"},"source_kind":"arxiv","source_id":"2403.08966","source_version":8,"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-20T00:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1I5eE1OwrzeFTXPWOYgdUXJe7ShtpVoIySJLhRlK5rPEcwHIpnanLmfZxp5+876NT5qsm9BJMMN6fN5w6j1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:41:07.179822Z"},"content_sha256":"145723308329784e92556d643fe1de6d2514aa6655c645864c4ed95d61fd3b8e","schema_version":"1.0","event_id":"sha256:145723308329784e92556d643fe1de6d2514aa6655c645864c4ed95d61fd3b8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IJZKONMKD3TGCVXAZSIMOH4WZY","target":"graph","payload":{"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"},"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-20T00:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJw9HllfYVmwqzqs/73j4MOm7Pc54rySSUjYQHtT0lQRGr6FZRESJqLTzF5lhsqRDkGbQq5vAT7Tu6ZexJ8HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:41:07.180590Z"},"content_sha256":"ae66fa1a1920c19ca9248137eab786a0bcfadaa04dd9cde51bec76f51ec1493b","schema_version":"1.0","event_id":"sha256:ae66fa1a1920c19ca9248137eab786a0bcfadaa04dd9cde51bec76f51ec1493b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/bundle.json","state_url":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/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-26T08:41:07Z","links":{"resolver":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY","bundle":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/bundle.json","state":"https://pith.science/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJZKONMKD3TGCVXAZSIMOH4WZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IJZKONMKD3TGCVXAZSIMOH4WZY","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":"f73d96c4a54bea032110380b7c3a2c702badf6914a111ca3b00fb2e472f5762c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-13T21:12:24Z","title_canon_sha256":"2074cf614dc3a9644b112cde2a1a87fd4140d0cc63d6523c6d96027ecf495f3d"},"schema_version":"1.0","source":{"id":"2403.08966","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.08966","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.08966v8","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08966","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"IJZKONMKD3TG","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"IJZKONMKD3TGCVXA","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"IJZKONMK","created_at":"2026-05-20T00:04:04Z"}],"graph_snapshots":[{"event_id":"sha256:ae66fa1a1920c19ca9248137eab786a0bcfadaa04dd9cde51bec76f51ec1493b","target":"graph","created_at":"2026-05-20T00:04:04Z","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/2403.08966/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jian Hu, Ming Gao, Shixin Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-13T21:12:24Z","title":"Minimizing Upper Confidence Bounds: A Data-Driven Framework for Stochastic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08966","kind":"arxiv","version":8},"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:145723308329784e92556d643fe1de6d2514aa6655c645864c4ed95d61fd3b8e","target":"record","created_at":"2026-05-20T00:04:04Z","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":"f73d96c4a54bea032110380b7c3a2c702badf6914a111ca3b00fb2e472f5762c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-13T21:12:24Z","title_canon_sha256":"2074cf614dc3a9644b112cde2a1a87fd4140d0cc63d6523c6d96027ecf495f3d"},"schema_version":"1.0","source":{"id":"2403.08966","kind":"arxiv","version":8}},"canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4272a7358a1ee66156e0cc90c71f96ce1822abca5bf20a3f53905027f6284cb4","first_computed_at":"2026-05-20T00:04:04.197906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:04.197906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/vKRu62RbnTxwJgs7/UStPc7P+Xuf+iygWLmGGfzRl3SfHTHG4+aa+gVUPuUnCNdksQ+CZhi01n/TTqqayvAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:04.199039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.08966","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:145723308329784e92556d643fe1de6d2514aa6655c645864c4ed95d61fd3b8e","sha256:ae66fa1a1920c19ca9248137eab786a0bcfadaa04dd9cde51bec76f51ec1493b"],"state_sha256":"0964d580aba7e7e58400391ffcdd69756e4363157ac6432eae9e765c0255830b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BO/Q+gO2wsObCOl6pVCCzZF6h2DCToXzMQjqb9MAYVqBObF0Ljqc/O85gRzKxLeVYC9F9yhHpDnkmv/TlUPgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:41:07.184229Z","bundle_sha256":"e9b73833d8ad9c372ef523c5509f846c8aa990b622fff08d6ae55b5fa3f0c891"}}