{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PCMIOE3XIXDMXGSF647EMWS66U","short_pith_number":"pith:PCMIOE3X","canonical_record":{"source":{"id":"1910.03685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T20:49:17Z","cross_cats_sorted":[],"title_canon_sha256":"8f4c63f1dd672e49cf4e2e94476c0b560a163edfa57deb4faae2728ef5f498af","abstract_canon_sha256":"748e37469ccc7caeba86ce6205d60697201103de4b88fc6cce6f6b1a4dd8f358"},"schema_version":"1.0"},"canonical_sha256":"789887137745c6cb9a45f73e465a5ef50080afbfc610facc9ef2ec9b83417200","source":{"kind":"arxiv","id":"1910.03685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03685","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03685v1","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03685","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"PCMIOE3XIXDM","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"PCMIOE3XIXDMXGSF","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"PCMIOE3X","created_at":"2026-07-05T00:10:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PCMIOE3XIXDMXGSF647EMWS66U","target":"record","payload":{"canonical_record":{"source":{"id":"1910.03685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T20:49:17Z","cross_cats_sorted":[],"title_canon_sha256":"8f4c63f1dd672e49cf4e2e94476c0b560a163edfa57deb4faae2728ef5f498af","abstract_canon_sha256":"748e37469ccc7caeba86ce6205d60697201103de4b88fc6cce6f6b1a4dd8f358"},"schema_version":"1.0"},"canonical_sha256":"789887137745c6cb9a45f73e465a5ef50080afbfc610facc9ef2ec9b83417200","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:56.705000Z","signature_b64":"wbNWFkFZ6Ov7LGl8S8xE5Tf7Vn2HZX7jzAy5oZhZ4VMcGEstTuuSZVxjPFzV+zeKCKGpQxiBAvJcRQvERz8QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789887137745c6cb9a45f73e465a5ef50080afbfc610facc9ef2ec9b83417200","last_reissued_at":"2026-07-05T00:10:56.704532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:56.704532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.03685","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-05T00:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAcL3GbbUScgDrxRKI7aRiMQsNLcMb8KQOYAjfj+7IlzNdSKOhbQhfASzHIn+q9Yn2WC9QOUkwq6SJHFHiWqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:17:35.692740Z"},"content_sha256":"0fac9569c580fc9c2059f5ed4089fb0bc10fc857d6fa4068479af1a557087162","schema_version":"1.0","event_id":"sha256:0fac9569c580fc9c2059f5ed4089fb0bc10fc857d6fa4068479af1a557087162"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PCMIOE3XIXDMXGSF647EMWS66U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact and Scalable Problem Decomposition for Security-Constrained Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre Velloso, Emma S. Johnson, Pascal Van Hentenryck","submitted_at":"2019-10-08T20:49:17Z","abstract_excerpt":"In this paper, we present decomposition techniques for solving large-scale instances of the security-constrained optimal power flow (SCOPF) problem with primary response. Specifically, under each contingency state, we require that the nodal demands are met and that the synchronized units generating below their limits follow a linear model for primary response. The resulting formulation is a mixed-integer linear program since the primary response model introduces disjunctions to the SCOPF problem. Unfortunately, exact methods relying on traditional Benders' decomposition do not scale well. As a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03685","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/1910.03685/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-05T00:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zV3adBmN3T/oVWsmmCBstxcnRIHI1Inmq4rH2VGtv/ibdyOl1yJSojKOGCiBDM3QShIKLzjIMbcUWy4MQRmIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:17:35.693529Z"},"content_sha256":"1e35f3894985f44261e90ec453b3766814a9f989dbaf120b75f2a7e6228ebdd8","schema_version":"1.0","event_id":"sha256:1e35f3894985f44261e90ec453b3766814a9f989dbaf120b75f2a7e6228ebdd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCMIOE3XIXDMXGSF647EMWS66U/bundle.json","state_url":"https://pith.science/pith/PCMIOE3XIXDMXGSF647EMWS66U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCMIOE3XIXDMXGSF647EMWS66U/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-10T21:17:35Z","links":{"resolver":"https://pith.science/pith/PCMIOE3XIXDMXGSF647EMWS66U","bundle":"https://pith.science/pith/PCMIOE3XIXDMXGSF647EMWS66U/bundle.json","state":"https://pith.science/pith/PCMIOE3XIXDMXGSF647EMWS66U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCMIOE3XIXDMXGSF647EMWS66U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PCMIOE3XIXDMXGSF647EMWS66U","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":"748e37469ccc7caeba86ce6205d60697201103de4b88fc6cce6f6b1a4dd8f358","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T20:49:17Z","title_canon_sha256":"8f4c63f1dd672e49cf4e2e94476c0b560a163edfa57deb4faae2728ef5f498af"},"schema_version":"1.0","source":{"id":"1910.03685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03685","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03685v1","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03685","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"PCMIOE3XIXDM","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"PCMIOE3XIXDMXGSF","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"PCMIOE3X","created_at":"2026-07-05T00:10:56Z"}],"graph_snapshots":[{"event_id":"sha256:1e35f3894985f44261e90ec453b3766814a9f989dbaf120b75f2a7e6228ebdd8","target":"graph","created_at":"2026-07-05T00:10:56Z","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/1910.03685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present decomposition techniques for solving large-scale instances of the security-constrained optimal power flow (SCOPF) problem with primary response. Specifically, under each contingency state, we require that the nodal demands are met and that the synchronized units generating below their limits follow a linear model for primary response. The resulting formulation is a mixed-integer linear program since the primary response model introduces disjunctions to the SCOPF problem. Unfortunately, exact methods relying on traditional Benders' decomposition do not scale well. As a","authors_text":"Alexandre Velloso, Emma S. Johnson, Pascal Van Hentenryck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T20:49:17Z","title":"An Exact and Scalable Problem Decomposition for Security-Constrained Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03685","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:0fac9569c580fc9c2059f5ed4089fb0bc10fc857d6fa4068479af1a557087162","target":"record","created_at":"2026-07-05T00:10:56Z","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":"748e37469ccc7caeba86ce6205d60697201103de4b88fc6cce6f6b1a4dd8f358","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-08T20:49:17Z","title_canon_sha256":"8f4c63f1dd672e49cf4e2e94476c0b560a163edfa57deb4faae2728ef5f498af"},"schema_version":"1.0","source":{"id":"1910.03685","kind":"arxiv","version":1}},"canonical_sha256":"789887137745c6cb9a45f73e465a5ef50080afbfc610facc9ef2ec9b83417200","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789887137745c6cb9a45f73e465a5ef50080afbfc610facc9ef2ec9b83417200","first_computed_at":"2026-07-05T00:10:56.704532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:56.704532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbNWFkFZ6Ov7LGl8S8xE5Tf7Vn2HZX7jzAy5oZhZ4VMcGEstTuuSZVxjPFzV+zeKCKGpQxiBAvJcRQvERz8QBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:56.705000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.03685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fac9569c580fc9c2059f5ed4089fb0bc10fc857d6fa4068479af1a557087162","sha256:1e35f3894985f44261e90ec453b3766814a9f989dbaf120b75f2a7e6228ebdd8"],"state_sha256":"a8a0de9758bbd03774efffc2ad2922673bde6f835e8ac007df6cc3d33d32a20a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUq+e6b2awznBdPMXeeC+JLaDhhfeXCodVzFhd1etMJnGkFZOvJYOZ9q8ee78TAEv1Uq3x6Y7bMDE2q55+TUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T21:17:35.699844Z","bundle_sha256":"73b5cfe176d56c6139a8cc4af5a829405fe16ee1c386a287622659065c37d761"}}