{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YAWPAQUO4BKGN5NAAILLXECJNN","short_pith_number":"pith:YAWPAQUO","schema_version":"1.0","canonical_sha256":"c02cf0428ee05466f5a00216bb90496b77fffdd133b1c61f730d19618c18e4a7","source":{"kind":"arxiv","id":"1403.7427","version":1},"attestation_state":"computed","paper":{"title":"Robust optimal solutions in interval linear programming with forall-exists quantifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Milan Hlad\\'ik","submitted_at":"2014-03-28T16:02:56Z","abstract_excerpt":"We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are appropriate choices of the right-hand side entries from their interval domains such that x* remains optimal. we propose a method to check for robustness of a given point, and also recommend how a suitable candidate can be found. We also discuss topological properties of the robust optimal solution set. We illustrate applicability of our concept in a transportation pro"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.7427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-28T16:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"8f659ee0fd843814509968da824b6cdc45f686de2a110d3e8855ae515e4b08fc","abstract_canon_sha256":"c9ee078965bf5a71c2466616ae40269164d4d39d5920fba5fb97d2ea7383c8c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.936287Z","signature_b64":"CohATdsuq8MT1eBF4bKNVilS56C7vXl/pxZJ52KJK/d8obZXKcu3dAi7HFk7X34cG3lv5Y2zjD5ZqC6vmxZhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02cf0428ee05466f5a00216bb90496b77fffdd133b1c61f730d19618c18e4a7","last_reissued_at":"2026-05-17T23:45:15.935570Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.935570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust optimal solutions in interval linear programming with forall-exists quantifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Milan Hlad\\'ik","submitted_at":"2014-03-28T16:02:56Z","abstract_excerpt":"We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are appropriate choices of the right-hand side entries from their interval domains such that x* remains optimal. we propose a method to check for robustness of a given point, and also recommend how a suitable candidate can be found. We also discuss topological properties of the robust optimal solution set. We illustrate applicability of our concept in a transportation pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7427","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.7427","created_at":"2026-05-17T23:45:15.935676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7427v1","created_at":"2026-05-17T23:45:15.935676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7427","created_at":"2026-05-17T23:45:15.935676+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAWPAQUO4BKG","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAWPAQUO4BKGN5NA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAWPAQUO","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN","json":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN.json","graph_json":"https://pith.science/api/pith-number/YAWPAQUO4BKGN5NAAILLXECJNN/graph.json","events_json":"https://pith.science/api/pith-number/YAWPAQUO4BKGN5NAAILLXECJNN/events.json","paper":"https://pith.science/paper/YAWPAQUO"},"agent_actions":{"view_html":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN","download_json":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN.json","view_paper":"https://pith.science/paper/YAWPAQUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7427&json=true","fetch_graph":"https://pith.science/api/pith-number/YAWPAQUO4BKGN5NAAILLXECJNN/graph.json","fetch_events":"https://pith.science/api/pith-number/YAWPAQUO4BKGN5NAAILLXECJNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN/action/storage_attestation","attest_author":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN/action/author_attestation","sign_citation":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN/action/citation_signature","submit_replication":"https://pith.science/pith/YAWPAQUO4BKGN5NAAILLXECJNN/action/replication_record"}},"created_at":"2026-05-17T23:45:15.935676+00:00","updated_at":"2026-05-17T23:45:15.935676+00:00"}