{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ST3FJNUIZUOX2TUSEKT5JEQBZI","short_pith_number":"pith:ST3FJNUI","schema_version":"1.0","canonical_sha256":"94f654b688cd1d7d4e9222a7d49201ca288891ef545a2227ec1873b2738638ed","source":{"kind":"arxiv","id":"2112.08091","version":3},"attestation_state":"computed","paper":{"title":"Ensuring DNN Solution Feasibility for Optimization Problems with Convex Constraints and Its Application to DC Optimal Power Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Minghua Chen, Steven H. Low, Tianyu Zhao, Xiang Pan","submitted_at":"2021-12-15T13:05:59Z","abstract_excerpt":"Ensuring solution feasibility is a key challenge in developing Deep Neural Network (DNN) schemes for solving constrained optimization problems, due to inherent DNN prediction errors. In this paper, we propose a ``preventive learning'' framework to guarantee DNN solution feasibility for problems with convex constraints and general objective functions without post-processing, upon satisfying a mild condition on constraint calibration. Without loss of generality, we focus on problems with only inequality constraints. We systematically calibrate inequality constraints used in DNN training, thereby"},"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":"2112.08091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-15T13:05:59Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"0e452d89ac49506495c11df6f2488977897cbb7e67a64fd89b00f783af94053b","abstract_canon_sha256":"56d680add667b3686d5405fe2faf2f66d035086d5ef12f5b4fe2591d50892a7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:59.517868Z","signature_b64":"wfK+70FO0xpYAyF6uDIU2xa/Su1Ggnw0ehVSCxxcBSYuJqh0TXe4h7s1UvXTZ+86BnuvLt2TvHXP0dHIyLvxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94f654b688cd1d7d4e9222a7d49201ca288891ef545a2227ec1873b2738638ed","last_reissued_at":"2026-07-05T06:10:59.517504Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:59.517504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensuring DNN Solution Feasibility for Optimization Problems with Convex Constraints and Its Application to DC Optimal Power Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Minghua Chen, Steven H. Low, Tianyu Zhao, Xiang Pan","submitted_at":"2021-12-15T13:05:59Z","abstract_excerpt":"Ensuring solution feasibility is a key challenge in developing Deep Neural Network (DNN) schemes for solving constrained optimization problems, due to inherent DNN prediction errors. In this paper, we propose a ``preventive learning'' framework to guarantee DNN solution feasibility for problems with convex constraints and general objective functions without post-processing, upon satisfying a mild condition on constraint calibration. Without loss of generality, we focus on problems with only inequality constraints. We systematically calibrate inequality constraints used in DNN training, thereby"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.08091","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/2112.08091/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.08091","created_at":"2026-07-05T06:10:59.517559+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.08091v3","created_at":"2026-07-05T06:10:59.517559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.08091","created_at":"2026-07-05T06:10:59.517559+00:00"},{"alias_kind":"pith_short_12","alias_value":"ST3FJNUIZUOX","created_at":"2026-07-05T06:10:59.517559+00:00"},{"alias_kind":"pith_short_16","alias_value":"ST3FJNUIZUOX2TUS","created_at":"2026-07-05T06:10:59.517559+00:00"},{"alias_kind":"pith_short_8","alias_value":"ST3FJNUI","created_at":"2026-07-05T06:10:59.517559+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/ST3FJNUIZUOX2TUSEKT5JEQBZI","json":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI.json","graph_json":"https://pith.science/api/pith-number/ST3FJNUIZUOX2TUSEKT5JEQBZI/graph.json","events_json":"https://pith.science/api/pith-number/ST3FJNUIZUOX2TUSEKT5JEQBZI/events.json","paper":"https://pith.science/paper/ST3FJNUI"},"agent_actions":{"view_html":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI","download_json":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI.json","view_paper":"https://pith.science/paper/ST3FJNUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.08091&json=true","fetch_graph":"https://pith.science/api/pith-number/ST3FJNUIZUOX2TUSEKT5JEQBZI/graph.json","fetch_events":"https://pith.science/api/pith-number/ST3FJNUIZUOX2TUSEKT5JEQBZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI/action/storage_attestation","attest_author":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI/action/author_attestation","sign_citation":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI/action/citation_signature","submit_replication":"https://pith.science/pith/ST3FJNUIZUOX2TUSEKT5JEQBZI/action/replication_record"}},"created_at":"2026-07-05T06:10:59.517559+00:00","updated_at":"2026-07-05T06:10:59.517559+00:00"}