{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ES6CVYBEXMOTQH5BYB64VXSBPZ","short_pith_number":"pith:ES6CVYBE","canonical_record":{"source":{"id":"2405.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T01:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"47ff53dbf1bbdf03b5aecf51eefb04400ce916b845e4dc5ba04e0b0adec6b1e8","abstract_canon_sha256":"9c407b493e39b5af48dd8f21910606929957d65d5d500f6c30c31921bc083cb5"},"schema_version":"1.0"},"canonical_sha256":"24bc2ae024bb1d381fa1c07dcade417e6d92af83faa4474316eff8d79ae42c45","source":{"kind":"arxiv","id":"2405.00935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00935","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00935v1","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00935","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"ES6CVYBEXMOT","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"ES6CVYBEXMOTQH5B","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"ES6CVYBE","created_at":"2026-07-05T08:14:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ES6CVYBEXMOTQH5BYB64VXSBPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2405.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T01:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"47ff53dbf1bbdf03b5aecf51eefb04400ce916b845e4dc5ba04e0b0adec6b1e8","abstract_canon_sha256":"9c407b493e39b5af48dd8f21910606929957d65d5d500f6c30c31921bc083cb5"},"schema_version":"1.0"},"canonical_sha256":"24bc2ae024bb1d381fa1c07dcade417e6d92af83faa4474316eff8d79ae42c45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:28.208098Z","signature_b64":"9sSTY7JJr+0au6vNALAta3a+mNpO+aNffJc7EFnXfHUf47WZFecZ/Edt+Kg7iC4AQrdlLFbZU8ein8XUzGH1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24bc2ae024bb1d381fa1c07dcade417e6d92af83faa4474316eff8d79ae42c45","last_reissued_at":"2026-07-05T08:14:28.207649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:28.207649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.00935","source_version":1,"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-05T08:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jk5hAj4Pys77JTf4MYY3cUjI0IYlcQ6OyoR5XAyhfYVE1Tr7K8pwJ72COl/9KmlnK8Cj/Lk7oEoF/620NgoCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:10:31.723927Z"},"content_sha256":"cb40d1b2143001393d9b4b410d6f39c3887053ffad108c02db5df19e430ebada","schema_version":"1.0","event_id":"sha256:cb40d1b2143001393d9b4b410d6f39c3887053ffad108c02db5df19e430ebada"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ES6CVYBEXMOTQH5BYB64VXSBPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Internal Strategies in Quantum Relaxation based Branch-and-Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hiromichi Matsuyama, Kohji Nishimura, Wei-Hao Huang, Yu Yamashiro","submitted_at":"2024-05-02T01:28:52Z","abstract_excerpt":"A combinatorial optimization problem is to find an optimal solution under the constraints. This is one of the potential applications for quantum computers. Quantum Random Access Optimization (QRAO) is the quantum optimization algorithm that encodes multiple classical variables into a single qubit to construct a quantum Hamiltonian, thereby reducing the number of qubits required. The ground energy of the QRAO Hamiltonian provides a lower bound on the original problem's optimal value before encoding. This property allows the QRAO Hamiltonian to be used as a relaxation of the original problem, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00935","kind":"arxiv","version":1},"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/2405.00935/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-05T08:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lR8PWm27ge4ENKZl+BP+6RR26K6XoVybCVStPLJSCc6oZLwo00uCGjhTy83la2Cfaaw+Z07B4n545IVHTbBbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:10:31.724417Z"},"content_sha256":"b605044e3145da2ed6408327d05399cd9505b200aaa01731ada850e8cf2842b2","schema_version":"1.0","event_id":"sha256:b605044e3145da2ed6408327d05399cd9505b200aaa01731ada850e8cf2842b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/bundle.json","state_url":"https://pith.science/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/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-08T23:10:31Z","links":{"resolver":"https://pith.science/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ","bundle":"https://pith.science/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/bundle.json","state":"https://pith.science/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ES6CVYBEXMOTQH5BYB64VXSBPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ES6CVYBEXMOTQH5BYB64VXSBPZ","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":"9c407b493e39b5af48dd8f21910606929957d65d5d500f6c30c31921bc083cb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T01:28:52Z","title_canon_sha256":"47ff53dbf1bbdf03b5aecf51eefb04400ce916b845e4dc5ba04e0b0adec6b1e8"},"schema_version":"1.0","source":{"id":"2405.00935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00935","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00935v1","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00935","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"ES6CVYBEXMOT","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"ES6CVYBEXMOTQH5B","created_at":"2026-07-05T08:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"ES6CVYBE","created_at":"2026-07-05T08:14:28Z"}],"graph_snapshots":[{"event_id":"sha256:b605044e3145da2ed6408327d05399cd9505b200aaa01731ada850e8cf2842b2","target":"graph","created_at":"2026-07-05T08:14:28Z","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/2405.00935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A combinatorial optimization problem is to find an optimal solution under the constraints. This is one of the potential applications for quantum computers. Quantum Random Access Optimization (QRAO) is the quantum optimization algorithm that encodes multiple classical variables into a single qubit to construct a quantum Hamiltonian, thereby reducing the number of qubits required. The ground energy of the QRAO Hamiltonian provides a lower bound on the original problem's optimal value before encoding. This property allows the QRAO Hamiltonian to be used as a relaxation of the original problem, an","authors_text":"Hiromichi Matsuyama, Kohji Nishimura, Wei-Hao Huang, Yu Yamashiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T01:28:52Z","title":"Efficient Internal Strategies in Quantum Relaxation based Branch-and-Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00935","kind":"arxiv","version":1},"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:cb40d1b2143001393d9b4b410d6f39c3887053ffad108c02db5df19e430ebada","target":"record","created_at":"2026-07-05T08:14:28Z","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":"9c407b493e39b5af48dd8f21910606929957d65d5d500f6c30c31921bc083cb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T01:28:52Z","title_canon_sha256":"47ff53dbf1bbdf03b5aecf51eefb04400ce916b845e4dc5ba04e0b0adec6b1e8"},"schema_version":"1.0","source":{"id":"2405.00935","kind":"arxiv","version":1}},"canonical_sha256":"24bc2ae024bb1d381fa1c07dcade417e6d92af83faa4474316eff8d79ae42c45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24bc2ae024bb1d381fa1c07dcade417e6d92af83faa4474316eff8d79ae42c45","first_computed_at":"2026-07-05T08:14:28.207649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:14:28.207649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9sSTY7JJr+0au6vNALAta3a+mNpO+aNffJc7EFnXfHUf47WZFecZ/Edt+Kg7iC4AQrdlLFbZU8ein8XUzGH1Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:14:28.208098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.00935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb40d1b2143001393d9b4b410d6f39c3887053ffad108c02db5df19e430ebada","sha256:b605044e3145da2ed6408327d05399cd9505b200aaa01731ada850e8cf2842b2"],"state_sha256":"1132663540f517f62caa8c54797c474aef8f51772ddccc691a0d4e6d47f77bbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYIV1tMN+c7NKaw5Oi2keLyi54T73cP4hyj9UKJhGE07D1c1MPvBNDkOSBPaoLXjOAviLK7BXh/Kw98hMWshDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:10:31.728075Z","bundle_sha256":"76082d46377eb49e599c977a054af51958ed8e412e45cc4bc60c565adce8ce31"}}