{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NBNCG665WV67U7FBAKYLSM4ATX","short_pith_number":"pith:NBNCG665","canonical_record":{"source":{"id":"1802.09639","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-26T23:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"7c274dd8642a0c550c3074081f1fa5144768907c83cf40149c02b7bacd2fdb14","abstract_canon_sha256":"63d2f93841ae63cb6e5cabc8edfb4d9fb84f5e80636ffa902869fe76805ab7d3"},"schema_version":"1.0"},"canonical_sha256":"685a237bddb57dfa7ca102b0b933809df0abaff7eee8a5c30a915b2cc8283f38","source":{"kind":"arxiv","id":"1802.09639","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09639","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09639v4","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09639","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"NBNCG665WV67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBNCG665WV67U7FB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBNCG665","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NBNCG665WV67U7FBAKYLSM4ATX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09639","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-26T23:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"7c274dd8642a0c550c3074081f1fa5144768907c83cf40149c02b7bacd2fdb14","abstract_canon_sha256":"63d2f93841ae63cb6e5cabc8edfb4d9fb84f5e80636ffa902869fe76805ab7d3"},"schema_version":"1.0"},"canonical_sha256":"685a237bddb57dfa7ca102b0b933809df0abaff7eee8a5c30a915b2cc8283f38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.331890Z","signature_b64":"wHp+W9hK1bVZQyaZV4vL5TrqUN5lzDuFTaNpeXWt4iS88CxNXvVmFzED9wIU2DnV73yqfeDAM5jD2XMboP0BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"685a237bddb57dfa7ca102b0b933809df0abaff7eee8a5c30a915b2cc8283f38","last_reissued_at":"2026-05-17T23:56:10.331243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.331243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09639","source_version":4,"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-05-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBwasP55RlJDFUDFy21L+mAabJ3ZpFYd7dUwrSS7unSi+kQL5i7i5SA/svZRj6BY/hmzOiTbvsXu4winTW4gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:59:25.689952Z"},"content_sha256":"27a7b4b01207d24d3a9ff9e74376d3dd9987ccf268aa7a60c1c649d05fd710f6","schema_version":"1.0","event_id":"sha256:27a7b4b01207d24d3a9ff9e74376d3dd9987ccf268aa7a60c1c649d05fd710f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NBNCG665WV67U7FBAKYLSM4ATX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Line Roald, Sidhant Misra, Yeesian Ng","submitted_at":"2018-02-26T23:24:14Z","abstract_excerpt":"In many engineered systems, optimization is used for decision making at time-scales ranging from real-time operation to long-term planning. This process often involves solving similar optimization problems over and over again with slightly modified input parameters, often under tight latency requirements. We consider the problem of using the information available through this repeated solution process to directly learn a model of the optimal solution as a function of the input parameters, thus reducing the need to solve computationally expensive large-scale parametric programs in real time. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09639","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"},"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-05-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIgwd8BtvgwM9tvEIGDTDHCTWgi7xb96D6Dkr4FJHfCR4jA+Sit/JxU7vFoE5PjrdHcOqEMH6/p+QvJ7T4FzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:59:25.690452Z"},"content_sha256":"98f222df6b587da8caad1b98635c7c1fc263395fd44845e824e231e7a063cf06","schema_version":"1.0","event_id":"sha256:98f222df6b587da8caad1b98635c7c1fc263395fd44845e824e231e7a063cf06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBNCG665WV67U7FBAKYLSM4ATX/bundle.json","state_url":"https://pith.science/pith/NBNCG665WV67U7FBAKYLSM4ATX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBNCG665WV67U7FBAKYLSM4ATX/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-05-28T02:59:25Z","links":{"resolver":"https://pith.science/pith/NBNCG665WV67U7FBAKYLSM4ATX","bundle":"https://pith.science/pith/NBNCG665WV67U7FBAKYLSM4ATX/bundle.json","state":"https://pith.science/pith/NBNCG665WV67U7FBAKYLSM4ATX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBNCG665WV67U7FBAKYLSM4ATX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NBNCG665WV67U7FBAKYLSM4ATX","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":"63d2f93841ae63cb6e5cabc8edfb4d9fb84f5e80636ffa902869fe76805ab7d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-26T23:24:14Z","title_canon_sha256":"7c274dd8642a0c550c3074081f1fa5144768907c83cf40149c02b7bacd2fdb14"},"schema_version":"1.0","source":{"id":"1802.09639","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09639","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09639v4","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09639","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"NBNCG665WV67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBNCG665WV67U7FB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBNCG665","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:98f222df6b587da8caad1b98635c7c1fc263395fd44845e824e231e7a063cf06","target":"graph","created_at":"2026-05-17T23:56:10Z","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"},"paper":{"abstract_excerpt":"In many engineered systems, optimization is used for decision making at time-scales ranging from real-time operation to long-term planning. This process often involves solving similar optimization problems over and over again with slightly modified input parameters, often under tight latency requirements. We consider the problem of using the information available through this repeated solution process to directly learn a model of the optimal solution as a function of the input parameters, thus reducing the need to solve computationally expensive large-scale parametric programs in real time. Ou","authors_text":"Line Roald, Sidhant Misra, Yeesian Ng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-26T23:24:14Z","title":"Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09639","kind":"arxiv","version":4},"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:27a7b4b01207d24d3a9ff9e74376d3dd9987ccf268aa7a60c1c649d05fd710f6","target":"record","created_at":"2026-05-17T23:56:10Z","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":"63d2f93841ae63cb6e5cabc8edfb4d9fb84f5e80636ffa902869fe76805ab7d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-26T23:24:14Z","title_canon_sha256":"7c274dd8642a0c550c3074081f1fa5144768907c83cf40149c02b7bacd2fdb14"},"schema_version":"1.0","source":{"id":"1802.09639","kind":"arxiv","version":4}},"canonical_sha256":"685a237bddb57dfa7ca102b0b933809df0abaff7eee8a5c30a915b2cc8283f38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"685a237bddb57dfa7ca102b0b933809df0abaff7eee8a5c30a915b2cc8283f38","first_computed_at":"2026-05-17T23:56:10.331243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:10.331243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wHp+W9hK1bVZQyaZV4vL5TrqUN5lzDuFTaNpeXWt4iS88CxNXvVmFzED9wIU2DnV73yqfeDAM5jD2XMboP0BDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:10.331890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09639","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a7b4b01207d24d3a9ff9e74376d3dd9987ccf268aa7a60c1c649d05fd710f6","sha256:98f222df6b587da8caad1b98635c7c1fc263395fd44845e824e231e7a063cf06"],"state_sha256":"98c02f6b4ebd732e2c93dc828fde75aa1e7a289f0bfcb98adb11e660af96f97c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgE5jHE0UTZtxEdnAP4pIamJ9SWvoYMY2jvHbypHEw5Vqhr1We1nrlEbJTFyLtmpjl+KTQjRbH/iPAQJUF7ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:59:25.692606Z","bundle_sha256":"f577764d2ec1b425d01fb7b329fb683c0421d16112878fa126aa13463d965686"}}