{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CYRCXVGPVG57ZKITDICWD6MBLA","short_pith_number":"pith:CYRCXVGP","canonical_record":{"source":{"id":"1908.02376","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"fdef429ffd54259b4b5231f13b3ad57f05a84e036ecb8fc09159247346532c04","abstract_canon_sha256":"b50af8270e9ff1fb70125e7142545463a378ef0e9a0b5e3df95795bfce746f11"},"schema_version":"1.0"},"canonical_sha256":"16222bd4cfa9bbfca9131a0561f9815823e454fdac350ec007327c9803191e28","source":{"kind":"arxiv","id":"1908.02376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02376","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02376v2","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02376","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"CYRCXVGPVG57","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_16","alias_value":"CYRCXVGPVG57ZKIT","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_8","alias_value":"CYRCXVGP","created_at":"2026-07-05T03:58:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CYRCXVGPVG57ZKITDICWD6MBLA","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02376","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"fdef429ffd54259b4b5231f13b3ad57f05a84e036ecb8fc09159247346532c04","abstract_canon_sha256":"b50af8270e9ff1fb70125e7142545463a378ef0e9a0b5e3df95795bfce746f11"},"schema_version":"1.0"},"canonical_sha256":"16222bd4cfa9bbfca9131a0561f9815823e454fdac350ec007327c9803191e28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:12.327174Z","signature_b64":"TAuFGuuEAapX9DzE23Gsj+Oeg8ENvNYLFi5KWBb1t4MjLamps9ghK6QWT8hKF7Izqma37ioNvFvMcsOCITwKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16222bd4cfa9bbfca9131a0561f9815823e454fdac350ec007327c9803191e28","last_reissued_at":"2026-07-05T03:58:12.326765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:12.326765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02376","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-07-05T03:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogyWT5nMjg17CVCZvhRKpYEBRcqRmGYru4RBqUkunr1opru0QO2h+46s4o4nKvPNQQq83hQCQCUEWBloUKEGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:04:05.796010Z"},"content_sha256":"90fc3d774bf09030bd5c11e836a6539e9cfbae1488b9dd04fd59cb5190ae5818","schema_version":"1.0","event_id":"sha256:90fc3d774bf09030bd5c11e836a6539e9cfbae1488b9dd04fd59cb5190ae5818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CYRCXVGPVG57ZKITDICWD6MBLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Taewoo Lee, Zahed Shahmoradi","submitted_at":"2019-08-06T21:52:08Z","abstract_excerpt":"Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and corresponding forward solutions from the existing inverse LP method can be highly sensitive to noise, errors, and uncertainty in the input data, limiting its applicability in data-driven settings. We introduce the notion of inverse and forward stability in inverse LP and propose a novel inverse LP method that determines a set of objective functions that are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02376","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02376/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKkIN2LGDirIMzNwsL9/n+NakkBQrz3Ewe4SNGRj54oBdyLb1SfcZuc4Ov8jVaTRsG7FuGlj7B7Fv+3vJLe8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:04:05.796530Z"},"content_sha256":"33fcec8762c709a9861236142d6a08b67503caf800cfb9b13c48b82f81683c54","schema_version":"1.0","event_id":"sha256:33fcec8762c709a9861236142d6a08b67503caf800cfb9b13c48b82f81683c54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYRCXVGPVG57ZKITDICWD6MBLA/bundle.json","state_url":"https://pith.science/pith/CYRCXVGPVG57ZKITDICWD6MBLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYRCXVGPVG57ZKITDICWD6MBLA/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-08-16T12:04:05Z","links":{"resolver":"https://pith.science/pith/CYRCXVGPVG57ZKITDICWD6MBLA","bundle":"https://pith.science/pith/CYRCXVGPVG57ZKITDICWD6MBLA/bundle.json","state":"https://pith.science/pith/CYRCXVGPVG57ZKITDICWD6MBLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYRCXVGPVG57ZKITDICWD6MBLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CYRCXVGPVG57ZKITDICWD6MBLA","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":"b50af8270e9ff1fb70125e7142545463a378ef0e9a0b5e3df95795bfce746f11","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:52:08Z","title_canon_sha256":"fdef429ffd54259b4b5231f13b3ad57f05a84e036ecb8fc09159247346532c04"},"schema_version":"1.0","source":{"id":"1908.02376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02376","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02376v2","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02376","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"CYRCXVGPVG57","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_16","alias_value":"CYRCXVGPVG57ZKIT","created_at":"2026-07-05T03:58:12Z"},{"alias_kind":"pith_short_8","alias_value":"CYRCXVGP","created_at":"2026-07-05T03:58:12Z"}],"graph_snapshots":[{"event_id":"sha256:33fcec8762c709a9861236142d6a08b67503caf800cfb9b13c48b82f81683c54","target":"graph","created_at":"2026-07-05T03:58:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and corresponding forward solutions from the existing inverse LP method can be highly sensitive to noise, errors, and uncertainty in the input data, limiting its applicability in data-driven settings. We introduce the notion of inverse and forward stability in inverse LP and propose a novel inverse LP method that determines a set of objective functions that are s","authors_text":"Taewoo Lee, Zahed Shahmoradi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:52:08Z","title":"Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02376","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:90fc3d774bf09030bd5c11e836a6539e9cfbae1488b9dd04fd59cb5190ae5818","target":"record","created_at":"2026-07-05T03:58:12Z","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":"b50af8270e9ff1fb70125e7142545463a378ef0e9a0b5e3df95795bfce746f11","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:52:08Z","title_canon_sha256":"fdef429ffd54259b4b5231f13b3ad57f05a84e036ecb8fc09159247346532c04"},"schema_version":"1.0","source":{"id":"1908.02376","kind":"arxiv","version":2}},"canonical_sha256":"16222bd4cfa9bbfca9131a0561f9815823e454fdac350ec007327c9803191e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16222bd4cfa9bbfca9131a0561f9815823e454fdac350ec007327c9803191e28","first_computed_at":"2026-07-05T03:58:12.326765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:12.326765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TAuFGuuEAapX9DzE23Gsj+Oeg8ENvNYLFi5KWBb1t4MjLamps9ghK6QWT8hKF7Izqma37ioNvFvMcsOCITwKAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:12.327174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90fc3d774bf09030bd5c11e836a6539e9cfbae1488b9dd04fd59cb5190ae5818","sha256:33fcec8762c709a9861236142d6a08b67503caf800cfb9b13c48b82f81683c54"],"state_sha256":"883c4646c1826327ac1add8a063ddb6a52d2c4554f691446b27eae9ab1895005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuq+L+Ck0C+FvouVotDzcXg7J2pc/kKHlmX9e2Ju4AoljS+iATq4705WkMUjkhiFXkM5PKw5LaxtmrwmD6uBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:04:05.801979Z","bundle_sha256":"271c86b0541121b443250cbd5e4ef6ac247484d36badb2c2cfb4cf3924c19b4b"}}