{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FFFFW6IVBCMA37NGZHYKPJM5QO","short_pith_number":"pith:FFFFW6IV","schema_version":"1.0","canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","source":{"kind":"arxiv","id":"2506.17924","version":1},"attestation_state":"computed","paper":{"title":"Inverse Chance Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Kairui Feng, Mengqi Xue, Shenglu Wang, Yue Song","submitted_at":"2025-06-22T07:30:20Z","abstract_excerpt":"The chance constrained optimal power flow (CC-OPF) essentially finds the low-cost generation dispatch scheme ensuring operational constraints are met with a specified probability, termed the security level. While the security level is a crucial input parameter, how it shapes the CC-OPF feasibility boundary has not been revealed. Changing the security level from a parameter to a decision variable, this letter proposes the inverse CC-OPF that seeks the highest feasible security level supported by the system. To efficiently solve this problem, we design a Newton-Raphson-like iteration algorithm l"},"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":"2506.17924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-22T07:30:20Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"765faed35665034c2a372d870125703759d23edc6309ae4902a144f69abe1cd0","abstract_canon_sha256":"8c4b80bde4ff78530b8ddecd85e944daa7d037eaf399259452fd15ee65de6ca7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:25.651631Z","signature_b64":"FLuwry3NgCoeclrEko4AOfftvJ1dDLACr1CK0nK48XjHHEpd+yLzyJ48hUU2Ksyzc93ol18gpFc6lY0YayWhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","last_reissued_at":"2026-07-05T11:25:25.651144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:25.651144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Chance Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Kairui Feng, Mengqi Xue, Shenglu Wang, Yue Song","submitted_at":"2025-06-22T07:30:20Z","abstract_excerpt":"The chance constrained optimal power flow (CC-OPF) essentially finds the low-cost generation dispatch scheme ensuring operational constraints are met with a specified probability, termed the security level. While the security level is a crucial input parameter, how it shapes the CC-OPF feasibility boundary has not been revealed. Changing the security level from a parameter to a decision variable, this letter proposes the inverse CC-OPF that seeks the highest feasible security level supported by the system. To efficiently solve this problem, we design a Newton-Raphson-like iteration algorithm l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17924","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/2506.17924/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":"2506.17924","created_at":"2026-07-05T11:25:25.651201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.17924v1","created_at":"2026-07-05T11:25:25.651201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17924","created_at":"2026-07-05T11:25:25.651201+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFFFW6IVBCMA","created_at":"2026-07-05T11:25:25.651201+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFFFW6IVBCMA37NG","created_at":"2026-07-05T11:25:25.651201+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFFFW6IV","created_at":"2026-07-05T11:25:25.651201+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/FFFFW6IVBCMA37NGZHYKPJM5QO","json":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO.json","graph_json":"https://pith.science/api/pith-number/FFFFW6IVBCMA37NGZHYKPJM5QO/graph.json","events_json":"https://pith.science/api/pith-number/FFFFW6IVBCMA37NGZHYKPJM5QO/events.json","paper":"https://pith.science/paper/FFFFW6IV"},"agent_actions":{"view_html":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO","download_json":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO.json","view_paper":"https://pith.science/paper/FFFFW6IV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.17924&json=true","fetch_graph":"https://pith.science/api/pith-number/FFFFW6IVBCMA37NGZHYKPJM5QO/graph.json","fetch_events":"https://pith.science/api/pith-number/FFFFW6IVBCMA37NGZHYKPJM5QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/action/storage_attestation","attest_author":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/action/author_attestation","sign_citation":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/action/citation_signature","submit_replication":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/action/replication_record"}},"created_at":"2026-07-05T11:25:25.651201+00:00","updated_at":"2026-07-05T11:25:25.651201+00:00"}