{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMPY5FGW6Z6JA4XZIO567PNOA5","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":"013c81781a26d0f915269384ca9d0f37fed2562b1f5e170b5feb95886e7e7400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:21:57Z","title_canon_sha256":"f0c52385993e7c2408e6375de76dd66f70aefd7715805c1a89059698f4cad420"},"schema_version":"1.0","source":{"id":"1809.09812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09812","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09812v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09812","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"KMPY5FGW6Z6J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMPY5FGW6Z6JA4XZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMPY5FGW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:70aad66dcb7aca91c2b682bffdd8fedd5a6d47ad92998e014d95a6ef1e1b0464","target":"graph","created_at":"2026-05-18T00:04:43Z","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"},"paper":{"abstract_excerpt":"This paper proposes a sequential convex relaxation method for obtaining feasible and near-globally optimal solutions for unit commitment (UC) with AC transmission constraints. First, we develop a second-order cone programming (SOCP) relaxation for AC unit commitment. To ensure that the resulting solutions are feasible for the original non-convex problem, we incorporate penalty terms into the objective of the proposed SOCP relaxation. We generalize our penalization method to a sequential algorithm which starts from an initial point (not necessarily feasible) and leads to feasible and near-optim","authors_text":"Adnan Nasir, Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:21:57Z","title":"Sequential Relaxation of Unit Commitment with AC Transmission Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09812","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:7ae9a6bdb626368b8dfd3d61eeda4ca2500acb27753177ab1b6a7cd55b025b5f","target":"record","created_at":"2026-05-18T00:04:43Z","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":"013c81781a26d0f915269384ca9d0f37fed2562b1f5e170b5feb95886e7e7400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:21:57Z","title_canon_sha256":"f0c52385993e7c2408e6375de76dd66f70aefd7715805c1a89059698f4cad420"},"schema_version":"1.0","source":{"id":"1809.09812","kind":"arxiv","version":1}},"canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","first_computed_at":"2026-05-18T00:04:43.586413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.586413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYCfqJXpQTHqhPMy64vJ2UgznW3n5i63QXMFfhfru0ygdHFHwAvbzgJWAQAaMIosk+LydTXHzdi/UPEB6LFlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.586978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ae9a6bdb626368b8dfd3d61eeda4ca2500acb27753177ab1b6a7cd55b025b5f","sha256:70aad66dcb7aca91c2b682bffdd8fedd5a6d47ad92998e014d95a6ef1e1b0464"],"state_sha256":"52dc9fc110f6a8478749c8d151f1d9e05a64590b7f9c653aa4f4722a72f49670"}