{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:AS5LY33GHAALEE4YPCOVBL5HBK","short_pith_number":"pith:AS5LY33G","canonical_record":{"source":{"id":"2312.14151","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"e1390b3ad52ae9f6dd4e390b5b98a1d685f211ea231ab03dd64fc41c5805be7a","abstract_canon_sha256":"ab36f7eb87246961cb0adb171e118c5d8c9a96837dcae6c89a75a459fb339f82"},"schema_version":"1.0"},"canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","source":{"kind":"arxiv","id":"2312.14151","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14151","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14151v3","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14151","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"AS5LY33GHAAL","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_16","alias_value":"AS5LY33GHAALEE4Y","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_8","alias_value":"AS5LY33G","created_at":"2026-07-05T11:16:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:AS5LY33GHAALEE4YPCOVBL5HBK","target":"record","payload":{"canonical_record":{"source":{"id":"2312.14151","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"e1390b3ad52ae9f6dd4e390b5b98a1d685f211ea231ab03dd64fc41c5805be7a","abstract_canon_sha256":"ab36f7eb87246961cb0adb171e118c5d8c9a96837dcae6c89a75a459fb339f82"},"schema_version":"1.0"},"canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:27.136071Z","signature_b64":"/d/aP5MtzfzggzagmybzvS4kbY6haGRlKJrkkWxKydS3dV203faj/6rmQ+P4QYe4eHWCCwOSi+TwcAU+zbTRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","last_reissued_at":"2026-07-05T11:16:27.135526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:27.135526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.14151","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:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5azCaMWU5Bi6+Mm9cLunsD4kFYAI9QTXM1lxnpxKuWBjQJnA0GSGTA/Va3JVu0BLaMVXFzfmvcm6L01kNCMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:48:17.467761Z"},"content_sha256":"bbe5c8fcda0b35c00f24b0df83b8703e95dd3617d2633b400b40d4d096bf6fe9","schema_version":"1.0","event_id":"sha256:bbe5c8fcda0b35c00f24b0df83b8703e95dd3617d2633b400b40d4d096bf6fe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:AS5LY33GHAALEE4YPCOVBL5HBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variational Quantum Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hao Wang, Linus Ekstrom, Sebastian Schmitt","submitted_at":"2023-12-21T18:59:21Z","abstract_excerpt":"Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attraction in recent years. Currently, most works have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. The proposed quantum multi-objective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14151","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/2312.14151/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:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3newvZ44hlY5NgJNyQk9XrFUdHecRHfRG6v0ACcgWjpTAM3d8Ph6PLshKb++o7DrWXe5rhMtCNv0VQrX6lOGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:48:17.468711Z"},"content_sha256":"07836fc4b88cc42dc341ba60fd3d6b88dad802b22a65a9d678c6be0b71a92df8","schema_version":"1.0","event_id":"sha256:07836fc4b88cc42dc341ba60fd3d6b88dad802b22a65a9d678c6be0b71a92df8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/bundle.json","state_url":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS5LY33GHAALEE4YPCOVBL5HBK/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-16T10:48:17Z","links":{"resolver":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK","bundle":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/bundle.json","state":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS5LY33GHAALEE4YPCOVBL5HBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AS5LY33GHAALEE4YPCOVBL5HBK","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":"ab36f7eb87246961cb0adb171e118c5d8c9a96837dcae6c89a75a459fb339f82","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","title_canon_sha256":"e1390b3ad52ae9f6dd4e390b5b98a1d685f211ea231ab03dd64fc41c5805be7a"},"schema_version":"1.0","source":{"id":"2312.14151","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14151","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14151v3","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14151","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"AS5LY33GHAAL","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_16","alias_value":"AS5LY33GHAALEE4Y","created_at":"2026-07-05T11:16:27Z"},{"alias_kind":"pith_short_8","alias_value":"AS5LY33G","created_at":"2026-07-05T11:16:27Z"}],"graph_snapshots":[{"event_id":"sha256:07836fc4b88cc42dc341ba60fd3d6b88dad802b22a65a9d678c6be0b71a92df8","target":"graph","created_at":"2026-07-05T11:16:27Z","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/2312.14151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attraction in recent years. Currently, most works have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. The proposed quantum multi-objective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the qua","authors_text":"Hao Wang, Linus Ekstrom, Sebastian Schmitt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","title":"Variational Quantum Multi-Objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14151","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:bbe5c8fcda0b35c00f24b0df83b8703e95dd3617d2633b400b40d4d096bf6fe9","target":"record","created_at":"2026-07-05T11:16:27Z","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":"ab36f7eb87246961cb0adb171e118c5d8c9a96837dcae6c89a75a459fb339f82","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","title_canon_sha256":"e1390b3ad52ae9f6dd4e390b5b98a1d685f211ea231ab03dd64fc41c5805be7a"},"schema_version":"1.0","source":{"id":"2312.14151","kind":"arxiv","version":3}},"canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","first_computed_at":"2026-07-05T11:16:27.135526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:27.135526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/d/aP5MtzfzggzagmybzvS4kbY6haGRlKJrkkWxKydS3dV203faj/6rmQ+P4QYe4eHWCCwOSi+TwcAU+zbTRCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:27.136071Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14151","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe5c8fcda0b35c00f24b0df83b8703e95dd3617d2633b400b40d4d096bf6fe9","sha256:07836fc4b88cc42dc341ba60fd3d6b88dad802b22a65a9d678c6be0b71a92df8"],"state_sha256":"d1eee2b6417243db07a85b6c703949a8dd24a65f505869851338109958e8d14a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZY8wmdYjTM1crFrMkR5zJtEy3D5fPhKsPTKDJgx798O/kIKnUS1KLDy3GvG0HitenZy31+mHYOyMbj2EHtJyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:48:17.475773Z","bundle_sha256":"bbc9e9e0141d5672ea5f42291932ad9aaca0f2db893bb24c35afd4c54892450b"}}