{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IWTR6ANJUJXHDTAQPFZN5C53UY","short_pith_number":"pith:IWTR6ANJ","canonical_record":{"source":{"id":"2403.11707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-18T12:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"f1fb0177f8241991602e81b9221ae8957a6eb55a29f3f379d678e348270feab0","abstract_canon_sha256":"3318c588557fee5d8de16cc8224837056d714908f327f6bcb15e4186f9a8c627"},"schema_version":"1.0"},"canonical_sha256":"45a71f01a9a26e71cc107972de8bbba6241adf94971d949f6931f15ef46b36eb","source":{"kind":"arxiv","id":"2403.11707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.11707","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.11707v1","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11707","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"IWTR6ANJUJXH","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_16","alias_value":"IWTR6ANJUJXHDTAQ","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_8","alias_value":"IWTR6ANJ","created_at":"2026-07-05T07:57:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IWTR6ANJUJXHDTAQPFZN5C53UY","target":"record","payload":{"canonical_record":{"source":{"id":"2403.11707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-18T12:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"f1fb0177f8241991602e81b9221ae8957a6eb55a29f3f379d678e348270feab0","abstract_canon_sha256":"3318c588557fee5d8de16cc8224837056d714908f327f6bcb15e4186f9a8c627"},"schema_version":"1.0"},"canonical_sha256":"45a71f01a9a26e71cc107972de8bbba6241adf94971d949f6931f15ef46b36eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:20.380706Z","signature_b64":"nOCsIyi0ccmcRJKd4r/irl0vWwMWqs+Si8sGSXStN8hNKRPzBYrPA1zlxEDoA60EUdsxBzUZiPk1QAitOj3rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a71f01a9a26e71cc107972de8bbba6241adf94971d949f6931f15ef46b36eb","last_reissued_at":"2026-07-05T07:57:20.380212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:20.380212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.11707","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-05T07:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxQm5yc9rSLrt38PtUxL1LdwgyZfjCv0L/shF7r/3L+Zv1OjzQYYhTdyai8BRsbBU4EyjEPMcG8GzidkbXglBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:56:43.854051Z"},"content_sha256":"9952f53c507da2d72c1b158051798fb119926b648cb5a2ab769d79c0357fcef2","schema_version":"1.0","event_id":"sha256:9952f53c507da2d72c1b158051798fb119926b648cb5a2ab769d79c0357fcef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IWTR6ANJUJXHDTAQPFZN5C53UY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantile Neural Network Framework for Two-stage Stochastic Optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antonio Alc\\'antara, Calvin Tsay, Carlos Ruiz","submitted_at":"2024-03-18T12:12:23Z","abstract_excerpt":"Two-stage stochastic programming is a popular framework for optimization under uncertainty, where decision variables are split between first-stage decisions, and second-stage (or recourse) decisions, with the latter being adjusted after uncertainty is realized. These problems are often formulated using Sample Average Approximation (SAA), where uncertainty is modeled as a finite set of scenarios, resulting in a large \"monolithic\" problem, i.e., where the model is repeated for each scenario. The resulting models can be challenging to solve, and several problem-specific decomposition approaches h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11707","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/2403.11707/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-05T07:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"co5QoNKZW8viOVEaUgZeDLb83WdbuYcgiV5FjIrmEwEyYgUMrDD0oLorZe0lTwj39KYpN0W0wqSo1NbU1vzEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:56:43.854443Z"},"content_sha256":"8cfb621107e4eb66e0c8944cbfd8c277c9eb040f0e4807d0ead61cbe0ba7ade6","schema_version":"1.0","event_id":"sha256:8cfb621107e4eb66e0c8944cbfd8c277c9eb040f0e4807d0ead61cbe0ba7ade6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/bundle.json","state_url":"https://pith.science/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/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-08-21T18:56:43Z","links":{"resolver":"https://pith.science/pith/IWTR6ANJUJXHDTAQPFZN5C53UY","bundle":"https://pith.science/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/bundle.json","state":"https://pith.science/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWTR6ANJUJXHDTAQPFZN5C53UY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IWTR6ANJUJXHDTAQPFZN5C53UY","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":"3318c588557fee5d8de16cc8224837056d714908f327f6bcb15e4186f9a8c627","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-18T12:12:23Z","title_canon_sha256":"f1fb0177f8241991602e81b9221ae8957a6eb55a29f3f379d678e348270feab0"},"schema_version":"1.0","source":{"id":"2403.11707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.11707","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.11707v1","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11707","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"IWTR6ANJUJXH","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_16","alias_value":"IWTR6ANJUJXHDTAQ","created_at":"2026-07-05T07:57:20Z"},{"alias_kind":"pith_short_8","alias_value":"IWTR6ANJ","created_at":"2026-07-05T07:57:20Z"}],"graph_snapshots":[{"event_id":"sha256:8cfb621107e4eb66e0c8944cbfd8c277c9eb040f0e4807d0ead61cbe0ba7ade6","target":"graph","created_at":"2026-07-05T07:57:20Z","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.11707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two-stage stochastic programming is a popular framework for optimization under uncertainty, where decision variables are split between first-stage decisions, and second-stage (or recourse) decisions, with the latter being adjusted after uncertainty is realized. These problems are often formulated using Sample Average Approximation (SAA), where uncertainty is modeled as a finite set of scenarios, resulting in a large \"monolithic\" problem, i.e., where the model is repeated for each scenario. The resulting models can be challenging to solve, and several problem-specific decomposition approaches h","authors_text":"Antonio Alc\\'antara, Calvin Tsay, Carlos Ruiz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-18T12:12:23Z","title":"A Quantile Neural Network Framework for Two-stage Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11707","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:9952f53c507da2d72c1b158051798fb119926b648cb5a2ab769d79c0357fcef2","target":"record","created_at":"2026-07-05T07:57:20Z","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":"3318c588557fee5d8de16cc8224837056d714908f327f6bcb15e4186f9a8c627","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-18T12:12:23Z","title_canon_sha256":"f1fb0177f8241991602e81b9221ae8957a6eb55a29f3f379d678e348270feab0"},"schema_version":"1.0","source":{"id":"2403.11707","kind":"arxiv","version":1}},"canonical_sha256":"45a71f01a9a26e71cc107972de8bbba6241adf94971d949f6931f15ef46b36eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a71f01a9a26e71cc107972de8bbba6241adf94971d949f6931f15ef46b36eb","first_computed_at":"2026-07-05T07:57:20.380212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:57:20.380212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nOCsIyi0ccmcRJKd4r/irl0vWwMWqs+Si8sGSXStN8hNKRPzBYrPA1zlxEDoA60EUdsxBzUZiPk1QAitOj3rDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:57:20.380706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.11707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9952f53c507da2d72c1b158051798fb119926b648cb5a2ab769d79c0357fcef2","sha256:8cfb621107e4eb66e0c8944cbfd8c277c9eb040f0e4807d0ead61cbe0ba7ade6"],"state_sha256":"eda72c10d6b5ba3e0547f0c185641ae5d7a24bfbfcdb8c4da0313eef7a0aee7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phqkT6rO32aGu6Av6w76FBLH7Sn8Katoj0VPVEj/okHjD7AiSnKU/xLVVuB/R67kGEY7fizKWhQGWS+zmUtmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:56:43.857420Z","bundle_sha256":"397f49261dbec699b58bc025dcf64a37381a80d074c87240b9464bbf2afbbba8"}}