{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:29:57Z","timestamp":1740144597095,"version":"3.37.3"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF\/CRA Computing Innovation Fellows program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Arch. Lett."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/lca.2023.3340030","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T18:43:48Z","timestamp":1701888228000},"page":"25-28","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing the Reach and Reliability of Quantum Annealers by Pruning Longer Chains"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6687-5668","authenticated-orcid":false,"given":"Ramin","family":"Ayanzadeh","sequence":"first","affiliation":[{"name":"School of Computer Science, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1314-9096","authenticated-orcid":false,"given":"Moinuddin","family":"Qureshi","sequence":"additional","affiliation":[{"name":"School of Computer Science, Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575741"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00074"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-95482-w"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"article-title":"A practical heuristic for finding graph minors","year":"2014","author":"Cai","key":"ref6"},{"article-title":"The colorado index of complex networks","year":"2016","author":"Clauset","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-38388-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446758"}],"container-title":["IEEE Computer Architecture Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10208\/10375809\/10345714.pdf?arnumber=10345714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T05:04:26Z","timestamp":1709442266000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10345714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":10,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lca.2023.3340030","relation":{},"ISSN":["1556-6056","1556-6064","2473-2575"],"issn-type":[{"type":"print","value":"1556-6056"},{"type":"electronic","value":"1556-6064"},{"type":"electronic","value":"2473-2575"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}