{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X3CDULZ7VTGN5X4IM64FXYOJIS","short_pith_number":"pith:X3CDULZ7","canonical_record":{"source":{"id":"1602.01764","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T17:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"d8887688058ef02a1bdea90d4b8ede882247fc2614a180b19327bbca9fd3238b","abstract_canon_sha256":"2d4de5fe073cffce42aad5f272ec8c61f3c3dcae7af96e21827b4c5624d508e3"},"schema_version":"1.0"},"canonical_sha256":"bec43a2f3facccdedf8867b85be1c94485a85fce13a8f70bf5d9878dab30d753","source":{"kind":"arxiv","id":"1602.01764","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01764","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01764v3","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01764","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"X3CDULZ7VTGN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X3CDULZ7VTGN5X4I","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X3CDULZ7","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X3CDULZ7VTGN5X4IM64FXYOJIS","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01764","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T17:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"d8887688058ef02a1bdea90d4b8ede882247fc2614a180b19327bbca9fd3238b","abstract_canon_sha256":"2d4de5fe073cffce42aad5f272ec8c61f3c3dcae7af96e21827b4c5624d508e3"},"schema_version":"1.0"},"canonical_sha256":"bec43a2f3facccdedf8867b85be1c94485a85fce13a8f70bf5d9878dab30d753","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:33.783578Z","signature_b64":"gkwNERY+6b66bl1goifQ8IWto15zuxTn5MvYo12wUL0NrlO346BMkUB9goA9icDOUtXWfRWGT3pBj9nuEuaECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bec43a2f3facccdedf8867b85be1c94485a85fce13a8f70bf5d9878dab30d753","last_reissued_at":"2026-05-18T00:40:33.782789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:33.782789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01764","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-05-18T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UczvRNaKHkKxNGtqUuo9sF2dVxoUNEyt+QuhyHxPnUioAetTJtjgrGPMINN14gOXpgko3FvC7NV8Ks/PIh20Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:13:55.768942Z"},"content_sha256":"6c7bb1bffe68a893446623343b3e08028fd1f9325a97fa2c97b6bab02560df09","schema_version":"1.0","event_id":"sha256:6c7bb1bffe68a893446623343b3e08028fd1f9325a97fa2c97b6bab02560df09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X3CDULZ7VTGN5X4IM64FXYOJIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A double oracle approach for minmax regret optimization problems with interval data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hugo Gilbert, Olivier Spanjaard","submitted_at":"2016-02-04T17:57:30Z","abstract_excerpt":"In this paper, we provide a generic anytime lower bounding procedure for minmax regret optimization problems. We show that the lower bound obtained is always at least as accurate as the lower bound recently proposed by Chassein and Goerigk (2015). This lower bound can be viewed as the optimal value of a linear programming relaxation of a mixed integer programming formulation of minmax regret optimization, but the contribution of the paper is to compute this lower bound via a double oracle algorithm (McMahan et al., 2003) that we specify. The double oracle algorithm is designed by relying on a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01764","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":""},"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-05-18T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vrULo+awYQHJ+JG6Xco8GyHqdi1LIBeUE+Iww+2+6jOQejFUp4Wzf6hKQot7ygL1Tc4tYeCPAJFwK0u4VDDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:13:55.769278Z"},"content_sha256":"2bec5f6b8d26f006c461b3648142038f469489b104dcecf6251fb73f1071e16f","schema_version":"1.0","event_id":"sha256:2bec5f6b8d26f006c461b3648142038f469489b104dcecf6251fb73f1071e16f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/bundle.json","state_url":"https://pith.science/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/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-06-27T13:13:55Z","links":{"resolver":"https://pith.science/pith/X3CDULZ7VTGN5X4IM64FXYOJIS","bundle":"https://pith.science/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/bundle.json","state":"https://pith.science/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3CDULZ7VTGN5X4IM64FXYOJIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X3CDULZ7VTGN5X4IM64FXYOJIS","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":"2d4de5fe073cffce42aad5f272ec8c61f3c3dcae7af96e21827b4c5624d508e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T17:57:30Z","title_canon_sha256":"d8887688058ef02a1bdea90d4b8ede882247fc2614a180b19327bbca9fd3238b"},"schema_version":"1.0","source":{"id":"1602.01764","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01764","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01764v3","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01764","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"X3CDULZ7VTGN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X3CDULZ7VTGN5X4I","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X3CDULZ7","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:2bec5f6b8d26f006c461b3648142038f469489b104dcecf6251fb73f1071e16f","target":"graph","created_at":"2026-05-18T00:40:33Z","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"},"paper":{"abstract_excerpt":"In this paper, we provide a generic anytime lower bounding procedure for minmax regret optimization problems. We show that the lower bound obtained is always at least as accurate as the lower bound recently proposed by Chassein and Goerigk (2015). This lower bound can be viewed as the optimal value of a linear programming relaxation of a mixed integer programming formulation of minmax regret optimization, but the contribution of the paper is to compute this lower bound via a double oracle algorithm (McMahan et al., 2003) that we specify. The double oracle algorithm is designed by relying on a ","authors_text":"Hugo Gilbert, Olivier Spanjaard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T17:57:30Z","title":"A double oracle approach for minmax regret optimization problems with interval data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01764","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:6c7bb1bffe68a893446623343b3e08028fd1f9325a97fa2c97b6bab02560df09","target":"record","created_at":"2026-05-18T00:40:33Z","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":"2d4de5fe073cffce42aad5f272ec8c61f3c3dcae7af96e21827b4c5624d508e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T17:57:30Z","title_canon_sha256":"d8887688058ef02a1bdea90d4b8ede882247fc2614a180b19327bbca9fd3238b"},"schema_version":"1.0","source":{"id":"1602.01764","kind":"arxiv","version":3}},"canonical_sha256":"bec43a2f3facccdedf8867b85be1c94485a85fce13a8f70bf5d9878dab30d753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bec43a2f3facccdedf8867b85be1c94485a85fce13a8f70bf5d9878dab30d753","first_computed_at":"2026-05-18T00:40:33.782789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:33.782789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gkwNERY+6b66bl1goifQ8IWto15zuxTn5MvYo12wUL0NrlO346BMkUB9goA9icDOUtXWfRWGT3pBj9nuEuaECA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:33.783578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01764","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c7bb1bffe68a893446623343b3e08028fd1f9325a97fa2c97b6bab02560df09","sha256:2bec5f6b8d26f006c461b3648142038f469489b104dcecf6251fb73f1071e16f"],"state_sha256":"83d1f9e3edaba248562eff4b8522c196ff70e11d9d63692060a81ce2f5c682e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYfQWsgK4PScob8FPEYG7dVbxDylOaDTSt1plH7FIInrwL23/5EbhZGlWVad2kcFXCB58vSdv6mAGr04iavYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:13:55.771123Z","bundle_sha256":"5596e8aead28aa9df2d02e9682c10a58f1c0f3a24a57e0ce16c3fa24e84e48a4"}}