{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BTPSZOD3LBNREAZI7EM37SUFKO","short_pith_number":"pith:BTPSZOD3","canonical_record":{"source":{"id":"1907.02917","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T16:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"02b281e7750d9f31015bc660994b454186565049dc94c0b67838ed70ddcee2fb","abstract_canon_sha256":"923b10de5a2c1d61f9599acc62cd26c3fb1711946dcb15ca7799997412cfd6d1"},"schema_version":"1.0"},"canonical_sha256":"0cdf2cb87b585b120328f919bfca8553b205138ec571bb7019751a19833c2375","source":{"kind":"arxiv","id":"1907.02917","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02917","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02917v5","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02917","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_12","alias_value":"BTPSZOD3LBNR","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_16","alias_value":"BTPSZOD3LBNREAZI","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_8","alias_value":"BTPSZOD3","created_at":"2026-07-05T03:57:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BTPSZOD3LBNREAZI7EM37SUFKO","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02917","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T16:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"02b281e7750d9f31015bc660994b454186565049dc94c0b67838ed70ddcee2fb","abstract_canon_sha256":"923b10de5a2c1d61f9599acc62cd26c3fb1711946dcb15ca7799997412cfd6d1"},"schema_version":"1.0"},"canonical_sha256":"0cdf2cb87b585b120328f919bfca8553b205138ec571bb7019751a19833c2375","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:59.333828Z","signature_b64":"T5j91ZA9GYkJit/8eXMXp5QHMZJ07XLdp6Tgx1XQOnUoiN+MlsNg7IopD7nVQ9fQMsqu/93st9Y24Tnw/KYRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cdf2cb87b585b120328f919bfca8553b205138ec571bb7019751a19833c2375","last_reissued_at":"2026-07-05T03:57:59.333427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:59.333427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02917","source_version":5,"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-05T03:57:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnVSAOyCwsKVnOqFs1d6CGy5/ElDMZ8g7OZ4SP62QQGAeCUmy/EX1nb20mP+hhAia/0MrkDTlq8F3OHwDsJsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:33:19.006878Z"},"content_sha256":"ee4b51c65c126d1bdf2002b8114a466bcc0dc5d55a3f064a56a9a9acc2002622","schema_version":"1.0","event_id":"sha256:ee4b51c65c126d1bdf2002b8114a466bcc0dc5d55a3f064a56a9a9acc2002622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BTPSZOD3LBNREAZI7EM37SUFKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Budget of Uncertainty for Classes of Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Houra Mahmoudzadeh, Milad Dehghani Filabadi","submitted_at":"2019-07-05T16:36:11Z","abstract_excerpt":"Robust optimization (RO) tackles data uncertainty by optimizing for the worst-case scenario of an uncertain parameter and, in its basic form, is sometimes criticized for producing overly-conservative solutions. To reduce the level of conservatism in RO, one can use the well-known budget-of-uncertainty approach which limits the amount of uncertainty to be considered in the model. In this paper, we study a class of problems with resource uncertainty and propose a robust optimization methodology that produces solutions that are even less conservative than the conventional budget-of-uncertainty ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02917","kind":"arxiv","version":5},"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/1907.02917/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-05T03:57:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paxj61T053SI9PghtS+TjUmpCqWpS5q9cMrvOJUzBG9prm4dke5glY0nOB6Z5uCt1xT/tTxLrBI3uclVe/uUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:33:19.007398Z"},"content_sha256":"4fb49bd5aebdfd58843c6c22a074cf935080164f0d3e905c9783e3b74213cf60","schema_version":"1.0","event_id":"sha256:4fb49bd5aebdfd58843c6c22a074cf935080164f0d3e905c9783e3b74213cf60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTPSZOD3LBNREAZI7EM37SUFKO/bundle.json","state_url":"https://pith.science/pith/BTPSZOD3LBNREAZI7EM37SUFKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTPSZOD3LBNREAZI7EM37SUFKO/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-23T11:33:19Z","links":{"resolver":"https://pith.science/pith/BTPSZOD3LBNREAZI7EM37SUFKO","bundle":"https://pith.science/pith/BTPSZOD3LBNREAZI7EM37SUFKO/bundle.json","state":"https://pith.science/pith/BTPSZOD3LBNREAZI7EM37SUFKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTPSZOD3LBNREAZI7EM37SUFKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BTPSZOD3LBNREAZI7EM37SUFKO","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":"923b10de5a2c1d61f9599acc62cd26c3fb1711946dcb15ca7799997412cfd6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T16:36:11Z","title_canon_sha256":"02b281e7750d9f31015bc660994b454186565049dc94c0b67838ed70ddcee2fb"},"schema_version":"1.0","source":{"id":"1907.02917","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02917","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02917v5","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02917","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_12","alias_value":"BTPSZOD3LBNR","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_16","alias_value":"BTPSZOD3LBNREAZI","created_at":"2026-07-05T03:57:59Z"},{"alias_kind":"pith_short_8","alias_value":"BTPSZOD3","created_at":"2026-07-05T03:57:59Z"}],"graph_snapshots":[{"event_id":"sha256:4fb49bd5aebdfd58843c6c22a074cf935080164f0d3e905c9783e3b74213cf60","target":"graph","created_at":"2026-07-05T03:57:59Z","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/1907.02917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust optimization (RO) tackles data uncertainty by optimizing for the worst-case scenario of an uncertain parameter and, in its basic form, is sometimes criticized for producing overly-conservative solutions. To reduce the level of conservatism in RO, one can use the well-known budget-of-uncertainty approach which limits the amount of uncertainty to be considered in the model. In this paper, we study a class of problems with resource uncertainty and propose a robust optimization methodology that produces solutions that are even less conservative than the conventional budget-of-uncertainty ap","authors_text":"Houra Mahmoudzadeh, Milad Dehghani Filabadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T16:36:11Z","title":"Effective Budget of Uncertainty for Classes of Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02917","kind":"arxiv","version":5},"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:ee4b51c65c126d1bdf2002b8114a466bcc0dc5d55a3f064a56a9a9acc2002622","target":"record","created_at":"2026-07-05T03:57:59Z","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":"923b10de5a2c1d61f9599acc62cd26c3fb1711946dcb15ca7799997412cfd6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T16:36:11Z","title_canon_sha256":"02b281e7750d9f31015bc660994b454186565049dc94c0b67838ed70ddcee2fb"},"schema_version":"1.0","source":{"id":"1907.02917","kind":"arxiv","version":5}},"canonical_sha256":"0cdf2cb87b585b120328f919bfca8553b205138ec571bb7019751a19833c2375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cdf2cb87b585b120328f919bfca8553b205138ec571bb7019751a19833c2375","first_computed_at":"2026-07-05T03:57:59.333427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:57:59.333427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5j91ZA9GYkJit/8eXMXp5QHMZJ07XLdp6Tgx1XQOnUoiN+MlsNg7IopD7nVQ9fQMsqu/93st9Y24Tnw/KYRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:57:59.333828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02917","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee4b51c65c126d1bdf2002b8114a466bcc0dc5d55a3f064a56a9a9acc2002622","sha256:4fb49bd5aebdfd58843c6c22a074cf935080164f0d3e905c9783e3b74213cf60"],"state_sha256":"4234452dc87139bf8a454ab13e813a5168838f0fca175f4c24d6647e10e7b64d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hCjqDodkyan6v9u3S7+mlvBjewF3kcuuJrQ/jGW8hGlQjtLwzj9EjTi/LLZ+1inebrnqpMQX+6m6jtDcy/mBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:33:19.011133Z","bundle_sha256":"dbb55e134ca14a8d0e5a2bd6b97dd413178a0f414e58f9537ec4b3b2cefad0f3"}}