{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QUQQPEG4AIATH6HLXQAKWMAICV","short_pith_number":"pith:QUQQPEG4","schema_version":"1.0","canonical_sha256":"85210790dc020133f8ebbc00ab30081541cd69857f4df318cd10a7a5d1891354","source":{"kind":"arxiv","id":"2608.00848","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.00848","created_at":"2026-08-04T01:55:15.440617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00848v1","created_at":"2026-08-04T01:55:15.440617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00848","created_at":"2026-08-04T01:55:15.440617+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUQQPEG4AIAT","created_at":"2026-08-04T01:55:15.440617+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUQQPEG4AIATH6HL","created_at":"2026-08-04T01:55:15.440617+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUQQPEG4","created_at":"2026-08-04T01:55:15.440617+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/QUQQPEG4AIATH6HLXQAKWMAICV","json":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV.json","graph_json":"https://pith.science/api/pith-number/QUQQPEG4AIATH6HLXQAKWMAICV/graph.json","events_json":"https://pith.science/api/pith-number/QUQQPEG4AIATH6HLXQAKWMAICV/events.json","paper":"https://pith.science/paper/QUQQPEG4"},"agent_actions":{"view_html":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV","download_json":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV.json","view_paper":"https://pith.science/paper/QUQQPEG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00848&json=true","fetch_graph":"https://pith.science/api/pith-number/QUQQPEG4AIATH6HLXQAKWMAICV/graph.json","fetch_events":"https://pith.science/api/pith-number/QUQQPEG4AIATH6HLXQAKWMAICV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/action/storage_attestation","attest_author":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/action/author_attestation","sign_citation":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/action/citation_signature","submit_replication":"https://pith.science/pith/QUQQPEG4AIATH6HLXQAKWMAICV/action/replication_record"}},"created_at":"2026-08-04T01:55:15.440617+00:00","updated_at":"2026-08-04T01:55:15.440617+00:00"}