{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D6OADF2ZZXAQMTFBF5XBAISGOW","short_pith_number":"pith:D6OADF2Z","schema_version":"1.0","canonical_sha256":"1f9c019759cdc1064ca12f6e1022467598588ddba6021915474545f53b25ec75","source":{"kind":"arxiv","id":"1507.03266","version":4},"attestation_state":"computed","paper":{"title":"Inverse Optimization with Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anil Aswani, Auyon Siddiq, Zuo-Jun Max Shen","submitted_at":"2015-07-12T20:15:20Z","abstract_excerpt":"Inverse optimization refers to the inference of unknown parameters of an optimization problem based on knowledge of its optimal solutions. This paper considers inverse optimization in the setting where measurements of the optimal solutions of a convex optimization problem are corrupted by noise. We first provide a formulation for inverse optimization and prove it to be NP-hard. In contrast to existing methods, we show that the parameter estimates produced by our formulation are statistically consistent. Our approach involves combining a new duality-based reformulation for bilevel programs with"},"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":"1507.03266","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T20:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"e2d72f0e39cc40a8448370368d96f4b1f6381c72c15b97f3dd5e6991c1800870","abstract_canon_sha256":"b3fbcab0082ea5632b541701b46951faf7983ac605b642a93b2bb6f792df5b17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.562464Z","signature_b64":"n+ckRjw+oTbMjWiIqC3bUqqQMDzP+dcntbrNDEm4TBVInvTe16jDxq/tGZFXbjYrx2AC8wWzpQXLXtyfns3XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f9c019759cdc1064ca12f6e1022467598588ddba6021915474545f53b25ec75","last_reissued_at":"2026-05-18T00:27:22.561999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.561999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Optimization with Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anil Aswani, Auyon Siddiq, Zuo-Jun Max Shen","submitted_at":"2015-07-12T20:15:20Z","abstract_excerpt":"Inverse optimization refers to the inference of unknown parameters of an optimization problem based on knowledge of its optimal solutions. This paper considers inverse optimization in the setting where measurements of the optimal solutions of a convex optimization problem are corrupted by noise. We first provide a formulation for inverse optimization and prove it to be NP-hard. In contrast to existing methods, we show that the parameter estimates produced by our formulation are statistically consistent. Our approach involves combining a new duality-based reformulation for bilevel programs with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03266","kind":"arxiv","version":4},"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":"1507.03266","created_at":"2026-05-18T00:27:22.562059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03266v4","created_at":"2026-05-18T00:27:22.562059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03266","created_at":"2026-05-18T00:27:22.562059+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6OADF2ZZXAQ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6OADF2ZZXAQMTFB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6OADF2Z","created_at":"2026-05-18T12:29:17.054201+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/D6OADF2ZZXAQMTFBF5XBAISGOW","json":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW.json","graph_json":"https://pith.science/api/pith-number/D6OADF2ZZXAQMTFBF5XBAISGOW/graph.json","events_json":"https://pith.science/api/pith-number/D6OADF2ZZXAQMTFBF5XBAISGOW/events.json","paper":"https://pith.science/paper/D6OADF2Z"},"agent_actions":{"view_html":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW","download_json":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW.json","view_paper":"https://pith.science/paper/D6OADF2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03266&json=true","fetch_graph":"https://pith.science/api/pith-number/D6OADF2ZZXAQMTFBF5XBAISGOW/graph.json","fetch_events":"https://pith.science/api/pith-number/D6OADF2ZZXAQMTFBF5XBAISGOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW/action/storage_attestation","attest_author":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW/action/author_attestation","sign_citation":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW/action/citation_signature","submit_replication":"https://pith.science/pith/D6OADF2ZZXAQMTFBF5XBAISGOW/action/replication_record"}},"created_at":"2026-05-18T00:27:22.562059+00:00","updated_at":"2026-05-18T00:27:22.562059+00:00"}