{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JPPWAVX7QRCQIHVF32TUOJGEVF","short_pith_number":"pith:JPPWAVX7","canonical_record":{"source":{"id":"2404.19474","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-30T11:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"860ef8fe630f70058635eca30e00e7ff1152df106a6df2e6cd73c58df0a37b28","abstract_canon_sha256":"a0067e0651e9b0f686d153d94a99a1dcbb4e3160d69c4add56c32a27f772ea13"},"schema_version":"1.0"},"canonical_sha256":"4bdf6056ff8445041ea5dea74724c4a9485763c4aebdb5f1aaa5f60b5bde4154","source":{"kind":"arxiv","id":"2404.19474","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.19474","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"arxiv_version","alias_value":"2404.19474v2","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19474","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_12","alias_value":"JPPWAVX7QRCQ","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_16","alias_value":"JPPWAVX7QRCQIHVF","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_8","alias_value":"JPPWAVX7","created_at":"2026-07-05T09:59:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JPPWAVX7QRCQIHVF32TUOJGEVF","target":"record","payload":{"canonical_record":{"source":{"id":"2404.19474","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-30T11:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"860ef8fe630f70058635eca30e00e7ff1152df106a6df2e6cd73c58df0a37b28","abstract_canon_sha256":"a0067e0651e9b0f686d153d94a99a1dcbb4e3160d69c4add56c32a27f772ea13"},"schema_version":"1.0"},"canonical_sha256":"4bdf6056ff8445041ea5dea74724c4a9485763c4aebdb5f1aaa5f60b5bde4154","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:46.123059Z","signature_b64":"SQTXNQE2dMQ/EJx6eBhGRDFg5MUp0DcpaectkCdvJgn1hpS5p1MhuFg5osvZn/MM2sXGYE8icyWPeClREperCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bdf6056ff8445041ea5dea74724c4a9485763c4aebdb5f1aaa5f60b5bde4154","last_reissued_at":"2026-07-05T09:59:46.122592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:46.122592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.19474","source_version":2,"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-05T09:59:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1wTM2dD6PBdUt/HuKUrFcx3jhWsYXIfqIzotw22+2wz8wYs6MYyy2wGCQoKD7MCzDaQyOGn0NsXmxoHQpB0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:47:25.222404Z"},"content_sha256":"84e2c44272d5302178f8baa81d65f5f3bdcfa1f37b4f5489c584b0dd1824e262","schema_version":"1.0","event_id":"sha256:84e2c44272d5302178f8baa81d65f5f3bdcfa1f37b4f5489c584b0dd1824e262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JPPWAVX7QRCQIHVF32TUOJGEVF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Relaxation for Solving Multiple Knapsack Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hoong Chuin LAU, Monit Sharma, Rudy Raymond, Yan Jin","submitted_at":"2024-04-30T11:40:07Z","abstract_excerpt":"Combinatorial problems are a common challenge in business, requiring finding optimal solutions under specified constraints. While significant progress has been made with variational approaches such as QAOA, most problems addressed are unconstrained (such as Max-Cut). In this study, we investigate a hybrid quantum-classical method for constrained optimization problems, particularly those with knapsack constraints that occur frequently in financial and supply chain applications. Our proposed method relies firstly on relaxations to local quantum Hamiltonians, defined through commutative maps. Dra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19474","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/2404.19474/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-05T09:59:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIUzz4YhjP72CUsqHCKVeAIO9rs1HZhD3SUm1RstRQKqL5RJX8FdgfZlGmlvjRoPoWlA/jlA2pJp6n2j4sZgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:47:25.222906Z"},"content_sha256":"f348e931d519c46c8114cf4925a881d99454052f9a088786084ca16a1857f5a5","schema_version":"1.0","event_id":"sha256:f348e931d519c46c8114cf4925a881d99454052f9a088786084ca16a1857f5a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/bundle.json","state_url":"https://pith.science/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/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-08-06T02:47:25Z","links":{"resolver":"https://pith.science/pith/JPPWAVX7QRCQIHVF32TUOJGEVF","bundle":"https://pith.science/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/bundle.json","state":"https://pith.science/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPPWAVX7QRCQIHVF32TUOJGEVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JPPWAVX7QRCQIHVF32TUOJGEVF","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":"a0067e0651e9b0f686d153d94a99a1dcbb4e3160d69c4add56c32a27f772ea13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-30T11:40:07Z","title_canon_sha256":"860ef8fe630f70058635eca30e00e7ff1152df106a6df2e6cd73c58df0a37b28"},"schema_version":"1.0","source":{"id":"2404.19474","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.19474","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"arxiv_version","alias_value":"2404.19474v2","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19474","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_12","alias_value":"JPPWAVX7QRCQ","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_16","alias_value":"JPPWAVX7QRCQIHVF","created_at":"2026-07-05T09:59:46Z"},{"alias_kind":"pith_short_8","alias_value":"JPPWAVX7","created_at":"2026-07-05T09:59:46Z"}],"graph_snapshots":[{"event_id":"sha256:f348e931d519c46c8114cf4925a881d99454052f9a088786084ca16a1857f5a5","target":"graph","created_at":"2026-07-05T09:59:46Z","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/2404.19474/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial problems are a common challenge in business, requiring finding optimal solutions under specified constraints. While significant progress has been made with variational approaches such as QAOA, most problems addressed are unconstrained (such as Max-Cut). In this study, we investigate a hybrid quantum-classical method for constrained optimization problems, particularly those with knapsack constraints that occur frequently in financial and supply chain applications. Our proposed method relies firstly on relaxations to local quantum Hamiltonians, defined through commutative maps. Dra","authors_text":"Hoong Chuin LAU, Monit Sharma, Rudy Raymond, Yan Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-30T11:40:07Z","title":"Quantum Relaxation for Solving Multiple Knapsack Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19474","kind":"arxiv","version":2},"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:84e2c44272d5302178f8baa81d65f5f3bdcfa1f37b4f5489c584b0dd1824e262","target":"record","created_at":"2026-07-05T09:59:46Z","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":"a0067e0651e9b0f686d153d94a99a1dcbb4e3160d69c4add56c32a27f772ea13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-30T11:40:07Z","title_canon_sha256":"860ef8fe630f70058635eca30e00e7ff1152df106a6df2e6cd73c58df0a37b28"},"schema_version":"1.0","source":{"id":"2404.19474","kind":"arxiv","version":2}},"canonical_sha256":"4bdf6056ff8445041ea5dea74724c4a9485763c4aebdb5f1aaa5f60b5bde4154","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bdf6056ff8445041ea5dea74724c4a9485763c4aebdb5f1aaa5f60b5bde4154","first_computed_at":"2026-07-05T09:59:46.122592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:59:46.122592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SQTXNQE2dMQ/EJx6eBhGRDFg5MUp0DcpaectkCdvJgn1hpS5p1MhuFg5osvZn/MM2sXGYE8icyWPeClREperCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:59:46.123059Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.19474","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84e2c44272d5302178f8baa81d65f5f3bdcfa1f37b4f5489c584b0dd1824e262","sha256:f348e931d519c46c8114cf4925a881d99454052f9a088786084ca16a1857f5a5"],"state_sha256":"2b3ceeba7bcfa6d6325d7dd4be0a1c1f8ed8fbaa6edeceda72ae46fe7bfe4e0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38pXRDBWeB4fxriVKclkCiNIc/nIv7fZGTcy9ROABeia8p8f3zUJ/3fua4kVkyffkDjWHQ2lOlLNF+f9ajf1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:47:25.227969Z","bundle_sha256":"ac4461ec9d3eb8446d7d24dc78df74ebeb728b85d0489faa02ba690870614edf"}}