{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I3SKR74MQ7RL3RZ2A72A3PQJUY","short_pith_number":"pith:I3SKR74M","canonical_record":{"source":{"id":"1401.7043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-27T22:59:52Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"db34be03c6f01ff4094150558ce1c74869444e1b5bd96eee404a6a49ef06e169","abstract_canon_sha256":"8d3077a9b52ce92483aadf514c9907efa23931408e5f77cd213ae599266e5594"},"schema_version":"1.0"},"canonical_sha256":"46e4a8ff8c87e2bdc73a07f40dbe09a619187dcde7a29cb1041778f5a921b8ba","source":{"kind":"arxiv","id":"1401.7043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7043","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7043v2","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7043","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"I3SKR74MQ7RL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3SKR74MQ7RL3RZ2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3SKR74M","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I3SKR74MQ7RL3RZ2A72A3PQJUY","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-27T22:59:52Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"db34be03c6f01ff4094150558ce1c74869444e1b5bd96eee404a6a49ef06e169","abstract_canon_sha256":"8d3077a9b52ce92483aadf514c9907efa23931408e5f77cd213ae599266e5594"},"schema_version":"1.0"},"canonical_sha256":"46e4a8ff8c87e2bdc73a07f40dbe09a619187dcde7a29cb1041778f5a921b8ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:25.877700Z","signature_b64":"aICCANNk0ZJzBCzj0OTzwlTgBYFkkNh8boWF2d8FIKZsFzAyP5ASIHNWxmM44IzNa1cPc35UDPBi7aAE2SBlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46e4a8ff8c87e2bdc73a07f40dbe09a619187dcde7a29cb1041778f5a921b8ba","last_reissued_at":"2026-05-18T02:42:25.876791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:25.876791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7043","source_version":2,"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-18T02:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rijcsrFZQ7aT8EzESqXIOLisR3X/Sde1f152JRLCc/lrJ4L8R+FW37FvgubgZmhZKh9PbRBPRBdFwAFediOfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:06.361880Z"},"content_sha256":"0049eeec8ceff203193ffb1319554028b10ee590a589cfce29c7cb699dc4c371","schema_version":"1.0","event_id":"sha256:0049eeec8ceff203193ffb1319554028b10ee590a589cfce29c7cb699dc4c371"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I3SKR74MQ7RL3RZ2A72A3PQJUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DM","authors_text":"Andrew Mastin, Patrick Jaillet, Sang Chin","submitted_at":"2014-01-27T22:59:52Z","abstract_excerpt":"The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. The existing minmax regret model considers only deterministic solutions/strategies, and minmax regret versions of most polynomial solvable problems are NP-hard. In this paper, we consider a randomized model where the optimizing player selects a probability distribution (corresponding to a mixed stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7043","kind":"arxiv","version":2},"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-18T02:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUmZGgDpfixBERvtXsphD+AvNoFNmYmircMobl2dNgNxjEk9i2O3COn6oP1ieHxcyK/Ekd2j1xPzgdQD1W5mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:06.362226Z"},"content_sha256":"63083dad2cfb19f5b8e7632e93db45cd8fda13604c6cf0de0d171176000c05d8","schema_version":"1.0","event_id":"sha256:63083dad2cfb19f5b8e7632e93db45cd8fda13604c6cf0de0d171176000c05d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/bundle.json","state_url":"https://pith.science/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/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-03T09:25:06Z","links":{"resolver":"https://pith.science/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY","bundle":"https://pith.science/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/bundle.json","state":"https://pith.science/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3SKR74MQ7RL3RZ2A72A3PQJUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I3SKR74MQ7RL3RZ2A72A3PQJUY","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":"8d3077a9b52ce92483aadf514c9907efa23931408e5f77cd213ae599266e5594","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-27T22:59:52Z","title_canon_sha256":"db34be03c6f01ff4094150558ce1c74869444e1b5bd96eee404a6a49ef06e169"},"schema_version":"1.0","source":{"id":"1401.7043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7043","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7043v2","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7043","created_at":"2026-05-18T02:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"I3SKR74MQ7RL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3SKR74MQ7RL3RZ2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3SKR74M","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:63083dad2cfb19f5b8e7632e93db45cd8fda13604c6cf0de0d171176000c05d8","target":"graph","created_at":"2026-05-18T02:42:25Z","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":"The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. The existing minmax regret model considers only deterministic solutions/strategies, and minmax regret versions of most polynomial solvable problems are NP-hard. In this paper, we consider a randomized model where the optimizing player selects a probability distribution (corresponding to a mixed stra","authors_text":"Andrew Mastin, Patrick Jaillet, Sang Chin","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-27T22:59:52Z","title":"Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7043","kind":"arxiv","version":2},"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:0049eeec8ceff203193ffb1319554028b10ee590a589cfce29c7cb699dc4c371","target":"record","created_at":"2026-05-18T02:42:25Z","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":"8d3077a9b52ce92483aadf514c9907efa23931408e5f77cd213ae599266e5594","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-27T22:59:52Z","title_canon_sha256":"db34be03c6f01ff4094150558ce1c74869444e1b5bd96eee404a6a49ef06e169"},"schema_version":"1.0","source":{"id":"1401.7043","kind":"arxiv","version":2}},"canonical_sha256":"46e4a8ff8c87e2bdc73a07f40dbe09a619187dcde7a29cb1041778f5a921b8ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46e4a8ff8c87e2bdc73a07f40dbe09a619187dcde7a29cb1041778f5a921b8ba","first_computed_at":"2026-05-18T02:42:25.876791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:25.876791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aICCANNk0ZJzBCzj0OTzwlTgBYFkkNh8boWF2d8FIKZsFzAyP5ASIHNWxmM44IzNa1cPc35UDPBi7aAE2SBlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:25.877700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0049eeec8ceff203193ffb1319554028b10ee590a589cfce29c7cb699dc4c371","sha256:63083dad2cfb19f5b8e7632e93db45cd8fda13604c6cf0de0d171176000c05d8"],"state_sha256":"ac145cc66913bdda151d499fe5cf3b5d70d8d575d97c46f84ef8e8cdeee30862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+46nLu3PZgX0n0W6DgbjWGttPlemC7FbufAj76nKE9buqHH6Xn2Rohk+kuF7b2zU4wJilKGd3U7I+v8K0rmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:25:06.364170Z","bundle_sha256":"7cf6a5b5643a3a295c6e8c41df34ea74bd3212c0aea62f4b4bb3639098ef581f"}}