{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BFGI7SYMXU5TSBP5UGUKUPXE3A","short_pith_number":"pith:BFGI7SYM","canonical_record":{"source":{"id":"1605.09462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-31T01:28:22Z","cross_cats_sorted":["cs.ET","quant-ph"],"title_canon_sha256":"7244b465dc092fa1cc373eb76fb1695a24b9ea6790ecd042e9ab102ee6722870","abstract_canon_sha256":"9fbf2c60630ba2a7a48a1180eb8ba9b56870f247b7f99a6cd1d4e9409bb2ceff"},"schema_version":"1.0"},"canonical_sha256":"094c8fcb0cbd3b3905fda1a8aa3ee4d80ef1374ec02a7b6e425678dfea144d19","source":{"kind":"arxiv","id":"1605.09462","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09462","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09462v3","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09462","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"BFGI7SYMXU5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFGI7SYMXU5TSBP5","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFGI7SYM","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BFGI7SYMXU5TSBP5UGUKUPXE3A","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-31T01:28:22Z","cross_cats_sorted":["cs.ET","quant-ph"],"title_canon_sha256":"7244b465dc092fa1cc373eb76fb1695a24b9ea6790ecd042e9ab102ee6722870","abstract_canon_sha256":"9fbf2c60630ba2a7a48a1180eb8ba9b56870f247b7f99a6cd1d4e9409bb2ceff"},"schema_version":"1.0"},"canonical_sha256":"094c8fcb0cbd3b3905fda1a8aa3ee4d80ef1374ec02a7b6e425678dfea144d19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:00.958368Z","signature_b64":"LWX/oEK8vAz/EFYn4F4uywphCYdrf3mBt08nuUqy2q9SN3taINyRC0Drs7Bhf25/SwU5c0HQAWQ8Xc5QxJzHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094c8fcb0cbd3b3905fda1a8aa3ee4d80ef1374ec02a7b6e425678dfea144d19","last_reissued_at":"2026-05-17T23:57:00.957875Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:00.957875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09462","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-05-17T23:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xG6mDt3EBcfafAMwDpIjUCQG1lNe4goOjCJKeLIpUr337ehRChbtDe2tG7d/Y1lopSjm4bTJBbV+Y12cdYRODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:17:43.377072Z"},"content_sha256":"174834f50100b157add31eec7ee8b0b921b51eeb0bbcdccbb31f9c5b5bea0c24","schema_version":"1.0","event_id":"sha256:174834f50100b157add31eec7ee8b0b921b51eeb0bbcdccbb31f9c5b5bea0c24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BFGI7SYMXU5TSBP5UGUKUPXE3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Subgradient Approach for Constrained Binary Optimization via Quantum Adiabatic Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"math.OC","authors_text":"Pooya Ronagh, Sahar Karimi","submitted_at":"2016-05-31T01:28:22Z","abstract_excerpt":"An earlier work [18] proposes a method for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution using an outer approximation method. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system. However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise. In this paper, we consider a subgradient method for finding an optimal primal-dual pair for the Lagrangian dual of a constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09462","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":""},"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-17T23:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3IoYzZP/WDCfQ9L00NZQB9xKmvT71leLQPCuXjxw0QjDKl4gYDzM/Y1lR2CXi/WLB3C2oMej4gBaIrOjfAJBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:17:43.377735Z"},"content_sha256":"560ee04c7701f681d9a2fadfb9850246243ef767cc613b65d023563d494ee962","schema_version":"1.0","event_id":"sha256:560ee04c7701f681d9a2fadfb9850246243ef767cc613b65d023563d494ee962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/bundle.json","state_url":"https://pith.science/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/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-26T20:17:43Z","links":{"resolver":"https://pith.science/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A","bundle":"https://pith.science/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/bundle.json","state":"https://pith.science/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFGI7SYMXU5TSBP5UGUKUPXE3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BFGI7SYMXU5TSBP5UGUKUPXE3A","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":"9fbf2c60630ba2a7a48a1180eb8ba9b56870f247b7f99a6cd1d4e9409bb2ceff","cross_cats_sorted":["cs.ET","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-31T01:28:22Z","title_canon_sha256":"7244b465dc092fa1cc373eb76fb1695a24b9ea6790ecd042e9ab102ee6722870"},"schema_version":"1.0","source":{"id":"1605.09462","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09462","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09462v3","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09462","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"BFGI7SYMXU5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFGI7SYMXU5TSBP5","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFGI7SYM","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:560ee04c7701f681d9a2fadfb9850246243ef767cc613b65d023563d494ee962","target":"graph","created_at":"2026-05-17T23:57:00Z","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":"An earlier work [18] proposes a method for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution using an outer approximation method. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system. However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise. In this paper, we consider a subgradient method for finding an optimal primal-dual pair for the Lagrangian dual of a constr","authors_text":"Pooya Ronagh, Sahar Karimi","cross_cats":["cs.ET","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-31T01:28:22Z","title":"A Subgradient Approach for Constrained Binary Optimization via Quantum Adiabatic Evolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09462","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:174834f50100b157add31eec7ee8b0b921b51eeb0bbcdccbb31f9c5b5bea0c24","target":"record","created_at":"2026-05-17T23:57:00Z","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":"9fbf2c60630ba2a7a48a1180eb8ba9b56870f247b7f99a6cd1d4e9409bb2ceff","cross_cats_sorted":["cs.ET","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-31T01:28:22Z","title_canon_sha256":"7244b465dc092fa1cc373eb76fb1695a24b9ea6790ecd042e9ab102ee6722870"},"schema_version":"1.0","source":{"id":"1605.09462","kind":"arxiv","version":3}},"canonical_sha256":"094c8fcb0cbd3b3905fda1a8aa3ee4d80ef1374ec02a7b6e425678dfea144d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"094c8fcb0cbd3b3905fda1a8aa3ee4d80ef1374ec02a7b6e425678dfea144d19","first_computed_at":"2026-05-17T23:57:00.957875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:00.957875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LWX/oEK8vAz/EFYn4F4uywphCYdrf3mBt08nuUqy2q9SN3taINyRC0Drs7Bhf25/SwU5c0HQAWQ8Xc5QxJzHAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:00.958368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09462","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:174834f50100b157add31eec7ee8b0b921b51eeb0bbcdccbb31f9c5b5bea0c24","sha256:560ee04c7701f681d9a2fadfb9850246243ef767cc613b65d023563d494ee962"],"state_sha256":"a9f4542ac3e8c458f446d14aa7f31fb2876422945f56c5f9ae8e42c13e63e55b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woQSu4Su3+qh3LS5N9PQHSwiOBMDPAViAPP3KS8dTbxx69h0h/FsNWbz1N7OTyzi9e703q9OP5H5uLDLF6aIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:17:43.381386Z","bundle_sha256":"06549d60a6a912ab355f733415bd5a71cef3be3df011a608d79e1f0fe4d5a609"}}