{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6SH5MG6W4DU4YTW3HAUTBTOJHT","short_pith_number":"pith:6SH5MG6W","canonical_record":{"source":{"id":"1911.04574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T21:34:33Z","cross_cats_sorted":["quant-ph","stat.ML"],"title_canon_sha256":"4c4f238bd993dc47057eb3f21cd1de212bcb6329efabd1d11b0af2a2e92b6914","abstract_canon_sha256":"6af7f496481b72fb7489266b0905928f8b273803760fef84db3a4cc10e2dd58e"},"schema_version":"1.0"},"canonical_sha256":"f48fd61bd6e0e9cc4edb382930cdc93cda70bfc33291cb43a7ac640b115a3912","source":{"kind":"arxiv","id":"1911.04574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04574","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04574v1","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04574","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"6SH5MG6W4DU4","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"6SH5MG6W4DU4YTW3","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"6SH5MG6W","created_at":"2026-07-05T04:31:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6SH5MG6W4DU4YTW3HAUTBTOJHT","target":"record","payload":{"canonical_record":{"source":{"id":"1911.04574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T21:34:33Z","cross_cats_sorted":["quant-ph","stat.ML"],"title_canon_sha256":"4c4f238bd993dc47057eb3f21cd1de212bcb6329efabd1d11b0af2a2e92b6914","abstract_canon_sha256":"6af7f496481b72fb7489266b0905928f8b273803760fef84db3a4cc10e2dd58e"},"schema_version":"1.0"},"canonical_sha256":"f48fd61bd6e0e9cc4edb382930cdc93cda70bfc33291cb43a7ac640b115a3912","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:55.237738Z","signature_b64":"EFnaOumO5QpXzqPzl4EQJbIwAm61DP484daGOMBRkgLeey9u4LN6Q72YXqSJReRSTVJ2FnQWTmjrq/ZMXfh5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f48fd61bd6e0e9cc4edb382930cdc93cda70bfc33291cb43a7ac640b115a3912","last_reissued_at":"2026-07-05T04:31:55.237266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:55.237266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.04574","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-05T04:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klgCY+eQTEMPqxRHe2rpFeahBjE5KxOQ2Ktn0yX3WL4JRNRaNNgp4J7e5CDOeHls782wFVhrooSSTHt512i1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:03:04.302522Z"},"content_sha256":"b2f8c126759a8533deb3eb097f54a595e92f76d368e1b6626afae7d4e40794be","schema_version":"1.0","event_id":"sha256:b2f8c126759a8533deb3eb097f54a595e92f76d368e1b6626afae7d4e40794be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6SH5MG6W4DU4YTW3HAUTBTOJHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lukasz Cincio, Prasanna Balaprakash, Ruslan Shaydulin, Sami Khairy, Yuri Alexeev","submitted_at":"2019-11-11T21:34:33Z","abstract_excerpt":"Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quantum-classical algorithm that combines a parameterized quantum state evolution with a classical optimization routine to approximately solve combinatorial problems. The quality of the solution obtained by QAOA within a fixed budget of calls to the quantum computer depends on the per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04574","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/1911.04574/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-05T04:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1YDFNw7GDx77MDYRMoOCWxTGuYrG5V3nMEaSlVTQwSvi9UOuLBDksk3Ij09amVZxeEQ/aAg9bzUU/P6rNeMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:03:04.303452Z"},"content_sha256":"1e0e65b0fe7c81bc45c8f17be0eff1d74e215e2352ee0cefb09401c893893d6e","schema_version":"1.0","event_id":"sha256:1e0e65b0fe7c81bc45c8f17be0eff1d74e215e2352ee0cefb09401c893893d6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/bundle.json","state_url":"https://pith.science/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/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-12T21:03:04Z","links":{"resolver":"https://pith.science/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT","bundle":"https://pith.science/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/bundle.json","state":"https://pith.science/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SH5MG6W4DU4YTW3HAUTBTOJHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6SH5MG6W4DU4YTW3HAUTBTOJHT","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":"6af7f496481b72fb7489266b0905928f8b273803760fef84db3a4cc10e2dd58e","cross_cats_sorted":["quant-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T21:34:33Z","title_canon_sha256":"4c4f238bd993dc47057eb3f21cd1de212bcb6329efabd1d11b0af2a2e92b6914"},"schema_version":"1.0","source":{"id":"1911.04574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04574","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04574v1","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04574","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"6SH5MG6W4DU4","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"6SH5MG6W4DU4YTW3","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"6SH5MG6W","created_at":"2026-07-05T04:31:55Z"}],"graph_snapshots":[{"event_id":"sha256:1e0e65b0fe7c81bc45c8f17be0eff1d74e215e2352ee0cefb09401c893893d6e","target":"graph","created_at":"2026-07-05T04:31:55Z","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/1911.04574/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quantum-classical algorithm that combines a parameterized quantum state evolution with a classical optimization routine to approximately solve combinatorial problems. The quality of the solution obtained by QAOA within a fixed budget of calls to the quantum computer depends on the per","authors_text":"Lukasz Cincio, Prasanna Balaprakash, Ruslan Shaydulin, Sami Khairy, Yuri Alexeev","cross_cats":["quant-ph","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T21:34:33Z","title":"Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04574","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:b2f8c126759a8533deb3eb097f54a595e92f76d368e1b6626afae7d4e40794be","target":"record","created_at":"2026-07-05T04:31:55Z","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":"6af7f496481b72fb7489266b0905928f8b273803760fef84db3a4cc10e2dd58e","cross_cats_sorted":["quant-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T21:34:33Z","title_canon_sha256":"4c4f238bd993dc47057eb3f21cd1de212bcb6329efabd1d11b0af2a2e92b6914"},"schema_version":"1.0","source":{"id":"1911.04574","kind":"arxiv","version":1}},"canonical_sha256":"f48fd61bd6e0e9cc4edb382930cdc93cda70bfc33291cb43a7ac640b115a3912","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f48fd61bd6e0e9cc4edb382930cdc93cda70bfc33291cb43a7ac640b115a3912","first_computed_at":"2026-07-05T04:31:55.237266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:55.237266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EFnaOumO5QpXzqPzl4EQJbIwAm61DP484daGOMBRkgLeey9u4LN6Q72YXqSJReRSTVJ2FnQWTmjrq/ZMXfh5CA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:55.237738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.04574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2f8c126759a8533deb3eb097f54a595e92f76d368e1b6626afae7d4e40794be","sha256:1e0e65b0fe7c81bc45c8f17be0eff1d74e215e2352ee0cefb09401c893893d6e"],"state_sha256":"88eab0700fb6e430ed2bc2808d08e12fb63a3a330ca562730da95646b31b1271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Dbvhme5gkT/2Cxzr8v2oRmARLIzBQLR1ESACrdLk5XjIPUw2v+4/2Itcyht4NpJN+67ft+0xchm6mU2OxApBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:03:04.316233Z","bundle_sha256":"430e685b5cd1a72fc987faf9052812e223bae1f11b7adec13bd59ee56cfb78e5"}}