{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZZ72N2TYRGTF2NHIAVCRCVLMPI","short_pith_number":"pith:ZZ72N2TY","schema_version":"1.0","canonical_sha256":"ce7fa6ea7889a65d34e8054511556c7a22ad4613c66c04feb4632889f90a83ca","source":{"kind":"arxiv","id":"1312.4489","version":3},"attestation_state":"computed","paper":{"title":"A Utility Theory Based Interactive Approach to Robustness in Linear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tuncel, Mehdi Karimi, Somayeh Moazeni","submitted_at":"2013-12-16T19:57:47Z","abstract_excerpt":"We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms for robust optimization, based on concave and quasi-concave utility functions. In addition to practical advantages, due to the flexibility of our approach, we are able to prove that under a theoretical framework due to Bertsimas and Sim [14], which establishes the existence of certain convex formulation of robust optimization problems, the robust optimal so"},"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":"1312.4489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T19:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"188bbedb06fcb21b749878785216cfb264c7f65a90649b4f717369cf3cb5aa34","abstract_canon_sha256":"64adea01a9cdbb8629c8e3588d0bad0b977a155970bbc8e2cced8223acc0bade"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:42.998232Z","signature_b64":"rxyRlV9TdaVjwvkspMC2H0uamy0cCKR16F2t5iqWXzahsxzUwJFFJMYZ2UAd0Hr3VQnmz3/teT/va8GoPBAXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce7fa6ea7889a65d34e8054511556c7a22ad4613c66c04feb4632889f90a83ca","last_reissued_at":"2026-05-18T00:15:42.997674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:42.997674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Utility Theory Based Interactive Approach to Robustness in Linear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tuncel, Mehdi Karimi, Somayeh Moazeni","submitted_at":"2013-12-16T19:57:47Z","abstract_excerpt":"We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms for robust optimization, based on concave and quasi-concave utility functions. In addition to practical advantages, due to the flexibility of our approach, we are able to prove that under a theoretical framework due to Bertsimas and Sim [14], which establishes the existence of certain convex formulation of robust optimization problems, the robust optimal so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4489","kind":"arxiv","version":3},"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":"1312.4489","created_at":"2026-05-18T00:15:42.997763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4489v3","created_at":"2026-05-18T00:15:42.997763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4489","created_at":"2026-05-18T00:15:42.997763+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ72N2TYRGTF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ72N2TYRGTF2NHI","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ72N2TY","created_at":"2026-05-18T12:28:09.283467+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/ZZ72N2TYRGTF2NHIAVCRCVLMPI","json":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI.json","graph_json":"https://pith.science/api/pith-number/ZZ72N2TYRGTF2NHIAVCRCVLMPI/graph.json","events_json":"https://pith.science/api/pith-number/ZZ72N2TYRGTF2NHIAVCRCVLMPI/events.json","paper":"https://pith.science/paper/ZZ72N2TY"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI","download_json":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI.json","view_paper":"https://pith.science/paper/ZZ72N2TY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4489&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ72N2TYRGTF2NHIAVCRCVLMPI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ72N2TYRGTF2NHIAVCRCVLMPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ72N2TYRGTF2NHIAVCRCVLMPI/action/replication_record"}},"created_at":"2026-05-18T00:15:42.997763+00:00","updated_at":"2026-05-18T00:15:42.997763+00:00"}