{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CMI42ATKBTAA7TIUM4GK5F46HB","short_pith_number":"pith:CMI42ATK","schema_version":"1.0","canonical_sha256":"1311cd026a0cc00fcd14670cae979e384cdccb931de174f96aa5fb7858b7c89c","source":{"kind":"arxiv","id":"1908.02210","version":2},"attestation_state":"computed","paper":{"title":"Knapsack Problem variants of QAOA for battery revenue optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Jean-Francois Hullo, Pierre Dupuy de la Grand'rive","submitted_at":"2019-08-06T15:23:34Z","abstract_excerpt":"We implement two Quantum Approximate Optimisation Algorithm (QAOA) variants for a battery revenue optimisation problem, equivalent to the weakly NP-hard Knapsack Problem. Both approaches investigate how to tackle constrained problems with QAOA. A first 'constrained' approach introduces a quadratic penalty to enforce the constraint to be respected strictly and reformulates the problem into an Ising Problem. However, simulations on IBM's simulator highlight non-convergent results for intermediate depth ($ p\\leq 50$). A second 'relaxed' approach applies the QAOA with a non-Ising target function 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":"1908.02210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-08-06T15:23:34Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a98a1678f4d02a338e98ded625c68d7d0584396ee65b04b3a99cd25f1f8b6418","abstract_canon_sha256":"160097a3809f51572e5f8a28d93686c9bf51d27fd41dee60c20d093b903890b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:49.367862Z","signature_b64":"OlkHavo+zBXB9cMrmCMN4lkqDmfdrYO7jUYYVpORYUB1T/eadXacKST+bKMVBn5eEmndRNRNrFwjU4mQgu2pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1311cd026a0cc00fcd14670cae979e384cdccb931de174f96aa5fb7858b7c89c","last_reissued_at":"2026-07-04T23:56:49.367402Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:49.367402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knapsack Problem variants of QAOA for battery revenue optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Jean-Francois Hullo, Pierre Dupuy de la Grand'rive","submitted_at":"2019-08-06T15:23:34Z","abstract_excerpt":"We implement two Quantum Approximate Optimisation Algorithm (QAOA) variants for a battery revenue optimisation problem, equivalent to the weakly NP-hard Knapsack Problem. Both approaches investigate how to tackle constrained problems with QAOA. A first 'constrained' approach introduces a quadratic penalty to enforce the constraint to be respected strictly and reformulates the problem into an Ising Problem. However, simulations on IBM's simulator highlight non-convergent results for intermediate depth ($ p\\leq 50$). A second 'relaxed' approach applies the QAOA with a non-Ising target function t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02210","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/1908.02210/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":"1908.02210","created_at":"2026-07-04T23:56:49.367461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02210v2","created_at":"2026-07-04T23:56:49.367461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02210","created_at":"2026-07-04T23:56:49.367461+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMI42ATKBTAA","created_at":"2026-07-04T23:56:49.367461+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMI42ATKBTAA7TIU","created_at":"2026-07-04T23:56:49.367461+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMI42ATK","created_at":"2026-07-04T23:56:49.367461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10062","citing_title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB","json":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB.json","graph_json":"https://pith.science/api/pith-number/CMI42ATKBTAA7TIUM4GK5F46HB/graph.json","events_json":"https://pith.science/api/pith-number/CMI42ATKBTAA7TIUM4GK5F46HB/events.json","paper":"https://pith.science/paper/CMI42ATK"},"agent_actions":{"view_html":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB","download_json":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB.json","view_paper":"https://pith.science/paper/CMI42ATK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02210&json=true","fetch_graph":"https://pith.science/api/pith-number/CMI42ATKBTAA7TIUM4GK5F46HB/graph.json","fetch_events":"https://pith.science/api/pith-number/CMI42ATKBTAA7TIUM4GK5F46HB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB/action/storage_attestation","attest_author":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB/action/author_attestation","sign_citation":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB/action/citation_signature","submit_replication":"https://pith.science/pith/CMI42ATKBTAA7TIUM4GK5F46HB/action/replication_record"}},"created_at":"2026-07-04T23:56:49.367461+00:00","updated_at":"2026-07-04T23:56:49.367461+00:00"}