{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7T5FPSA3WG5YORXICRWOHPECIC","short_pith_number":"pith:7T5FPSA3","schema_version":"1.0","canonical_sha256":"fcfa57c81bb1bb8746e8146ce3bc8240a9761dd2223b9fcbdf5258716cbd8fd8","source":{"kind":"arxiv","id":"2212.06480","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Computing Approach for the Unit Commitment Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Kai Plociennik, Michael Trebing, Pascal Halffmann, Patrick Holzer","submitted_at":"2022-12-13T11:01:42Z","abstract_excerpt":"Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called \\emph{unit commitment problem (UCP)} have to be solved more rapidly, a task that probably can be solved more efficiently via quantum computing. In this article, we model a UCP with minimum running and idle times as a quadratic unconstrained optimization problem to solve it on quantum computing hardware. First experiments confirm the advantages of our formulation in terms of qubit"},"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":"2212.06480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-13T11:01:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fdf54e9bad62d0f88e9011233699b186418993c6b7add68bf05cefe8822e4aca","abstract_canon_sha256":"13923c2a244d73c9f7fc9ad26f3fbb725553722e165867f39e10b08b286c23a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:39.430164Z","signature_b64":"EkdgaDhHbGevLr/FJKLVOcNUy2xooxEKZdLu/9OAAAC4LZMjrNWrJOxyID39NAvdg6H7pbxaZfjZ9a3JskZ2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcfa57c81bb1bb8746e8146ce3bc8240a9761dd2223b9fcbdf5258716cbd8fd8","last_reissued_at":"2026-07-05T07:52:39.429716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:39.429716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Computing Approach for the Unit Commitment Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Kai Plociennik, Michael Trebing, Pascal Halffmann, Patrick Holzer","submitted_at":"2022-12-13T11:01:42Z","abstract_excerpt":"Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called \\emph{unit commitment problem (UCP)} have to be solved more rapidly, a task that probably can be solved more efficiently via quantum computing. In this article, we model a UCP with minimum running and idle times as a quadratic unconstrained optimization problem to solve it on quantum computing hardware. First experiments confirm the advantages of our formulation in terms of qubit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06480","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.06480/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":"2212.06480","created_at":"2026-07-05T07:52:39.429775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06480v1","created_at":"2026-07-05T07:52:39.429775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06480","created_at":"2026-07-05T07:52:39.429775+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T5FPSA3WG5Y","created_at":"2026-07-05T07:52:39.429775+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T5FPSA3WG5YORXI","created_at":"2026-07-05T07:52:39.429775+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T5FPSA3","created_at":"2026-07-05T07:52:39.429775+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/7T5FPSA3WG5YORXICRWOHPECIC","json":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC.json","graph_json":"https://pith.science/api/pith-number/7T5FPSA3WG5YORXICRWOHPECIC/graph.json","events_json":"https://pith.science/api/pith-number/7T5FPSA3WG5YORXICRWOHPECIC/events.json","paper":"https://pith.science/paper/7T5FPSA3"},"agent_actions":{"view_html":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC","download_json":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC.json","view_paper":"https://pith.science/paper/7T5FPSA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06480&json=true","fetch_graph":"https://pith.science/api/pith-number/7T5FPSA3WG5YORXICRWOHPECIC/graph.json","fetch_events":"https://pith.science/api/pith-number/7T5FPSA3WG5YORXICRWOHPECIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC/action/storage_attestation","attest_author":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC/action/author_attestation","sign_citation":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC/action/citation_signature","submit_replication":"https://pith.science/pith/7T5FPSA3WG5YORXICRWOHPECIC/action/replication_record"}},"created_at":"2026-07-05T07:52:39.429775+00:00","updated_at":"2026-07-05T07:52:39.429775+00:00"}