{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7RVVH37FZTXXNHWIZQNC3JAVQ6","short_pith_number":"pith:7RVVH37F","schema_version":"1.0","canonical_sha256":"fc6b53efe5ccef769ec8cc1a2da41587a0700c052174b576e5df4490620f6c32","source":{"kind":"arxiv","id":"1812.07826","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.07826","created_at":"2026-05-17T23:57:55.858171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.07826v1","created_at":"2026-05-17T23:57:55.858171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07826","created_at":"2026-05-17T23:57:55.858171+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RVVH37FZTXX","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RVVH37FZTXXNHWI","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RVVH37F","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6","json":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6.json","graph_json":"https://pith.science/api/pith-number/7RVVH37FZTXXNHWIZQNC3JAVQ6/graph.json","events_json":"https://pith.science/api/pith-number/7RVVH37FZTXXNHWIZQNC3JAVQ6/events.json","paper":"https://pith.science/paper/7RVVH37F"},"agent_actions":{"view_html":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6","download_json":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6.json","view_paper":"https://pith.science/paper/7RVVH37F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.07826&json=true","fetch_graph":"https://pith.science/api/pith-number/7RVVH37FZTXXNHWIZQNC3JAVQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/7RVVH37FZTXXNHWIZQNC3JAVQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/action/storage_attestation","attest_author":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/action/author_attestation","sign_citation":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/action/citation_signature","submit_replication":"https://pith.science/pith/7RVVH37FZTXXNHWIZQNC3JAVQ6/action/replication_record"}},"created_at":"2026-05-17T23:57:55.858171+00:00","updated_at":"2026-05-17T23:57:55.858171+00:00"}