{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5RPKAT2CGOV3B2C25TAHTPDBDW","short_pith_number":"pith:5RPKAT2C","canonical_record":{"source":{"id":"1908.05082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9b6daa5a0e990915d9e0260e1a34fa384d0f632e65b2af92f33eb5dcc52e1a1a","abstract_canon_sha256":"c99fa00369b377fc8ef4fb6e80d8771957bf0aa583a677d3e5536fdb65b4e4d7"},"schema_version":"1.0"},"canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","source":{"kind":"arxiv","id":"1908.05082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05082","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05082v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05082","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"5RPKAT2CGOV3","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"5RPKAT2CGOV3B2C2","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"5RPKAT2C","created_at":"2026-07-04T23:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5RPKAT2CGOV3B2C25TAHTPDBDW","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9b6daa5a0e990915d9e0260e1a34fa384d0f632e65b2af92f33eb5dcc52e1a1a","abstract_canon_sha256":"c99fa00369b377fc8ef4fb6e80d8771957bf0aa583a677d3e5536fdb65b4e4d7"},"schema_version":"1.0"},"canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:59.666911Z","signature_b64":"uMryCWPOdEQ//5N4/4jcE2KOIk7R+2rl4qtfok2UFnVlbUWQK7hksxCHP4LSzYwCP70R/rzfdMuzWy8DSbdNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","last_reissued_at":"2026-07-04T23:55:59.666542Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:59.666542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05082","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-07-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hu1JBJGHB2yWEumhfwArIQOBzi3y+sckf/CV5EdBgPDJpqWlBmfkf5jNsCEguy/XhJVG20Jpzc1ABt47EolgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:26:40.088613Z"},"content_sha256":"2117e703f42370827ba11ddb07dcea233090862f34581c22df9bf688e1fe26bf","schema_version":"1.0","event_id":"sha256:2117e703f42370827ba11ddb07dcea233090862f34581c22df9bf688e1fe26bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5RPKAT2CGOV3B2C25TAHTPDBDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Christophe Duhamel, Iago A. Carvalho, Thiago F. Noronha","submitted_at":"2019-08-14T11:46:37Z","abstract_excerpt":"We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computational experiments developed on variations of MIPLIB instances show that the heuristics obtain good results in a reasonable computational time when compared to the Benders-like Decomposition algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05082","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/1908.05082/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-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcEHnjtJl3UO9ePBagdqFTwfyNjaVpUbGpQ/hY2Tptt7+0bCsRJNd5IPNeZNwNpkNfSn2kX2mt68VOA6CYmaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:26:40.089215Z"},"content_sha256":"eeed38335722d268671518af898bbb3bdaaf5f89680df0be350845bd4eac29f6","schema_version":"1.0","event_id":"sha256:eeed38335722d268671518af898bbb3bdaaf5f89680df0be350845bd4eac29f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/bundle.json","state_url":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/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-16T09:26:40Z","links":{"resolver":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW","bundle":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/bundle.json","state":"https://pith.science/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RPKAT2CGOV3B2C25TAHTPDBDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5RPKAT2CGOV3B2C25TAHTPDBDW","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":"c99fa00369b377fc8ef4fb6e80d8771957bf0aa583a677d3e5536fdb65b4e4d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","title_canon_sha256":"9b6daa5a0e990915d9e0260e1a34fa384d0f632e65b2af92f33eb5dcc52e1a1a"},"schema_version":"1.0","source":{"id":"1908.05082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05082","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05082v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05082","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"5RPKAT2CGOV3","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"5RPKAT2CGOV3B2C2","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"5RPKAT2C","created_at":"2026-07-04T23:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:eeed38335722d268671518af898bbb3bdaaf5f89680df0be350845bd4eac29f6","target":"graph","created_at":"2026-07-04T23:55: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/1908.05082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computational experiments developed on variations of MIPLIB instances show that the heuristics obtain good results in a reasonable computational time when compared to the Benders-like Decomposition algorithm.","authors_text":"Christophe Duhamel, Iago A. Carvalho, Thiago F. Noronha","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05082","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:2117e703f42370827ba11ddb07dcea233090862f34581c22df9bf688e1fe26bf","target":"record","created_at":"2026-07-04T23:55: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":"c99fa00369b377fc8ef4fb6e80d8771957bf0aa583a677d3e5536fdb65b4e4d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-14T11:46:37Z","title_canon_sha256":"9b6daa5a0e990915d9e0260e1a34fa384d0f632e65b2af92f33eb5dcc52e1a1a"},"schema_version":"1.0","source":{"id":"1908.05082","kind":"arxiv","version":1}},"canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec5ea04f4233abb0e85aecc079bc611d83e3af92ef84cf8245e84b3cc12a0f43","first_computed_at":"2026-07-04T23:55:59.666542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:59.666542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uMryCWPOdEQ//5N4/4jcE2KOIk7R+2rl4qtfok2UFnVlbUWQK7hksxCHP4LSzYwCP70R/rzfdMuzWy8DSbdNCA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:59.666911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2117e703f42370827ba11ddb07dcea233090862f34581c22df9bf688e1fe26bf","sha256:eeed38335722d268671518af898bbb3bdaaf5f89680df0be350845bd4eac29f6"],"state_sha256":"a1c8bc8285e74b7d0b3be9fb00cc95fce24b203dd6edbfc594c8008b482c8b48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqnTYL63H/xi9WLDfg74hMx40I97fXBNvc7Gf9/IxcjZkyvaEhr9K0emKrsyjfInXT1M5/NPtAgJeeHNIAI8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:26:40.093288Z","bundle_sha256":"e06014f77c041f7fb8366331543070e6cbf53a77a04b2fdcecf3b9a0563dc7ad"}}