{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KMPY5FGW6Z6JA4XZIO567PNOA5","short_pith_number":"pith:KMPY5FGW","schema_version":"1.0","canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","source":{"kind":"arxiv","id":"1809.09812","version":1},"attestation_state":"computed","paper":{"title":"Sequential Relaxation of Unit Commitment with AC Transmission Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adnan Nasir, Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:21:57Z","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"},"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":"1809.09812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:21:57Z","cross_cats_sorted":[],"title_canon_sha256":"f0c52385993e7c2408e6375de76dd66f70aefd7715805c1a89059698f4cad420","abstract_canon_sha256":"013c81781a26d0f915269384ca9d0f37fed2562b1f5e170b5feb95886e7e7400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.586978Z","signature_b64":"iYCfqJXpQTHqhPMy64vJ2UgznW3n5i63QXMFfhfru0ygdHFHwAvbzgJWAQAaMIosk+LydTXHzdi/UPEB6LFlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","last_reissued_at":"2026-05-18T00:04:43.586413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.586413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Relaxation of Unit Commitment with AC Transmission Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adnan Nasir, Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:21:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09812","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":""},"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":"1809.09812","created_at":"2026-05-18T00:04:43.586525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09812v1","created_at":"2026-05-18T00:04:43.586525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09812","created_at":"2026-05-18T00:04:43.586525+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMPY5FGW6Z6J","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMPY5FGW6Z6JA4XZ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMPY5FGW","created_at":"2026-05-18T12:32:33.847187+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/KMPY5FGW6Z6JA4XZIO567PNOA5","json":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5.json","graph_json":"https://pith.science/api/pith-number/KMPY5FGW6Z6JA4XZIO567PNOA5/graph.json","events_json":"https://pith.science/api/pith-number/KMPY5FGW6Z6JA4XZIO567PNOA5/events.json","paper":"https://pith.science/paper/KMPY5FGW"},"agent_actions":{"view_html":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5","download_json":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5.json","view_paper":"https://pith.science/paper/KMPY5FGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09812&json=true","fetch_graph":"https://pith.science/api/pith-number/KMPY5FGW6Z6JA4XZIO567PNOA5/graph.json","fetch_events":"https://pith.science/api/pith-number/KMPY5FGW6Z6JA4XZIO567PNOA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/action/storage_attestation","attest_author":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/action/author_attestation","sign_citation":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/action/citation_signature","submit_replication":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/action/replication_record"}},"created_at":"2026-05-18T00:04:43.586525+00:00","updated_at":"2026-05-18T00:04:43.586525+00:00"}