{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SHSBIJVVV7FKULCVMPRVUY2345","short_pith_number":"pith:SHSBIJVV","canonical_record":{"source":{"id":"2001.00143","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-01T05:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"bc305a100e3b75f06e44383f60e198ebf5e88b194f39d3aef8a7f990e86fb2f9","abstract_canon_sha256":"cbd8ee3ad5167ab8b054cf8b061146f5c81cb55b1c1240edab76ca5060bcc9e3"},"schema_version":"1.0"},"canonical_sha256":"91e41426b5afcaaa2c5563e35a635be750df55f9614cd2b164b92ff198bb20a1","source":{"kind":"arxiv","id":"2001.00143","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00143","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00143v3","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00143","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"SHSBIJVVV7FK","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_16","alias_value":"SHSBIJVVV7FKULCV","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_8","alias_value":"SHSBIJVV","created_at":"2026-07-05T01:34:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SHSBIJVVV7FKULCVMPRVUY2345","target":"record","payload":{"canonical_record":{"source":{"id":"2001.00143","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-01T05:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"bc305a100e3b75f06e44383f60e198ebf5e88b194f39d3aef8a7f990e86fb2f9","abstract_canon_sha256":"cbd8ee3ad5167ab8b054cf8b061146f5c81cb55b1c1240edab76ca5060bcc9e3"},"schema_version":"1.0"},"canonical_sha256":"91e41426b5afcaaa2c5563e35a635be750df55f9614cd2b164b92ff198bb20a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:41.903196Z","signature_b64":"YUoYK5sVbhzzkjo96sSqekja5M7ar2u4SVV+wQKpke4Yd6fZDI7I7ApWbziWn38yb8bc/vucsleZksMg1cw3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e41426b5afcaaa2c5563e35a635be750df55f9614cd2b164b92ff198bb20a1","last_reissued_at":"2026-07-05T01:34:41.902870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:41.902870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.00143","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-05T01:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojKGAQSDAdWkQ4yclz5xTnIz3u2D3n+AmdYBMBl2rXJhhgTqzV4BAsIuq+Lkahl0aV+FErzDOIe30seIczAsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:53:44.946210Z"},"content_sha256":"392a8e7f80ee7582ce65252582ec59f63b40408cb8b31ef55a36640e618561cc","schema_version":"1.0","event_id":"sha256:392a8e7f80ee7582ce65252582ec59f63b40408cb8b31ef55a36640e618561cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SHSBIJVVV7FKULCVMPRVUY2345","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inferring Linear Feasible Regions using Inverse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Houra Mahmoudzadeh, Kimia Ghobadi","submitted_at":"2020-01-01T05:34:13Z","abstract_excerpt":"Consider a problem where a set of feasible observations are provided by an expert and a cost function is defined that characterizes which of the observations dominate the others and are hence, preferred. Our goal is to find a set of linear constraints that would render all the given observations feasible while making the preferred ones optimal for the cost (objective) function. By doing so, we infer the implicit feasible region of the linear programming problem. Providing such feasible regions (i) builds a baseline for categorizing future observations as feasible or infeasible, and (ii) allows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00143","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/2001.00143/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-05T01:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+aZn2T9+IfXj4auXAqz9+LjHpzJEJF99i39Q7FbNWXl104uepyL3G/EtKavL2KOL3a+QqqWF19qtmt9qauUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:53:44.946702Z"},"content_sha256":"9ecc668a4f6e25a50aa6fea4d84de025ec2bbbd317454e99b4cd89d61df11ac4","schema_version":"1.0","event_id":"sha256:9ecc668a4f6e25a50aa6fea4d84de025ec2bbbd317454e99b4cd89d61df11ac4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHSBIJVVV7FKULCVMPRVUY2345/bundle.json","state_url":"https://pith.science/pith/SHSBIJVVV7FKULCVMPRVUY2345/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHSBIJVVV7FKULCVMPRVUY2345/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-23T23:53:44Z","links":{"resolver":"https://pith.science/pith/SHSBIJVVV7FKULCVMPRVUY2345","bundle":"https://pith.science/pith/SHSBIJVVV7FKULCVMPRVUY2345/bundle.json","state":"https://pith.science/pith/SHSBIJVVV7FKULCVMPRVUY2345/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHSBIJVVV7FKULCVMPRVUY2345/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SHSBIJVVV7FKULCVMPRVUY2345","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":"cbd8ee3ad5167ab8b054cf8b061146f5c81cb55b1c1240edab76ca5060bcc9e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-01T05:34:13Z","title_canon_sha256":"bc305a100e3b75f06e44383f60e198ebf5e88b194f39d3aef8a7f990e86fb2f9"},"schema_version":"1.0","source":{"id":"2001.00143","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00143","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00143v3","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00143","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"SHSBIJVVV7FK","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_16","alias_value":"SHSBIJVVV7FKULCV","created_at":"2026-07-05T01:34:41Z"},{"alias_kind":"pith_short_8","alias_value":"SHSBIJVV","created_at":"2026-07-05T01:34:41Z"}],"graph_snapshots":[{"event_id":"sha256:9ecc668a4f6e25a50aa6fea4d84de025ec2bbbd317454e99b4cd89d61df11ac4","target":"graph","created_at":"2026-07-05T01:34:41Z","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/2001.00143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a problem where a set of feasible observations are provided by an expert and a cost function is defined that characterizes which of the observations dominate the others and are hence, preferred. Our goal is to find a set of linear constraints that would render all the given observations feasible while making the preferred ones optimal for the cost (objective) function. By doing so, we infer the implicit feasible region of the linear programming problem. Providing such feasible regions (i) builds a baseline for categorizing future observations as feasible or infeasible, and (ii) allows","authors_text":"Houra Mahmoudzadeh, Kimia Ghobadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-01T05:34:13Z","title":"Inferring Linear Feasible Regions using Inverse Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00143","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:392a8e7f80ee7582ce65252582ec59f63b40408cb8b31ef55a36640e618561cc","target":"record","created_at":"2026-07-05T01:34:41Z","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":"cbd8ee3ad5167ab8b054cf8b061146f5c81cb55b1c1240edab76ca5060bcc9e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-01T05:34:13Z","title_canon_sha256":"bc305a100e3b75f06e44383f60e198ebf5e88b194f39d3aef8a7f990e86fb2f9"},"schema_version":"1.0","source":{"id":"2001.00143","kind":"arxiv","version":3}},"canonical_sha256":"91e41426b5afcaaa2c5563e35a635be750df55f9614cd2b164b92ff198bb20a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91e41426b5afcaaa2c5563e35a635be750df55f9614cd2b164b92ff198bb20a1","first_computed_at":"2026-07-05T01:34:41.902870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:34:41.902870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YUoYK5sVbhzzkjo96sSqekja5M7ar2u4SVV+wQKpke4Yd6fZDI7I7ApWbziWn38yb8bc/vucsleZksMg1cw3Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:34:41.903196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.00143","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392a8e7f80ee7582ce65252582ec59f63b40408cb8b31ef55a36640e618561cc","sha256:9ecc668a4f6e25a50aa6fea4d84de025ec2bbbd317454e99b4cd89d61df11ac4"],"state_sha256":"9dc0eea2337fe65cf9bfcd8a231ec862adf7400be6c429026d016e824d017d6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDitOBPi/qcKyD2XJyRoPHHts51nveF2HAxowl7vF1er2r4Ina2b84u7NQXTRMh0o2zuNDImC6q++WH4x05oCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T23:53:44.951312Z","bundle_sha256":"de054fc57fa09480104a301258e6412fb23bf553f7e86bc2ca856fe5cbad85b0"}}