{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VDSU46OW74XTKFO5BJ3IJEHERD","short_pith_number":"pith:VDSU46OW","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"},"canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","source":{"kind":"arxiv","id":"2507.12159","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12159","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12159v3","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12159","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"VDSU46OW74XT","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"VDSU46OW74XTKFO5","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"VDSU46OW","created_at":"2026-07-05T11:51:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VDSU46OW74XTKFO5BJ3IJEHERD","target":"record","payload":{"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"},"canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","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"},"source_kind":"arxiv","source_id":"2507.12159","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vMruC5IXDARQrb1h36rAmhiSMFFE/6ldtwRN8kaqAsoaDhpchG8g9he/bW776THRuLgtrfjYCyEIbNepUhPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T23:22:29.997720Z"},"content_sha256":"d898f7113d56c14571b5ece8216fe80d23359e4f2a2b962b50e9898024a81461","schema_version":"1.0","event_id":"sha256:d898f7113d56c14571b5ece8216fe80d23359e4f2a2b962b50e9898024a81461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VDSU46OW74XTKFO5BJ3IJEHERD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/U2xdYkLe5yY61HjLd8MLrcC6d5l4gwxfTA7xarFiilwoXg1DLNOsOBl/0HCtllq5ySewLQbg6pwJ6YcqQOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T23:22:29.998097Z"},"content_sha256":"da7799591dc53b8eb70c0ffe1d622d9512ebc3c2a0fad1ec3cf69731b4820ccc","schema_version":"1.0","event_id":"sha256:da7799591dc53b8eb70c0ffe1d622d9512ebc3c2a0fad1ec3cf69731b4820ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/bundle.json","state_url":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDSU46OW74XTKFO5BJ3IJEHERD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-26T23:22:29Z","links":{"resolver":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD","bundle":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/bundle.json","state":"https://pith.science/pith/VDSU46OW74XTKFO5BJ3IJEHERD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDSU46OW74XTKFO5BJ3IJEHERD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VDSU46OW74XTKFO5BJ3IJEHERD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"10f69712166e9c3ed5bb86733345c068d22a86714c4d64e2f2215a0fb8c4964c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T11:39:47Z","title_canon_sha256":"ec81ef73649be7f9f07eab29a98e4ae760c1e86ede05f5951e4b940192d73dae"},"schema_version":"1.0","source":{"id":"2507.12159","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12159","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12159v3","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12159","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"VDSU46OW74XT","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"VDSU46OW74XTKFO5","created_at":"2026-07-05T11:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"VDSU46OW","created_at":"2026-07-05T11:51:32Z"}],"graph_snapshots":[{"event_id":"sha256:da7799591dc53b8eb70c0ffe1d622d9512ebc3c2a0fad1ec3cf69731b4820ccc","target":"graph","created_at":"2026-07-05T11:51:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.12159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hoong Chuin LAU, Monit Sharma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T11:39:47Z","title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12159","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d898f7113d56c14571b5ece8216fe80d23359e4f2a2b962b50e9898024a81461","target":"record","created_at":"2026-07-05T11:51:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"10f69712166e9c3ed5bb86733345c068d22a86714c4d64e2f2215a0fb8c4964c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T11:39:47Z","title_canon_sha256":"ec81ef73649be7f9f07eab29a98e4ae760c1e86ede05f5951e4b940192d73dae"},"schema_version":"1.0","source":{"id":"2507.12159","kind":"arxiv","version":3}},"canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8e54e79d6ff2f3515dd0a768490e488f5e79d83a5f2561516cf4fabb9c42361","first_computed_at":"2026-07-05T11:51:32.132487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:32.132487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svshxL3vvdlkT8NPAIZDdw9ygYN+PUWZzPnuzYWUOOQugvOrsoHRa5Yw+4ZJMBAFqKjAOwUK5kGbUxYme3wfBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:32.132971Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.12159","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d898f7113d56c14571b5ece8216fe80d23359e4f2a2b962b50e9898024a81461","sha256:da7799591dc53b8eb70c0ffe1d622d9512ebc3c2a0fad1ec3cf69731b4820ccc"],"state_sha256":"5e85fd63842364898a2e4fba349afb4c1456e0d6896d44c0bcdd114fe2cf97bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8ruAdoC/D8lpsW9mYgDQk0jdCU/MMd10lwhNBV27CLTnZw37KVIOwCW0adPex/2GB4HbmRkIGT7EiDkh4MpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T23:22:30.000722Z","bundle_sha256":"d5d58974a88d507a0438a628bc007f67e378720838bb3fc026c48ef496cd212f"}}