{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VU75T7NSCMTOYIWSSSDGTJGQXJ","short_pith_number":"pith:VU75T7NS","schema_version":"1.0","canonical_sha256":"ad3fd9fdb21326ec22d2948669a4d0ba4f617bfbf9b14e52cb19529324903d98","source":{"kind":"arxiv","id":"2502.15917","version":3},"attestation_state":"computed","paper":{"title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Fei Teng, Wangkun Xu, Wei Hong","submitted_at":"2025-02-21T20:15:40Z","abstract_excerpt":"Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary Optimization (QUBO) problems, presents a potential solution. However, existing quantum algorithms rely on slack variables to handle linear binary inequality constraints, "},"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":"2502.15917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-21T20:15:40Z","cross_cats_sorted":["cs.ET","cs.SY","eess.SY"],"title_canon_sha256":"0cdb571b4a9b7d5f5982fa3f7e333c8737f0b93e20cdd94dbe4992f64f211ede","abstract_canon_sha256":"30ca07e3b0b0526822c284207ba9b1a7debeefdd41e4cc41100219940fd9c4ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:05.576687Z","signature_b64":"t1tHpRm/Rp5lT72pm00/1qZTf2NvkqmJt6gb3vVRlAz8x+RxdxxPiEu8JPVUBjTsDLUvsDJ7jHvr6cRXIbOWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3fd9fdb21326ec22d2948669a4d0ba4f617bfbf9b14e52cb19529324903d98","last_reissued_at":"2026-06-09T01:05:05.576209Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:05.576209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Fei Teng, Wangkun Xu, Wei Hong","submitted_at":"2025-02-21T20:15:40Z","abstract_excerpt":"Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary Optimization (QUBO) problems, presents a potential solution. However, existing quantum algorithms rely on slack variables to handle linear binary inequality constraints, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15917","kind":"arxiv","version":3},"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/2502.15917/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":"2502.15917","created_at":"2026-06-09T01:05:05.576267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15917v3","created_at":"2026-06-09T01:05:05.576267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15917","created_at":"2026-06-09T01:05:05.576267+00:00"},{"alias_kind":"pith_short_12","alias_value":"VU75T7NSCMTO","created_at":"2026-06-09T01:05:05.576267+00:00"},{"alias_kind":"pith_short_16","alias_value":"VU75T7NSCMTOYIWS","created_at":"2026-06-09T01:05:05.576267+00:00"},{"alias_kind":"pith_short_8","alias_value":"VU75T7NS","created_at":"2026-06-09T01:05:05.576267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.18285","citing_title":"EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ","json":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ.json","graph_json":"https://pith.science/api/pith-number/VU75T7NSCMTOYIWSSSDGTJGQXJ/graph.json","events_json":"https://pith.science/api/pith-number/VU75T7NSCMTOYIWSSSDGTJGQXJ/events.json","paper":"https://pith.science/paper/VU75T7NS"},"agent_actions":{"view_html":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ","download_json":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ.json","view_paper":"https://pith.science/paper/VU75T7NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15917&json=true","fetch_graph":"https://pith.science/api/pith-number/VU75T7NSCMTOYIWSSSDGTJGQXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VU75T7NSCMTOYIWSSSDGTJGQXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ/action/storage_attestation","attest_author":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ/action/author_attestation","sign_citation":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ/action/citation_signature","submit_replication":"https://pith.science/pith/VU75T7NSCMTOYIWSSSDGTJGQXJ/action/replication_record"}},"created_at":"2026-06-09T01:05:05.576267+00:00","updated_at":"2026-06-09T01:05:05.576267+00:00"}