{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DAFMYXOEU4IXHRSXKQZSL7RBMV","short_pith_number":"pith:DAFMYXOE","canonical_record":{"source":{"id":"2006.08923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-16T04:43:54Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"30163a69ed2c2a5a5f275394b46bff82bad78a3eca019dd4a7de0ad72782ffc5","abstract_canon_sha256":"97af86158b655fcd4177c321563fdd8eeef6dce815b1505ca50771a50f1d1c41"},"schema_version":"1.0"},"canonical_sha256":"180acc5dc4a71173c657543325fe21657295698b95a7b301cfa4b808fdcbe8de","source":{"kind":"arxiv","id":"2006.08923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08923","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08923v1","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08923","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"DAFMYXOEU4IX","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_16","alias_value":"DAFMYXOEU4IXHRSX","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_8","alias_value":"DAFMYXOE","created_at":"2026-07-05T01:10:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DAFMYXOEU4IXHRSXKQZSL7RBMV","target":"record","payload":{"canonical_record":{"source":{"id":"2006.08923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-16T04:43:54Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"30163a69ed2c2a5a5f275394b46bff82bad78a3eca019dd4a7de0ad72782ffc5","abstract_canon_sha256":"97af86158b655fcd4177c321563fdd8eeef6dce815b1505ca50771a50f1d1c41"},"schema_version":"1.0"},"canonical_sha256":"180acc5dc4a71173c657543325fe21657295698b95a7b301cfa4b808fdcbe8de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:44.534543Z","signature_b64":"SK1BktoymNiCvr3UbJjK/FiUbWlOEegPJZ0VS8r0hSErJ2OcoEC7ljOIoPch9KUbWA0pjE4LASQ5IMxjcvOPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180acc5dc4a71173c657543325fe21657295698b95a7b301cfa4b808fdcbe8de","last_reissued_at":"2026-07-05T01:10:44.534150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:44.534150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.08923","source_version":1,"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:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Zl29fx4RGpr4D83HmDHkLpNEF0tGo+GXKBIip8j/AoFzqhv6+bbd/T+68lvLna9O7jG0kj58Gq9EW+HuQYiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:13:50.650424Z"},"content_sha256":"4773778f0339e7b1e02b6cdbcd55dcae5327a14dc0dc36ab3143ec88eaf3846b","schema_version":"1.0","event_id":"sha256:4773778f0339e7b1e02b6cdbcd55dcae5327a14dc0dc36ab3143ec88eaf3846b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DAFMYXOEU4IXHRSXKQZSL7RBMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Linear Programs from Optimal Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Delong, Daria Terekhov, Yingcong Tan","submitted_at":"2020-06-16T04:43:54Z","abstract_excerpt":"We propose a flexible gradient-based framework for learning linear programs from optimal decisions. Linear programs are often specified by hand, using prior knowledge of relevant costs and constraints. In some applications, linear programs must instead be learned from observations of optimal decisions. Learning from optimal decisions is a particularly challenging bi-level problem, and much of the related inverse optimization literature is dedicated to special cases. We tackle the general problem, learning all parameters jointly while allowing flexible parametrizations of costs, constraints, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08923","kind":"arxiv","version":1},"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/2006.08923/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:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eLqww0c2Hig2Nueu+J8P2lA3WGWzzl0biq9267fRuufZQSoy6B+cHhXOEnUY8XEXaO0xLBHXGnbk+PTaAvPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:13:50.650935Z"},"content_sha256":"29e7bc24a79079348f581462906693397a2ae3a4891dcc8d901f25ff20dae33f","schema_version":"1.0","event_id":"sha256:29e7bc24a79079348f581462906693397a2ae3a4891dcc8d901f25ff20dae33f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/bundle.json","state_url":"https://pith.science/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/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-07T00:13:50Z","links":{"resolver":"https://pith.science/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV","bundle":"https://pith.science/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/bundle.json","state":"https://pith.science/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAFMYXOEU4IXHRSXKQZSL7RBMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DAFMYXOEU4IXHRSXKQZSL7RBMV","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":"97af86158b655fcd4177c321563fdd8eeef6dce815b1505ca50771a50f1d1c41","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-16T04:43:54Z","title_canon_sha256":"30163a69ed2c2a5a5f275394b46bff82bad78a3eca019dd4a7de0ad72782ffc5"},"schema_version":"1.0","source":{"id":"2006.08923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08923","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08923v1","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08923","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"DAFMYXOEU4IX","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_16","alias_value":"DAFMYXOEU4IXHRSX","created_at":"2026-07-05T01:10:44Z"},{"alias_kind":"pith_short_8","alias_value":"DAFMYXOE","created_at":"2026-07-05T01:10:44Z"}],"graph_snapshots":[{"event_id":"sha256:29e7bc24a79079348f581462906693397a2ae3a4891dcc8d901f25ff20dae33f","target":"graph","created_at":"2026-07-05T01:10:44Z","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/2006.08923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a flexible gradient-based framework for learning linear programs from optimal decisions. Linear programs are often specified by hand, using prior knowledge of relevant costs and constraints. In some applications, linear programs must instead be learned from observations of optimal decisions. Learning from optimal decisions is a particularly challenging bi-level problem, and much of the related inverse optimization literature is dedicated to special cases. We tackle the general problem, learning all parameters jointly while allowing flexible parametrizations of costs, constraints, an","authors_text":"Andrew Delong, Daria Terekhov, Yingcong Tan","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-16T04:43:54Z","title":"Learning Linear Programs from Optimal Decisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08923","kind":"arxiv","version":1},"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:4773778f0339e7b1e02b6cdbcd55dcae5327a14dc0dc36ab3143ec88eaf3846b","target":"record","created_at":"2026-07-05T01:10:44Z","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":"97af86158b655fcd4177c321563fdd8eeef6dce815b1505ca50771a50f1d1c41","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-16T04:43:54Z","title_canon_sha256":"30163a69ed2c2a5a5f275394b46bff82bad78a3eca019dd4a7de0ad72782ffc5"},"schema_version":"1.0","source":{"id":"2006.08923","kind":"arxiv","version":1}},"canonical_sha256":"180acc5dc4a71173c657543325fe21657295698b95a7b301cfa4b808fdcbe8de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"180acc5dc4a71173c657543325fe21657295698b95a7b301cfa4b808fdcbe8de","first_computed_at":"2026-07-05T01:10:44.534150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:44.534150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SK1BktoymNiCvr3UbJjK/FiUbWlOEegPJZ0VS8r0hSErJ2OcoEC7ljOIoPch9KUbWA0pjE4LASQ5IMxjcvOPBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:44.534543Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4773778f0339e7b1e02b6cdbcd55dcae5327a14dc0dc36ab3143ec88eaf3846b","sha256:29e7bc24a79079348f581462906693397a2ae3a4891dcc8d901f25ff20dae33f"],"state_sha256":"1858c5df5f7a05fd7fa52d6546e20484d86e068d64d271a7c5ccbd4742d3f9e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23Gm1ed8ZR3Y+K/ZRcQm7o004n0/x18r/exrm5avQGx9gy8MF6jipd27l6WrGvt2n/03CkHa6beittccHMBZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:13:50.659632Z","bundle_sha256":"f85bb6da2faa9a11c6ab936c1564dd1f337846c73610a7d7e6897459b67569aa"}}