{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MQU5VYVSPBUZURKWMQGPG7E2NJ","short_pith_number":"pith:MQU5VYVS","canonical_record":{"source":{"id":"1511.01922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T21:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"a969382edfc79dc9b1fe4d13ca11e90720ee2daa307c4707444305336f37d8cd","abstract_canon_sha256":"9d3a50eaeff83f26e23cf4f51064faad6476a77dc523beb9dc0a19bd0a6d6b4a"},"schema_version":"1.0"},"canonical_sha256":"6429dae2b278699a4556640cf37c9a6a79cb04b45c13861209228e9d0660a2bf","source":{"kind":"arxiv","id":"1511.01922","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01922","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01922v2","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01922","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"MQU5VYVSPBUZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQU5VYVSPBUZURKW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQU5VYVS","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MQU5VYVSPBUZURKWMQGPG7E2NJ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T21:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"a969382edfc79dc9b1fe4d13ca11e90720ee2daa307c4707444305336f37d8cd","abstract_canon_sha256":"9d3a50eaeff83f26e23cf4f51064faad6476a77dc523beb9dc0a19bd0a6d6b4a"},"schema_version":"1.0"},"canonical_sha256":"6429dae2b278699a4556640cf37c9a6a79cb04b45c13861209228e9d0660a2bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.349437Z","signature_b64":"lLe6330eC7IT76Gm7+DCBbW7PNlb42ZyGCZEgEB5U6pQsCOn1ZwDU8R/WmJH4uMpPwHNxOtlEVWWQUbSiGsXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6429dae2b278699a4556640cf37c9a6a79cb04b45c13861209228e9d0660a2bf","last_reissued_at":"2026-05-18T00:51:03.348959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.348959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01922","source_version":2,"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-18T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXhTCrmynnAkLoG5SOzm9WOontzQdT1WEk1ebiUKlPdOFVDMLsn060tT2KqpoQLnClQxHilXozazWYrrT4cTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:46:55.387694Z"},"content_sha256":"60deb4b4cffccc6f8b6f8c2cd6a6e245f45e1b95cd32157b8f6c93cb43eed34c","schema_version":"1.0","event_id":"sha256:60deb4b4cffccc6f8b6f8c2cd6a6e245f45e1b95cd32157b8f6c93cb43eed34c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MQU5VYVSPBUZURKWMQGPG7E2NJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-stage Stochastic Programming Approach for Network Capacity Expansion with Multiple Sources of Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Huang, Majid Taghavi","submitted_at":"2015-11-05T21:36:49Z","abstract_excerpt":"In networks, there are often more than one source of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity and contract capacity. We use a scenario tree to model the uncertainty, and build a multi-stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01922","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsmZbMt101Y6ds9dpNjdcSM4pdp6K/YyabYCUOlwkMTv2Cbh1APdV2f/9Xb7fn2AXkWUST/fh15EYysyYobOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:46:55.388160Z"},"content_sha256":"148a58f037ad55a7fcd0f4dd5f08cf628c4b68635644be4ec2bad53b7d9386e4","schema_version":"1.0","event_id":"sha256:148a58f037ad55a7fcd0f4dd5f08cf628c4b68635644be4ec2bad53b7d9386e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/bundle.json","state_url":"https://pith.science/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/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-11T00:46:55Z","links":{"resolver":"https://pith.science/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ","bundle":"https://pith.science/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/bundle.json","state":"https://pith.science/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQU5VYVSPBUZURKWMQGPG7E2NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MQU5VYVSPBUZURKWMQGPG7E2NJ","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":"9d3a50eaeff83f26e23cf4f51064faad6476a77dc523beb9dc0a19bd0a6d6b4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T21:36:49Z","title_canon_sha256":"a969382edfc79dc9b1fe4d13ca11e90720ee2daa307c4707444305336f37d8cd"},"schema_version":"1.0","source":{"id":"1511.01922","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01922","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01922v2","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01922","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"MQU5VYVSPBUZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MQU5VYVSPBUZURKW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MQU5VYVS","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:148a58f037ad55a7fcd0f4dd5f08cf628c4b68635644be4ec2bad53b7d9386e4","target":"graph","created_at":"2026-05-18T00:51:03Z","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"},"paper":{"abstract_excerpt":"In networks, there are often more than one source of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity and contract capacity. We use a scenario tree to model the uncertainty, and build a multi-stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a ","authors_text":"Kai Huang, Majid Taghavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T21:36:49Z","title":"A Multi-stage Stochastic Programming Approach for Network Capacity Expansion with Multiple Sources of Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01922","kind":"arxiv","version":2},"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:60deb4b4cffccc6f8b6f8c2cd6a6e245f45e1b95cd32157b8f6c93cb43eed34c","target":"record","created_at":"2026-05-18T00:51:03Z","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":"9d3a50eaeff83f26e23cf4f51064faad6476a77dc523beb9dc0a19bd0a6d6b4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-05T21:36:49Z","title_canon_sha256":"a969382edfc79dc9b1fe4d13ca11e90720ee2daa307c4707444305336f37d8cd"},"schema_version":"1.0","source":{"id":"1511.01922","kind":"arxiv","version":2}},"canonical_sha256":"6429dae2b278699a4556640cf37c9a6a79cb04b45c13861209228e9d0660a2bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6429dae2b278699a4556640cf37c9a6a79cb04b45c13861209228e9d0660a2bf","first_computed_at":"2026-05-18T00:51:03.348959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.348959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLe6330eC7IT76Gm7+DCBbW7PNlb42ZyGCZEgEB5U6pQsCOn1ZwDU8R/WmJH4uMpPwHNxOtlEVWWQUbSiGsXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.349437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01922","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60deb4b4cffccc6f8b6f8c2cd6a6e245f45e1b95cd32157b8f6c93cb43eed34c","sha256:148a58f037ad55a7fcd0f4dd5f08cf628c4b68635644be4ec2bad53b7d9386e4"],"state_sha256":"c9e7653683b378d74568abc8394eef982dfa86f088309720cde3a2a15f3cbd1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"673qVZqEukpiXCytt3H5vur4MMHz8Xl7Y2o8sKg/7okM2ekYFBbVfeOVJxYAbAEgkzlAnZ2Fkls27+UPuwdWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T00:46:55.392089Z","bundle_sha256":"0669006c1f65a6c6130db808948ec1a645a59c8631e5fbc94b47b9a5ef499d0a"}}