{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XY7MXLR5AE5HIBCZH4DSTIYSOM","short_pith_number":"pith:XY7MXLR5","canonical_record":{"source":{"id":"2207.02894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-06T18:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"98879d03b90c7c73a25db4d9114056abb72e11727f1384d2811d8f7a44555bce","abstract_canon_sha256":"55d1dbcf27182ec51d00722cc290321d594d9d3c94f0a81f2cba430999c08874"},"schema_version":"1.0"},"canonical_sha256":"be3ecbae3d013a7404593f0729a312730972544eee7ac17372c733b61c1b3903","source":{"kind":"arxiv","id":"2207.02894","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.02894","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"2207.02894v3","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02894","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"XY7MXLR5AE5H","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_16","alias_value":"XY7MXLR5AE5HIBCZ","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_8","alias_value":"XY7MXLR5","created_at":"2026-07-05T09:17:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XY7MXLR5AE5HIBCZH4DSTIYSOM","target":"record","payload":{"canonical_record":{"source":{"id":"2207.02894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-06T18:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"98879d03b90c7c73a25db4d9114056abb72e11727f1384d2811d8f7a44555bce","abstract_canon_sha256":"55d1dbcf27182ec51d00722cc290321d594d9d3c94f0a81f2cba430999c08874"},"schema_version":"1.0"},"canonical_sha256":"be3ecbae3d013a7404593f0729a312730972544eee7ac17372c733b61c1b3903","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:30.891295Z","signature_b64":"tIUDeGvfhtEYDW6WxDTfwY0r0usltEEiOSBcVF9QAP0bXIoihlCJYTOhJF0xTTlwFJnGyrCjJBxBXvuuQS31Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3ecbae3d013a7404593f0729a312730972544eee7ac17372c733b61c1b3903","last_reissued_at":"2026-07-05T09:17:30.890908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:30.890908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.02894","source_version":3,"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-05T09:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86fBngE7pSOUwYHPKtlE6aCYYYcKXwzJgeoKIFooVDpikL12UJPc9vUhfabiUNEPNK7aMSs9098q5G/rhQIiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:47:22.842969Z"},"content_sha256":"d7e1363d163a877e510fab6f2b2ad2f2d6f642a3a2282d9f1d13661cb6a07f47","schema_version":"1.0","event_id":"sha256:d7e1363d163a877e510fab6f2b2ad2f2d6f642a3a2282d9f1d13661cb6a07f47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XY7MXLR5AE5HIBCZH4DSTIYSOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expert-Guided Inverse Optimization for Convex Constraint Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Houra Mahmoudzadeh, Kimia Ghobadi","submitted_at":"2022-07-06T18:14:59Z","abstract_excerpt":"Conventional inverse optimization inputs a solution and finds the parameters of an optimization model that render a given solution optimal. The literature mostly focuses on inferring the objective function in linear problems when accepted solutions are provided as input. In this paper, we propose an inverse optimization model that inputs several accepted and rejected solutions and recovers the underlying convex optimization model that can be used to generate such solutions. The novelty of our model is two-fold: First, we focus on inferring the parameters of the underlying convex feasible regio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02894","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.02894/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-05T09:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjWRbFG4Q0q8FiLZoscBXmpSenBqi0aB3MNfvn4kwXroOsmlrXBOAIFlKrrrEACHRFz3HMS9JIQn5jsNkz46Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:47:22.843488Z"},"content_sha256":"4da94590f97a8c71a7cffd0b200ea021e2bd10eab864873cb5c1d133cb751400","schema_version":"1.0","event_id":"sha256:4da94590f97a8c71a7cffd0b200ea021e2bd10eab864873cb5c1d133cb751400"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/bundle.json","state_url":"https://pith.science/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/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-23T12:47:22Z","links":{"resolver":"https://pith.science/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM","bundle":"https://pith.science/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/bundle.json","state":"https://pith.science/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY7MXLR5AE5HIBCZH4DSTIYSOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XY7MXLR5AE5HIBCZH4DSTIYSOM","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":"55d1dbcf27182ec51d00722cc290321d594d9d3c94f0a81f2cba430999c08874","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-06T18:14:59Z","title_canon_sha256":"98879d03b90c7c73a25db4d9114056abb72e11727f1384d2811d8f7a44555bce"},"schema_version":"1.0","source":{"id":"2207.02894","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.02894","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"2207.02894v3","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02894","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"XY7MXLR5AE5H","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_16","alias_value":"XY7MXLR5AE5HIBCZ","created_at":"2026-07-05T09:17:30Z"},{"alias_kind":"pith_short_8","alias_value":"XY7MXLR5","created_at":"2026-07-05T09:17:30Z"}],"graph_snapshots":[{"event_id":"sha256:4da94590f97a8c71a7cffd0b200ea021e2bd10eab864873cb5c1d133cb751400","target":"graph","created_at":"2026-07-05T09:17:30Z","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/2207.02894/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Conventional inverse optimization inputs a solution and finds the parameters of an optimization model that render a given solution optimal. The literature mostly focuses on inferring the objective function in linear problems when accepted solutions are provided as input. In this paper, we propose an inverse optimization model that inputs several accepted and rejected solutions and recovers the underlying convex optimization model that can be used to generate such solutions. The novelty of our model is two-fold: First, we focus on inferring the parameters of the underlying convex feasible regio","authors_text":"Houra Mahmoudzadeh, Kimia Ghobadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-06T18:14:59Z","title":"Expert-Guided Inverse Optimization for Convex Constraint Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02894","kind":"arxiv","version":3},"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:d7e1363d163a877e510fab6f2b2ad2f2d6f642a3a2282d9f1d13661cb6a07f47","target":"record","created_at":"2026-07-05T09:17:30Z","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":"55d1dbcf27182ec51d00722cc290321d594d9d3c94f0a81f2cba430999c08874","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-06T18:14:59Z","title_canon_sha256":"98879d03b90c7c73a25db4d9114056abb72e11727f1384d2811d8f7a44555bce"},"schema_version":"1.0","source":{"id":"2207.02894","kind":"arxiv","version":3}},"canonical_sha256":"be3ecbae3d013a7404593f0729a312730972544eee7ac17372c733b61c1b3903","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3ecbae3d013a7404593f0729a312730972544eee7ac17372c733b61c1b3903","first_computed_at":"2026-07-05T09:17:30.890908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:17:30.890908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tIUDeGvfhtEYDW6WxDTfwY0r0usltEEiOSBcVF9QAP0bXIoihlCJYTOhJF0xTTlwFJnGyrCjJBxBXvuuQS31Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:17:30.891295Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.02894","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7e1363d163a877e510fab6f2b2ad2f2d6f642a3a2282d9f1d13661cb6a07f47","sha256:4da94590f97a8c71a7cffd0b200ea021e2bd10eab864873cb5c1d133cb751400"],"state_sha256":"da52d3044f08f26708486fcb55222568e4b264890a3b73178fc4686d3a07bc86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/eRNhOgDJXAeekUq3ZWkXZIastO8sBm7YhAwu2mUoG0htUj7VIHiDV8K1tDwRw9hi2ECdxG8qs6yhep6hSgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T12:47:22.847024Z","bundle_sha256":"1740a3f2461241f1a82637f3c8c4d50e8b5709c238aea8a6a84a25b9d3d9aaf0"}}