{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A7CNVCS2SPZQQIWRUMAKMH3KA7","short_pith_number":"pith:A7CNVCS2","schema_version":"1.0","canonical_sha256":"07c4da8a5a93f30822d1a300a61f6a07f723f83e281f60a19c60556e43282268","source":{"kind":"arxiv","id":"2003.00133","version":1},"attestation_state":"computed","paper":{"title":"Next-Generation Topology of D-Wave Quantum Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aidan Roy, Jack Raymond, Kelly Boothby, Paul Bunyk","submitted_at":"2020-02-29T00:20:30Z","abstract_excerpt":"This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera topology. It also presents some initial performance results for simple, standard Ising model classes of problems."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.00133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-02-29T00:20:30Z","cross_cats_sorted":[],"title_canon_sha256":"edf7b8d4ad608f4ed66b8aca25a47769b6c6a737225ccea1273c9b38ab439303","abstract_canon_sha256":"995d2cbc734441d2a600210f17cb3dcba1369731d734ee6dd5c22ebd4ea3c3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:44.316245Z","signature_b64":"nXT13+0acpJJIc7s8yAWJUenR/Naqtflseh/nVEcGAGwKsd1b/jLyeqF4o7x2Rwj3zVS8e0dKZMgxJOp3HmSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07c4da8a5a93f30822d1a300a61f6a07f723f83e281f60a19c60556e43282268","last_reissued_at":"2026-07-05T00:44:44.315805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:44.315805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Next-Generation Topology of D-Wave Quantum Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aidan Roy, Jack Raymond, Kelly Boothby, Paul Bunyk","submitted_at":"2020-02-29T00:20:30Z","abstract_excerpt":"This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera topology. It also presents some initial performance results for simple, standard Ising model classes of problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00133","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/2003.00133/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.00133","created_at":"2026-07-05T00:44:44.315861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00133v1","created_at":"2026-07-05T00:44:44.315861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00133","created_at":"2026-07-05T00:44:44.315861+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7CNVCS2SPZQ","created_at":"2026-07-05T00:44:44.315861+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7CNVCS2SPZQQIWR","created_at":"2026-07-05T00:44:44.315861+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7CNVCS2","created_at":"2026-07-05T00:44:44.315861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17623","citing_title":"Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20166","citing_title":"Applications of quantum annealing to magnetic dipole hyperfine structure constants: First results beyond energies for atoms","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2501.19221","citing_title":"VeloxQ: A Fast and Efficient QUBO Solver","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2502.19872","citing_title":"Designing a Machine Learning-Driven, Cross-Hardware Emulator for Noisy Quantum Computers with Gate-Based Protocols","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2603.09468","citing_title":"Multi-tasking through quantum annealing","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2506.17418","citing_title":"Magnetic Hysteresis Experiments Performed on Quantum Annealers","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01050","citing_title":"Simulated Bifurcation Quantum Annealing","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25433","citing_title":"Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25433","citing_title":"Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06857","citing_title":"Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7","json":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7.json","graph_json":"https://pith.science/api/pith-number/A7CNVCS2SPZQQIWRUMAKMH3KA7/graph.json","events_json":"https://pith.science/api/pith-number/A7CNVCS2SPZQQIWRUMAKMH3KA7/events.json","paper":"https://pith.science/paper/A7CNVCS2"},"agent_actions":{"view_html":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7","download_json":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7.json","view_paper":"https://pith.science/paper/A7CNVCS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00133&json=true","fetch_graph":"https://pith.science/api/pith-number/A7CNVCS2SPZQQIWRUMAKMH3KA7/graph.json","fetch_events":"https://pith.science/api/pith-number/A7CNVCS2SPZQQIWRUMAKMH3KA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7/action/storage_attestation","attest_author":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7/action/author_attestation","sign_citation":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7/action/citation_signature","submit_replication":"https://pith.science/pith/A7CNVCS2SPZQQIWRUMAKMH3KA7/action/replication_record"}},"created_at":"2026-07-05T00:44:44.315861+00:00","updated_at":"2026-07-05T00:44:44.315861+00:00"}