{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R4BFWAP6CKDEEB5M2GW67TWF46","short_pith_number":"pith:R4BFWAP6","canonical_record":{"source":{"id":"1807.02812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-08T13:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"46d3ba944b72766b8d2cef8fe2cc477fbabdb1862ae28f7eab5428c58daaa28c","abstract_canon_sha256":"67e5538410eae577968f8c083b722c60d7d8377303cf47de48931545edd36433"},"schema_version":"1.0"},"canonical_sha256":"8f025b01fe12864207acd1adefcec5e788535a90430a33e7b26b07371491d850","source":{"kind":"arxiv","id":"1807.02812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02812","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02812v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02812","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"R4BFWAP6CKDE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4BFWAP6CKDEEB5M","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4BFWAP6","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R4BFWAP6CKDEEB5M2GW67TWF46","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-08T13:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"46d3ba944b72766b8d2cef8fe2cc477fbabdb1862ae28f7eab5428c58daaa28c","abstract_canon_sha256":"67e5538410eae577968f8c083b722c60d7d8377303cf47de48931545edd36433"},"schema_version":"1.0"},"canonical_sha256":"8f025b01fe12864207acd1adefcec5e788535a90430a33e7b26b07371491d850","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.617700Z","signature_b64":"5tM+d2jVU7skxhS13ETHG25LTFsOuCpz6VLQWhxGl50gMz63mz/3ls1oAp+CtP1vxn5oEWt0Gr7odf6RXHOnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f025b01fe12864207acd1adefcec5e788535a90430a33e7b26b07371491d850","last_reissued_at":"2026-05-18T00:11:13.617056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.617056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02812","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-05-18T00:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLkPJoQzw7tS79tQwWFaQ1diuetrbvoEhDXo/i7438quk5ZpJ0zV6/X2JhH+q9i2M1TwbBzlH3CfFKSNCkMMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:38:35.828953Z"},"content_sha256":"d047061e469168ce8a842099365c26a6316af1b63fc198b298675c7443e8be0d","schema_version":"1.0","event_id":"sha256:d047061e469168ce8a842099365c26a6316af1b63fc198b298675c7443e8be0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R4BFWAP6CKDEEB5M2GW67TWF46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Algorithm for Two-Stage Adaptive Linear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitris Bertsimas, Shimrit Shtern","submitted_at":"2018-07-08T13:07:14Z","abstract_excerpt":"The column-and-constraint generation (CCG) method was introduced by \\citet{Zeng2013} for solving two-stage adaptive optimization. We found that the CCG method is quite scalable, but sometimes, and in some applications often, produces infeasible first-stage solutions, even though the problem is feasible. In this research, we extend the CCG method in a way that (a) maintains scalability and (b) always produces feasible first-stage decisions if they exist. We compare our method to several recently proposed methods and find that it reaches high accuracies faster and solves significantly larger pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02812","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":""},"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:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaxavWDiD+Iru5CeQNfw43nOqWndc/AG4bWV4pOIe1dVaX9pgTHTWZRwMc9xCMDFJOvRsU2HAf6uVBN+fqYZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:38:35.829297Z"},"content_sha256":"7af18551aa1818dd3997aae0ee164df1ac19c006314ec33bd39e1df326e39614","schema_version":"1.0","event_id":"sha256:7af18551aa1818dd3997aae0ee164df1ac19c006314ec33bd39e1df326e39614"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4BFWAP6CKDEEB5M2GW67TWF46/bundle.json","state_url":"https://pith.science/pith/R4BFWAP6CKDEEB5M2GW67TWF46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4BFWAP6CKDEEB5M2GW67TWF46/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-07-17T03:38:35Z","links":{"resolver":"https://pith.science/pith/R4BFWAP6CKDEEB5M2GW67TWF46","bundle":"https://pith.science/pith/R4BFWAP6CKDEEB5M2GW67TWF46/bundle.json","state":"https://pith.science/pith/R4BFWAP6CKDEEB5M2GW67TWF46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4BFWAP6CKDEEB5M2GW67TWF46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R4BFWAP6CKDEEB5M2GW67TWF46","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":"67e5538410eae577968f8c083b722c60d7d8377303cf47de48931545edd36433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-08T13:07:14Z","title_canon_sha256":"46d3ba944b72766b8d2cef8fe2cc477fbabdb1862ae28f7eab5428c58daaa28c"},"schema_version":"1.0","source":{"id":"1807.02812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02812","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02812v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02812","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"R4BFWAP6CKDE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4BFWAP6CKDEEB5M","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4BFWAP6","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7af18551aa1818dd3997aae0ee164df1ac19c006314ec33bd39e1df326e39614","target":"graph","created_at":"2026-05-18T00:11:13Z","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":"The column-and-constraint generation (CCG) method was introduced by \\citet{Zeng2013} for solving two-stage adaptive optimization. We found that the CCG method is quite scalable, but sometimes, and in some applications often, produces infeasible first-stage solutions, even though the problem is feasible. In this research, we extend the CCG method in a way that (a) maintains scalability and (b) always produces feasible first-stage decisions if they exist. We compare our method to several recently proposed methods and find that it reaches high accuracies faster and solves significantly larger pro","authors_text":"Dimitris Bertsimas, Shimrit Shtern","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-08T13:07:14Z","title":"A Scalable Algorithm for Two-Stage Adaptive Linear Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02812","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:d047061e469168ce8a842099365c26a6316af1b63fc198b298675c7443e8be0d","target":"record","created_at":"2026-05-18T00:11:13Z","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":"67e5538410eae577968f8c083b722c60d7d8377303cf47de48931545edd36433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-08T13:07:14Z","title_canon_sha256":"46d3ba944b72766b8d2cef8fe2cc477fbabdb1862ae28f7eab5428c58daaa28c"},"schema_version":"1.0","source":{"id":"1807.02812","kind":"arxiv","version":1}},"canonical_sha256":"8f025b01fe12864207acd1adefcec5e788535a90430a33e7b26b07371491d850","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f025b01fe12864207acd1adefcec5e788535a90430a33e7b26b07371491d850","first_computed_at":"2026-05-18T00:11:13.617056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:13.617056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tM+d2jVU7skxhS13ETHG25LTFsOuCpz6VLQWhxGl50gMz63mz/3ls1oAp+CtP1vxn5oEWt0Gr7odf6RXHOnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:13.617700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d047061e469168ce8a842099365c26a6316af1b63fc198b298675c7443e8be0d","sha256:7af18551aa1818dd3997aae0ee164df1ac19c006314ec33bd39e1df326e39614"],"state_sha256":"27e62fc370bbb03658b104489c775ffc5aad95498d745bf5fd272d54106fec40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVQFdkajc6DgO/wc4w+LYZ90awIXMu3ryk0WnNfUg5hMY6s7jBq+x2znbZP1lyOGNwsrEHSUrb3Q6lexPHpoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T03:38:35.831655Z","bundle_sha256":"d677689a95b9d35cf7c8110bf58d1f95690e9285bbdcc0368dc3cedeaffe660e"}}