{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VDSU46OW74XTKFO5BJ3IJEHERD","short_pith_number":"pith:VDSU46OW","schema_version":"1.0","canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","source":{"kind":"arxiv","id":"2507.12159","version":3},"attestation_state":"computed","paper":{"title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hoong Chuin LAU, Monit Sharma","submitted_at":"2025-07-16T11:39:47Z","abstract_excerpt":"Constraint handling remains a key bottleneck in quantum combinatorial optimization. While slack-variable-based encodings are straightforward, they significantly increase qubit counts and circuit depth, challenging the scalability of quantum solvers. In this work, we investigate a suite of Lagrangian-based optimization techniques including dual ascent, bundle methods, cutting plane approaches, and augmented Lagrangian formulations for solving constrained combinatorial problems on quantum simulators and hardware. Our framework is applied to three representative NP-hard problems: the Travelling S"},"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":"2507.12159","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T11:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"ec81ef73649be7f9f07eab29a98e4ae760c1e86ede05f5951e4b940192d73dae","abstract_canon_sha256":"10f69712166e9c3ed5bb86733345c068d22a86714c4d64e2f2215a0fb8c4964c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:32.132971Z","signature_b64":"svshxL3vvdlkT8NPAIZDdw9ygYN+PUWZzPnuzYWUOOQugvOrsoHRa5Yw+4ZJMBAFqKjAOwUK5kGbUxYme3wfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","last_reissued_at":"2026-07-05T11:51:32.132487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:32.132487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hoong Chuin LAU, Monit Sharma","submitted_at":"2025-07-16T11:39:47Z","abstract_excerpt":"Constraint handling remains a key bottleneck in quantum combinatorial optimization. While slack-variable-based encodings are straightforward, they significantly increase qubit counts and circuit depth, challenging the scalability of quantum solvers. In this work, we investigate a suite of Lagrangian-based optimization techniques including dual ascent, bundle methods, cutting plane approaches, and augmented Lagrangian formulations for solving constrained combinatorial problems on quantum simulators and hardware. Our framework is applied to three representative NP-hard problems: the Travelling S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12159","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/2507.12159/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":"2507.12159","created_at":"2026-07-05T11:51:32.132545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12159v3","created_at":"2026-07-05T11:51:32.132545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12159","created_at":"2026-07-05T11:51:32.132545+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDSU46OW74XT","created_at":"2026-07-05T11:51:32.132545+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDSU46OW74XTKFO5","created_at":"2026-07-05T11:51:32.132545+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDSU46OW","created_at":"2026-07-05T11:51:32.132545+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18985","citing_title":"Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22194","citing_title":"Qubit-Scalable CVRP via Lagrangian Knapsack Decomposition and Noise-Aware Quantum Execution","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD","json":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD.json","graph_json":"https://pith.science/api/pith-number/VDSU46OW74XTKFO5BJ3IJEHERD/graph.json","events_json":"https://pith.science/api/pith-number/VDSU46OW74XTKFO5BJ3IJEHERD/events.json","paper":"https://pith.science/paper/VDSU46OW"},"agent_actions":{"view_html":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD","download_json":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD.json","view_paper":"https://pith.science/paper/VDSU46OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12159&json=true","fetch_graph":"https://pith.science/api/pith-number/VDSU46OW74XTKFO5BJ3IJEHERD/graph.json","fetch_events":"https://pith.science/api/pith-number/VDSU46OW74XTKFO5BJ3IJEHERD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/action/storage_attestation","attest_author":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/action/author_attestation","sign_citation":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/action/citation_signature","submit_replication":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/action/replication_record"}},"created_at":"2026-07-05T11:51:32.132545+00:00","updated_at":"2026-07-05T11:51:32.132545+00:00"}