{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L5CPX7QPHD2IWVRXFU2ATBTIH7","short_pith_number":"pith:L5CPX7QP","canonical_record":{"source":{"id":"1810.09096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T05:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"3503b2f7fa8e45609a496778b153fcd884376a5e0fff0899c67a2f3570a91068","abstract_canon_sha256":"abc7b2ab54cf280cd198e1ef84721144a906bca5d0488575df9786b862590e31"},"schema_version":"1.0"},"canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","source":{"kind":"arxiv","id":"1810.09096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09096","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09096v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09096","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"L5CPX7QPHD2I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L5CPX7QPHD2IWVRX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L5CPX7QP","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L5CPX7QPHD2IWVRXFU2ATBTIH7","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T05:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"3503b2f7fa8e45609a496778b153fcd884376a5e0fff0899c67a2f3570a91068","abstract_canon_sha256":"abc7b2ab54cf280cd198e1ef84721144a906bca5d0488575df9786b862590e31"},"schema_version":"1.0"},"canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:41.032627Z","signature_b64":"HnMaTtX3B1q4z9QnKT/h/kjK4RHLsTze7CJl/LIxTQIc2wgEpib7ow5EF4mOt12mC04rEU/UEBCkCwmx0vHIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","last_reissued_at":"2026-05-18T00:02:41.032096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:41.032096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09096","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:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ss1czXNkQdISY12M13PEURQa8j7L3F9RfqT+heepZJG4UdkQO3CBveHiSGAcJEsvgGOA13gP3CA4cef8/wxeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:26:45.212520Z"},"content_sha256":"cc3fe85bbfa83173eddeab75154cc11dd68258f7dce1b0c313b2bdb796214b1c","schema_version":"1.0","event_id":"sha256:cc3fe85bbfa83173eddeab75154cc11dd68258f7dce1b0c313b2bdb796214b1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L5CPX7QPHD2IWVRXFU2ATBTIH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Variable Reduction Method for Large-Scale Security Constrained Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jingxuan Zhou, Qiaozhu Zhai, Xiaohong Guan, Xuan Li","submitted_at":"2018-10-22T05:49:56Z","abstract_excerpt":"Efficient methods for large-scale security constrained unit commitment (SCUC) problems have long been an important research topic and a challenge especially in market clearing computation. For large-scale SCUC, the Lagrangian relaxation methods (LR) and the mixed integer programming methods (MIP) are most widely adopted. However, LR usually suffers from slow convergence; and the computational burden of MIP is heavy when the binary variable number is large. In this paper, a variable reduction method is proposed: First, the time-coupled constraints in the original SCUC problem are relaxed and ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09096","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:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cI5vPCGSp7p/VRju8QdKcTAQo7KXsi0KwfC/GK38UjgeiVFbTo6OjiOgpVZNygdH1HUtAGzqGm1EHWkEJ1cxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:26:45.212870Z"},"content_sha256":"70021a3a75388bbfbd3f9ae5d2173e7565981f8d26ea1ea7b84c20ae58fea195","schema_version":"1.0","event_id":"sha256:70021a3a75388bbfbd3f9ae5d2173e7565981f8d26ea1ea7b84c20ae58fea195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/bundle.json","state_url":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/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-05-28T04:26:45Z","links":{"resolver":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7","bundle":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/bundle.json","state":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L5CPX7QPHD2IWVRXFU2ATBTIH7","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":"abc7b2ab54cf280cd198e1ef84721144a906bca5d0488575df9786b862590e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T05:49:56Z","title_canon_sha256":"3503b2f7fa8e45609a496778b153fcd884376a5e0fff0899c67a2f3570a91068"},"schema_version":"1.0","source":{"id":"1810.09096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09096","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09096v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09096","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"L5CPX7QPHD2I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L5CPX7QPHD2IWVRX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L5CPX7QP","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:70021a3a75388bbfbd3f9ae5d2173e7565981f8d26ea1ea7b84c20ae58fea195","target":"graph","created_at":"2026-05-18T00:02:41Z","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":"Efficient methods for large-scale security constrained unit commitment (SCUC) problems have long been an important research topic and a challenge especially in market clearing computation. For large-scale SCUC, the Lagrangian relaxation methods (LR) and the mixed integer programming methods (MIP) are most widely adopted. However, LR usually suffers from slow convergence; and the computational burden of MIP is heavy when the binary variable number is large. In this paper, a variable reduction method is proposed: First, the time-coupled constraints in the original SCUC problem are relaxed and ma","authors_text":"Jingxuan Zhou, Qiaozhu Zhai, Xiaohong Guan, Xuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T05:49:56Z","title":"A Variable Reduction Method for Large-Scale Security Constrained Unit Commitment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09096","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:cc3fe85bbfa83173eddeab75154cc11dd68258f7dce1b0c313b2bdb796214b1c","target":"record","created_at":"2026-05-18T00:02:41Z","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":"abc7b2ab54cf280cd198e1ef84721144a906bca5d0488575df9786b862590e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T05:49:56Z","title_canon_sha256":"3503b2f7fa8e45609a496778b153fcd884376a5e0fff0899c67a2f3570a91068"},"schema_version":"1.0","source":{"id":"1810.09096","kind":"arxiv","version":1}},"canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","first_computed_at":"2026-05-18T00:02:41.032096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:41.032096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnMaTtX3B1q4z9QnKT/h/kjK4RHLsTze7CJl/LIxTQIc2wgEpib7ow5EF4mOt12mC04rEU/UEBCkCwmx0vHIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:41.032627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc3fe85bbfa83173eddeab75154cc11dd68258f7dce1b0c313b2bdb796214b1c","sha256:70021a3a75388bbfbd3f9ae5d2173e7565981f8d26ea1ea7b84c20ae58fea195"],"state_sha256":"7f70ee3f69fbb185998a3f7854799fe45b4ca4aa1be6265198e8c5dc3b9072f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voRsW9/xilNUu+HETn+UMbIWbQBVfsUVvhNQGP0HnWo9dxwlTwnRBjCdEE4fSgQ85QZmSx/q6bSDxYFYkiw2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:26:45.214943Z","bundle_sha256":"60faf4259f5ebca4a20630d69e9ddcf947e293bb672524bdbfe97a3dd0060513"}}