{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7RVVH37FZTXXNHWIZQNC3JAVQ6","short_pith_number":"pith:7RVVH37F","canonical_record":{"source":{"id":"1812.07826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-19T09:11:12Z","cross_cats_sorted":[],"title_canon_sha256":"be5994783b0d0a0862bb4c1cbdef30603cd42cfc7c00df9c7d71ac7ecd32f439","abstract_canon_sha256":"c954bb53677a3cdb17227978544ec88e82df7344bede1de3b14552cee59b3331"},"schema_version":"1.0"},"canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","source":{"kind":"arxiv","id":"1812.07826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07826","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07826v1","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07826","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"7RVVH37FZTXX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7RVVH37FZTXXNHWI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7RVVH37F","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7RVVH37FZTXXNHWIZQNC3JAVQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1812.07826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-19T09:11:12Z","cross_cats_sorted":[],"title_canon_sha256":"be5994783b0d0a0862bb4c1cbdef30603cd42cfc7c00df9c7d71ac7ecd32f439","abstract_canon_sha256":"c954bb53677a3cdb17227978544ec88e82df7344bede1de3b14552cee59b3331"},"schema_version":"1.0"},"canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:55.858709Z","signature_b64":"GoJooiamkS0MpzyrfHFDbPz9bWlU0vv2JXi5FzoOM7WJIBCWk8sf0RPZ9+AlWnH1ObfrBEUTVyuwMDfc+KLBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","last_reissued_at":"2026-05-17T23:57:55.858079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:55.858079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.07826","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-17T23:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7WIipy5iVHGzlJsSacgix3pBAo2IEZyPM8Cigf56i8UvgnuAHmTBIRyOmPtaSgReI6PKuv85M+5P+EjFhvXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:28:07.574061Z"},"content_sha256":"00ae51969fd63eab56502671a95fbe0ed73f6b0ab6c9fb8c17950e4919bb7368","schema_version":"1.0","event_id":"sha256:00ae51969fd63eab56502671a95fbe0ed73f6b0ab6c9fb8c17950e4919bb7368"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7RVVH37FZTXXNHWIZQNC3JAVQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-stage Combinatorial Optimization Problems under Risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Marc Goerigk, Pawel Zielinski","submitted_at":"2018-12-19T09:11:12Z","abstract_excerpt":"In this paper a class of combinatorial optimization problems is discussed. It is assumed that a solution can be constructed in two stages. The current first-stage costs are precisely known, while the future second-stage costs are only known to belong to an uncertainty set, which contains a finite number of scenarios with known probability distribution. A partial solution, chosen in the first stage, can be completed by performing an optimal recourse action, after the true second-stage scenario is revealed. A solution minimizing the Conditional Value at Risk (CVaR) measure is computed. Since exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07826","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-17T23:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhNuyuAtHD24VfwNtGtdP9b/a+KPTrLpBRL2aV7zYSfF7UzWMUHRkF+amFhoFCZ5rBaad6asJvC3UPOrjKIwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:28:07.574426Z"},"content_sha256":"362182a1897d0176077278e7ed2475e60f73f0a9196d933fe9dbe47b5e22a313","schema_version":"1.0","event_id":"sha256:362182a1897d0176077278e7ed2475e60f73f0a9196d933fe9dbe47b5e22a313"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/bundle.json","state_url":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/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-06-03T08:28:07Z","links":{"resolver":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6","bundle":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/bundle.json","state":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7RVVH37FZTXXNHWIZQNC3JAVQ6","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":"c954bb53677a3cdb17227978544ec88e82df7344bede1de3b14552cee59b3331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-19T09:11:12Z","title_canon_sha256":"be5994783b0d0a0862bb4c1cbdef30603cd42cfc7c00df9c7d71ac7ecd32f439"},"schema_version":"1.0","source":{"id":"1812.07826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07826","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07826v1","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07826","created_at":"2026-05-17T23:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"7RVVH37FZTXX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7RVVH37FZTXXNHWI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7RVVH37F","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:362182a1897d0176077278e7ed2475e60f73f0a9196d933fe9dbe47b5e22a313","target":"graph","created_at":"2026-05-17T23:57:55Z","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 this paper a class of combinatorial optimization problems is discussed. It is assumed that a solution can be constructed in two stages. The current first-stage costs are precisely known, while the future second-stage costs are only known to belong to an uncertainty set, which contains a finite number of scenarios with known probability distribution. A partial solution, chosen in the first stage, can be completed by performing an optimal recourse action, after the true second-stage scenario is revealed. A solution minimizing the Conditional Value at Risk (CVaR) measure is computed. Since exp","authors_text":"Adam Kasperski, Marc Goerigk, Pawel Zielinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-19T09:11:12Z","title":"Two-stage Combinatorial Optimization Problems under Risk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07826","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:00ae51969fd63eab56502671a95fbe0ed73f6b0ab6c9fb8c17950e4919bb7368","target":"record","created_at":"2026-05-17T23:57:55Z","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":"c954bb53677a3cdb17227978544ec88e82df7344bede1de3b14552cee59b3331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-19T09:11:12Z","title_canon_sha256":"be5994783b0d0a0862bb4c1cbdef30603cd42cfc7c00df9c7d71ac7ecd32f439"},"schema_version":"1.0","source":{"id":"1812.07826","kind":"arxiv","version":1}},"canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","first_computed_at":"2026-05-17T23:57:55.858079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:55.858079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GoJooiamkS0MpzyrfHFDbPz9bWlU0vv2JXi5FzoOM7WJIBCWk8sf0RPZ9+AlWnH1ObfrBEUTVyuwMDfc+KLBCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:55.858709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.07826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00ae51969fd63eab56502671a95fbe0ed73f6b0ab6c9fb8c17950e4919bb7368","sha256:362182a1897d0176077278e7ed2475e60f73f0a9196d933fe9dbe47b5e22a313"],"state_sha256":"11939afe85d80effeb065a4f6ea63fcd762ca25f52b65b0aa8207583364c1bb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H10n2RiMlcZbREAJRn7dcl9BaCLSZbqhAxKEGIIhYI6aikwLQiJtWkIW7aNkklQom71lSdmPJ06PERuqE9V0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:28:07.576407Z","bundle_sha256":"652457c96ea77e376e6e10fac67fafd5799d9a0358cb18342f8bb7440aada161"}}