{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7RHO3N3JO72ZBMW4VLFGWPZJSQ","short_pith_number":"pith:7RHO3N3J","canonical_record":{"source":{"id":"2409.12630","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-19T10:01:02Z","cross_cats_sorted":[],"title_canon_sha256":"13111beb787901d49fd7128da3956c3e823406bc466471305eed7e7b33e91d1f","abstract_canon_sha256":"6dbf1fefb28d3ce98400773600afa1e38b2054225d41a30daa57940719df5b1e"},"schema_version":"1.0"},"canonical_sha256":"fc4eedb76977f590b2dcaaca6b3f2994058d8bf87abca7a414688d30d7f873a1","source":{"kind":"arxiv","id":"2409.12630","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12630","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12630v3","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12630","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"7RHO3N3JO72Z","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"7RHO3N3JO72ZBMW4","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"7RHO3N3J","created_at":"2026-07-05T12:03:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7RHO3N3JO72ZBMW4VLFGWPZJSQ","target":"record","payload":{"canonical_record":{"source":{"id":"2409.12630","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-19T10:01:02Z","cross_cats_sorted":[],"title_canon_sha256":"13111beb787901d49fd7128da3956c3e823406bc466471305eed7e7b33e91d1f","abstract_canon_sha256":"6dbf1fefb28d3ce98400773600afa1e38b2054225d41a30daa57940719df5b1e"},"schema_version":"1.0"},"canonical_sha256":"fc4eedb76977f590b2dcaaca6b3f2994058d8bf87abca7a414688d30d7f873a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:43.533440Z","signature_b64":"aQzsX602XG6POPThvS2ArYgWs76nSI9tDUaYnQzPKzfg/oWt7/DFWdFhpw8+zAn1RDhbDH4ovDjcgvQfXZhGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4eedb76977f590b2dcaaca6b3f2994058d8bf87abca7a414688d30d7f873a1","last_reissued_at":"2026-07-05T12:03:43.532914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:43.532914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.12630","source_version":3,"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-05T12:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rG5gEuTyxE/ymV2muJzmtTHTQHbrSVTdm3H9HFzwXcWc77me9u2bDwzes5V3E8RJjwaN4OOLAH09bfsDcaJbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:31:03.405899Z"},"content_sha256":"1181eae4b693547ee8e963b78c2617e22efdf72598dd403370b60246f4143158","schema_version":"1.0","event_id":"sha256:1181eae4b693547ee8e963b78c2617e22efdf72598dd403370b60246f4143158"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7RHO3N3JO72ZBMW4VLFGWPZJSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the Optimal Number of Policies for Robust K-Adaptability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jannis Kurtz","submitted_at":"2024-09-19T10:01:02Z","abstract_excerpt":"In the realm of robust optimization the k-adaptability approach is one promising method to derive approximate solutions for two-stage robust optimization problems. Instead of allowing all possible second-stage decisions, the k-adaptability approach aims at calculating a limited set of k such decisions already in the first-stage before the uncertainty is revealed. The parameter k can be adjusted to control the quality of the approximation. However, not much is known on how many solutions k are needed to achieve an optimal solution for the two-stage robust problem. In this work we derive bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12630","kind":"arxiv","version":3},"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/2409.12630/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-05T12:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JK29BPD2V/ax+kevNDY3heCrL1+rSEC9VMulZsYX/r6xKCsVMmmXQmPWVCMFYecNSJMuZKMABZDkteLQi9waAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:31:03.407358Z"},"content_sha256":"9376b26c159e22d45aaad86f5a216b48cdcb9cb31d6a98d2ebb9a3c0a4392ac0","schema_version":"1.0","event_id":"sha256:9376b26c159e22d45aaad86f5a216b48cdcb9cb31d6a98d2ebb9a3c0a4392ac0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/bundle.json","state_url":"https://pith.science/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/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-18T04:31:03Z","links":{"resolver":"https://pith.science/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ","bundle":"https://pith.science/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/bundle.json","state":"https://pith.science/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RHO3N3JO72ZBMW4VLFGWPZJSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7RHO3N3JO72ZBMW4VLFGWPZJSQ","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":"6dbf1fefb28d3ce98400773600afa1e38b2054225d41a30daa57940719df5b1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-19T10:01:02Z","title_canon_sha256":"13111beb787901d49fd7128da3956c3e823406bc466471305eed7e7b33e91d1f"},"schema_version":"1.0","source":{"id":"2409.12630","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12630","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12630v3","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12630","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"7RHO3N3JO72Z","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"7RHO3N3JO72ZBMW4","created_at":"2026-07-05T12:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"7RHO3N3J","created_at":"2026-07-05T12:03:43Z"}],"graph_snapshots":[{"event_id":"sha256:9376b26c159e22d45aaad86f5a216b48cdcb9cb31d6a98d2ebb9a3c0a4392ac0","target":"graph","created_at":"2026-07-05T12:03:43Z","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/2409.12630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the realm of robust optimization the k-adaptability approach is one promising method to derive approximate solutions for two-stage robust optimization problems. Instead of allowing all possible second-stage decisions, the k-adaptability approach aims at calculating a limited set of k such decisions already in the first-stage before the uncertainty is revealed. The parameter k can be adjusted to control the quality of the approximation. However, not much is known on how many solutions k are needed to achieve an optimal solution for the two-stage robust problem. In this work we derive bounds ","authors_text":"Jannis Kurtz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-19T10:01:02Z","title":"Bounding the Optimal Number of Policies for Robust K-Adaptability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12630","kind":"arxiv","version":3},"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:1181eae4b693547ee8e963b78c2617e22efdf72598dd403370b60246f4143158","target":"record","created_at":"2026-07-05T12:03:43Z","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":"6dbf1fefb28d3ce98400773600afa1e38b2054225d41a30daa57940719df5b1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-19T10:01:02Z","title_canon_sha256":"13111beb787901d49fd7128da3956c3e823406bc466471305eed7e7b33e91d1f"},"schema_version":"1.0","source":{"id":"2409.12630","kind":"arxiv","version":3}},"canonical_sha256":"fc4eedb76977f590b2dcaaca6b3f2994058d8bf87abca7a414688d30d7f873a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4eedb76977f590b2dcaaca6b3f2994058d8bf87abca7a414688d30d7f873a1","first_computed_at":"2026-07-05T12:03:43.532914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:43.532914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aQzsX602XG6POPThvS2ArYgWs76nSI9tDUaYnQzPKzfg/oWt7/DFWdFhpw8+zAn1RDhbDH4ovDjcgvQfXZhGCw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:43.533440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.12630","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1181eae4b693547ee8e963b78c2617e22efdf72598dd403370b60246f4143158","sha256:9376b26c159e22d45aaad86f5a216b48cdcb9cb31d6a98d2ebb9a3c0a4392ac0"],"state_sha256":"20801f9e6ff62ab4b26fb013440cf713fe762401b2181d59157e8ca3daa319b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoMZWEW3P4zc/z9c7fIRDLBe960CRr60B8wxQDU4j0FiLcyzuKSZT/OGZ/nbef44Px3nKI7HPsTglwXtpPJQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T04:31:03.418281Z","bundle_sha256":"01869eb5215ef91b990a5b7f38770a8fe5b91240df03a0d3ae12cea839db1548"}}