{"id":"https://openalex.org/W1890759571","doi":"https://doi.org/10.1007/978-3-642-38616-9_6","title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","display_name":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1890759571","doi":"https://doi.org/10.1007/978-3-642-38616-9_6","mag":"1890759571"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-38616-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38616-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1301.6176","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Thijs Laarhoven","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Thijs Laarhoven","raw_affiliation_strings":["Dept. of Mathematics and Computer Science, Eindhoven University of Technology, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Michele Mosca","orcid":null},"institutions":[{"id":"https://openalex.org/I183974707","display_name":"Perimeter Institute","ror":"https://ror.org/013m0ej23","country_code":"CA","type":"facility","lineage":["https://openalex.org/I183974707"]},{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michele Mosca","raw_affiliation_strings":["Institute for Quantum Computing and Dept. of C&O, University of Waterloo, Canada","Perimeter Institute for Theoretical Physics, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Quantum Computing and Dept. of C&O, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Perimeter Institute for Theoretical Physics, Canada","institution_ids":["https://openalex.org/I183974707"]}]},{"author_position":"last","author":{"id":null,"display_name":"Joop van de Pol","orcid":null},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Joop van de Pol","raw_affiliation_strings":["Dept. of Computer Science, University of Bristol, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6772,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.72468311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"83","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3815000057220459,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3815000057220459,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.3614000082015991,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.11779999732971191,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lattice-problem","display_name":"Lattice problem","score":0.8258000016212463},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.542900025844574},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5116000175476074},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.4302000105381012},{"id":"https://openalex.org/keywords/cryptosystem","display_name":"Cryptosystem","score":0.4239000082015991},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39649999141693115},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37599998712539673},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3555999994277954}],"concepts":[{"id":"https://openalex.org/C168482242","wikidata":"https://www.wikidata.org/wiki/Q6497128","display_name":"Lattice problem","level":3,"score":0.8258000016212463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5996000170707703},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.542900025844574},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5116000175476074},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4302000105381012},{"id":"https://openalex.org/C6295992","wikidata":"https://www.wikidata.org/wiki/Q976521","display_name":"Cryptosystem","level":3,"score":0.4239000082015991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4171000123023987},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34049999713897705},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.30649998784065247},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27869999408721924},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.27720001339912415},{"id":"https://openalex.org/C13336665","wikidata":"https://www.wikidata.org/wiki/Q125977","display_name":"Vector space","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.26910001039505005},{"id":"https://openalex.org/C15706264","wikidata":"https://www.wikidata.org/wiki/Q230883","display_name":"Quantum state","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.2549999952316284},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":13,"locations":[{"id":"doi:10.1007/978-3-642-38616-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38616-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/88ab4886-1840-4ad9-ac54-3a37331392dc","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/88ab4886-1840-4ad9-ac54-3a37331392dc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Laarhoven, T M M, Mosca, M & van de Pol, J 2013, Solving the shortest vector problem in lattices faster using quantum search. in P Gaborit (ed.), Post-Quantum Cryptography - 5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings). Lecture Notes in Computer Science, vol. 7932, Springer, Berlin, pp. 83-101, 5th International Conference on Post-Quantum Cryptography (PQCrypto 2013), Limoges, France, 4/06/13. https://doi.org/10.1007/978-3-642-38616-9_6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1301.6176","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6176","pdf_url":"https://arxiv.org/pdf/1301.6176","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:803329","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=803329","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.712.5272","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.5272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/pgrad/csjhvdp/files/pqc13paper.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:755614","is_oa":false,"landing_page_url":"http://repository.tue.nl/755614","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:803329","is_oa":false,"landing_page_url":"http://repository.tue.nl/803329","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"},{"id":"pmh:oai:library.tue.nl:891694","is_oa":false,"landing_page_url":"http://repository.tue.nl/891694","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/0d7202a1-33c5-4e08-9d84-fe6f3a2a9606","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/0d7202a1-33c5-4e08-9d84-fe6f3a2a9606","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laarhoven, T M M, Mosca, M & Pol, van de, J 2013, Solving the shortest vector problem in lattices faster using quantum search. arXiv.org, vol. 1301.6176 [cs.CR], s.n.","raw_type":"book"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/f2fce8ce-5c67-486b-b368-b095fc91157a","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/f2fce8ce-5c67-486b-b368-b095fc91157a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laarhoven, T, Mosca, M & van de Pol, J 2013, Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. in Post-Quantum Cryptography - PQC 2013. vol. 7932, Lecture Notes in Computer Science, vol. 7932, Springer Berlin Heidelberg, pp. 83-101. https://doi.org/10.1007/978-3-642-38616-9_6","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/f2fce8ce-5c67-486b-b368-b095fc91157a","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/f2fce8ce-5c67-486b-b368-b095fc91157a","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laarhoven, T, Mosca, M & van de Pol, J 2013, Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. in Post-Quantum Cryptography - PQC 2013. vol. 7932, Lecture Notes in Computer Science, vol. 7932, Springer Berlin Heidelberg, pp. 83-101. https://doi.org/10.1007/978-3-642-38616-9_6","raw_type":"contributionToPeriodical"},{"id":"pmh:tue:oai:pure.tue.nl:publications/0d7202a1-33c5-4e08-9d84-fe6f3a2a9606","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/0d7202a1-33c5-4e08-9d84-fe6f3a2a9606","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/88ab4886-1840-4ad9-ac54-3a37331392dc","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/88ab4886-1840-4ad9-ac54-3a37331392dc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Post-Quantum Cryptography - 5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings), 83 - 101","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1301.6176","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6176","pdf_url":"https://arxiv.org/pdf/1301.6176","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2575519571","display_name":null,"funder_award_id":"EP/I03126X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W80562455","https://openalex.org/W121367636","https://openalex.org/W132616194","https://openalex.org/W166611642","https://openalex.org/W1556199233","https://openalex.org/W1572157978","https://openalex.org/W1675339804","https://openalex.org/W1742003405","https://openalex.org/W1766548092","https://openalex.org/W1845765495","https://openalex.org/W1905918643","https://openalex.org/W1972883454","https://openalex.org/W1989510734","https://openalex.org/W1993000433","https://openalex.org/W1997002146","https://openalex.org/W1997086908","https://openalex.org/W2000956176","https://openalex.org/W2006290558","https://openalex.org/W2007712808","https://openalex.org/W2012589104","https://openalex.org/W2020918964","https://openalex.org/W2031533839","https://openalex.org/W2038761522","https://openalex.org/W2050689197","https://openalex.org/W2051446825","https://openalex.org/W2056492141","https://openalex.org/W2057065544","https://openalex.org/W2061949491","https://openalex.org/W2090828985","https://openalex.org/W2121981260","https://openalex.org/W2126483728","https://openalex.org/W2141040012","https://openalex.org/W2152926062","https://openalex.org/W2171692676","https://openalex.org/W2762094014","https://openalex.org/W2964216201","https://openalex.org/W3023478445","https://openalex.org/W4235093468","https://openalex.org/W6640612031","https://openalex.org/W6728321236"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-30T09:15:22.047038","created_date":"2016-06-24T00:00:00"}