{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KMPY5FGW6Z6JA4XZIO567PNOA5","short_pith_number":"pith:KMPY5FGW","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"},"canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","source":{"kind":"arxiv","id":"1809.09812","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KMPY5FGW6Z6JA4XZIO567PNOA5","target":"record","payload":{"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"},"canonical_sha256":"531f8e94d6f67c9072f943bbefbdae07730bc8ee7bd7901547ee61b01d7e4d9b","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"},"source_kind":"arxiv","source_id":"1809.09812","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-05-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFDcwfiiZaYdAPtmvUPWQWW6RZ9VY6IPGZgpkcAqqMl0WHVWWSrU8fW2AFfisdhTbBbNQLrXtgXHHIb9pqrjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:17:53.039803Z"},"content_sha256":"7ae9a6bdb626368b8dfd3d61eeda4ca2500acb27753177ab1b6a7cd55b025b5f","schema_version":"1.0","event_id":"sha256:7ae9a6bdb626368b8dfd3d61eeda4ca2500acb27753177ab1b6a7cd55b025b5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KMPY5FGW6Z6JA4XZIO567PNOA5","target":"graph","payload":{"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"},"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-05-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhK8YG20RGOHEPlPfKrDCCBhCLSUyIVwKIB4TiiLN//GSGRhLWq82+bszRW5BvZOi/Gphp2Ngmig/YTR9kXaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:17:53.040154Z"},"content_sha256":"70aad66dcb7aca91c2b682bffdd8fedd5a6d47ad92998e014d95a6ef1e1b0464","schema_version":"1.0","event_id":"sha256:70aad66dcb7aca91c2b682bffdd8fedd5a6d47ad92998e014d95a6ef1e1b0464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/bundle.json","state_url":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/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-06-02T04:17:53Z","links":{"resolver":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5","bundle":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/bundle.json","state":"https://pith.science/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMPY5FGW6Z6JA4XZIO567PNOA5/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfSj5ibPmyQCMxPDvYOYJF85dhBMORGCfmddKYAPLYMK+RMzSqxpX7E5H8KD9ELt/u1/6LNZT3Pw9VKC6d8+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:17:53.042170Z","bundle_sha256":"20ba35b07e50d16148d24a0720ba5c2b16c8343e55ee1f4439d84eeb9a254963"}}