{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JDNJCZ67G3QQKD3AJYIZIZRQ3H","short_pith_number":"pith:JDNJCZ67","canonical_record":{"source":{"id":"2403.02045","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-04T13:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"b73194942667994d70af4baeb3786d093933d77c9800cc400eb0e98a190d143b","abstract_canon_sha256":"f190ae466b4d50b289ee9331ebfbadb66bb7d9d282de0500231e75c85fe24ee4"},"schema_version":"1.0"},"canonical_sha256":"48da9167df36e1050f604e11946630d9ebda3aa16ca51a472a09b1d711659e58","source":{"kind":"arxiv","id":"2403.02045","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02045","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02045v3","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02045","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"JDNJCZ67G3QQ","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_16","alias_value":"JDNJCZ67G3QQKD3A","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_8","alias_value":"JDNJCZ67","created_at":"2026-07-05T10:00:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JDNJCZ67G3QQKD3AJYIZIZRQ3H","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02045","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-04T13:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"b73194942667994d70af4baeb3786d093933d77c9800cc400eb0e98a190d143b","abstract_canon_sha256":"f190ae466b4d50b289ee9331ebfbadb66bb7d9d282de0500231e75c85fe24ee4"},"schema_version":"1.0"},"canonical_sha256":"48da9167df36e1050f604e11946630d9ebda3aa16ca51a472a09b1d711659e58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:35.076844Z","signature_b64":"0XoUKU7IOZ+AHGq4fzxl34g3vhie/96BCqReMLEYyJLEvvgAcIOv5S2fwLWqqGTpi/mufHr2dswsnR7D5Zn+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48da9167df36e1050f604e11946630d9ebda3aa16ca51a472a09b1d711659e58","last_reissued_at":"2026-07-05T10:00:35.076498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:35.076498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02045","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-05T10:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2cdRrOsuejms0EQzl7owMEl2vkoQ3McFUtUim1rjz1AWA1mQbZ98fvdH1Fp6zqYz/sCQiCmqpiiPJRkftWMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:24:29.403968Z"},"content_sha256":"67eb4b1ab455c8d448b728a18f58c0783a4ac8125606aa15cdfa9c832a293b1f","schema_version":"1.0","event_id":"sha256:67eb4b1ab455c8d448b728a18f58c0783a4ac8125606aa15cdfa9c832a293b1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JDNJCZ67G3QQKD3AJYIZIZRQ3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Quantum Relaxation for Combinatorial Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Naoki Yamamoto, Rudy Raymond, Ruho Kondo, Yuki Sato","submitted_at":"2024-03-04T13:48:21Z","abstract_excerpt":"Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems. This paper shows that some existing quantum optimization methods can be unified into a solver to find the binary solution which is most likely measured from the optimal quantum state. Combining this finding with the concept of quantum random access codes (QRACs) for encoding bits into quantum states on fewer qubits, we propose an efficient recursive quantum relaxation meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02045","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/2403.02045/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-05T10:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MVT4WPkds1j8bBUqrvo7oDmy8JGyBD0QPdPREtPkMIZJ7C3nXB4w48RVFmTAydIqB/12qanWSAkyQDY8Kdj1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:24:29.404494Z"},"content_sha256":"d401c935c606d253a8cff79948da50ddcc5d5756d65cc879f4a891ad22c9dac5","schema_version":"1.0","event_id":"sha256:d401c935c606d253a8cff79948da50ddcc5d5756d65cc879f4a891ad22c9dac5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/bundle.json","state_url":"https://pith.science/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/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-14T09:24:29Z","links":{"resolver":"https://pith.science/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H","bundle":"https://pith.science/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/bundle.json","state":"https://pith.science/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDNJCZ67G3QQKD3AJYIZIZRQ3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JDNJCZ67G3QQKD3AJYIZIZRQ3H","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":"f190ae466b4d50b289ee9331ebfbadb66bb7d9d282de0500231e75c85fe24ee4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-04T13:48:21Z","title_canon_sha256":"b73194942667994d70af4baeb3786d093933d77c9800cc400eb0e98a190d143b"},"schema_version":"1.0","source":{"id":"2403.02045","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02045","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02045v3","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02045","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"JDNJCZ67G3QQ","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_16","alias_value":"JDNJCZ67G3QQKD3A","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_8","alias_value":"JDNJCZ67","created_at":"2026-07-05T10:00:35Z"}],"graph_snapshots":[{"event_id":"sha256:d401c935c606d253a8cff79948da50ddcc5d5756d65cc879f4a891ad22c9dac5","target":"graph","created_at":"2026-07-05T10:00:35Z","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/2403.02045/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems. This paper shows that some existing quantum optimization methods can be unified into a solver to find the binary solution which is most likely measured from the optimal quantum state. Combining this finding with the concept of quantum random access codes (QRACs) for encoding bits into quantum states on fewer qubits, we propose an efficient recursive quantum relaxation meth","authors_text":"Naoki Yamamoto, Rudy Raymond, Ruho Kondo, Yuki Sato","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-04T13:48:21Z","title":"Recursive Quantum Relaxation for Combinatorial Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02045","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:67eb4b1ab455c8d448b728a18f58c0783a4ac8125606aa15cdfa9c832a293b1f","target":"record","created_at":"2026-07-05T10:00:35Z","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":"f190ae466b4d50b289ee9331ebfbadb66bb7d9d282de0500231e75c85fe24ee4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-04T13:48:21Z","title_canon_sha256":"b73194942667994d70af4baeb3786d093933d77c9800cc400eb0e98a190d143b"},"schema_version":"1.0","source":{"id":"2403.02045","kind":"arxiv","version":3}},"canonical_sha256":"48da9167df36e1050f604e11946630d9ebda3aa16ca51a472a09b1d711659e58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48da9167df36e1050f604e11946630d9ebda3aa16ca51a472a09b1d711659e58","first_computed_at":"2026-07-05T10:00:35.076498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:35.076498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0XoUKU7IOZ+AHGq4fzxl34g3vhie/96BCqReMLEYyJLEvvgAcIOv5S2fwLWqqGTpi/mufHr2dswsnR7D5Zn+CA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:35.076844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02045","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67eb4b1ab455c8d448b728a18f58c0783a4ac8125606aa15cdfa9c832a293b1f","sha256:d401c935c606d253a8cff79948da50ddcc5d5756d65cc879f4a891ad22c9dac5"],"state_sha256":"b31b156908cfe0781582c84b54c49761dc06382a155826a9e84eab6edee06417"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfWQXFLXMw6GPQy0yjJA//JXWYU0PjRaSYNJidW5rhIRfpvJL1bprXEoQmQ8bHPM5PszmR/T+NsoZOEc3yKXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:24:29.408435Z","bundle_sha256":"bcba911e2450b954069b95724cd24da491644e2ca30212cf20418bacf45ef735"}}