{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZN5OU7UJSEL6JOEZOVXXIAOTFU","short_pith_number":"pith:ZN5OU7UJ","canonical_record":{"source":{"id":"1603.03111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-10T00:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"c7058875dd5dd1d25ecd216fdfb19658676ba5ba8736743263d4fe9f584767bb","abstract_canon_sha256":"b15b665bfe74b7c5f935983906e83f4042235041b902ac079df111634fe7337e"},"schema_version":"1.0"},"canonical_sha256":"cb7aea7e899117e4b899756f7401d32d1f11b2bc752b31899c92254f188117bb","source":{"kind":"arxiv","id":"1603.03111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03111","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03111v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03111","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZN5OU7UJSEL6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZN5OU7UJSEL6JOEZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZN5OU7UJ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZN5OU7UJSEL6JOEZOVXXIAOTFU","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-10T00:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"c7058875dd5dd1d25ecd216fdfb19658676ba5ba8736743263d4fe9f584767bb","abstract_canon_sha256":"b15b665bfe74b7c5f935983906e83f4042235041b902ac079df111634fe7337e"},"schema_version":"1.0"},"canonical_sha256":"cb7aea7e899117e4b899756f7401d32d1f11b2bc752b31899c92254f188117bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:19.000976Z","signature_b64":"6PhJO6M5SRxrYdfkloXVoBcyztCqqWToLAHKePDxhhjxs3DMKuhQ4PFU2hd7Ho2RfGZXcFVbrxqRz8b3g6oXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb7aea7e899117e4b899756f7401d32d1f11b2bc752b31899c92254f188117bb","last_reissued_at":"2026-05-18T01:19:19.000561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:19.000561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03111","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-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iz5a9+xtRxSYgyiL1pXBf/xrAGAlFwzgJGUk1//UpsPMlbsPBBh5Z6G227/xwL4TYH/zUOklTx20qmSdtsm1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:37:00.074888Z"},"content_sha256":"0c8d5b5cd17f848c3ffb71878460ea1f6cf1b1a78402d255a805c81a27ddca75","schema_version":"1.0","event_id":"sha256:0c8d5b5cd17f848c3ffb71878460ea1f6cf1b1a78402d255a805c81a27ddca75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZN5OU7UJSEL6JOEZOVXXIAOTFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mapping constrained optimization problems to quantum annealing with application to fault diagnosis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aidan Roy, Brad Lackey, Fabian Chudak, Robert Israel, William G. Macready, Zhengbing Bian","submitted_at":"2016-03-10T00:32:53Z","abstract_excerpt":"Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware.\n  The mapping technique is locally-structured, as hardware"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03111","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-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4+wrYZS9JY2lYUO7K6XyX4E2G60IGl//+9P75mcMi/90wgOBsK/kwmBz4oax9uRb3hcWNKv9I3Wknd09oM4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:37:00.075342Z"},"content_sha256":"db8be749d6a6716cd18491cce4f83530af23be82da8a14ee74077c56274f48e2","schema_version":"1.0","event_id":"sha256:db8be749d6a6716cd18491cce4f83530af23be82da8a14ee74077c56274f48e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/bundle.json","state_url":"https://pith.science/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/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:37:00Z","links":{"resolver":"https://pith.science/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU","bundle":"https://pith.science/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/bundle.json","state":"https://pith.science/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZN5OU7UJSEL6JOEZOVXXIAOTFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZN5OU7UJSEL6JOEZOVXXIAOTFU","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":"b15b665bfe74b7c5f935983906e83f4042235041b902ac079df111634fe7337e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-10T00:32:53Z","title_canon_sha256":"c7058875dd5dd1d25ecd216fdfb19658676ba5ba8736743263d4fe9f584767bb"},"schema_version":"1.0","source":{"id":"1603.03111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03111","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03111v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03111","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZN5OU7UJSEL6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZN5OU7UJSEL6JOEZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZN5OU7UJ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:db8be749d6a6716cd18491cce4f83530af23be82da8a14ee74077c56274f48e2","target":"graph","created_at":"2026-05-18T01:19:19Z","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":"Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware.\n  The mapping technique is locally-structured, as hardware","authors_text":"Aidan Roy, Brad Lackey, Fabian Chudak, Robert Israel, William G. Macready, Zhengbing Bian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-10T00:32:53Z","title":"Mapping constrained optimization problems to quantum annealing with application to fault diagnosis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03111","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:0c8d5b5cd17f848c3ffb71878460ea1f6cf1b1a78402d255a805c81a27ddca75","target":"record","created_at":"2026-05-18T01:19:19Z","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":"b15b665bfe74b7c5f935983906e83f4042235041b902ac079df111634fe7337e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-10T00:32:53Z","title_canon_sha256":"c7058875dd5dd1d25ecd216fdfb19658676ba5ba8736743263d4fe9f584767bb"},"schema_version":"1.0","source":{"id":"1603.03111","kind":"arxiv","version":1}},"canonical_sha256":"cb7aea7e899117e4b899756f7401d32d1f11b2bc752b31899c92254f188117bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb7aea7e899117e4b899756f7401d32d1f11b2bc752b31899c92254f188117bb","first_computed_at":"2026-05-18T01:19:19.000561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:19.000561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6PhJO6M5SRxrYdfkloXVoBcyztCqqWToLAHKePDxhhjxs3DMKuhQ4PFU2hd7Ho2RfGZXcFVbrxqRz8b3g6oXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:19.000976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c8d5b5cd17f848c3ffb71878460ea1f6cf1b1a78402d255a805c81a27ddca75","sha256:db8be749d6a6716cd18491cce4f83530af23be82da8a14ee74077c56274f48e2"],"state_sha256":"5468280302e4300a21579ce636fe9a44b58a5b18b13e0fdcc73f930e3d9a0302"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Uw+FtjK2cIeu6T9M0DWVl4ibOk24sn3vcz51oYtHN80cfQ8JQxZ93HVMmw9AjfEeVpTKxgfpw14u/dVESSiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:37:00.079100Z","bundle_sha256":"2cef507031f84b96f225d4804387fcb1fdd39960faa23462c53f197594232ebf"}}