{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FWWDS5VEWNUTJQ5KOHORTFINPN","short_pith_number":"pith:FWWDS5VE","schema_version":"1.0","canonical_sha256":"2dac3976a4b36934c3aa71dd19950d7b4ba551cf1f4c293bde65dda2fd503ced","source":{"kind":"arxiv","id":"2412.11312","version":1},"attestation_state":"computed","paper":{"title":"A hybrid classical-quantum approach to highly constrained Unit Commitment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Sequeira, Bruna Salgado, Luis Paulo Santos","submitted_at":"2024-12-15T21:21:36Z","abstract_excerpt":"The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify t"},"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":"2412.11312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-15T21:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"6635787557eb58286fd468d05272d75d986c93d9c310ea2caa733be6aa4596fb","abstract_canon_sha256":"27e078fc4f5fab5ad0be0e92d6c4e9dcfccca29a7ac1792c4c33d5489b4c415c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:30.458848Z","signature_b64":"x39PeJ3mmuOIzW9hJb7daw6vYgOwnvggmcUDRopcGiC9HysGHqw45jxWyq6Ecyrw6LSjzi3BKPugQa4+89HMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dac3976a4b36934c3aa71dd19950d7b4ba551cf1f4c293bde65dda2fd503ced","last_reissued_at":"2026-07-05T09:49:30.458380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:30.458380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hybrid classical-quantum approach to highly constrained Unit Commitment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Sequeira, Bruna Salgado, Luis Paulo Santos","submitted_at":"2024-12-15T21:21:36Z","abstract_excerpt":"The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11312","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/2412.11312/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":"2412.11312","created_at":"2026-07-05T09:49:30.458456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11312v1","created_at":"2026-07-05T09:49:30.458456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11312","created_at":"2026-07-05T09:49:30.458456+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWWDS5VEWNUT","created_at":"2026-07-05T09:49:30.458456+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWWDS5VEWNUTJQ5K","created_at":"2026-07-05T09:49:30.458456+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWWDS5VE","created_at":"2026-07-05T09:49:30.458456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26345","citing_title":"Feasibility-Aware Security-Constrained Unit Commitment via Hybrid Soft Actor-Critic with Quantum-Sampled Features","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2511.09884","citing_title":"Quantum Artificial Intelligence for Mission-Critical Systems: Foundations, Architectural Elements, and Future Directions","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17145","citing_title":"Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN","json":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN.json","graph_json":"https://pith.science/api/pith-number/FWWDS5VEWNUTJQ5KOHORTFINPN/graph.json","events_json":"https://pith.science/api/pith-number/FWWDS5VEWNUTJQ5KOHORTFINPN/events.json","paper":"https://pith.science/paper/FWWDS5VE"},"agent_actions":{"view_html":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN","download_json":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN.json","view_paper":"https://pith.science/paper/FWWDS5VE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11312&json=true","fetch_graph":"https://pith.science/api/pith-number/FWWDS5VEWNUTJQ5KOHORTFINPN/graph.json","fetch_events":"https://pith.science/api/pith-number/FWWDS5VEWNUTJQ5KOHORTFINPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN/action/storage_attestation","attest_author":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN/action/author_attestation","sign_citation":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN/action/citation_signature","submit_replication":"https://pith.science/pith/FWWDS5VEWNUTJQ5KOHORTFINPN/action/replication_record"}},"created_at":"2026-07-05T09:49:30.458456+00:00","updated_at":"2026-07-05T09:49:30.458456+00:00"}