{"id":"https://openalex.org/W2108315152","doi":"https://doi.org/10.1145/233561.233564","title":"Improving data locality with loop transformations","display_name":"Improving data locality with loop transformations","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2108315152","doi":"https://doi.org/10.1145/233561.233564","mag":"2108315152"},"language":"en","primary_location":{"id":"doi:10.1145/233561.233564","doi":"https://doi.org/10.1145/233561.233564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/233561.233564","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/233561.233564","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/233561.233564","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087054368","display_name":"Kathryn S. McKinley","orcid":"https://orcid.org/0000-0002-7188-2501","observed_orcids":["https://orcid.org/0000-0002-7188-2501"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kathryn S. McKinley","raw_affiliation_strings":["Computer Science Department, LGRC, University of Massachusetts, Amherst, MA","Computer Science Dept., LGRC, University of Massachusetts, Amherst, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, LGRC, University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Computer Science Dept., LGRC, University of Massachusetts, Amherst, MA#TAB#","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002599549","display_name":"Steve Carr","orcid":"https://orcid.org/0000-0002-8922-0805","observed_orcids":["https://orcid.org/0000-0002-8922-0805"]},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steve Carr","raw_affiliation_strings":["Department of Computer Science, Michigan Technological University, Houghton, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan Technological University, Houghton, MI","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110090957","display_name":"Chau\u2010Wen Tseng","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chau-Wen Tseng","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":24.4052,"has_fulltext":true,"cited_by_count":541,"citation_normalized_percentile":{"value":0.99712396,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"18","issue":"4","first_page":"424","last_page":"453"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/data-locality","display_name":"data locality","score":0.9459999799728394},{"id":"https://openalex.org/keywords/loop-transformation","display_name":"loop transformation","score":0.9549999833106995},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.7979999780654907},{"id":"https://openalex.org/keywords/spatial-reuse","display_name":"spatial reuse","score":0.9990000128746033},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"loop fusion","score":1.0},{"id":"https://openalex.org/keywords/loop-distribution","display_name":"loop distribution","score":0.9879999756813049},{"id":"https://openalex.org/keywords/loop-nests","display_name":"loop nests","score":0.5809999704360962},{"id":"https://openalex.org/keywords/cache-hit-ratio","display_name":"cache hit rate","score":0.8100000023841858},{"id":"https://openalex.org/keywords/scientific-kernels","display_name":"scientific kernels","score":0.6259999871253967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9199110865592957},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.8671272993087769},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.8084739446640015},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7989382743835449},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.7753678560256958},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6511126756668091},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6380903124809265},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6189109086990356},{"id":"https://openalex.org/C27602214","wikidata":"https://www.wikidata.org/wiki/Q1868547","display_name":"Locality of reference","level":3,"score":0.5947153568267822},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5526953339576721},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5035693049430847},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5018670558929443},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.4748689830303192},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.4696321487426758},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.4606615900993347},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4361838698387146},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1443137526512146},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/233561.233564","doi":"https://doi.org/10.1145/233561.233564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/233561.233564","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/233561.233564","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.9215","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.9215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mtu.edu/%7Ecarr/papers/toplas96.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.374.4417","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.4417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/mckinley/papers/toplas-1996.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.1703","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/projects/cosmic/papers/toplas96.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.2602","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.2602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umass.edu/pub/mckinley/toplas.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.585.3989","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.585.3989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www1.ju.edu.jo/ecourse/cpestcourse/readings/ImprovingDataLocalityWithLoopTransformations.pdf","raw_type":"text"},{"id":"pmh:oai:digitalcommons.mtu.edu:michigantech-p-31832","doi":null,"is_oa":false,"landing_page_url":"https://digitalcommons.mtu.edu/michigantech-p/12530","pdf_url":null,"source":{"id":"https://openalex.org/S4377196391","display_name":"Digital Commons - Michigan Tech (Michigan Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I11957088","host_organization_name":"Michigan Technological University","host_organization_lineage":["https://openalex.org/I11957088"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Michigan Tech Publications, Part 1","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1139","doi":null,"is_oa":false,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/141","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:20.500.14394/9801","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.14394/9801","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/233561.233564","doi":"https://doi.org/10.1145/233561.233564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/233561.233564","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/233561.233564","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3492201183","display_name":"RIA: Improving Cache Performance in Scientific Applications","funder_award_id":"9409341","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"},{"id":"https://openalex.org/F4320310133","display_name":"Rice University","ror":"https://ror.org/008zs3103"},{"id":"https://openalex.org/F4320332169","display_name":"Directorate for Computer and Information Science and Engineering","ror":"https://ror.org/025kzpk63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2108315152.pdf","grobid_xml":"https://content.openalex.org/works/W2108315152.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W21449722","https://openalex.org/W178226523","https://openalex.org/W346213406","https://openalex.org/W1489943243","https://openalex.org/W1513554765","https://openalex.org/W1585509108","https://openalex.org/W1588100470","https://openalex.org/W1600567712","https://openalex.org/W1601372155","https://openalex.org/W1843640069","https://openalex.org/W1966708457","https://openalex.org/W1971065013","https://openalex.org/W1986906448","https://openalex.org/W2010418442","https://openalex.org/W2031185609","https://openalex.org/W2040314537","https://openalex.org/W2043555680","https://openalex.org/W2077960035","https://openalex.org/W2078113878","https://openalex.org/W2098220211","https://openalex.org/W2102171686","https://openalex.org/W2102582914","https://openalex.org/W2119609467","https://openalex.org/W2134907441","https://openalex.org/W2135736783","https://openalex.org/W2135992106","https://openalex.org/W2138007781","https://openalex.org/W2150334562","https://openalex.org/W2158158791","https://openalex.org/W2296218291","https://openalex.org/W2475431187","https://openalex.org/W2585550685","https://openalex.org/W3004256893","https://openalex.org/W4232707757","https://openalex.org/W4234643798","https://openalex.org/W6670022321","https://openalex.org/W6979732046"],"related_works":["https://openalex.org/W4256622436","https://openalex.org/W7099784331","https://openalex.org/W7100834455","https://openalex.org/W175074385","https://openalex.org/W2128145051","https://openalex.org/W4238138329","https://openalex.org/W7095355789","https://openalex.org/W7099442219","https://openalex.org/W7097842373","https://openalex.org/W7096453792"],"abstract_inverted_index":{"In":[0,34],"the":[1,35,74,124,138,152,172],"past":[2],"decade,":[3],"processor":[4],"speed":[5],"has":[6],"become":[7],"significantly":[8],"faster":[9],"than":[10],"memory":[11],"speed.":[12],"Small,":[13],"fast":[14],"cache":[15,63,145],"memories":[16],"are":[17,25,171],"designed":[18],"to":[19,42,65,161,185],"overcome":[20],"this":[21,36],"discrepancy,":[22],"but":[23],"they":[24],"only":[26],"effective":[27],"when":[28],"programs":[29,108,157,189],"exhibit":[30],"data":[31,44,164,198],"locality":[32,45],".":[33],"article,":[37],"we":[38,95,136],"present":[39],"compiler":[40],"optimizations":[41,202],"improve":[43,162],"based":[46],"on":[47,102],"a":[48,103,129],"simple":[49],"yet":[50],"accurate":[51],"cost":[52,71],"model.":[53],"The":[54,70],"model":[55,72,117],"computes":[56],"both":[57],"temporal":[58],"and":[59,87,99,109,118,122,140,143,158,177],"spatial":[60],"reuse":[61],"of":[62,76,80,106,155,174],"lines":[64],"find":[66],"desirable":[67],"loop":[68,81,83,85,88,126],"organizations.":[69],"drives":[73],"application":[75],"compound":[77],"transformations":[78],"consisting":[79],"permutation,":[82],"fusion,":[84],"distribution,":[86],"reversal.":[89],"To":[90,166],"validate":[91],"our":[92,97,116,159,167,201],"optimization":[93],"strategy,":[94],"implemented":[96],"algorithms":[98],"ran":[100],"experiments":[101],"large":[104],"collection":[105],"scientific":[107],"kernels.":[110],"Experiments":[111],"illustrate":[112],"that":[113],"for":[114,128,196],"kernels":[115],"algorithm":[119],"can":[120],"select":[121],"achieve":[123,186],"best":[125],"structure":[127],"nest.":[130],"For":[131],"over":[132],"30":[133],"complete":[134],"applications,":[135],"executed":[137],"original":[139],"transformed":[141],"versions":[142],"simulated":[144],"hit":[146,193],"rates.":[147],"We":[148,179],"collected":[149],"statistics":[150],"about":[151],"inherent":[153],"characteristics":[154],"these":[156,169],"ability":[160],"their":[163],"locality.":[165],"knowledge,":[168],"studies":[170],"first":[173],"such":[175],"breadth":[176],"depth.":[178],"found":[180],"performance":[181],"improvements":[182],"were":[183],"difficult":[184],"bacause":[187],"benchmark":[188],"typically":[190],"have":[191],"high":[192],"rates":[194],"even":[195],"small":[197],"caches;":[199],"however,":[200],"significanty":[203],"improved":[204],"several":[205],"programs.":[206]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":17}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}