{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RETSZDRKHMODFH4FKYXV64EJKH","short_pith_number":"pith:RETSZDRK","canonical_record":{"source":{"id":"2307.16756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T15:27:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ffe34777b8d53de378d1ccfcc2bcabb2ee826e4d355ae07d65510e82110a9ebb","abstract_canon_sha256":"b88f7887814bfb7d3cf7ef13bbbb2caa8ee070a8e92fc4e56b4a3757793818a6"},"schema_version":"1.0"},"canonical_sha256":"89272c8e2a3b1c329f85562f5f708951f316e0537c7c3f0cb990ccdc99938d33","source":{"kind":"arxiv","id":"2307.16756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.16756","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2307.16756v1","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16756","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"RETSZDRKHMOD","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"RETSZDRKHMODFH4F","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"RETSZDRK","created_at":"2026-07-05T06:36:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RETSZDRKHMODFH4FKYXV64EJKH","target":"record","payload":{"canonical_record":{"source":{"id":"2307.16756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T15:27:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ffe34777b8d53de378d1ccfcc2bcabb2ee826e4d355ae07d65510e82110a9ebb","abstract_canon_sha256":"b88f7887814bfb7d3cf7ef13bbbb2caa8ee070a8e92fc4e56b4a3757793818a6"},"schema_version":"1.0"},"canonical_sha256":"89272c8e2a3b1c329f85562f5f708951f316e0537c7c3f0cb990ccdc99938d33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:07.779030Z","signature_b64":"yJz5z6NyaV8fNB3nzrbr7IQuY/jMtS8QBE08L4ab59zw63XRGU8TV7LQOGneunkmZo4WL+oAELfPE0vyj/iCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89272c8e2a3b1c329f85562f5f708951f316e0537c7c3f0cb990ccdc99938d33","last_reissued_at":"2026-07-05T06:36:07.778569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:07.778569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.16756","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-05T06:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZTMvFrDer24L7pEBu1EdNRhl3BNHgNpNNi9hYJFFIYgyRgEAJSVPiHZE6HZsx+EKxy5J1LCulvt6KmyQkZxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:50:14.864726Z"},"content_sha256":"ba2a38f35a9a8d6a072ea5d13b1ae91347ac552184fc6770cb5e21d27099c688","schema_version":"1.0","event_id":"sha256:ba2a38f35a9a8d6a072ea5d13b1ae91347ac552184fc6770cb5e21d27099c688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RETSZDRKHMODFH4FKYXV64EJKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Variational Circuits for Higher-Order Binary Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Andrea Simonetto, Sourour Elloumi, Zo\\'e Verch\\`ere","submitted_at":"2023-07-31T15:27:06Z","abstract_excerpt":"Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves transforming the optimization problem into a quadratic unconstrained binary optimization (QUBO) problem. While this transformation offers flexibility and a ready-to-implement circuit involving only two-qubit gates, it has been shown to be less than optimal in the number of employed qubits and circuit depth, especially for polynomial optimization. On the other hand, strategies based on higher-order binary optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16756","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/2307.16756/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-05T06:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkMvWzsJ1lM0yxd3BxsPTfLUNPR+iVhQ4u8Xk464AwLs0wLRN0oDjwntOjzlWgg/gIeuzoiQM9AO/M2bDa+rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:50:14.865228Z"},"content_sha256":"db0a86f0d2842ee3795bb4ec5990ae945a76baa79a8e0ccfbf42bdd4eec323d4","schema_version":"1.0","event_id":"sha256:db0a86f0d2842ee3795bb4ec5990ae945a76baa79a8e0ccfbf42bdd4eec323d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RETSZDRKHMODFH4FKYXV64EJKH/bundle.json","state_url":"https://pith.science/pith/RETSZDRKHMODFH4FKYXV64EJKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RETSZDRKHMODFH4FKYXV64EJKH/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-08T15:50:14Z","links":{"resolver":"https://pith.science/pith/RETSZDRKHMODFH4FKYXV64EJKH","bundle":"https://pith.science/pith/RETSZDRKHMODFH4FKYXV64EJKH/bundle.json","state":"https://pith.science/pith/RETSZDRKHMODFH4FKYXV64EJKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RETSZDRKHMODFH4FKYXV64EJKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RETSZDRKHMODFH4FKYXV64EJKH","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":"b88f7887814bfb7d3cf7ef13bbbb2caa8ee070a8e92fc4e56b4a3757793818a6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T15:27:06Z","title_canon_sha256":"ffe34777b8d53de378d1ccfcc2bcabb2ee826e4d355ae07d65510e82110a9ebb"},"schema_version":"1.0","source":{"id":"2307.16756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.16756","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2307.16756v1","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16756","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"RETSZDRKHMOD","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"RETSZDRKHMODFH4F","created_at":"2026-07-05T06:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"RETSZDRK","created_at":"2026-07-05T06:36:07Z"}],"graph_snapshots":[{"event_id":"sha256:db0a86f0d2842ee3795bb4ec5990ae945a76baa79a8e0ccfbf42bdd4eec323d4","target":"graph","created_at":"2026-07-05T06:36:07Z","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/2307.16756/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves transforming the optimization problem into a quadratic unconstrained binary optimization (QUBO) problem. While this transformation offers flexibility and a ready-to-implement circuit involving only two-qubit gates, it has been shown to be less than optimal in the number of employed qubits and circuit depth, especially for polynomial optimization. On the other hand, strategies based on higher-order binary optimization ","authors_text":"Andrea Simonetto, Sourour Elloumi, Zo\\'e Verch\\`ere","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T15:27:06Z","title":"Optimizing Variational Circuits for Higher-Order Binary Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16756","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:ba2a38f35a9a8d6a072ea5d13b1ae91347ac552184fc6770cb5e21d27099c688","target":"record","created_at":"2026-07-05T06:36:07Z","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":"b88f7887814bfb7d3cf7ef13bbbb2caa8ee070a8e92fc4e56b4a3757793818a6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T15:27:06Z","title_canon_sha256":"ffe34777b8d53de378d1ccfcc2bcabb2ee826e4d355ae07d65510e82110a9ebb"},"schema_version":"1.0","source":{"id":"2307.16756","kind":"arxiv","version":1}},"canonical_sha256":"89272c8e2a3b1c329f85562f5f708951f316e0537c7c3f0cb990ccdc99938d33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89272c8e2a3b1c329f85562f5f708951f316e0537c7c3f0cb990ccdc99938d33","first_computed_at":"2026-07-05T06:36:07.778569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:36:07.778569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJz5z6NyaV8fNB3nzrbr7IQuY/jMtS8QBE08L4ab59zw63XRGU8TV7LQOGneunkmZo4WL+oAELfPE0vyj/iCCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:36:07.779030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.16756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba2a38f35a9a8d6a072ea5d13b1ae91347ac552184fc6770cb5e21d27099c688","sha256:db0a86f0d2842ee3795bb4ec5990ae945a76baa79a8e0ccfbf42bdd4eec323d4"],"state_sha256":"8f90cd561d78ca19a51f36bc578ebda26245cdb7bdebcf6e7b6daaf3d85b78ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlJ20fBW0GtOOLvwcs3LnDmmLh/ffGyR+T4XJMXD5HrTPfNeaGPSWsqnkKMpWMpf/V1PW5cGpiLQfl3OsKG7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:50:14.870012Z","bundle_sha256":"41885f3f280205f590387674e556f007e54d9d09cf7a1dd25db5feea5a3c2d7d"}}