{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QUQQPEG4AIATH6HLXQAKWMAICV","short_pith_number":"pith:QUQQPEG4","canonical_record":{"source":{"id":"2608.00848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-01T20:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"62a761f21c376cea5a3a90d938226af38689adec2e514f427faffeed5e99bae4","abstract_canon_sha256":"27e7f5010d713f83a967f563671fea6d02977d5c9f2643f84e5ac839cbca0b55"},"schema_version":"1.0"},"canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","source":{"kind":"arxiv","id":"2608.00848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00848","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00848v1","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00848","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"QUQQPEG4AIAT","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"QUQQPEG4AIATH6HL","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"QUQQPEG4","created_at":"2026-08-04T01:55:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QUQQPEG4AIATH6HLXQAKWMAICV","target":"record","payload":{"canonical_record":{"source":{"id":"2608.00848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-01T20:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"62a761f21c376cea5a3a90d938226af38689adec2e514f427faffeed5e99bae4","abstract_canon_sha256":"27e7f5010d713f83a967f563671fea6d02977d5c9f2643f84e5ac839cbca0b55"},"schema_version":"1.0"},"canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:15.440785Z","signature_b64":"fEBdEcIo7TDjae8cp0otkeEz3kWRBIN1fRBKz1PZrvTUmfMQreOH9EFQ9Jo1MGbUiSjWZAzn+8wuvts3OWgdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","last_reissued_at":"2026-08-04T01:55:15.439332Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:15.439332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.00848","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-08-04T01:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSguYblaZI4aGdQQ7xNrkJz4AsJtsXCmsKzZQbGXtiIWfr2DwiRJo+QJ2Njxt8fc1M3DGl34QBgi65tS6HqcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:50:14.258359Z"},"content_sha256":"41ca33fe7aace21594656c0928a5ac5cf2b33067da40b7521817c03bacd24923","schema_version":"1.0","event_id":"sha256:41ca33fe7aace21594656c0928a5ac5cf2b33067da40b7521817c03bacd24923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QUQQPEG4AIATH6HLXQAKWMAICV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Balkanski, Nicole Megow, Vineet Goyal, Yasser Alghouass","submitted_at":"2026-08-01T20:01:50Z","abstract_excerpt":"Robust optimization protects against uncertainty by optimizing for the worst case over a prescribed uncertainty set. This protection can be overly conservative when forecasts, historical data, or learned predictions indicate a more likely scenario. We introduce a framework for robust optimization with predictions. The input consists of an uncertainty set together with a distinguished predicted scenario, and the goal is to compute a single solution that is both consistent, meaning near-optimal for the predicted scenario, and robust, meaning competitive with the classical min-max robust optimum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00848","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.00848/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-08-04T01:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+74px4SKgLL1jeoeQClEHqKKfO4Q8LgHtBMkegcgV2vW4vN+SQB3O95MUXIv/uqrQb6/LpSYT9dDCU/ezgm/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:50:14.258879Z"},"content_sha256":"e79a8cd0832c82d0f9e6690b02a41ed296a0c900f6931525d29b3c761abf8e26","schema_version":"1.0","event_id":"sha256:e79a8cd0832c82d0f9e6690b02a41ed296a0c900f6931525d29b3c761abf8e26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/bundle.json","state_url":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUQQPEG4AIATH6HLXQAKWMAICV/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-05T13:50:14Z","links":{"resolver":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV","bundle":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/bundle.json","state":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUQQPEG4AIATH6HLXQAKWMAICV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QUQQPEG4AIATH6HLXQAKWMAICV","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":"27e7f5010d713f83a967f563671fea6d02977d5c9f2643f84e5ac839cbca0b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-01T20:01:50Z","title_canon_sha256":"62a761f21c376cea5a3a90d938226af38689adec2e514f427faffeed5e99bae4"},"schema_version":"1.0","source":{"id":"2608.00848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00848","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00848v1","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00848","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"QUQQPEG4AIAT","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_16","alias_value":"QUQQPEG4AIATH6HL","created_at":"2026-08-04T01:55:15Z"},{"alias_kind":"pith_short_8","alias_value":"QUQQPEG4","created_at":"2026-08-04T01:55:15Z"}],"graph_snapshots":[{"event_id":"sha256:e79a8cd0832c82d0f9e6690b02a41ed296a0c900f6931525d29b3c761abf8e26","target":"graph","created_at":"2026-08-04T01:55:15Z","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/2608.00848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust optimization protects against uncertainty by optimizing for the worst case over a prescribed uncertainty set. This protection can be overly conservative when forecasts, historical data, or learned predictions indicate a more likely scenario. We introduce a framework for robust optimization with predictions. The input consists of an uncertainty set together with a distinguished predicted scenario, and the goal is to compute a single solution that is both consistent, meaning near-optimal for the predicted scenario, and robust, meaning competitive with the classical min-max robust optimum.","authors_text":"Eric Balkanski, Nicole Megow, Vineet Goyal, Yasser Alghouass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-01T20:01:50Z","title":"A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00848","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:41ca33fe7aace21594656c0928a5ac5cf2b33067da40b7521817c03bacd24923","target":"record","created_at":"2026-08-04T01:55:15Z","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":"27e7f5010d713f83a967f563671fea6d02977d5c9f2643f84e5ac839cbca0b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-01T20:01:50Z","title_canon_sha256":"62a761f21c376cea5a3a90d938226af38689adec2e514f427faffeed5e99bae4"},"schema_version":"1.0","source":{"id":"2608.00848","kind":"arxiv","version":1}},"canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","first_computed_at":"2026-08-04T01:55:15.439332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T01:55:15.439332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fEBdEcIo7TDjae8cp0otkeEz3kWRBIN1fRBKz1PZrvTUmfMQreOH9EFQ9Jo1MGbUiSjWZAzn+8wuvts3OWgdBQ==","signature_status":"signed_v1","signed_at":"2026-08-04T01:55:15.440785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41ca33fe7aace21594656c0928a5ac5cf2b33067da40b7521817c03bacd24923","sha256:e79a8cd0832c82d0f9e6690b02a41ed296a0c900f6931525d29b3c761abf8e26"],"state_sha256":"99a5f52fdb5b61d4503d0c5777c07a170a730e7d79b221b6ccdc0c3ea01ef882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30/Fko4mQ5I06QYzQ+hCUIKDH6rWsOTqTTTGgUXPhDwn9+BT3Lp+/JlAhsvKOvbfRVODg1qlqNkd+dkXvSIcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:50:14.270943Z","bundle_sha256":"245e7104ef86c038133fcc3b8199989c86eba4e5fbc6806d5a669d715f0a8cb6"}}