{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FIPNXQT5N22XNDYW5RCX4QODCB","short_pith_number":"pith:FIPNXQT5","canonical_record":{"source":{"id":"1709.07511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T20:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"625e09240439b36b46478851f371867b0e8f85831af13d7febfa3dedd612f6f9","abstract_canon_sha256":"8805978a32cbe2ee33098257ca8f563091ee51af2c37087f1e97644faba908a7"},"schema_version":"1.0"},"canonical_sha256":"2a1edbc27d6eb5768f16ec457e41c3106c4c0334e025f032ccba70b9b627ea7b","source":{"kind":"arxiv","id":"1709.07511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07511","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07511v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07511","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"FIPNXQT5N22X","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIPNXQT5N22XNDYW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIPNXQT5","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FIPNXQT5N22XNDYW5RCX4QODCB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T20:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"625e09240439b36b46478851f371867b0e8f85831af13d7febfa3dedd612f6f9","abstract_canon_sha256":"8805978a32cbe2ee33098257ca8f563091ee51af2c37087f1e97644faba908a7"},"schema_version":"1.0"},"canonical_sha256":"2a1edbc27d6eb5768f16ec457e41c3106c4c0334e025f032ccba70b9b627ea7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.973984Z","signature_b64":"L8vuI7pbJusx1pQUOcxhD78NQbAAmLp52i9pEOSw2fPwLuUaR0ROFKpEk+iqlYxVEUislCI177OFZJ5rCTb6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a1edbc27d6eb5768f16ec457e41c3106c4c0334e025f032ccba70b9b627ea7b","last_reissued_at":"2026-05-18T00:34:32.973635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.973635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07511","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-05-18T00:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aIZH6EYzKz5QgFWifsPWAQVTJPoEFOfNEegRWOZyXdnWujbI4s79OJ1gRgWGzHrGKNx+LApf/2xazBInh5fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:22:17.466772Z"},"content_sha256":"7f9a96dfbc12fa01009d5c94c475fef2055db5033ad4145b5069c9e4844627a8","schema_version":"1.0","event_id":"sha256:7f9a96dfbc12fa01009d5c94c475fef2055db5033ad4145b5069c9e4844627a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FIPNXQT5N22XNDYW5RCX4QODCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Optimization of Unconstrained Binary Quadratic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gary Kochenberger, John Metcalfe, Mark Lewis","submitted_at":"2017-09-21T20:36:21Z","abstract_excerpt":"In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, particularly in a new class of quantum annealing computers. Experimental design techniques are used to generate a diverse subset of possible scenarios, from which robust solutions are identified. An ill"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07511","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":""},"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:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylwonz3MOGubjuq1/PTsj9mm/k3D8Bj7JkDIpmWwnRUwEEfR7whN56m9cmQx5bKnUVueUM3f5fDIv3aNgTfHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:22:17.467110Z"},"content_sha256":"9db466afe9c6e44aa1582f6f1d7646ea2b22fd8252c9dba29d6fedefa51f99e3","schema_version":"1.0","event_id":"sha256:9db466afe9c6e44aa1582f6f1d7646ea2b22fd8252c9dba29d6fedefa51f99e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIPNXQT5N22XNDYW5RCX4QODCB/bundle.json","state_url":"https://pith.science/pith/FIPNXQT5N22XNDYW5RCX4QODCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIPNXQT5N22XNDYW5RCX4QODCB/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-07-03T08:22:17Z","links":{"resolver":"https://pith.science/pith/FIPNXQT5N22XNDYW5RCX4QODCB","bundle":"https://pith.science/pith/FIPNXQT5N22XNDYW5RCX4QODCB/bundle.json","state":"https://pith.science/pith/FIPNXQT5N22XNDYW5RCX4QODCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIPNXQT5N22XNDYW5RCX4QODCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FIPNXQT5N22XNDYW5RCX4QODCB","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":"8805978a32cbe2ee33098257ca8f563091ee51af2c37087f1e97644faba908a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T20:36:21Z","title_canon_sha256":"625e09240439b36b46478851f371867b0e8f85831af13d7febfa3dedd612f6f9"},"schema_version":"1.0","source":{"id":"1709.07511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07511","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07511v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07511","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"FIPNXQT5N22X","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIPNXQT5N22XNDYW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIPNXQT5","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:9db466afe9c6e44aa1582f6f1d7646ea2b22fd8252c9dba29d6fedefa51f99e3","target":"graph","created_at":"2026-05-18T00:34:32Z","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":"In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, particularly in a new class of quantum annealing computers. Experimental design techniques are used to generate a diverse subset of possible scenarios, from which robust solutions are identified. An ill","authors_text":"Gary Kochenberger, John Metcalfe, Mark Lewis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T20:36:21Z","title":"Robust Optimization of Unconstrained Binary Quadratic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07511","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:7f9a96dfbc12fa01009d5c94c475fef2055db5033ad4145b5069c9e4844627a8","target":"record","created_at":"2026-05-18T00:34:32Z","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":"8805978a32cbe2ee33098257ca8f563091ee51af2c37087f1e97644faba908a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T20:36:21Z","title_canon_sha256":"625e09240439b36b46478851f371867b0e8f85831af13d7febfa3dedd612f6f9"},"schema_version":"1.0","source":{"id":"1709.07511","kind":"arxiv","version":1}},"canonical_sha256":"2a1edbc27d6eb5768f16ec457e41c3106c4c0334e025f032ccba70b9b627ea7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a1edbc27d6eb5768f16ec457e41c3106c4c0334e025f032ccba70b9b627ea7b","first_computed_at":"2026-05-18T00:34:32.973635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:32.973635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L8vuI7pbJusx1pQUOcxhD78NQbAAmLp52i9pEOSw2fPwLuUaR0ROFKpEk+iqlYxVEUislCI177OFZJ5rCTb6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:32.973984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f9a96dfbc12fa01009d5c94c475fef2055db5033ad4145b5069c9e4844627a8","sha256:9db466afe9c6e44aa1582f6f1d7646ea2b22fd8252c9dba29d6fedefa51f99e3"],"state_sha256":"0dc2844e147f71ab30ac0e018feb337e0ac269adb59e7934d3b9c53de16df3f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llkt3JEm7bIOi1+IF+AWnwdqXkfoIVYJE/jCggWbngkQCa0Nng/yLkg1l+eIq4vsUCu7dwrMSUyxzYjvrqTlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T08:22:17.469031Z","bundle_sha256":"27ae3fbeb3c7fbb55c3a656a533cf296026fcdb948ce3cc32aa0d50e89a9ed48"}}