{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BYAEBSLMCE5HF6WK4UZZBFXZUB","short_pith_number":"pith:BYAEBSLM","schema_version":"1.0","canonical_sha256":"0e0040c96c113a72facae5339096f9a07f1298f318ed3b235118387a106f19e8","source":{"kind":"arxiv","id":"2210.06678","version":2},"attestation_state":"computed","paper":{"title":"Fully and partially distributed Quantum Generalized Benders Decomposition for Unit Commitment Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dejian Huang, Fang Gao, Mingyu Yang, Qing Gao, Wei Dai, Yu Pan, Ziwei Zhao","submitted_at":"2022-10-13T02:26:27Z","abstract_excerpt":"A series of hybrid quantum-classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems under centralized, distributed, and partially distributed frameworks. In the centralized approach, the quantum GBD transforms the master problem (MP) into a quadratic unconstrained binary optimization form suitable for quantum computing. For distributed systems, the distributed consensus quantum GBD employs an average consensus strategy to reformulate subproblems into local subproblems. By leveraging the dual information, local cutting planes are constru"},"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":"2210.06678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-13T02:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"37640c2945e91080453133c483933a92ea572503b9f36071641de29bb4bba3e1","abstract_canon_sha256":"32e0033c29c76750ead770da82af0413d0948247b40c4766a222f0e4f25ec077"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:58.746616Z","signature_b64":"Ka5yVAwXEjUSkKceG7EOOpwHluXho7IZOkmqgAbOGztRMRYi1L51Mdvl4tcl7hsZeEjiEySppDW1LTYM2SBBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e0040c96c113a72facae5339096f9a07f1298f318ed3b235118387a106f19e8","last_reissued_at":"2026-07-05T09:48:58.746111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:58.746111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully and partially distributed Quantum Generalized Benders Decomposition for Unit Commitment Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dejian Huang, Fang Gao, Mingyu Yang, Qing Gao, Wei Dai, Yu Pan, Ziwei Zhao","submitted_at":"2022-10-13T02:26:27Z","abstract_excerpt":"A series of hybrid quantum-classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems under centralized, distributed, and partially distributed frameworks. In the centralized approach, the quantum GBD transforms the master problem (MP) into a quadratic unconstrained binary optimization form suitable for quantum computing. For distributed systems, the distributed consensus quantum GBD employs an average consensus strategy to reformulate subproblems into local subproblems. By leveraging the dual information, local cutting planes are constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06678","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.06678/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.06678","created_at":"2026-07-05T09:48:58.746178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06678v2","created_at":"2026-07-05T09:48:58.746178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06678","created_at":"2026-07-05T09:48:58.746178+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYAEBSLMCE5H","created_at":"2026-07-05T09:48:58.746178+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYAEBSLMCE5HF6WK","created_at":"2026-07-05T09:48:58.746178+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYAEBSLM","created_at":"2026-07-05T09:48:58.746178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18887","citing_title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB","json":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB.json","graph_json":"https://pith.science/api/pith-number/BYAEBSLMCE5HF6WK4UZZBFXZUB/graph.json","events_json":"https://pith.science/api/pith-number/BYAEBSLMCE5HF6WK4UZZBFXZUB/events.json","paper":"https://pith.science/paper/BYAEBSLM"},"agent_actions":{"view_html":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB","download_json":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB.json","view_paper":"https://pith.science/paper/BYAEBSLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06678&json=true","fetch_graph":"https://pith.science/api/pith-number/BYAEBSLMCE5HF6WK4UZZBFXZUB/graph.json","fetch_events":"https://pith.science/api/pith-number/BYAEBSLMCE5HF6WK4UZZBFXZUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB/action/storage_attestation","attest_author":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB/action/author_attestation","sign_citation":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB/action/citation_signature","submit_replication":"https://pith.science/pith/BYAEBSLMCE5HF6WK4UZZBFXZUB/action/replication_record"}},"created_at":"2026-07-05T09:48:58.746178+00:00","updated_at":"2026-07-05T09:48:58.746178+00:00"}