{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:F522F6GRDRHPLQHEW43TOG2VFQ","short_pith_number":"pith:F522F6GR","canonical_record":{"source":{"id":"2110.01669","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"839ac9b434ef42c7a655ebb04df278285474ac2e9c4a84f9b64a22cfee084672","abstract_canon_sha256":"15a26a5f32af0436d9d58a89ae20e843ee0332e02ab392bf32ee1fb4dc7d2fc4"},"schema_version":"1.0"},"canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","source":{"kind":"arxiv","id":"2110.01669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.01669","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.01669v1","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01669","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"F522F6GRDRHP","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"F522F6GRDRHPLQHE","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"F522F6GR","created_at":"2026-07-05T03:20:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:F522F6GRDRHPLQHEW43TOG2VFQ","target":"record","payload":{"canonical_record":{"source":{"id":"2110.01669","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"839ac9b434ef42c7a655ebb04df278285474ac2e9c4a84f9b64a22cfee084672","abstract_canon_sha256":"15a26a5f32af0436d9d58a89ae20e843ee0332e02ab392bf32ee1fb4dc7d2fc4"},"schema_version":"1.0"},"canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:16.014567Z","signature_b64":"/N1M9M9vAsr/E4i13nykHlJL1/cawgTlQpNeyJVwtrpbVwsbjWS0HwTaSy5kVshEGII7KbDzAKG86pZUcMVECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","last_reissued_at":"2026-07-05T03:20:16.014162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:16.014162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.01669","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-05T03:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sw23gcybl2u9YqjoMjedVGyz8lKVHsn70KaQf9OnUQCGddpANU8cetC6jWXouh53mhczhvjOTAPGLe1l69RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:28:07.591399Z"},"content_sha256":"37587b535ca441cd1efcdb72d50d3d12b4f6775ac69ef762e0a3cd29cddc9c10","schema_version":"1.0","event_id":"sha256:37587b535ca441cd1efcdb72d50d3d12b4f6775ac69ef762e0a3cd29cddc9c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:F522F6GRDRHPLQHEW43TOG2VFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving realistic security-constrained optimal power flow problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cosmin G. Petra, Ignacio Aravena","submitted_at":"2021-10-04T19:07:46Z","abstract_excerpt":"We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The approach aims at complementing the existing body of literature on bounding the problem via convex relaxations. It was designed for the participation in ARPA-E's Grid Optimization (GO) Competition Challenge 1. The challenge focused on a near-real-time version of the SCACOPF problem where a base case operating point is optimized taking into account possible sin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01669","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/2110.01669/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-05T03:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NaZHGiwcDVLgz+lsHEU6sL0cHurM+q580gIP64yVpddc3sPu7uoSK9L0VklZiW4TAjSiRYN/gQgJrYMnEOLZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:28:07.592059Z"},"content_sha256":"d8463332c7432f1cb78bfe321d3e55048334ff0daf886c9f9bbba8495ae8aca0","schema_version":"1.0","event_id":"sha256:d8463332c7432f1cb78bfe321d3e55048334ff0daf886c9f9bbba8495ae8aca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/bundle.json","state_url":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F522F6GRDRHPLQHEW43TOG2VFQ/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-11T19:28:07Z","links":{"resolver":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ","bundle":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/bundle.json","state":"https://pith.science/pith/F522F6GRDRHPLQHEW43TOG2VFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F522F6GRDRHPLQHEW43TOG2VFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:F522F6GRDRHPLQHEW43TOG2VFQ","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":"15a26a5f32af0436d9d58a89ae20e843ee0332e02ab392bf32ee1fb4dc7d2fc4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","title_canon_sha256":"839ac9b434ef42c7a655ebb04df278285474ac2e9c4a84f9b64a22cfee084672"},"schema_version":"1.0","source":{"id":"2110.01669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.01669","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.01669v1","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01669","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"F522F6GRDRHP","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"F522F6GRDRHPLQHE","created_at":"2026-07-05T03:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"F522F6GR","created_at":"2026-07-05T03:20:16Z"}],"graph_snapshots":[{"event_id":"sha256:d8463332c7432f1cb78bfe321d3e55048334ff0daf886c9f9bbba8495ae8aca0","target":"graph","created_at":"2026-07-05T03:20:16Z","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/2110.01669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The approach aims at complementing the existing body of literature on bounding the problem via convex relaxations. It was designed for the participation in ARPA-E's Grid Optimization (GO) Competition Challenge 1. The challenge focused on a near-real-time version of the SCACOPF problem where a base case operating point is optimized taking into account possible sin","authors_text":"Cosmin G. Petra, Ignacio Aravena","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","title":"Solving realistic security-constrained optimal power flow problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01669","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:37587b535ca441cd1efcdb72d50d3d12b4f6775ac69ef762e0a3cd29cddc9c10","target":"record","created_at":"2026-07-05T03:20:16Z","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":"15a26a5f32af0436d9d58a89ae20e843ee0332e02ab392bf32ee1fb4dc7d2fc4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-04T19:07:46Z","title_canon_sha256":"839ac9b434ef42c7a655ebb04df278285474ac2e9c4a84f9b64a22cfee084672"},"schema_version":"1.0","source":{"id":"2110.01669","kind":"arxiv","version":1}},"canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f75a2f8d11c4ef5c0e4b737371b552c2b26c44dfe60499d3ae3c93f0c678380","first_computed_at":"2026-07-05T03:20:16.014162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:16.014162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/N1M9M9vAsr/E4i13nykHlJL1/cawgTlQpNeyJVwtrpbVwsbjWS0HwTaSy5kVshEGII7KbDzAKG86pZUcMVECQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:16.014567Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.01669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37587b535ca441cd1efcdb72d50d3d12b4f6775ac69ef762e0a3cd29cddc9c10","sha256:d8463332c7432f1cb78bfe321d3e55048334ff0daf886c9f9bbba8495ae8aca0"],"state_sha256":"897a765b16650a1a77ebf8e96afb63b80f89c7661a95590e23c8871650d1cacd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoDQZGtRedpjZSfe6uEWVWJks5u2l6A8pZX50c2RE2T/BwKV4gZtphfvBJHUawKrj0xDetUGPV618Q7O0cE6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:28:07.597540Z","bundle_sha256":"6bf5f1ac8e14beaa7e363c42945e18f2c7924bae60432e5c3baa4c1682c28c83"}}