{"id":"https://openalex.org/W2000058275","doi":"https://doi.org/10.1017/s0956796812000172","title":"Lazy tree splitting","display_name":"Lazy tree splitting","publication_year":2012,"publication_date":"2012-08-15","ids":{"openalex":"https://openalex.org/W2000058275","doi":"https://doi.org/10.1017/s0956796812000172","mag":"2000058275"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796812000172","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000172","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EF3F7E296F505383FA01B64E7E299F72/S0956796812000172a.pdf/div-class-title-lazy-tree-splitting-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EF3F7E296F505383FA01B64E7E299F72/S0956796812000172a.pdf/div-class-title-lazy-tree-splitting-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066547359","display_name":"Lars Bergstr\u00f6m","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"LARS BERGSTROM","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: larsberg@cs.uchicago.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: larsberg@cs.uchicago.edu)#TAB#","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029478793","display_name":"Matthew Fluet","orcid":"https://orcid.org/0000-0002-4194-7618"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MATTHEW FLUET","raw_affiliation_strings":["Department of Computer Science, Rochester Institute of Technology, Rochester NY 14623-5603, USA (e-mail:","Department of computer science, rochester institute of technology, rochester ny 14623-5603, usa (e-mail: mtf@cs.rit.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rochester Institute of Technology, Rochester NY 14623-5603, USA (e-mail:","institution_ids":["https://openalex.org/I155173764"]},{"raw_affiliation_string":"Department of computer science, rochester institute of technology, rochester ny 14623-5603, usa (e-mail: mtf@cs.rit.edu)#TAB#","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009476343","display_name":"Mike Rainey","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MIKE RAINEY","raw_affiliation_strings":["Max Planck Institute for Software Systems, D-67663 Kaiserslautern, Rheinland-PhalzGermany (e-mail:","Max planck institute for software systems, d-67663 kaiserslautern, rheinland-phalzgermany (e-mail: mrainey@mpi-sws.org)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, D-67663 Kaiserslautern, Rheinland-PhalzGermany (e-mail:","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"Max planck institute for software systems, d-67663 kaiserslautern, rheinland-phalzgermany (e-mail: mrainey@mpi-sws.org)#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030967328","display_name":"John Reppy","orcid":"https://orcid.org/0000-0002-5881-298X"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOHN REPPY","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: jhr@cs.uchicago.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: jhr@cs.uchicago.edu)#TAB#","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034853790","display_name":"Adam Shaw","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ADAM SHAW","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: ams@cs.uchicago.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL 60637, USA (e-mail:","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Department of computer science, university of chicago, chicago, il 60637, usa (e-mail: ams@cs.uchicago.edu)#TAB#","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5858,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.65919161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"4-5","first_page":"382","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.9292395114898682},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7683906555175781},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7378095388412476},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.485387921333313},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4719720780849457},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.46693652868270874},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.456296443939209},{"id":"https://openalex.org/keywords/parallel-i/o","display_name":"Parallel I/O","score":0.4431445300579071},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42727071046829224},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.42636218667030334},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4090614914894104},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39561593532562256},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3410872220993042},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14098650217056274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9292395114898682},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7683906555175781},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7378095388412476},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.485387921333313},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4719720780849457},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.46693652868270874},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.456296443939209},{"id":"https://openalex.org/C2781057727","wikidata":"https://www.wikidata.org/wiki/Q9941","display_name":"Parallel I/O","level":2,"score":0.4431445300579071},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42727071046829224},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.42636218667030334},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4090614914894104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39561593532562256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3410872220993042},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14098650217056274},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1017/s0956796812000172","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000172","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EF3F7E296F505383FA01B64E7E299F72/S0956796812000172a.pdf/div-class-title-lazy-tree-splitting-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.170.6307","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.6307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/%7Ejhr/papers/2010/icfp-lts.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.176.6753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.176.6753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.uchicago.edu/%7Emrainey/papers/icfp10-lts.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.7127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.7127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://manticore.cs.uchicago.edu/papers/jfp-lts-submitted.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.4382","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.4382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://manticore.cs.uchicago.edu/papers/jfp-lts-submitted.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.917.1915","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.917.1915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tufts.edu/%7Enr/cs257/archive/matthew-fluet/lazy-tree-splitting.pdf","raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:2173289","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0028-5DCA-E","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"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":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s0956796812000172","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000172","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EF3F7E296F505383FA01B64E7E299F72/S0956796812000172a.pdf/div-class-title-lazy-tree-splitting-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2730661478","display_name":"Collaborative Research:   CPA-SEL : Implementation Techniques for High- level Parallel Languages","funder_award_id":"0811389","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G785918194","display_name":"Collaborative Research:   CPA-SEL:   Implementation Techniques for High-level Parallel Languages","funder_award_id":"0811419","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2000058275.pdf","grobid_xml":"https://content.openalex.org/works/W2000058275.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1518650316","https://openalex.org/W1546727036","https://openalex.org/W1580664042","https://openalex.org/W1595783387","https://openalex.org/W1603306670","https://openalex.org/W1829244603","https://openalex.org/W1965122136","https://openalex.org/W1967321130","https://openalex.org/W1990195720","https://openalex.org/W1993621349","https://openalex.org/W2006208699","https://openalex.org/W2016559894","https://openalex.org/W2036186127","https://openalex.org/W2046996113","https://openalex.org/W2056714230","https://openalex.org/W2068306188","https://openalex.org/W2072725684","https://openalex.org/W2084423328","https://openalex.org/W2087610851","https://openalex.org/W2098037505","https://openalex.org/W2098522119","https://openalex.org/W2112708371","https://openalex.org/W2141157907","https://openalex.org/W2157542044","https://openalex.org/W2159430067","https://openalex.org/W2163496769","https://openalex.org/W2394868764","https://openalex.org/W2436525433","https://openalex.org/W2912949875","https://openalex.org/W2913368212","https://openalex.org/W2914284773","https://openalex.org/W4244257941","https://openalex.org/W4248901744","https://openalex.org/W6827625726"],"related_works":["https://openalex.org/W2045183646","https://openalex.org/W2162409446","https://openalex.org/W2109463584","https://openalex.org/W2504075107","https://openalex.org/W1888970550","https://openalex.org/W3085024073","https://openalex.org/W2354058185","https://openalex.org/W2974157558","https://openalex.org/W4387237598","https://openalex.org/W2487895676"],"abstract_inverted_index":{"Abstract":[0],"Nested":[1],"data-parallelism":[2],"(NDP)":[3],"is":[4,32,47],"a":[5,15,33,175],"language":[6],"mechanism":[7],"that":[8,168],"supports":[9],"programming":[10],"irregular":[11],"parallel":[12,50,98,119],"applications":[13],"in":[14,27],"declarative":[16],"style.":[17],"In":[18],"this":[19,94,106],"paper,":[20],"we":[21,55,71,125],"describe":[22,154],"the":[23,36,41,49,63,84,132,147,155,158,170],"implementation":[24,110,156],"of":[25,35,40,44,52,61,77,86,111,135,157,172,177],"NDP":[26,46,160],"Parallel":[28],"ML":[29],"(PML),":[30],"which":[31,113,124],"part":[34],"Manticore":[37],"system.":[38],"One":[39],"main":[42],"challenges":[43],"implementing":[45],"managing":[48],"decomposition":[51],"work.":[53],"If":[54],"have":[56,74,104],"too":[57,67],"many":[58],"small":[59],"chunks":[60,76],"work,":[62,78],"overhead":[64],"will":[65,80],"be":[66,81],"high,":[68],"but":[69],"if":[70],"do":[72],"not":[73,142],"enough":[75],"processors":[79],"idle.":[82],"Recently,":[83],"technique":[85,107],"Lazy":[87,127],"Binary":[88],"Splitting":[89,129],"was":[90],"proposed":[91],"to":[92,108,117,145],"address":[93],"problem":[95],"for":[96,150],"nested":[97],"loops":[99],"over":[100],"flat":[101],"arrays.":[102,120],"We":[103,153],"adapted":[105],"our":[109],"NDP,":[112],"uses":[114],"binary":[115],"trees":[116],"represent":[118],"This":[121],"new":[122],"technique,":[123],"call":[126],"Tree":[128],"(LTS),":[130],"has":[131],"key":[133],"advantage":[134],"performance":[136,149],"robustness":[137],",":[138],"i.e.,":[139],"it":[140],"does":[141],"require":[143],"tuning":[144],"get":[146],"best":[148],"each":[151],"program.":[152],"standard":[159],"operations":[161],"using":[162],"LTS":[163,173],"and":[164],"present":[165],"experimental":[166],"data":[167],"demonstrate":[169],"scalability":[171],"across":[174],"range":[176],"benchmarks.":[178]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}