{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FFFFW6IVBCMA37NGZHYKPJM5QO","short_pith_number":"pith:FFFFW6IV","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"},"canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","source":{"kind":"arxiv","id":"2506.17924","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.17924","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.17924v1","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17924","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"FFFFW6IVBCMA","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_16","alias_value":"FFFFW6IVBCMA37NG","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_8","alias_value":"FFFFW6IV","created_at":"2026-07-05T11:25:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FFFFW6IVBCMA37NGZHYKPJM5QO","target":"record","payload":{"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"},"canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","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"},"source_kind":"arxiv","source_id":"2506.17924","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-05T11:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8b9lohjU1viIg7bvauy4SaGwmrzemfi7uIhNi7snbHLODZVvB8SPOONtviN9qSC4N4taFt6D36PjGXSO8KXIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:07:22.444611Z"},"content_sha256":"0ff883ce778a542aff6f35b160f0250120cac54a7bab65a9c2c5c92ec7078f33","schema_version":"1.0","event_id":"sha256:0ff883ce778a542aff6f35b160f0250120cac54a7bab65a9c2c5c92ec7078f33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FFFFW6IVBCMA37NGZHYKPJM5QO","target":"graph","payload":{"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"},"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-05T11:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCgnUiTlCfbI3LRfALNxDE3rl5LWrnNekFooU54JbojAC2opNv0vVk696LKxr31SJxTAjRkuqSLzdpPePWi7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:07:22.445118Z"},"content_sha256":"d2f0b1d26359ea0d30a8fdf7354da953b2731fd96b3d45dc90a44ddf7a2dd039","schema_version":"1.0","event_id":"sha256:d2f0b1d26359ea0d30a8fdf7354da953b2731fd96b3d45dc90a44ddf7a2dd039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/bundle.json","state_url":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/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-19T16:07:22Z","links":{"resolver":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO","bundle":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/bundle.json","state":"https://pith.science/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFFFW6IVBCMA37NGZHYKPJM5QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FFFFW6IVBCMA37NGZHYKPJM5QO","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":"8c4b80bde4ff78530b8ddecd85e944daa7d037eaf399259452fd15ee65de6ca7","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-22T07:30:20Z","title_canon_sha256":"765faed35665034c2a372d870125703759d23edc6309ae4902a144f69abe1cd0"},"schema_version":"1.0","source":{"id":"2506.17924","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.17924","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.17924v1","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17924","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"FFFFW6IVBCMA","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_16","alias_value":"FFFFW6IVBCMA37NG","created_at":"2026-07-05T11:25:25Z"},{"alias_kind":"pith_short_8","alias_value":"FFFFW6IV","created_at":"2026-07-05T11:25:25Z"}],"graph_snapshots":[{"event_id":"sha256:d2f0b1d26359ea0d30a8fdf7354da953b2731fd96b3d45dc90a44ddf7a2dd039","target":"graph","created_at":"2026-07-05T11:25:25Z","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/2506.17924/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kairui Feng, Mengqi Xue, Shenglu Wang, Yue Song","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-22T07:30:20Z","title":"Inverse Chance Constrained Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17924","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:0ff883ce778a542aff6f35b160f0250120cac54a7bab65a9c2c5c92ec7078f33","target":"record","created_at":"2026-07-05T11:25:25Z","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":"8c4b80bde4ff78530b8ddecd85e944daa7d037eaf399259452fd15ee65de6ca7","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-22T07:30:20Z","title_canon_sha256":"765faed35665034c2a372d870125703759d23edc6309ae4902a144f69abe1cd0"},"schema_version":"1.0","source":{"id":"2506.17924","kind":"arxiv","version":1}},"canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"294a5b791508980dfda6c9f0a7a59d839d405875c942a35abf5ced91f9594fc4","first_computed_at":"2026-07-05T11:25:25.651144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:25:25.651144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FLuwry3NgCoeclrEko4AOfftvJ1dDLACr1CK0nK48XjHHEpd+yLzyJ48hUU2Ksyzc93ol18gpFc6lY0YayWhCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:25:25.651631Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.17924","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ff883ce778a542aff6f35b160f0250120cac54a7bab65a9c2c5c92ec7078f33","sha256:d2f0b1d26359ea0d30a8fdf7354da953b2731fd96b3d45dc90a44ddf7a2dd039"],"state_sha256":"1fe102c27b314ad38e1c11fd705fe10be529c9112eaba945a124119a654adc8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLNB9sO/v+KzhK/q8mrKpSkHLL3MfK6rjr5+g390AqRkJbUHQtqqDVnrJtDJ+M+/VgPpt8KPJWc0fI34hQafCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:07:22.449807Z","bundle_sha256":"5d3450d9c0e9291e4de48c0ee48cc33c6725bc8981b6ca1befee70080624754f"}}