{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Y67DNDQUYDKBCPDPPHQYSYQFIY","short_pith_number":"pith:Y67DNDQU","canonical_record":{"source":{"id":"2205.03386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-05T07:02:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d839b3b7629d326c90e82ec154630dc433f85c5ffd432025e930cdb067a783bf","abstract_canon_sha256":"58c216dc0e16cfcc1a907d28fd0111f74797bcbf9468c665914ca99d160483ec"},"schema_version":"1.0"},"canonical_sha256":"c7be368e14c0d4113c6f79e1896205463da0fd8ab3af988924a3de744e6b056e","source":{"kind":"arxiv","id":"2205.03386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03386","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03386v1","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03386","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y67DNDQUYDKB","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_16","alias_value":"Y67DNDQUYDKBCPDP","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_8","alias_value":"Y67DNDQU","created_at":"2026-07-05T04:20:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Y67DNDQUYDKBCPDPPHQYSYQFIY","target":"record","payload":{"canonical_record":{"source":{"id":"2205.03386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-05T07:02:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d839b3b7629d326c90e82ec154630dc433f85c5ffd432025e930cdb067a783bf","abstract_canon_sha256":"58c216dc0e16cfcc1a907d28fd0111f74797bcbf9468c665914ca99d160483ec"},"schema_version":"1.0"},"canonical_sha256":"c7be368e14c0d4113c6f79e1896205463da0fd8ab3af988924a3de744e6b056e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:59.386152Z","signature_b64":"z9b30YzuZSTOcdRRcwxfHf3wIcAka/RrxXJK7SkYgnuM7U2iuBItfkrZAhKceO/9aX00BtpJB2LQvKJuEpnuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7be368e14c0d4113c6f79e1896205463da0fd8ab3af988924a3de744e6b056e","last_reissued_at":"2026-07-05T04:20:59.385685Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:59.385685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.03386","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-05T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEFXl2JC3FQtej7FxORB+l/2QOph7cJxF0Vk4D8ZOkcqFAQQ3vI2vgl/OG1ahQOFYmV52DG8rMSqScB5P02wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:25:24.705031Z"},"content_sha256":"c766922fd7e8dd77eb1661c548b5108fc57a085f8110ac8cba799e555aaaf557","schema_version":"1.0","event_id":"sha256:c766922fd7e8dd77eb1661c548b5108fc57a085f8110ac8cba799e555aaaf557"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Y67DNDQUYDKBCPDPPHQYSYQFIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A matheuristic for tri-objective binary integer programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Duleabom An, Fabien Tricoire, Markus Sinnl, Sophie N. Parragh","submitted_at":"2022-05-05T07:02:36Z","abstract_excerpt":"Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient solutions. These solutions have the property that neither objective can be improved without deteriorating another objective. Motivated by the success of matheuristics in the single-objective domain, we propose a linear programming-based matheuristic for tri-objective binary integer programming. To achieve a high-quality approximation of the optimal set of trade-off solutions, a lower bound set is first obtained using th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03386","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/2205.03386/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-05T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RgDoFu1Y3yM1aj6hEtuDVVDkbMKQCtry/71t8zpm/K2VT2WNYfRu+MW7zmM71/malpTsRF43hGSV5ZQ65YXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:25:24.705861Z"},"content_sha256":"180690c50b400e59ff38a41cab33236bb5365669179013e99be5a76d9da4886c","schema_version":"1.0","event_id":"sha256:180690c50b400e59ff38a41cab33236bb5365669179013e99be5a76d9da4886c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/bundle.json","state_url":"https://pith.science/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/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-21T02:25:24Z","links":{"resolver":"https://pith.science/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY","bundle":"https://pith.science/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/bundle.json","state":"https://pith.science/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y67DNDQUYDKBCPDPPHQYSYQFIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Y67DNDQUYDKBCPDPPHQYSYQFIY","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":"58c216dc0e16cfcc1a907d28fd0111f74797bcbf9468c665914ca99d160483ec","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-05T07:02:36Z","title_canon_sha256":"d839b3b7629d326c90e82ec154630dc433f85c5ffd432025e930cdb067a783bf"},"schema_version":"1.0","source":{"id":"2205.03386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03386","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03386v1","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03386","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y67DNDQUYDKB","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_16","alias_value":"Y67DNDQUYDKBCPDP","created_at":"2026-07-05T04:20:59Z"},{"alias_kind":"pith_short_8","alias_value":"Y67DNDQU","created_at":"2026-07-05T04:20:59Z"}],"graph_snapshots":[{"event_id":"sha256:180690c50b400e59ff38a41cab33236bb5365669179013e99be5a76d9da4886c","target":"graph","created_at":"2026-07-05T04:20: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/2205.03386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient solutions. These solutions have the property that neither objective can be improved without deteriorating another objective. Motivated by the success of matheuristics in the single-objective domain, we propose a linear programming-based matheuristic for tri-objective binary integer programming. To achieve a high-quality approximation of the optimal set of trade-off solutions, a lower bound set is first obtained using th","authors_text":"Duleabom An, Fabien Tricoire, Markus Sinnl, Sophie N. Parragh","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-05T07:02:36Z","title":"A matheuristic for tri-objective binary integer programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03386","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:c766922fd7e8dd77eb1661c548b5108fc57a085f8110ac8cba799e555aaaf557","target":"record","created_at":"2026-07-05T04:20: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":"58c216dc0e16cfcc1a907d28fd0111f74797bcbf9468c665914ca99d160483ec","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-05T07:02:36Z","title_canon_sha256":"d839b3b7629d326c90e82ec154630dc433f85c5ffd432025e930cdb067a783bf"},"schema_version":"1.0","source":{"id":"2205.03386","kind":"arxiv","version":1}},"canonical_sha256":"c7be368e14c0d4113c6f79e1896205463da0fd8ab3af988924a3de744e6b056e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7be368e14c0d4113c6f79e1896205463da0fd8ab3af988924a3de744e6b056e","first_computed_at":"2026-07-05T04:20:59.385685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:20:59.385685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z9b30YzuZSTOcdRRcwxfHf3wIcAka/RrxXJK7SkYgnuM7U2iuBItfkrZAhKceO/9aX00BtpJB2LQvKJuEpnuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:20:59.386152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.03386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c766922fd7e8dd77eb1661c548b5108fc57a085f8110ac8cba799e555aaaf557","sha256:180690c50b400e59ff38a41cab33236bb5365669179013e99be5a76d9da4886c"],"state_sha256":"4b9c992848b33cf1269be155f4362718b1ce934be79b695fd346fb320f558b30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSW1DlqvT4DZoIGUywXjg9E5tqd1REXWh/cjXDUGhq8CDshJ7u/LOQYtS0Z1Z83oV+1C5xWlwBBDjsiTr9dCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T02:25:24.710615Z","bundle_sha256":"4a0157e7eb217cdefe6e8b0903c117064c5a5e6839ffd23ffdde23ef7b93bc97"}}