{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YPIZF2PGGX5C2DSQDV5UWLFKZI","short_pith_number":"pith:YPIZF2PG","canonical_record":{"source":{"id":"2306.08546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T14:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"f506c296ab2dbd21e1e2ab13c65afc3e45ff5d33fe94ef6072516a2b49a154fa","abstract_canon_sha256":"0383164420795fc3152b274cdf115a5740da99f36b4cb9d4095bc50470aeb2e9"},"schema_version":"1.0"},"canonical_sha256":"c3d192e9e635fa2d0e501d7b4b2caaca02bdb399690f42d62cbdc2c637724b30","source":{"kind":"arxiv","id":"2306.08546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08546","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08546v2","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08546","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"YPIZF2PGGX5C","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"YPIZF2PGGX5C2DSQ","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"YPIZF2PG","created_at":"2026-07-03T01:17:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YPIZF2PGGX5C2DSQDV5UWLFKZI","target":"record","payload":{"canonical_record":{"source":{"id":"2306.08546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T14:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"f506c296ab2dbd21e1e2ab13c65afc3e45ff5d33fe94ef6072516a2b49a154fa","abstract_canon_sha256":"0383164420795fc3152b274cdf115a5740da99f36b4cb9d4095bc50470aeb2e9"},"schema_version":"1.0"},"canonical_sha256":"c3d192e9e635fa2d0e501d7b4b2caaca02bdb399690f42d62cbdc2c637724b30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:09.466919Z","signature_b64":"YMJomcjAgZ+mVdOepVRNCQxmjFS6i5yredTD384R3kcwbgr5F32WgY2MDek/bPOB/I/o1dEhSZsDu+s9UPeeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3d192e9e635fa2d0e501d7b4b2caaca02bdb399690f42d62cbdc2c637724b30","last_reissued_at":"2026-07-03T01:17:09.466454Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:09.466454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.08546","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-03T01:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BgXC+jrIF4M/LmAeivDumjb+2x5cMXGx+HLF4MEeCrfZ+z0BfeGHmb9hs8gpKXoTL9USQjY3IRIM/1vvhD0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:17:54.542035Z"},"content_sha256":"81568c8e375733f204b0d6e82dc95d9680ec04c03fa2e187b410dbfb6056cb5f","schema_version":"1.0","event_id":"sha256:81568c8e375733f204b0d6e82dc95d9680ec04c03fa2e187b410dbfb6056cb5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YPIZF2PGGX5C2DSQDV5UWLFKZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recoverable Robust Optimization with Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Britta Peis, Felix Hommelsheim, Komal Muluk, Nicole Megow","submitted_at":"2023-06-14T14:44:28Z","abstract_excerpt":"We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust solution that, after the failing elements are revealed, can be augmented in a limited way. However, we commit to preserve the non-failing elements of the initial solution. We settle the computational complexity of such a robust counterpart of various classical polynomial-time solvable combinatorial optimization problems. We show, for the weighted matroid independent set problem, that an optimal solution to the nomin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08546","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/2306.08546/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-03T01:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aILoeLCVbmvQioW7zxKFPzWC9szGNsdU3LpBHcg+PyWEbjRWNS9Wd4rbCkUPvB1vQmOpWopVu0/BHPCOfwQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:17:54.543194Z"},"content_sha256":"1597d4fe952c52ee1bc9d1d8035b490532218c3c7d1c58d99fc6dcda2f7bd81a","schema_version":"1.0","event_id":"sha256:1597d4fe952c52ee1bc9d1d8035b490532218c3c7d1c58d99fc6dcda2f7bd81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/bundle.json","state_url":"https://pith.science/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/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-13T17:17:54Z","links":{"resolver":"https://pith.science/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI","bundle":"https://pith.science/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/bundle.json","state":"https://pith.science/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPIZF2PGGX5C2DSQDV5UWLFKZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YPIZF2PGGX5C2DSQDV5UWLFKZI","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":"0383164420795fc3152b274cdf115a5740da99f36b4cb9d4095bc50470aeb2e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T14:44:28Z","title_canon_sha256":"f506c296ab2dbd21e1e2ab13c65afc3e45ff5d33fe94ef6072516a2b49a154fa"},"schema_version":"1.0","source":{"id":"2306.08546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08546","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08546v2","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08546","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"YPIZF2PGGX5C","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"YPIZF2PGGX5C2DSQ","created_at":"2026-07-03T01:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"YPIZF2PG","created_at":"2026-07-03T01:17:09Z"}],"graph_snapshots":[{"event_id":"sha256:1597d4fe952c52ee1bc9d1d8035b490532218c3c7d1c58d99fc6dcda2f7bd81a","target":"graph","created_at":"2026-07-03T01:17:09Z","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/2306.08546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust solution that, after the failing elements are revealed, can be augmented in a limited way. However, we commit to preserve the non-failing elements of the initial solution. We settle the computational complexity of such a robust counterpart of various classical polynomial-time solvable combinatorial optimization problems. We show, for the weighted matroid independent set problem, that an optimal solution to the nomin","authors_text":"Britta Peis, Felix Hommelsheim, Komal Muluk, Nicole Megow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T14:44:28Z","title":"Recoverable Robust Optimization with Commitment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08546","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:81568c8e375733f204b0d6e82dc95d9680ec04c03fa2e187b410dbfb6056cb5f","target":"record","created_at":"2026-07-03T01:17:09Z","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":"0383164420795fc3152b274cdf115a5740da99f36b4cb9d4095bc50470aeb2e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T14:44:28Z","title_canon_sha256":"f506c296ab2dbd21e1e2ab13c65afc3e45ff5d33fe94ef6072516a2b49a154fa"},"schema_version":"1.0","source":{"id":"2306.08546","kind":"arxiv","version":2}},"canonical_sha256":"c3d192e9e635fa2d0e501d7b4b2caaca02bdb399690f42d62cbdc2c637724b30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3d192e9e635fa2d0e501d7b4b2caaca02bdb399690f42d62cbdc2c637724b30","first_computed_at":"2026-07-03T01:17:09.466454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:09.466454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMJomcjAgZ+mVdOepVRNCQxmjFS6i5yredTD384R3kcwbgr5F32WgY2MDek/bPOB/I/o1dEhSZsDu+s9UPeeAg==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:09.466919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.08546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81568c8e375733f204b0d6e82dc95d9680ec04c03fa2e187b410dbfb6056cb5f","sha256:1597d4fe952c52ee1bc9d1d8035b490532218c3c7d1c58d99fc6dcda2f7bd81a"],"state_sha256":"840d054b2ac37d57effb6507b17631888363663df64110c9bc78da4f5b0eef19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgYP6CTCdkPpWdfciR+MdZTCt0HY1RTn0l184kLMiLk9MBUWE2ZPmbi457yuRNosPchbNt0/KKee1IU8WX0sCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:17:54.631947Z","bundle_sha256":"ef0db4432f9943f3b7789b126bc3b24de1fbfa1285279edb534a064c7dbfdad5"}}