{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L5CPX7QPHD2IWVRXFU2ATBTIH7","short_pith_number":"pith:L5CPX7QP","schema_version":"1.0","canonical_sha256":"5f44fbfe0f38f48b56372d340986683fc7583a14b43bdc9e428f7baaae6f776b","source":{"kind":"arxiv","id":"1810.09096","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.09096","created_at":"2026-05-18T00:02:41.032183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09096v1","created_at":"2026-05-18T00:02:41.032183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09096","created_at":"2026-05-18T00:02:41.032183+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5CPX7QPHD2I","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5CPX7QPHD2IWVRX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5CPX7QP","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/L5CPX7QPHD2IWVRXFU2ATBTIH7","json":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7.json","graph_json":"https://pith.science/api/pith-number/L5CPX7QPHD2IWVRXFU2ATBTIH7/graph.json","events_json":"https://pith.science/api/pith-number/L5CPX7QPHD2IWVRXFU2ATBTIH7/events.json","paper":"https://pith.science/paper/L5CPX7QP"},"agent_actions":{"view_html":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7","download_json":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7.json","view_paper":"https://pith.science/paper/L5CPX7QP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09096&json=true","fetch_graph":"https://pith.science/api/pith-number/L5CPX7QPHD2IWVRXFU2ATBTIH7/graph.json","fetch_events":"https://pith.science/api/pith-number/L5CPX7QPHD2IWVRXFU2ATBTIH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/action/storage_attestation","attest_author":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/action/author_attestation","sign_citation":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/action/citation_signature","submit_replication":"https://pith.science/pith/L5CPX7QPHD2IWVRXFU2ATBTIH7/action/replication_record"}},"created_at":"2026-05-18T00:02:41.032183+00:00","updated_at":"2026-05-18T00:02:41.032183+00:00"}