{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:STKISVRLVLRNGAZAJMM7Z25G3J","short_pith_number":"pith:STKISVRL","schema_version":"1.0","canonical_sha256":"94d489562baae2d303204b19fceba6da6c3d36edf3fcfbdbb390212079ca9eb2","source":{"kind":"arxiv","id":"2601.01777","version":2},"attestation_state":"computed","paper":{"title":"A Survey on Applications of Quantum Computing for Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Ali Rajabi, Amin Kargarian, Milad Hasanzadeh","submitted_at":"2026-01-05T04:17:24Z","abstract_excerpt":"Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportu"},"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":"2601.01777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-01-05T04:17:24Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"67df4070408e7f85c1221e1e7eaf1857b3d820bc019f62797f80b3bb92bf4fa5","abstract_canon_sha256":"827bedfb601b7d1cc158e30be21361d380ad62a6c576717812b47d242095fc75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:52:07.667983Z","signature_b64":"rd5iLeIrrTR4cDEz2mO+dUHWpDbeziSY8TTsJq0aMbFD4WegqmhcY6yab/bZe14TE0EPme1gtFpJz443CaKFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94d489562baae2d303204b19fceba6da6c3d36edf3fcfbdbb390212079ca9eb2","last_reissued_at":"2026-08-04T01:52:07.666471Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:52:07.666471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Applications of Quantum Computing for Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Ali Rajabi, Amin Kargarian, Milad Hasanzadeh","submitted_at":"2026-01-05T04:17:24Z","abstract_excerpt":"Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.01777","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/2601.01777/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":"2601.01777","created_at":"2026-08-04T01:52:07.667669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.01777v2","created_at":"2026-08-04T01:52:07.667669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.01777","created_at":"2026-08-04T01:52:07.667669+00:00"},{"alias_kind":"pith_short_12","alias_value":"STKISVRLVLRN","created_at":"2026-08-04T01:52:07.667669+00:00"},{"alias_kind":"pith_short_16","alias_value":"STKISVRLVLRNGAZA","created_at":"2026-08-04T01:52:07.667669+00:00"},{"alias_kind":"pith_short_8","alias_value":"STKISVRL","created_at":"2026-08-04T01:52:07.667669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"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":27,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J","json":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J.json","graph_json":"https://pith.science/api/pith-number/STKISVRLVLRNGAZAJMM7Z25G3J/graph.json","events_json":"https://pith.science/api/pith-number/STKISVRLVLRNGAZAJMM7Z25G3J/events.json","paper":"https://pith.science/paper/STKISVRL"},"agent_actions":{"view_html":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J","download_json":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J.json","view_paper":"https://pith.science/paper/STKISVRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.01777&json=true","fetch_graph":"https://pith.science/api/pith-number/STKISVRLVLRNGAZAJMM7Z25G3J/graph.json","fetch_events":"https://pith.science/api/pith-number/STKISVRLVLRNGAZAJMM7Z25G3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J/action/storage_attestation","attest_author":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J/action/author_attestation","sign_citation":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J/action/citation_signature","submit_replication":"https://pith.science/pith/STKISVRLVLRNGAZAJMM7Z25G3J/action/replication_record"}},"created_at":"2026-08-04T01:52:07.667669+00:00","updated_at":"2026-08-04T01:52:07.667669+00:00"}