{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CLWKBJE6ZY5PVJZDNGJTKOP4XQ","short_pith_number":"pith:CLWKBJE6","canonical_record":{"source":{"id":"1612.01789","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-06T13:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"08fcf2e33d7b21b46b227c6928733c5fe82073d3c21e3dba19c2dbcda8a4466e","abstract_canon_sha256":"db344d781a6bde95a2066db2cc4939749f63d138accfb33f5fc89256cdeb2b0a"},"schema_version":"1.0"},"canonical_sha256":"12eca0a49ece3afaa72369933539fcbc3b61be667352fa6252574926edecdaee","source":{"kind":"arxiv","id":"1612.01789","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01789","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01789v4","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01789","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"CLWKBJE6ZY5P","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CLWKBJE6ZY5PVJZD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CLWKBJE6","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CLWKBJE6ZY5PVJZDNGJTKOP4XQ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01789","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-06T13:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"08fcf2e33d7b21b46b227c6928733c5fe82073d3c21e3dba19c2dbcda8a4466e","abstract_canon_sha256":"db344d781a6bde95a2066db2cc4939749f63d138accfb33f5fc89256cdeb2b0a"},"schema_version":"1.0"},"canonical_sha256":"12eca0a49ece3afaa72369933539fcbc3b61be667352fa6252574926edecdaee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.720676Z","signature_b64":"x/NFBH70pSjmYIv92exySt4yeuFfQrgP0mrtaV3o/e0vW+PlamPZFkXBT3m1FOUaOA86T9TOzRohIrKIuNMUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12eca0a49ece3afaa72369933539fcbc3b61be667352fa6252574926edecdaee","last_reissued_at":"2026-05-18T00:07:55.720020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.720020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01789","source_version":4,"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-05-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/QpzWRW7qm9Zu7YqksVOSrt5YjOIsdB+czJ8J3s3pz/wsXv0h0DXRWOUwxXpyoT5YwsShFS1DPuosXMHBERDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:42:21.258993Z"},"content_sha256":"5828d0fb7d5275bb0e5fd8c5791ef21a3efe3fc2f6a1cf5e348e466da06a3df8","schema_version":"1.0","event_id":"sha256:5828d0fb7d5275bb0e5fd8c5791ef21a3efe3fc2f6a1cf5e348e466da06a3df8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CLWKBJE6ZY5PVJZDNGJTKOP4XQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum gradient descent and Newton's method for constrained polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Petruccione, Leonard Wossnig, Maria Schuld, Patrick Rebentrost, Seth Lloyd","submitted_at":"2016-12-06T13:01:16Z","abstract_excerpt":"Optimization problems in disciplines such as machine learning are commonly solved with iterative methods. Gradient descent algorithms find local minima by moving along the direction of steepest descent while Newton's method takes into account curvature information and thereby often improves convergence. Here, we develop quantum versions of these iterative optimization algorithms and apply them to polynomial optimization with a unit norm constraint. In each step, multiple copies of the current candidate are used to improve the candidate using quantum phase estimation, an adapted quantum princip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01789","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2suS7BWFkDVk43H7b0E9ZBMRywryKQeKRajjqXTE9vdkVJ6kiGe507hy1U+Y5zWyFmi6twX1UBDFZKdm4StFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:42:21.259675Z"},"content_sha256":"d5c634c53f35934ef19265f58a45d6c9b7648d829733f96924e4e5e08ed4b438","schema_version":"1.0","event_id":"sha256:d5c634c53f35934ef19265f58a45d6c9b7648d829733f96924e4e5e08ed4b438"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/bundle.json","state_url":"https://pith.science/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/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-05-26T03:42:21Z","links":{"resolver":"https://pith.science/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ","bundle":"https://pith.science/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/bundle.json","state":"https://pith.science/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLWKBJE6ZY5PVJZDNGJTKOP4XQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CLWKBJE6ZY5PVJZDNGJTKOP4XQ","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":"db344d781a6bde95a2066db2cc4939749f63d138accfb33f5fc89256cdeb2b0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-06T13:01:16Z","title_canon_sha256":"08fcf2e33d7b21b46b227c6928733c5fe82073d3c21e3dba19c2dbcda8a4466e"},"schema_version":"1.0","source":{"id":"1612.01789","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01789","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01789v4","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01789","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"CLWKBJE6ZY5P","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CLWKBJE6ZY5PVJZD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CLWKBJE6","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:d5c634c53f35934ef19265f58a45d6c9b7648d829733f96924e4e5e08ed4b438","target":"graph","created_at":"2026-05-18T00:07: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"},"paper":{"abstract_excerpt":"Optimization problems in disciplines such as machine learning are commonly solved with iterative methods. Gradient descent algorithms find local minima by moving along the direction of steepest descent while Newton's method takes into account curvature information and thereby often improves convergence. Here, we develop quantum versions of these iterative optimization algorithms and apply them to polynomial optimization with a unit norm constraint. In each step, multiple copies of the current candidate are used to improve the candidate using quantum phase estimation, an adapted quantum princip","authors_text":"Francesco Petruccione, Leonard Wossnig, Maria Schuld, Patrick Rebentrost, Seth Lloyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-06T13:01:16Z","title":"Quantum gradient descent and Newton's method for constrained polynomial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01789","kind":"arxiv","version":4},"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:5828d0fb7d5275bb0e5fd8c5791ef21a3efe3fc2f6a1cf5e348e466da06a3df8","target":"record","created_at":"2026-05-18T00:07: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":"db344d781a6bde95a2066db2cc4939749f63d138accfb33f5fc89256cdeb2b0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-06T13:01:16Z","title_canon_sha256":"08fcf2e33d7b21b46b227c6928733c5fe82073d3c21e3dba19c2dbcda8a4466e"},"schema_version":"1.0","source":{"id":"1612.01789","kind":"arxiv","version":4}},"canonical_sha256":"12eca0a49ece3afaa72369933539fcbc3b61be667352fa6252574926edecdaee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12eca0a49ece3afaa72369933539fcbc3b61be667352fa6252574926edecdaee","first_computed_at":"2026-05-18T00:07:55.720020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:55.720020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x/NFBH70pSjmYIv92exySt4yeuFfQrgP0mrtaV3o/e0vW+PlamPZFkXBT3m1FOUaOA86T9TOzRohIrKIuNMUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:55.720676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01789","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5828d0fb7d5275bb0e5fd8c5791ef21a3efe3fc2f6a1cf5e348e466da06a3df8","sha256:d5c634c53f35934ef19265f58a45d6c9b7648d829733f96924e4e5e08ed4b438"],"state_sha256":"446dd569d2bea0062d8a63ad15c685d1e088429db671375f76212bfd7bb92e21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkHFls77hHji8JdlCltATQwnobDcHA25XJI2XPcA+h9kJO+z2YQED+uv6CahjsAww51/aEYqP+uxRNX50iXSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:42:21.264385Z","bundle_sha256":"281e6bc617ce691ed4b4d7a24bfe8c3d48a499cace3d6b19c2ca6c9a6726352e"}}