{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Z4XM42UNHCTWTZ2S7BNKDBZY7H","short_pith_number":"pith:Z4XM42UN","canonical_record":{"source":{"id":"2207.03291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T13:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"216b3885c987b6546eeb9678ab6f559f6f1f768e49f98e2e22dc733b620242e2","abstract_canon_sha256":"95fc83353bbc745fb813a5ebcec87721eef5b510c12602bdde699741125510cf"},"schema_version":"1.0"},"canonical_sha256":"cf2ece6a8d38a769e752f85aa18738f9f8fe9de3a4a68e041ec9a6e3c69466e5","source":{"kind":"arxiv","id":"2207.03291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03291","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03291v2","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03291","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"Z4XM42UNHCTW","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_16","alias_value":"Z4XM42UNHCTWTZ2S","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_8","alias_value":"Z4XM42UN","created_at":"2026-07-05T05:13:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Z4XM42UNHCTWTZ2S7BNKDBZY7H","target":"record","payload":{"canonical_record":{"source":{"id":"2207.03291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T13:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"216b3885c987b6546eeb9678ab6f559f6f1f768e49f98e2e22dc733b620242e2","abstract_canon_sha256":"95fc83353bbc745fb813a5ebcec87721eef5b510c12602bdde699741125510cf"},"schema_version":"1.0"},"canonical_sha256":"cf2ece6a8d38a769e752f85aa18738f9f8fe9de3a4a68e041ec9a6e3c69466e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:35.700431Z","signature_b64":"J1M6cqHXFuqcHlktis16YiyHvFXeJQTJx5rvCNoRfD8i/hUBjYH/nkllkNgtwvpRXKObc1cT9T5uSU9KqQ2mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf2ece6a8d38a769e752f85aa18738f9f8fe9de3a4a68e041ec9a6e3c69466e5","last_reissued_at":"2026-07-05T05:13:35.699922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:35.699922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.03291","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-07-05T05:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e51SnAdEGMoegQiWFr22bhSHzM5AR0VxYHg3+vVXjkvLiHLaOAabtJ/dbbBAURxnh6K6XT2P9sAYu0AQ8G+XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:54:24.557868Z"},"content_sha256":"e4819d305842b6880b2d1377fa035e4fbcc6b93695f89bbf03b4e02a7a393615","schema_version":"1.0","event_id":"sha256:e4819d305842b6880b2d1377fa035e4fbcc6b93695f89bbf03b4e02a7a393615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Z4XM42UNHCTWTZ2S7BNKDBZY7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inexact column-and-constraint generation method to solve two-stage robust optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank E. Curtis, Karmel S. Shehadeh, Man Yiu Tsang","submitted_at":"2022-07-07T13:38:57Z","abstract_excerpt":"We propose a new inexact column-and-constraint generation (i-C&CG) method to solve two-stage robust optimization problems. The method allows solutions to the master problems to be inexact, which is desirable when solving large-scale and/or challenging problems. It is equipped with a backtracking routine that controls the trade-off between bound improvement and inexactness. Importantly, this routine allows us to derive theoretical finite convergence guarantees for our i-C&CG method. Numerical experiments demonstrate computational advantages of our i-C&CG method over state-of-the-art column-and-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03291","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.03291/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-05T05:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/l/An0FlL26igktm5e3FbYonPJp+UhtZKSZ3Wf7F7pkVqJRmNKCV/chB1E8Qo5z8PCrjxBgSndqmwJEgO4ofCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:54:24.558687Z"},"content_sha256":"91f698940a88bdaf4a9af851d5cf2fc5d42db11186e64cd1e8bbd4c2c2c68f07","schema_version":"1.0","event_id":"sha256:91f698940a88bdaf4a9af851d5cf2fc5d42db11186e64cd1e8bbd4c2c2c68f07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/bundle.json","state_url":"https://pith.science/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/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-10T21:54:24Z","links":{"resolver":"https://pith.science/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H","bundle":"https://pith.science/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/bundle.json","state":"https://pith.science/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4XM42UNHCTWTZ2S7BNKDBZY7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Z4XM42UNHCTWTZ2S7BNKDBZY7H","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":"95fc83353bbc745fb813a5ebcec87721eef5b510c12602bdde699741125510cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T13:38:57Z","title_canon_sha256":"216b3885c987b6546eeb9678ab6f559f6f1f768e49f98e2e22dc733b620242e2"},"schema_version":"1.0","source":{"id":"2207.03291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03291","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03291v2","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03291","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"Z4XM42UNHCTW","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_16","alias_value":"Z4XM42UNHCTWTZ2S","created_at":"2026-07-05T05:13:35Z"},{"alias_kind":"pith_short_8","alias_value":"Z4XM42UN","created_at":"2026-07-05T05:13:35Z"}],"graph_snapshots":[{"event_id":"sha256:91f698940a88bdaf4a9af851d5cf2fc5d42db11186e64cd1e8bbd4c2c2c68f07","target":"graph","created_at":"2026-07-05T05:13:35Z","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/2207.03291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new inexact column-and-constraint generation (i-C&CG) method to solve two-stage robust optimization problems. The method allows solutions to the master problems to be inexact, which is desirable when solving large-scale and/or challenging problems. It is equipped with a backtracking routine that controls the trade-off between bound improvement and inexactness. Importantly, this routine allows us to derive theoretical finite convergence guarantees for our i-C&CG method. Numerical experiments demonstrate computational advantages of our i-C&CG method over state-of-the-art column-and-","authors_text":"Frank E. Curtis, Karmel S. Shehadeh, Man Yiu Tsang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T13:38:57Z","title":"An inexact column-and-constraint generation method to solve two-stage robust optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03291","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:e4819d305842b6880b2d1377fa035e4fbcc6b93695f89bbf03b4e02a7a393615","target":"record","created_at":"2026-07-05T05:13:35Z","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":"95fc83353bbc745fb813a5ebcec87721eef5b510c12602bdde699741125510cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T13:38:57Z","title_canon_sha256":"216b3885c987b6546eeb9678ab6f559f6f1f768e49f98e2e22dc733b620242e2"},"schema_version":"1.0","source":{"id":"2207.03291","kind":"arxiv","version":2}},"canonical_sha256":"cf2ece6a8d38a769e752f85aa18738f9f8fe9de3a4a68e041ec9a6e3c69466e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf2ece6a8d38a769e752f85aa18738f9f8fe9de3a4a68e041ec9a6e3c69466e5","first_computed_at":"2026-07-05T05:13:35.699922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:35.699922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1M6cqHXFuqcHlktis16YiyHvFXeJQTJx5rvCNoRfD8i/hUBjYH/nkllkNgtwvpRXKObc1cT9T5uSU9KqQ2mCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:35.700431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4819d305842b6880b2d1377fa035e4fbcc6b93695f89bbf03b4e02a7a393615","sha256:91f698940a88bdaf4a9af851d5cf2fc5d42db11186e64cd1e8bbd4c2c2c68f07"],"state_sha256":"a45cdd494a7cd4dc16bf4b6676f960a35b0ba8d2ad381c4e8869437c416cf18a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3SjB7RQRxTDzDngQgK0UxcHeco27EH+WXuE8PYnDRPdrSfJF1X4ddoGuU+G7gRCqCnbca/vFdiUZMksv63PBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T21:54:24.566790Z","bundle_sha256":"e7edb703efb6560d3baf7b82856a0f63058c3a57bef29d62547a452bb29436a1"}}