{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B2CY55YU2MSNRKWPH4BQFA2DXW","short_pith_number":"pith:B2CY55YU","schema_version":"1.0","canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","source":{"kind":"arxiv","id":"1509.04682","version":2},"attestation_state":"computed","paper":{"title":"Robust Sensitivity Analysis of the Optimal Value of Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanglin Xu, Samuel Burer","submitted_at":"2015-09-15T19:07:30Z","abstract_excerpt":"We propose a framework for sensitivity analysis of linear programs (LPs) in minimization form, allowing for simultaneous perturbations in the objective coefficients and right-hand sides, where the perturbations are modeled in a compact, convex uncertainty set. This framework unifies and extends multiple approaches for LP sensitivity analysis in the literature and has close ties to worst-case linear optimization and two-stage adaptive optimization. We define the minimum (best-case) and maximum (worst-case) LP optimal values, p- and p+, over the uncertainty set, and we discuss issues of finitene"},"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":"1509.04682","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-15T19:07:30Z","cross_cats_sorted":[],"title_canon_sha256":"73a04e4950528a59ce0bac62252a5ce2591c921afd342d71da5e24f4cec297b5","abstract_canon_sha256":"1299ee8bddfc4ac384c5bdad329a33c7422bd4b7f6c280c528ce712d37e9356a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.214821Z","signature_b64":"xgM1Og1YEB8BfdtjC2br3ivV9unGoX4Utj/wKM2DJK63xjkKNbcUkYIJHHOpdQLmvHRg4lKZJAbOViZM0hLtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","last_reissued_at":"2026-05-18T01:27:31.214270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.214270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Sensitivity Analysis of the Optimal Value of Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanglin Xu, Samuel Burer","submitted_at":"2015-09-15T19:07:30Z","abstract_excerpt":"We propose a framework for sensitivity analysis of linear programs (LPs) in minimization form, allowing for simultaneous perturbations in the objective coefficients and right-hand sides, where the perturbations are modeled in a compact, convex uncertainty set. This framework unifies and extends multiple approaches for LP sensitivity analysis in the literature and has close ties to worst-case linear optimization and two-stage adaptive optimization. We define the minimum (best-case) and maximum (worst-case) LP optimal values, p- and p+, over the uncertainty set, and we discuss issues of finitene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04682","kind":"arxiv","version":2},"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":"1509.04682","created_at":"2026-05-18T01:27:31.214349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04682v2","created_at":"2026-05-18T01:27:31.214349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04682","created_at":"2026-05-18T01:27:31.214349+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2CY55YU2MSN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2CY55YU2MSNRKWP","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2CY55YU","created_at":"2026-05-18T12:29:14.074870+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/B2CY55YU2MSNRKWPH4BQFA2DXW","json":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW.json","graph_json":"https://pith.science/api/pith-number/B2CY55YU2MSNRKWPH4BQFA2DXW/graph.json","events_json":"https://pith.science/api/pith-number/B2CY55YU2MSNRKWPH4BQFA2DXW/events.json","paper":"https://pith.science/paper/B2CY55YU"},"agent_actions":{"view_html":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW","download_json":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW.json","view_paper":"https://pith.science/paper/B2CY55YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04682&json=true","fetch_graph":"https://pith.science/api/pith-number/B2CY55YU2MSNRKWPH4BQFA2DXW/graph.json","fetch_events":"https://pith.science/api/pith-number/B2CY55YU2MSNRKWPH4BQFA2DXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/action/storage_attestation","attest_author":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/action/author_attestation","sign_citation":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/action/citation_signature","submit_replication":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/action/replication_record"}},"created_at":"2026-05-18T01:27:31.214349+00:00","updated_at":"2026-05-18T01:27:31.214349+00:00"}