{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4","short_pith_number":"pith:NDEFHQ7H","canonical_record":{"source":{"id":"2305.14197","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-23T16:17:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b352bc4349893c9bbc3579fdc57b05c2cdaea77efa7d4d95323fcb44c4d0a452","abstract_canon_sha256":"62611ab936bcd2b22ce3c2533ce392a2ec0234c17cdff1fa3c32f2726715e9ed"},"schema_version":"1.0"},"canonical_sha256":"68c853c3e70bc99d3e4a1f22cf921c870095c36ad8864f80a4d64033a46b60e5","source":{"kind":"arxiv","id":"2305.14197","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.14197","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"2305.14197v3","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14197","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"NDEFHQ7HBPEZ","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_16","alias_value":"NDEFHQ7HBPEZ2PSK","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_8","alias_value":"NDEFHQ7H","created_at":"2026-07-05T07:14:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4","target":"record","payload":{"canonical_record":{"source":{"id":"2305.14197","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-23T16:17:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b352bc4349893c9bbc3579fdc57b05c2cdaea77efa7d4d95323fcb44c4d0a452","abstract_canon_sha256":"62611ab936bcd2b22ce3c2533ce392a2ec0234c17cdff1fa3c32f2726715e9ed"},"schema_version":"1.0"},"canonical_sha256":"68c853c3e70bc99d3e4a1f22cf921c870095c36ad8864f80a4d64033a46b60e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:53.874667Z","signature_b64":"sfQgsnE9IG5UqhVmfSjBC9m2VIabOKVieHxK9Qmb2iqjDMVnbSG9e0/oW076YMCVAcU2hXRBvHsNrxviWpAVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c853c3e70bc99d3e4a1f22cf921c870095c36ad8864f80a4d64033a46b60e5","last_reissued_at":"2026-07-05T07:14:53.874044Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:53.874044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.14197","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-05T07:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OYz3IqKUhCOh4Ngc+3KRutSv6Xz17m62YtHbsF7xuM9yP7Z7a5zoaJuA2GN/OLVvVmpo9RZ1OHikS7VYMHBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:42:44.241465Z"},"content_sha256":"af90d8b8937acfd5e9379004a3cf8e5df96646b307bac4e20738e4bbc6623f08","schema_version":"1.0","event_id":"sha256:af90d8b8937acfd5e9379004a3cf8e5df96646b307bac4e20738e4bbc6623f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"A. I. Pakhomchik, Ar. A. Melnikov, A. Termanova, B. Nuriev, C. W. Mansell, I. Kreidich, M. Podobrii, M. R. Perelshtein, S. Iudin, V. M. Vinokur","submitted_at":"2023-05-23T16:17:57Z","abstract_excerpt":"Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum algorithms training, the shape of their cost landscape, the accuracy of their output, and their ability to scale to large-size problems. Here, we present an approximate gradient-based quantum algorithm for hardware-efficient circuits with amplitude encoding. We show how simple linear constraints can be directly incorporated into the circuit without additional modi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14197","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/2305.14197/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-05T07:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm/tZDd+peNSSU0HUve9MULggK6MNhcVzGq3zSYkWx9VE2puN0yOBFWl+c+TUyzxfsVKcb7bATJPHLHc/PlYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:42:44.242007Z"},"content_sha256":"2d8c85d329cfdcd1f9f6e5d72c5231b56be5da7759def20c9bc1c834780ca295","schema_version":"1.0","event_id":"sha256:2d8c85d329cfdcd1f9f6e5d72c5231b56be5da7759def20c9bc1c834780ca295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/bundle.json","state_url":"https://pith.science/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/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-15T12:42:44Z","links":{"resolver":"https://pith.science/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4","bundle":"https://pith.science/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/bundle.json","state":"https://pith.science/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NDEFHQ7HBPEZ2PSKD4RM7EQ4Q4","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":"62611ab936bcd2b22ce3c2533ce392a2ec0234c17cdff1fa3c32f2726715e9ed","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-23T16:17:57Z","title_canon_sha256":"b352bc4349893c9bbc3579fdc57b05c2cdaea77efa7d4d95323fcb44c4d0a452"},"schema_version":"1.0","source":{"id":"2305.14197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.14197","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"2305.14197v3","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14197","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"NDEFHQ7HBPEZ","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_16","alias_value":"NDEFHQ7HBPEZ2PSK","created_at":"2026-07-05T07:14:53Z"},{"alias_kind":"pith_short_8","alias_value":"NDEFHQ7H","created_at":"2026-07-05T07:14:53Z"}],"graph_snapshots":[{"event_id":"sha256:2d8c85d329cfdcd1f9f6e5d72c5231b56be5da7759def20c9bc1c834780ca295","target":"graph","created_at":"2026-07-05T07:14:53Z","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/2305.14197/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum algorithms training, the shape of their cost landscape, the accuracy of their output, and their ability to scale to large-size problems. Here, we present an approximate gradient-based quantum algorithm for hardware-efficient circuits with amplitude encoding. We show how simple linear constraints can be directly incorporated into the circuit without additional modi","authors_text":"A. I. Pakhomchik, Ar. A. Melnikov, A. Termanova, B. Nuriev, C. W. Mansell, I. Kreidich, M. Podobrii, M. R. Perelshtein, S. Iudin, V. M. Vinokur","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-23T16:17:57Z","title":"NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14197","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:af90d8b8937acfd5e9379004a3cf8e5df96646b307bac4e20738e4bbc6623f08","target":"record","created_at":"2026-07-05T07:14:53Z","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":"62611ab936bcd2b22ce3c2533ce392a2ec0234c17cdff1fa3c32f2726715e9ed","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-23T16:17:57Z","title_canon_sha256":"b352bc4349893c9bbc3579fdc57b05c2cdaea77efa7d4d95323fcb44c4d0a452"},"schema_version":"1.0","source":{"id":"2305.14197","kind":"arxiv","version":3}},"canonical_sha256":"68c853c3e70bc99d3e4a1f22cf921c870095c36ad8864f80a4d64033a46b60e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68c853c3e70bc99d3e4a1f22cf921c870095c36ad8864f80a4d64033a46b60e5","first_computed_at":"2026-07-05T07:14:53.874044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:14:53.874044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfQgsnE9IG5UqhVmfSjBC9m2VIabOKVieHxK9Qmb2iqjDMVnbSG9e0/oW076YMCVAcU2hXRBvHsNrxviWpAVDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:14:53.874667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.14197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af90d8b8937acfd5e9379004a3cf8e5df96646b307bac4e20738e4bbc6623f08","sha256:2d8c85d329cfdcd1f9f6e5d72c5231b56be5da7759def20c9bc1c834780ca295"],"state_sha256":"374c7de0e77dd48269d217b7b1fdd52a458a5d24ee10f51d0a281ffae930f1d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iXopoIymyow+hpp67GfpCyxdog/1W/Ghpceq2lE6p6VPxtfT3zdUpYGsaaRzkRyQCH//PRD20GJObpfzbpIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T12:42:44.247889Z","bundle_sha256":"17f37adbf75634e71e3eea2906f3089abdbafa05d71c8a8074b76927396fe1ba"}}