{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZOTEZEKIDU6ZE4BX5VC3NMMPOR","short_pith_number":"pith:ZOTEZEKI","canonical_record":{"source":{"id":"1112.6075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"8658252f77fa78ab3b64e86f3442f194ea1326edfa3f491ed6df43aa9a6901b0","abstract_canon_sha256":"b6061d217b8a884202177e54c3fbb1971dfd4b48cf4aa4251d42fbd0340ffce8"},"schema_version":"1.0"},"canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","source":{"kind":"arxiv","id":"1112.6075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6075","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6075v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6075","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZOTEZEKIDU6Z","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZOTEZEKIDU6ZE4BX","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZOTEZEKI","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZOTEZEKIDU6ZE4BX5VC3NMMPOR","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"8658252f77fa78ab3b64e86f3442f194ea1326edfa3f491ed6df43aa9a6901b0","abstract_canon_sha256":"b6061d217b8a884202177e54c3fbb1971dfd4b48cf4aa4251d42fbd0340ffce8"},"schema_version":"1.0"},"canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.901242Z","signature_b64":"NDJCSsS7DOdP8eW68a37zklAHCs3LeoJEUDD3Zjn8CnDTnJD8XchtBlGbrvDvkSuL5/kxFIl5B2YC4X6pypPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","last_reissued_at":"2026-05-18T04:05:36.900506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.900506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6075","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-05-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"641KFK60Rjhnwnq7q2hAJP9NXkbm+Ff6Sc74e3K6PrVcliqpsKVuDtIscLLR3UW7XxcXvEotbanxcFiIn2viAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:22.475616Z"},"content_sha256":"37450e08cb2d33918a0c5a39cde393d41abe7166f8d0ad331557bcf44b840216","schema_version":"1.0","event_id":"sha256:37450e08cb2d33918a0c5a39cde393d41abe7166f8d0ad331557bcf44b840216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZOTEZEKIDU6ZE4BX5VC3NMMPOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A semidefinite programming approach for solving Multiobjective Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.OC","authors_text":"Justo Puerto, Safae El-Haj Ben-Ali, V\\'ictor Blanco","submitted_at":"2011-12-28T07:51:55Z","abstract_excerpt":"Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6075","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":""},"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-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEbMoOIyxzfuaziTzfGzXZYcWYGs2mdW5zbpyQRJEgQ67KVHVRSonlWYukzXsXJYn5KL5w5/FmnQ/YYf3w/4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:22.476263Z"},"content_sha256":"c83278c82a51fe685372857d52891a1c5c3b8abac833651b957cc1535757e490","schema_version":"1.0","event_id":"sha256:c83278c82a51fe685372857d52891a1c5c3b8abac833651b957cc1535757e490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/bundle.json","state_url":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/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-03T12:17:22Z","links":{"resolver":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR","bundle":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/bundle.json","state":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZOTEZEKIDU6ZE4BX5VC3NMMPOR","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":"b6061d217b8a884202177e54c3fbb1971dfd4b48cf4aa4251d42fbd0340ffce8","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","title_canon_sha256":"8658252f77fa78ab3b64e86f3442f194ea1326edfa3f491ed6df43aa9a6901b0"},"schema_version":"1.0","source":{"id":"1112.6075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6075","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6075v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6075","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZOTEZEKIDU6Z","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZOTEZEKIDU6ZE4BX","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZOTEZEKI","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:c83278c82a51fe685372857d52891a1c5c3b8abac833651b957cc1535757e490","target":"graph","created_at":"2026-05-18T04:05:36Z","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":"Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial in","authors_text":"Justo Puerto, Safae El-Haj Ben-Ali, V\\'ictor Blanco","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","title":"A semidefinite programming approach for solving Multiobjective Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6075","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:37450e08cb2d33918a0c5a39cde393d41abe7166f8d0ad331557bcf44b840216","target":"record","created_at":"2026-05-18T04:05:36Z","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":"b6061d217b8a884202177e54c3fbb1971dfd4b48cf4aa4251d42fbd0340ffce8","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","title_canon_sha256":"8658252f77fa78ab3b64e86f3442f194ea1326edfa3f491ed6df43aa9a6901b0"},"schema_version":"1.0","source":{"id":"1112.6075","kind":"arxiv","version":1}},"canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","first_computed_at":"2026-05-18T04:05:36.900506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:36.900506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NDJCSsS7DOdP8eW68a37zklAHCs3LeoJEUDD3Zjn8CnDTnJD8XchtBlGbrvDvkSuL5/kxFIl5B2YC4X6pypPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:36.901242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37450e08cb2d33918a0c5a39cde393d41abe7166f8d0ad331557bcf44b840216","sha256:c83278c82a51fe685372857d52891a1c5c3b8abac833651b957cc1535757e490"],"state_sha256":"8a39def73397d88cae5063a14d699b163afc47015439f0ffcde79a2e7964d4e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44tc0/iRkCIVcYRmhdLQrGF7jMMNan4m821A2xfEuBEA7JhNdySvIJW+xV4NQFu8xmAcnwV+F11GfkKpkvaGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:17:22.479567Z","bundle_sha256":"bb0ffa7bb662cd76b670f6026c4322519ff514a9d2e949e2ea087841e4c8fd36"}}