{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B2CY55YU2MSNRKWPH4BQFA2DXW","short_pith_number":"pith:B2CY55YU","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"},"canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","source":{"kind":"arxiv","id":"1509.04682","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04682","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04682v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04682","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"B2CY55YU2MSN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B2CY55YU2MSNRKWP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B2CY55YU","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B2CY55YU2MSNRKWPH4BQFA2DXW","target":"record","payload":{"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"},"canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","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"},"source_kind":"arxiv","source_id":"1509.04682","source_version":2,"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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwINvY9eXpOw6iz6a0aH0OAebXUej1Htu1uya3xgDALDjv2j+zwCw88SofoSWUARXzuuLUJCI/uLmiPVTv8YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:57.601393Z"},"content_sha256":"247361fb463842d486c28a6864146ca7745039d56bb1a727260375d2b7118d58","schema_version":"1.0","event_id":"sha256:247361fb463842d486c28a6864146ca7745039d56bb1a727260375d2b7118d58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B2CY55YU2MSNRKWPH4BQFA2DXW","target":"graph","payload":{"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"},"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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XmU2Gir6aIvfIS2B/5UNbMU4uzcLfLhvfNY1G/UF1NHf1txNIAI5dRw6yYPgyIisTDyh36iiDGPnsDtenU+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:57.602208Z"},"content_sha256":"d848ceb661967b8b79e662c50db36c0f294191788f0b7f12998265c404621092","schema_version":"1.0","event_id":"sha256:d848ceb661967b8b79e662c50db36c0f294191788f0b7f12998265c404621092"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/bundle.json","state_url":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/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-05-25T13:23:57Z","links":{"resolver":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW","bundle":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/bundle.json","state":"https://pith.science/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2CY55YU2MSNRKWPH4BQFA2DXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B2CY55YU2MSNRKWPH4BQFA2DXW","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":"1299ee8bddfc4ac384c5bdad329a33c7422bd4b7f6c280c528ce712d37e9356a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-15T19:07:30Z","title_canon_sha256":"73a04e4950528a59ce0bac62252a5ce2591c921afd342d71da5e24f4cec297b5"},"schema_version":"1.0","source":{"id":"1509.04682","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04682","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04682v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04682","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"B2CY55YU2MSN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B2CY55YU2MSNRKWP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B2CY55YU","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d848ceb661967b8b79e662c50db36c0f294191788f0b7f12998265c404621092","target":"graph","created_at":"2026-05-18T01:27:31Z","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":"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","authors_text":"Guanglin Xu, Samuel Burer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-15T19:07:30Z","title":"Robust Sensitivity Analysis of the Optimal Value of Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04682","kind":"arxiv","version":2},"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:247361fb463842d486c28a6864146ca7745039d56bb1a727260375d2b7118d58","target":"record","created_at":"2026-05-18T01:27:31Z","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":"1299ee8bddfc4ac384c5bdad329a33c7422bd4b7f6c280c528ce712d37e9356a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-15T19:07:30Z","title_canon_sha256":"73a04e4950528a59ce0bac62252a5ce2591c921afd342d71da5e24f4cec297b5"},"schema_version":"1.0","source":{"id":"1509.04682","kind":"arxiv","version":2}},"canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e858ef714d324d8aacf3f03028343bdb259843dde2ffe13653a886e2284892b","first_computed_at":"2026-05-18T01:27:31.214270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.214270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xgM1Og1YEB8BfdtjC2br3ivV9unGoX4Utj/wKM2DJK63xjkKNbcUkYIJHHOpdQLmvHRg4lKZJAbOViZM0hLtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.214821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04682","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:247361fb463842d486c28a6864146ca7745039d56bb1a727260375d2b7118d58","sha256:d848ceb661967b8b79e662c50db36c0f294191788f0b7f12998265c404621092"],"state_sha256":"b25a99e3ed00962dc789368ddb2e87adff82eb234d5a33e0706a5d191abf3e3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjC1DrUOSl9gWghMMPc4gSPyqpgIhuS3MmjM7fxU2XW1SOoVveUzqeTFfbI38IEmZ2RHgozJ9P/vbTay+NarAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:23:57.605611Z","bundle_sha256":"2d06ca11b4c053c5bf261c333ef13997dd034923aa2262b364c3e3ea82ca146f"}}