{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JBH6UQT7GL55CCPLDIDLAGDL6Z","short_pith_number":"pith:JBH6UQT7","canonical_record":{"source":{"id":"1402.3095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-13T11:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"01bb359394f5503693dffd7880b22fde0f33431a3e4bb95cfc75e34a9bd1ecfa","abstract_canon_sha256":"06209e73f1916c3109cadf3e8c6ac40cede49b01e59e4182f1b3410f0b8c08b9"},"schema_version":"1.0"},"canonical_sha256":"484fea427f32fbd109eb1a06b0186bf6411598af41d07e709fd0f2726172ac9f","source":{"kind":"arxiv","id":"1402.3095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3095","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3095v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3095","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"JBH6UQT7GL55","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JBH6UQT7GL55CCPL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JBH6UQT7","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JBH6UQT7GL55CCPLDIDLAGDL6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-13T11:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"01bb359394f5503693dffd7880b22fde0f33431a3e4bb95cfc75e34a9bd1ecfa","abstract_canon_sha256":"06209e73f1916c3109cadf3e8c6ac40cede49b01e59e4182f1b3410f0b8c08b9"},"schema_version":"1.0"},"canonical_sha256":"484fea427f32fbd109eb1a06b0186bf6411598af41d07e709fd0f2726172ac9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:07.772532Z","signature_b64":"MWL4qtPOXIdZ5LsAFzyoC+bUvCoh2xFLNTfyfcOM5y/7DiDcZpljuszzmASS0mSf1MyD5SgaOrEXM/AmVZiVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"484fea427f32fbd109eb1a06b0186bf6411598af41d07e709fd0f2726172ac9f","last_reissued_at":"2026-05-18T02:59:07.771826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:07.771826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3095","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-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWyVnE9hh8hl1FP7qLw0ck4Nnj/lT+iyFf+Sef7h/N6DC27SyFzYtBgrkVf2V8mBEGGJPLHMGqHkWvkMUPldBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:47:36.336017Z"},"content_sha256":"1b229f63c37a1e8cb8846eed04d2bf7485d929e67c5c5cccc9a50c84db3a3ca8","schema_version":"1.0","event_id":"sha256:1b229f63c37a1e8cb8846eed04d2bf7485d929e67c5c5cccc9a50c84db3a3ca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JBH6UQT7GL55CCPLDIDLAGDL6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Solutions to Multi-Objective Linear Programs with Uncertain Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, J. Vicente-P\\'erez, M.A. Goberna, V. Jeyakumar","submitted_at":"2014-02-13T11:39:13Z","abstract_excerpt":"In this paper we examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula for radius of robust feasibility guaranteeing constraint feasibility for all possible uncertainties within a specified uncertainty set under affine data parametrization. We then present a complete characterization of robust weakly effcient solutions that are immunized against rank one objective matrix data uncertainty. We also provide classes of commonly used constraint data uncertainty sets under which a robust feas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3095","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-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxQERUDu2kSmDiYQy/lTH5xn7o+Vk04i97lye/rIoTLRSLXRXioQcyPtId1g3RVgJ7ieBNDuAXz0BkYcBsZ0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:47:36.336372Z"},"content_sha256":"f4d5c7ffe627b22a61bb1f4323b8c5ac39984920f7ab375b0446aa200aefe872","schema_version":"1.0","event_id":"sha256:f4d5c7ffe627b22a61bb1f4323b8c5ac39984920f7ab375b0446aa200aefe872"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/bundle.json","state_url":"https://pith.science/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/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-25T18:47:36Z","links":{"resolver":"https://pith.science/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z","bundle":"https://pith.science/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/bundle.json","state":"https://pith.science/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBH6UQT7GL55CCPLDIDLAGDL6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JBH6UQT7GL55CCPLDIDLAGDL6Z","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":"06209e73f1916c3109cadf3e8c6ac40cede49b01e59e4182f1b3410f0b8c08b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-13T11:39:13Z","title_canon_sha256":"01bb359394f5503693dffd7880b22fde0f33431a3e4bb95cfc75e34a9bd1ecfa"},"schema_version":"1.0","source":{"id":"1402.3095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3095","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3095v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3095","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"JBH6UQT7GL55","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JBH6UQT7GL55CCPL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JBH6UQT7","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:f4d5c7ffe627b22a61bb1f4323b8c5ac39984920f7ab375b0446aa200aefe872","target":"graph","created_at":"2026-05-18T02:59:07Z","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 examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula for radius of robust feasibility guaranteeing constraint feasibility for all possible uncertainties within a specified uncertainty set under affine data parametrization. We then present a complete characterization of robust weakly effcient solutions that are immunized against rank one objective matrix data uncertainty. We also provide classes of commonly used constraint data uncertainty sets under which a robust feas","authors_text":"G. Li, J. Vicente-P\\'erez, M.A. Goberna, V. Jeyakumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-13T11:39:13Z","title":"Robust Solutions to Multi-Objective Linear Programs with Uncertain Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3095","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:1b229f63c37a1e8cb8846eed04d2bf7485d929e67c5c5cccc9a50c84db3a3ca8","target":"record","created_at":"2026-05-18T02:59:07Z","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":"06209e73f1916c3109cadf3e8c6ac40cede49b01e59e4182f1b3410f0b8c08b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-13T11:39:13Z","title_canon_sha256":"01bb359394f5503693dffd7880b22fde0f33431a3e4bb95cfc75e34a9bd1ecfa"},"schema_version":"1.0","source":{"id":"1402.3095","kind":"arxiv","version":1}},"canonical_sha256":"484fea427f32fbd109eb1a06b0186bf6411598af41d07e709fd0f2726172ac9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"484fea427f32fbd109eb1a06b0186bf6411598af41d07e709fd0f2726172ac9f","first_computed_at":"2026-05-18T02:59:07.771826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:07.771826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MWL4qtPOXIdZ5LsAFzyoC+bUvCoh2xFLNTfyfcOM5y/7DiDcZpljuszzmASS0mSf1MyD5SgaOrEXM/AmVZiVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:07.772532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b229f63c37a1e8cb8846eed04d2bf7485d929e67c5c5cccc9a50c84db3a3ca8","sha256:f4d5c7ffe627b22a61bb1f4323b8c5ac39984920f7ab375b0446aa200aefe872"],"state_sha256":"408144d76d34130b577a863bb3e85b38d49ff03dc2cc535d3b31a09d9a710c43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D29cAQcdRX1lmI3O6yWrXTZFIlCML2UHa0osDA0Y3D/2WbHdINcxJCVv5l1P81Kvl/jjNpsHOInJDuvvcvemCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:47:36.338237Z","bundle_sha256":"072a2106ab2d87907fef9042e5d37594de5f6732bdf1cb12732e3263a5367fb3"}}