{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:53:18Z","timestamp":1775487198056,"version":"3.50.1"},"reference-count":163,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100012470","name":"CERN","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012470","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Softw Big Sci"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Research in high energy physics (HEP) requires huge amounts of computing and storage, putting strong constraints on the code speed and resource usage. To meet these requirements, a compiled high-performance language is typically used; while for physicists, who focus on the application when developing the code, better research productivity pleads for a high-level programming language. A popular approach consists of combining Python, used for the high-level interface, and C++, used for the computing intensive part of the code. A more convenient and efficient approach would be to use a language that provides both high-level programming and high-performance. The Julia programming language, developed at MIT especially to allow the use of a single language in research activities, has followed this path. In this paper the applicability of using the Julia language for HEP research is explored, covering the different aspects that are important for HEP code development: runtime performance, handling of large projects, interface with legacy code, distributed computing, training, and ease of programming. The study shows that the HEP community would benefit from a large scale adoption of this programming language. The HEP-specific foundation libraries that would need to be consolidated are identified.<\/jats:p>","DOI":"10.1007\/s41781-023-00104-x","type":"journal-article","created":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T16:01:56Z","timestamp":1696521716000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Potential of the Julia Programming Language for High Energy Physics Computing"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7312-3699","authenticated-orcid":false,"given":"Jonas","family":"Eschle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7821-8673","authenticated-orcid":false,"given":"Tam\u00e1s","family":"G\u00e1l","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7218-2873","authenticated-orcid":false,"given":"Mos\u00e8","family":"Giordano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3932-5967","authenticated-orcid":false,"given":"Philippe","family":"Gras","sequence":"additional","affiliation":[]},{"given":"Benedikt","family":"Hegner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4048-7584","authenticated-orcid":false,"given":"Lukas","family":"Heinrich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6182-1481","authenticated-orcid":false,"given":"Uwe","family":"Hernandez Acosta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8484-2261","authenticated-orcid":false,"given":"Stefan","family":"Kluth","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3359-0380","authenticated-orcid":false,"given":"Jerry","family":"Ling","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3009-8948","authenticated-orcid":false,"given":"Pere","family":"Mato","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6969-2063","authenticated-orcid":false,"given":"Mikhail","family":"Mikhasenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8415-2543","authenticated-orcid":false,"given":"Alexander","family":"Moreno Brice\u00f1o","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6649-343X","authenticated-orcid":false,"given":"Jim","family":"Pivarski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1216-9738","authenticated-orcid":false,"given":"Konstantinos","family":"Samaras-Tsakiris","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4200-5905","authenticated-orcid":false,"given":"Oliver","family":"Schulz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0182-7088","authenticated-orcid":false,"given":"Graeme Andrew","family":"Stewart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7470-9301","authenticated-orcid":false,"given":"Jan","family":"Strube","sequence":"additional","affiliation":[]},{"given":"Vassil","family":"Vassilev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"key":"104_CR1","unstructured":"Bird I et\u00a0al (2014) Update of the computing models of the WLCG and the LHC experiments. Technical Report CERN-LHCC-2014-014, CERN. https:\/\/cds.cern.ch\/record\/1695401"},{"key":"104_CR2","unstructured":"Collaboration A (2022) ATLAS Software and Computing HL-LHC Roadmap. Technical Report CERN-LHCC-2022-005, LHCC-G-182, CERN, Geneva. http:\/\/cds.cern.ch\/record\/2802918"},{"key":"104_CR3","unstructured":"Software CO (2022) Computing. CMS phase-2 computing model: Update document. Technical Report CERN-CMS-NOTE-2022-008, CERN, Geneva. http:\/\/cds.cern.ch\/record\/2815292"},{"key":"104_CR4","doi-asserted-by":"publisher","first-page":"S08001","DOI":"10.1088\/1748-0221\/3\/08\/S08001","volume":"3","author":"L Evans","year":"2008","unstructured":"Evans L, Bryant P (2008) LHC machine. JINST 3:S08001. https:\/\/doi.org\/10.1088\/1748-0221\/3\/08\/S08001","journal-title":"JINST"},{"key":"104_CR5","doi-asserted-by":"publisher","unstructured":"Apollinari G et\u00a0al (2017) High-luminosity large hadron collider (HL-LHC): technical design report V. 0.1. Technical Report CERN-2017-007-M, CERN. https:\/\/doi.org\/10.23731\/CYRM-2017-004","DOI":"10.23731\/CYRM-2017-004"},{"key":"104_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s41781-018-0018-8","volume":"3","author":"J Albrecht","year":"2019","unstructured":"Albrecht J et al (2019) A roadmap for HEP software and computing R &D for the 2020s. Comput Softw Big Sci 3:7. https:\/\/doi.org\/10.1007\/s41781-018-0018-8","journal-title":"Comput Softw Big Sci"},{"key":"104_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1085\/2\/022006","volume":"1085","author":"E Sexton-Kennedy","year":"2018","unstructured":"Sexton-Kennedy E (2018) HEP software development in the next decade; the views of the HSF community. J Phys Conf Ser 1085:022006. https:\/\/doi.org\/10.1088\/1742-6596\/1085\/2\/022006","journal-title":"J Phys Conf Ser"},{"key":"104_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/396\/5\/052071","volume":"396","author":"V Vassilev","year":"2012","unstructured":"Vassilev V, Canal P, Naumann A, Moneta L, Russo P (2012) Cling\u2013the new interactive interpreter for ROOT 6. J Phys Conf Ser 396:052071. https:\/\/doi.org\/10.1088\/1742-6596\/396\/5\/052071","journal-title":"J Phys Conf Ser"},{"key":"104_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0168-9002(97)00048-X","volume":"389","author":"R Brun","year":"1997","unstructured":"Brun R, Rademakers F (1997) ROOT: an object oriented data analysis framework. Nucl Instrum Meth A. 389:81\u201386. https:\/\/doi.org\/10.1016\/S0168-9002(97)00048-X","journal-title":"Nucl Instrum Meth A."},{"key":"104_CR10","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1016\/j.cpc.2009.08.005","volume":"180","author":"I Antcheva","year":"2009","unstructured":"Antcheva I et al (2009) ROOT\u2013A C++ framework for petabyte data storage, statistical analysis and visualization. 40 YEARS OF CPC: a celebratory issue focused on quality software for high performance, grid and novel computing architectures. Comp Phys Commun 180:2499\u20132512. https:\/\/doi.org\/10.1016\/j.cpc.2009.08.005","journal-title":"Comp Phys Commun"},{"key":"104_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: a fresh approach to numerical computing. SIAM Rev 59:65\u201398. https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev"},{"key":"104_CR12","doi-asserted-by":"publisher","DOI":"10.1145\/3276490","author":"J Bezanson","year":"2018","unstructured":"Bezanson J et al (2018) Julia: dynamism and performance reconciled by design. Proc ACM Program Lang. https:\/\/doi.org\/10.1145\/3276490","journal-title":"Proc ACM Program Lang"},{"key":"104_CR13","unstructured":"Bezanson J, Karpinski S, Shah VB, Edelman A (2012) Why we created Julia. https:\/\/julialang.org\/blog\/2012\/02\/why-we-created-julia\/"},{"key":"104_CR14","unstructured":"Julia Computing (2022) Newsletter january 2022\u2013julia growth statistics. https:\/\/juliacomputing.com\/blog\/2022\/01\/newsletter-january\/"},{"key":"104_CR15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s41781-021-00053-3","volume":"5","author":"M Stanitzki","year":"2021","unstructured":"Stanitzki M, Strube J (2021) Performance of Julia for high energy physics analyses. Comput Softw Big Sci 5:10. https:\/\/doi.org\/10.1007\/s41781-021-00053-3","journal-title":"Comput Softw Big Sci"},{"key":"104_CR16","unstructured":"Go 2 error handling feedback. https:\/\/github.com\/golang\/go\/wiki\/Go2ErrorHandlingFeedback. Accessed 12 Oct 2021"},{"key":"104_CR17","doi-asserted-by":"publisher","unstructured":"Rackauckas C (2021) ModelingToolkit, modelica, and modia: the composable modeling future in Julia. Winnower. https:\/\/doi.org\/10.15200\/winn.162133.39054","DOI":"10.15200\/winn.162133.39054"},{"key":"104_CR18","unstructured":"Julia Computing NVIDIA Julia computing brings support for NVIDIA GPU computing on Arm powered servers. https:\/\/juliacomputing.com\/blog\/2019\/12\/nvidia-ngc-arm. Accessed 12 Oct 2021"},{"key":"104_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jpdc.2018.12.008","volume":"127","author":"J Regier","year":"2019","unstructured":"Regier J et al (2019) Cataloging the visible universe through Bayesian inference in Julia at Petascale. J Parallel Distrib Comput 127:89\u2013104. https:\/\/doi.org\/10.1016\/j.jpdc.2018.12.008","journal-title":"J Parallel Distrib Comput"},{"key":"104_CR20","unstructured":"Claster A, Julia Joins Petaflop Club. https:\/\/juliacomputing.com\/media\/2017\/09\/julia-joins-petaflop-club. (accessed October 12, 2021)"},{"key":"104_CR21","unstructured":"The LuaJIT project website. https:\/\/luajit.org. Accessed 7 Apr 2022"},{"key":"104_CR22","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.scico.2013.02.001","volume":"98","author":"CF Bolz","year":"2015","unstructured":"Bolz CF, Tratt L (2015) The impact of meta-tracing on VM design and implementation. Sci Comp Program 98:408\u2013421. https:\/\/doi.org\/10.1016\/j.scico.2013.02.001","journal-title":"Sci Comp Program"},{"key":"104_CR23","unstructured":"Pypy project website. https:\/\/www.pypy.org\/. Accessed 7 Apr 2022"},{"key":"104_CR24","unstructured":"Stroustrup B (2018) A Tour of C++ C++ in-depth series. Pearson Education"},{"key":"104_CR25","unstructured":"Stroustrup B (1994) The design and evolution of C++. Pearson Education"},{"key":"104_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L Cardelli","year":"1985","unstructured":"Cardelli L, Wegner P (1985) On understanding types, data abstraction, and polymorphism. ACM Comput Surv 17:471\u2013523. https:\/\/doi.org\/10.1145\/6041.6042","journal-title":"ACM Comput Surv"},{"key":"104_CR27","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1010000313106","volume":"13","author":"C Strachey","year":"2000","unstructured":"Strachey C (2000) Fundamental concepts in programming languages. High Order Symb Comput 13:11\u201349. https:\/\/doi.org\/10.1023\/A:1010000313106","journal-title":"High Order Symb Comput"},{"key":"104_CR28","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/960112.28702","volume":"21","author":"A Snyder","year":"1986","unstructured":"Snyder A (1986) Encapsulation and inheritance in object-oriented programming languages. SIGPLAN Not 21:38\u201345. https:\/\/doi.org\/10.1145\/960112.28702","journal-title":"SIGPLAN Not"},{"key":"104_CR29","unstructured":"Gamma E, Helm R, Johnson RE, Vlissides J (1995) Design Patterns: Elements of Reusable Object-Oriented Software Addison-Wesley Professional Computing Series, Reading: Addison-Wesley. https:\/\/www.safaribooksonline.com\/library\/view\/design-patterns-elements\/0201633612\/"},{"key":"104_CR30","unstructured":"Python multid-dispatch module (2022) https:\/\/multiple-dispatch.readthedocs.io. Accessed 25 Mar 2022"},{"key":"104_CR31","doi-asserted-by":"publisher","DOI":"10.1145\/3276483","author":"F Zappa Nardelli","year":"2018","unstructured":"Zappa Nardelli F et al (2018) Julia subtyping: a rational reconstruction. Proc ACM Program Lang. https:\/\/doi.org\/10.1145\/3276483","journal-title":"Proc ACM Program Lang"},{"key":"104_CR32","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris CR et al (2020) Array programming with Numpy. Nature 585:357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"104_CR33","doi-asserted-by":"publisher","unstructured":"Gras P (2012). Analysis of the di-muon spectrum using data from the CMS detector taken in 2012. https:\/\/doi.org\/10.7483\/OPENDATA.KS4A.BD5W","DOI":"10.7483\/OPENDATA.KS4A.BD5W"},{"key":"104_CR34","doi-asserted-by":"publisher","unstructured":"Wunsch S (2019). Analysis of the di-muon spectrum using data from the CMS detector taken in 2012. https:\/\/doi.org\/10.7483\/OPENDATA.CMS.AAR1.4NZQ","DOI":"10.7483\/OPENDATA.CMS.AAR1.4NZQ"},{"key":"104_CR35","unstructured":"Dataframes.jl package documentation (2022) https:\/\/dataframes.juliadata.org. Accessed 1 Aug 2022"},{"key":"104_CR36","doi-asserted-by":"publisher","unstructured":"G\u00e1l T, Ling JJ, Amin N (2022) UnROOT: an I\/O library for the CERN ROOT file format written in Julia. J Open Source Softw 7, 4452. https:\/\/doi.org\/10.21105\/joss.04452","DOI":"10.21105\/joss.04452"},{"key":"104_CR37","doi-asserted-by":"publisher","unstructured":"Pivarski J et\u00a0al (2017) Uproot. https:\/\/doi.org\/10.5281\/zenodo.4340632","DOI":"10.5281\/zenodo.4340632"},{"key":"104_CR38","doi-asserted-by":"publisher","unstructured":"Pivarski J et al (2018) Awkward array Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7079705","DOI":"10.5281\/zenodo.7079705"},{"key":"104_CR39","doi-asserted-by":"publisher","unstructured":"Reback J et\u00a0al (2022) pandas-dev\/pandas: Pandas 1.4.4. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7037953","DOI":"10.5281\/zenodo.7037953"},{"key":"104_CR40","unstructured":"The Julia language manual (2021) https:\/\/docs.julialang.org\/en\/v1\/. Accessed 29 Sep 2021"},{"key":"104_CR41","unstructured":"Janssens B CxxWrap code repository. https:\/\/github.com\/JuliaInterop\/CxxWrap.jl. Accessed 17 Mar 2022"},{"key":"104_CR42","unstructured":"Abrahams D, Grosse-Kunstleve RW (2003) Building hybrid systems with Boost.Python. https:\/\/www.boost.org\/doc\/libs\/1_80_0\/libs\/python\/doc\/html\/article.html. Accessed 1 Aug 2022"},{"key":"104_CR43","unstructured":"Pybind11 code repository. https:\/\/github.com\/pybind\/pybind11. Accessed 1 Aug 2022"},{"key":"104_CR44","unstructured":"Gras P Automatic generation of c++\u2013julia bindings. https:\/\/github.com\/grasph\/wrapit. Accessed 17 Mar 2022"},{"key":"104_CR45","unstructured":"Fischer K et\u00a0al Cxx.jl code repository. https:\/\/github.com\/JuliaInterop\/Cxx.jl. Accessed 17 Mar 2022"},{"key":"104_CR46","unstructured":"The linear collider I\/O framework code repository (2022) https:\/\/github.com\/iLCSoft\/LCIO. Accessed 1 Aug 2022"},{"key":"104_CR47","doi-asserted-by":"crossref","unstructured":"Behnke T et\u00a0al (2013) The international linear collider technical design report\u2013volume 1: executive summary. Technical Report, The International Linear Collider. http:\/\/arxiv.org\/abs\/1306.6327","DOI":"10.2172\/1347945"},{"key":"104_CR48","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1140\/epjc\/s10052-012-1896-2","volume":"72","author":"M Cacciari","year":"2012","unstructured":"Cacciari M, Salam GP, Soyez G (2012) Fastjet user manual. Eur Phys J C 72:1896. https:\/\/doi.org\/10.1140\/epjc\/s10052-012-1896-2","journal-title":"Eur Phys J C"},{"key":"104_CR49","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.physletb.2006.08.037","volume":"641","author":"M Cacciari","year":"2006","unstructured":"Dispelling the n3 myth for the kt jet-finde. Phys Lett B 641:57\u201361. https:\/\/doi.org\/10.1016\/j.physletb.2006.08.037","journal-title":"Phys Lett B"},{"key":"104_CR50","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cpc.2006.11.010","volume":"176","author":"J Alwall","year":"2007","unstructured":"Alwall J et al (2007) A standard format for les Houches event files. Comp Phys Commun 176:300\u2013304","journal-title":"Comp Phys Commun"},{"key":"104_CR51","unstructured":"LHEF.jl (2021) https:\/\/github.com\/JuliaHEP\/LHEF.jl. Accessed 29 Sep 2021"},{"key":"104_CR52","doi-asserted-by":"publisher","unstructured":"Strube J, Saba E, TagBot J (2021) jstrube\/lcio.jl: v1.9.2. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.4560484","DOI":"10.5281\/zenodo.4560484"},{"key":"104_CR53","unstructured":"UpROOT.jl library code repository (2021) https:\/\/github.com\/JuliaHEP\/UpROOT.jl. Accessed 29 Sep 2021"},{"key":"104_CR54","doi-asserted-by":"publisher","first-page":"02030","DOI":"10.1051\/epjconf\/202024502030","volume":"245","author":"J Blomer","year":"2020","unstructured":"Blomer J, Canal P, Naumann A, Piparo D (2020) Evolution of the ROOT Tree I\/O. EPJ Web Conf 245:02030. https:\/\/doi.org\/10.1051\/epjconf\/202024502030","journal-title":"EPJ Web Conf"},{"key":"104_CR55","unstructured":"Foundation, T. A.\u00a0S. Apache arrow. https:\/\/arrow.apache.org\/. Accessed 1 Aug 2022"},{"key":"104_CR56","unstructured":"ClusterManagers package code repository. https:\/\/github.com\/JuliaParallel\/ClusterManagers.jl. Accessed 29 Sep 2021"},{"key":"104_CR57","unstructured":"Dask library web site (2021) https:\/\/docs.dask.org. Accessed 29 Sep 2021"},{"key":"104_CR58","unstructured":"Dagger.jl package code repository. https:\/\/github.com\/JuliaParallel\/Dagger.jl. Accessed 29 Sep 2021"},{"key":"104_CR59","doi-asserted-by":"publisher","unstructured":"Litzkow M, Livny M, Mutka M (1988) Condor\u2014a hunter of idle workstations, IEEE, pp 104\u2013111. https:\/\/doi.org\/10.1109\/DCS.1988.12507","DOI":"10.1109\/DCS.1988.12507"},{"key":"104_CR60","unstructured":"HTCondor software website (2021). https:\/\/htcondor.org\/. Accessed 29 Sep 2021"},{"key":"104_CR61","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0010-4655(75)90039-9","volume":"10","author":"F James","year":"1975","unstructured":"James F, Roos M (1975) Minuit: a system for function minimization and analysis of the parameter errors and correlations. Comput Phys Commun 10:343\u2013367. https:\/\/doi.org\/10.1016\/0010-4655(75)90039-9","journal-title":"Comput Phys Commun"},{"key":"104_CR62","unstructured":"James F, Roos M Minuit2 user guide. https:\/\/root.cern\/doc\/master\/md_math_minuit2_doc_Minuit2.html. Accessed 1 Aug 2022"},{"key":"104_CR63","unstructured":"The NLopt module for julia, code repository (2021) https:\/\/github.com\/JuliaOpt\/NLopt.jl. Accessed 29 Sep 2021"},{"key":"104_CR64","unstructured":"Optim.jl package code repository (2021) https:\/\/github.com\/JuliaNLSolvers\/Optim.jl. Accessed 29 Sep 2021"},{"key":"104_CR65","unstructured":"Optimization.jl package code repository (2021) https:\/\/github.com\/SciML\/Optimization.jl. Accessed 29 Sep 2021"},{"key":"104_CR66","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden CG (1970) The convergence of a class of double-rank minimization algorithms 1. General considerations. IMA J Appl Maths 6:76\u201390. https:\/\/doi.org\/10.1093\/imamat\/6.1.76","journal-title":"IMA J Appl Maths"},{"key":"104_CR67","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher R (1970) A new approach to variable metric algorithms. Comput J 13:317\u2013322. https:\/\/doi.org\/10.1093\/comjnl\/13.3.317","journal-title":"Comput J"},{"key":"104_CR68","doi-asserted-by":"publisher","DOI":"10.2307\/2004873","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb D (1970) A family of variable-metric methods derived by variational means. Maths Comput. https:\/\/doi.org\/10.2307\/2004873","journal-title":"Maths Comput"},{"key":"104_CR69","doi-asserted-by":"publisher","DOI":"10.2307\/2004840","author":"DF Shanno","year":"1970","unstructured":"Shanno DF (1970) Conditioning of quasi-newton methods for function minimization. Maths Comput. https:\/\/doi.org\/10.2307\/2004840","journal-title":"Maths Comput"},{"key":"104_CR70","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2020.100508","author":"J Eschle","year":"2019","unstructured":"Eschle J, Puig Navarro A, Silva Coutinho R, Serra N (2019) ZFIT: scalable pythonic fitting. SoftwareX. https:\/\/doi.org\/10.1016\/j.softx.2020.100508","journal-title":"SoftwareX"},{"key":"104_CR71","doi-asserted-by":"publisher","first-page":"06025","DOI":"10.1051\/epjconf\/202024506025","volume":"245","author":"J Eschle","year":"2020","unstructured":"Eschle J, Puig AN, Silva Coutinho R, Serra N (2020) ZFIT: scalable pythonic fitting. EPJ Web Conf 245:06025. https:\/\/doi.org\/10.1051\/epjconf\/202024506025","journal-title":"EPJ Web Conf"},{"key":"104_CR72","first-page":"1","volume":"98","author":"M Besan\u00e7on","year":"2011","unstructured":"Besan\u00e7on M et al (2011) Distributions.jl: Definition and modeling of probability distributions in the Juliastats ecosystem. J Stat Softw 98:1\u201330","journal-title":"J Stat Softw"},{"key":"104_CR73","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2647458","author":"D Lin","year":"2019","unstructured":"Lin D et al (2019) JuliaStats\/Distributions.jl: a Julia package for probability distributions and associated functions. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.2647458","journal-title":"Zenodo"},{"key":"104_CR74","unstructured":"StatsBase.jl package code repository (2021) https:\/\/github.com\/JuliaStats\/StatsBase.jl. Accessed 29 Sep 2021"},{"key":"104_CR75","doi-asserted-by":"publisher","unstructured":"Ling J, Amin N, Jacobsen R, Gal, T (2022) A pure julia 1D\/2D histogram package that focus on speed and thread-safe. https:\/\/doi.org\/10.5281\/zenodo.7191111","DOI":"10.5281\/zenodo.7191111"},{"key":"104_CR76","unstructured":"Breloff T Plots\u2013powerful convenience for vizualisation in Julia. https:\/\/docs.juliaplots.org\/v1.30\/. Accessed 15 Jun 2022"},{"key":"104_CR77","unstructured":"RecipeBase.jl (2022) https:\/\/github.com\/JuliaPlots\/RecipesBase.jl. Accessed 15 Jun 2022"},{"key":"104_CR78","unstructured":"Heinen J et\u00a0al (1985\u20132022) GR framework. https:\/\/gr-framework.org\/. Accessed 15 Jun 2022"},{"key":"104_CR79","unstructured":"Rosario HD, Heinen J (2019\u20132022) GRUtils. https:\/\/heliosdrm.github.io\/GRUtils.j. Accessed 15 Jun 2022"},{"key":"104_CR80","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.21105\/joss.03349","volume":"6","author":"S Danisch","year":"2021","unstructured":"Danisch S, Krumbiegel J (2021) Makie.jl: flexible high-performance data visualization for Julia. J Open Source Softw 6:3349. https:\/\/doi.org\/10.21105\/joss.03349","journal-title":"J Open Source Softw"},{"key":"104_CR81","doi-asserted-by":"publisher","first-page":"026","DOI":"10.21468\/SciPostPhys.8.2.026","volume":"8","author":"C Bierlich","year":"2020","unstructured":"Bierlich C et al (2020) Robust independent validation of experiment and theory: rivet version 3. SciPost Phys 8:026. https:\/\/doi.org\/10.21468\/SciPostPhys.8.2.026","journal-title":"SciPost Phys"},{"key":"104_CR82","unstructured":"PFGPlots code repository (2022) https:\/\/github.com\/JuliaTeX\/PGFPlots.jl. Accessed 15 Jun 2022"},{"key":"104_CR83","unstructured":"PFGPlotsX code repository (2022) https:\/\/github.com\/KristofferC\/PGFPlotsX.jl. Accessed 15 Jun 2022"},{"key":"104_CR84","unstructured":"Gaston code repository (2022) https:\/\/github.com\/mbaz\/Gaston.jl. Accessed 15 Jun 2022"},{"key":"104_CR85","unstructured":"Gnuplot (2022) http:\/\/www.gnuplot.info\/. Accessed 15 Jun 2022"},{"key":"104_CR86","unstructured":"Matplotlib (2022). https:\/\/matplotlib.org\/. Accessed 15 Jun 2022"},{"key":"104_CR87","unstructured":"Vega-Lite (2022) https:\/\/vega.github.io\/vega-lite\/. Accessed 15 Jun 2022"},{"key":"104_CR88","unstructured":"VegaLite.jl code repository (2022) https:\/\/github.com\/queryverse\/VegaLite.jl. Accessed 15 Jun 2022"},{"key":"104_CR89","unstructured":"UnicodePlots code repository (2022) https:\/\/github.com\/JuliaPlots\/UnicodePlots.jl. Accessed 15 Jun 2022"},{"key":"104_CR90","unstructured":"Inc. W\u00a0R (2022) Mathematica, Version 13.1. https:\/\/www.wolfram.com\/mathematica. Champaign"},{"key":"104_CR91","doi-asserted-by":"publisher","unstructured":"van\u00a0der Plas F et\u00a0al (2022) fonsp\/pluto.jl: v0.19.11. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.6916713","DOI":"10.5281\/zenodo.6916713"},{"key":"104_CR92","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0168-9002(03)01368-8","volume":"506","author":"S Agostinelli","year":"2003","unstructured":"Agostinelli S et al (2003) Geant4-a simulation toolkit. NIM-A 506:250\u2013303","journal-title":"NIM-A"},{"key":"104_CR93","doi-asserted-by":"publisher","first-page":"68","DOI":"10.21105\/jcon.00068","volume":"1","author":"S Byrne","year":"2021","unstructured":"Byrne S, Wilcox LC, Churavy V (2021) Mpi.jl: Julia bindings for the message passing interface. Proc JuliaCon Conf 1:68. https:\/\/doi.org\/10.21105\/jcon.00068","journal-title":"Proc JuliaCon Conf"},{"key":"104_CR94","unstructured":"Poulson J et\u00a0al Elemental.jl code repository (2017-2022). https:\/\/github.com\/JuliaParallel\/Elemental.jl. Accessed 17 Mar 2022"},{"key":"104_CR95","unstructured":"Elrod C et\u00a0al Loopvectorization code repository. https:\/\/github.com\/JuliaSIMD\/LoopVectorization.jl. Accessed 17 Mar 2022"},{"key":"104_CR96","doi-asserted-by":"publisher","unstructured":"Abbott M et\u00a0al (2022) mcabbott\/tullio.jl: v0.3.5. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7106192","DOI":"10.5281\/zenodo.7106192"},{"key":"104_CR97","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/3511528.3511535","volume":"55","author":"S Gowda","year":"2022","unstructured":"Gowda S et al (2022) High-performance symbolic-numerics via multiple dispatch. ACM Commun Comput Algebra 55:92\u201396. https:\/\/doi.org\/10.1145\/3511528.3511535","journal-title":"ACM Commun Comput Algebra"},{"key":"104_CR98","unstructured":"Symata.jl (2022) https:\/\/github.com\/jlapeyre\/Symata.jl. Accessed 17 Mar 2022"},{"key":"104_CR99","unstructured":"MathLink.jl (2022) https:\/\/github.com\/JuliaInterop\/MathLink.jl. Accessed 15 Mar 2022"},{"key":"104_CR100","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/3511528.3511535","volume":"55","author":"S Gowda","year":"2021","unstructured":"Gowda S et al (2021) High-performance symbolic-numerics via multiple dispatch. ACM Commun Comput Algebra 55:92\u201396. https:\/\/doi.org\/10.1145\/3511528.3511535","journal-title":"ACM Commun Comput Algebra"},{"key":"104_CR101","unstructured":"(2022) https:\/\/sciml.ai\/. Accessed 1 Aug 2022"},{"key":"104_CR102","doi-asserted-by":"publisher","first-page":"15","DOI":"10.5334\/jors.151","volume":"5","author":"C Rackauckas","year":"2017","unstructured":"Rackauckas C, Nie Q (2017) Differentialequations.jl\u2013a performant and feature-rich ecosystem for solving differential equations in Julia. J Open Res Softw 5:15. https:\/\/doi.org\/10.5334\/jors.151","journal-title":"J Open Res Softw"},{"key":"104_CR103","unstructured":"JuliaSymbolics roadmap: a modern computer algebra system for a modern language (2022) https:\/\/juliasymbolics.org\/roadmap\/. Accessed 16 Mar 2022"},{"key":"104_CR104","unstructured":"Ma Y et\u00a0al (2021) Modelingtoolkit: a composable graph transformation system for equation-based modeling. http:\/\/arxiv.org\/abs\/2103.05244"},{"key":"104_CR105","unstructured":"SymbolicUtils.jl (2022) https:\/\/github.com\/JuliaSymbolics\/SymbolicUtils.jl. Accessed 15 Mar 2022"},{"key":"104_CR106","unstructured":"MathLinkExtras.jl (2022) https:\/\/github.com\/fremling\/MathLinkExtras.jl. Accessed 17 Mar 2022"},{"key":"104_CR107","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s41781-021-00055-1","volume":"5","author":"S Amoroso","year":"2021","unstructured":"Amoroso S et al (2021) Challenges in monte Carlo event generator software for high-luminosity LHC. Comput Softw Big Sci. 5:12. https:\/\/doi.org\/10.1007\/s41781-021-00055-1","journal-title":"Comput Softw Big Sci."},{"key":"104_CR108","doi-asserted-by":"publisher","first-page":"03045","DOI":"10.1051\/epjconf\/202125103045","volume":"251","author":"A Valassi","year":"2021","unstructured":"Valassi A, Roiser S, Mattelaer O, Hageboeck S (2021) Design and engineering of a simplified workflow execution for the MG5aMC event generator on GPUs and vector CPUs. EPJ Web Conf. 251:03045. https:\/\/doi.org\/10.1051\/epjconf\/202125103045","journal-title":"EPJ Web Conf."},{"key":"104_CR109","unstructured":"DaggerGPU package code repository (2021) https:\/\/github.com\/JuliaGPU\/DaggerGPU.jl. Accessed 29 Sep 2021"},{"key":"104_CR110","unstructured":"Preston-Werner T (2013) Semantic versioning 2.0.0. http:\/\/semver.org"},{"key":"104_CR111","unstructured":"Expression problem (2022) https:\/\/en.wikipedia.org\/wiki\/Expression_problem. Champaign"},{"key":"104_CR112","doi-asserted-by":"publisher","unstructured":"Reynolds JC (1978) User-Defined types and procedural data structures as complementary approaches to data abstraction, New York: Springer, pp 309\u2013317 . https:\/\/doi.org\/10.1007\/978-1-4612-6315-9_22","DOI":"10.1007\/978-1-4612-6315-9_22"},{"key":"104_CR113","unstructured":"Revise package code repository (2021) https:\/\/github.com\/timholy\/Revise.jl. Accessed 29 Sep 2021"},{"key":"104_CR114","unstructured":"JAX library code repository (2021) https:\/\/github.com\/google\/jax. Accessed 29 Sep 2021"},{"key":"104_CR115","unstructured":"TensorFlow web site (2021) https:\/\/www.tensorflow.org. Accessed 29 Sep 2021"},{"key":"104_CR116","unstructured":"PyTorch web site (2021) https:\/\/pytorch.org\/. Accessed 29 Sep 2021"},{"key":"104_CR117","doi-asserted-by":"publisher","unstructured":"White FC et\u00a0al (2022) Juliadiff\/chainrules.jl: v1.44.7. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7182461","DOI":"10.5281\/zenodo.7182461"},{"key":"104_CR118","unstructured":"Juliadiff organisation website. https:\/\/juliadiff.org\/. Accessed 7 Apr 2022"},{"key":"104_CR119","unstructured":"Lorentzvectorhep. https:\/\/github.com\/JuliaHEP\/LorentzVectorHEP.jl. Accessed 17 Mar 2022"},{"key":"104_CR120","unstructured":"Table.jl. https:\/\/tables.juliadata.org\/stable\/. Accessed 17 Mar 2022"},{"key":"104_CR121","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s42979-021-00626-4","volume":"2","author":"O Schulz","year":"2021","unstructured":"Schulz O et al (2021) Bat.jl: a Julia-based tool for Bayesian inference. SN Comp Sci 2:210. https:\/\/doi.org\/10.1007\/s42979-021-00626-4","journal-title":"SN Comp Sci"},{"key":"104_CR122","unstructured":"Ge H, Xu K, Ghahramani Z (2018) Turing: a language for flexible probabilistic inference, 1682\u20131690 MLR Press. In: proceedings of the Conference on Artificial Intelligence and Statistics, AISTATS 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain. http:\/\/proceedings.mlr.press\/v84\/ge18b.html"},{"key":"104_CR123","unstructured":"Gabler P, Schulz O, Widmann D et\u00a0al Densityinterface.jl code repository (2021-2022). https:\/\/github.com\/JuliaMath\/DensityInterface.jl. Accessed 23 Nov 2022"},{"key":"104_CR124","unstructured":"Plavin A, Scherrer C, Schulz O, Widmann D et\u00a0al Inversefunctions.jl code repository (2021-2022). https:\/\/github.com\/JuliaMath\/InverseFunctions.jl. Accessed 23 Nov 2022"},{"key":"104_CR125","unstructured":"Schulz O, Widmann D et\u00a0al Changesofvariables.jl code repository (2021-2022). https:\/\/github.com\/JuliaMath\/ChangesOfVariables.jl. Accessed 23 Nov 2022"},{"key":"104_CR126","unstructured":"Collaboration TA, Collaboration TC, Group TLHC (2011) Procedure for the LHC higgs boson search combination in summer 2011. Technical Report CMS-NOTE-2011-005, ATL-PHYS-PUB-2011-011, ATL-PHYS-PUB-2011-11, CERN, Geneva. https:\/\/cds.cern.ch\/record\/1379837"},{"key":"104_CR127","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.physletb.2012.02.064","volume":"710","author":"S Chatrchyan","year":"2012","unstructured":"Chatrchyan S et al (2012) Combined results of searches for the standard model Higgs boson in pp collisions at \u221as = 7TeV. Phys Lett B 710:26\u201348. https:\/\/doi.org\/10.1016\/j.physletb.2012.02.064","journal-title":"Phys Lett B"},{"key":"104_CR128","unstructured":"Collaboration TA (2012) Observation of an excess of events in the search for the standard model Higgs boson with the ATLAS detector at the LHC. https:\/\/cds.cern.ch\/record\/1460439. ATLAS-CONF-2012-093"},{"key":"104_CR129","doi-asserted-by":"publisher","unstructured":"Cowan G, Cranmer K, Gross E, Vitells O (2011) Asymptotic formulae for likelihood-based tests of new physics. Eur Phys J. https:\/\/doi.org\/10.1140\/epjc\/s10052-011-1554-0. [Erratum: Eur. Phys. J. C 73, 2501 (2013)]","DOI":"10.1140\/epjc\/s10052-011-1554-0"},{"key":"104_CR130","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0168-9002(99)00498-2","volume":"434","author":"T Junk","year":"1999","unstructured":"Junk T (1999) Confidence level computation for combining searches with small statistics. Nucl Instrum Meth A 434:435\u2013443. https:\/\/doi.org\/10.1016\/S0168-9002(99)00498-2","journal-title":"Nucl Instrum Meth A"},{"key":"104_CR131","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1088\/0954-3899\/28\/10\/313","volume":"28","author":"AL Read","year":"2002","unstructured":"Read AL (2002) Presentation of search results: the CL(s) technique. J Phys G 28:2693\u20132704. https:\/\/doi.org\/10.1088\/0954-3899\/28\/10\/313","journal-title":"J Phys G"},{"key":"104_CR132","doi-asserted-by":"publisher","unstructured":"Fisher W (2006) Systematics and limit calculations. FERMILAB-TM-2386-E, D0-NOTE-5309. https:\/\/doi.org\/10.2172\/923070","DOI":"10.2172\/923070"},{"key":"104_CR133","unstructured":"Junk T (2006) Sensitivity, exclusion and discovery with small signals, large backgrounds, and large systematic uncertainties. https:\/\/inspirehep.net\/literature\/1361506. CDF-8128, CDF-Note-8128"},{"key":"104_CR134","doi-asserted-by":"publisher","DOI":"10.1142\/9781860948985_0039","author":"W Verkerke","year":"2006","unstructured":"Verkerke W, Kirkby D (2006) The RooFit toolkit for data modeling. World Sci. https:\/\/doi.org\/10.1142\/9781860948985_0039","journal-title":"World Sci"},{"key":"104_CR135","unstructured":"Boutigny D et\u00a0al (1995) BaBar technical design report. SLAC-R-457 http:\/\/www.slac.stanford.edu\/cgi-wrap\/getdoc\/slac-r-457.pdf"},{"key":"104_CR136","unstructured":"Cranmer K, Lewis G, Moneta L, Shibata A, Verkerke W (2012) HistFactory: A tool for creating statistical models for use with RooFit and RooStats. CERN-OPEN-2012-016. https:\/\/cds.cern.ch\/record\/1456844"},{"key":"104_CR137","unstructured":"ATLAS, CMS, LHC Higgs Combination Group (2011) Procedure for the LHC Higgs boson search combination in Summer 2011. CMS-NOTE-2011-005, ATL-PHYS-PUB-2011-11. https:\/\/cds.cern.ch\/record\/1379837"},{"key":"104_CR138","unstructured":"HiggsCombine code repository. https:\/\/github.com\/cms-analysis\/HiggsAnalysis-CombinedLimit. Accessed 1 Aug 2022"},{"key":"104_CR139","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.21105\/joss.02823","volume":"6","author":"L Heinrich","year":"2021","unstructured":"Heinrich L, Feickert M, Stark G, Cranmer K (2021) PYHF: pure-Python implementation of HistFactory statistical models. J Open Source Softw 6:2823. https:\/\/doi.org\/10.21105\/joss.02823","journal-title":"J Open Source Softw"},{"key":"104_CR140","doi-asserted-by":"publisher","unstructured":"Ling J (2022) LiteHF.jl: Julia implementation of HistFactory-style likelihood ratio methods and test statistics. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.7435541","DOI":"10.5281\/zenodo.7435541"},{"key":"104_CR141","doi-asserted-by":"publisher","unstructured":"Blobel V (2013) Unfolding, Ch.\u00a06, 187\u2013225 John Wiley and Sons, Ltd, https:\/\/doi.org\/10.1002\/9783527653416.ch6","DOI":"10.1002\/9783527653416.ch6"},{"key":"104_CR142","doi-asserted-by":"publisher","first-page":"T10003","DOI":"10.1088\/1748-0221\/7\/10\/T10003","volume":"7","author":"S Schmitt","year":"2012","unstructured":"Schmitt S (2012) TUnfold: an algorithm for correcting migration effects in high energy physics. JINST 7:T10003. https:\/\/doi.org\/10.1088\/1748-0221\/7\/10\/T10003","journal-title":"JINST"},{"key":"104_CR143","doi-asserted-by":"publisher","unstructured":"Adye T (2011) in Proceeedings of the PHYSTAT 2011 workshop on statistical issues related to discovery claims in search experiments and unfolding Prosper H, Lyons L. (eds) Unfolding algorithms and tests using RooUnfold 313\u2013318 (CERN, Geneva, 2011). https:\/\/doi.org\/10.5170\/CERN-2011-006.313. arXiv:1105.1160","DOI":"10.5170\/CERN-2011-006.313"},{"key":"104_CR144","doi-asserted-by":"publisher","first-page":"2050145","DOI":"10.1142\/S0217751X20501456","volume":"35","author":"L Brenner","year":"2020","unstructured":"Brenner L et al (2020) Comparison of unfolding methods using RooFitUnfold. Int J Mod Phys A 35:2050145. https:\/\/doi.org\/10.1142\/S0217751X20501456","journal-title":"Int J Mod Phys A"},{"key":"104_CR145","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.124.182001","volume":"124","author":"A Andreassen","year":"2020","unstructured":"Andreassen A, Komiske PT, Metodiev EM, Nachman B, Thaler J (2020) OmniFold: a method to simultaneously unfold all observables. Phys Rev Lett 124:182001. https:\/\/doi.org\/10.1103\/PhysRevLett.124.182001","journal-title":"Phys Rev Lett"},{"key":"104_CR146","unstructured":"Pharmaceutical development, pfizer uses julia to accelerate simulations of new therapies for metabolic diseases up to 175x. https:\/\/juliacomputing.com\/case-studies\/pfizer\/. Accessed 1 Aug 2022"},{"key":"104_CR147","unstructured":"(Moderna), H\u00a0A Modeling and simulation to guide dose selection for mRNA therapeutics and vaccines. Presented at the JuliaCon 2022 conference. https:\/\/live.juliacon.org\/talk\/9N9HZ3."},{"key":"104_CR148","unstructured":"Predicting toxicity. https:\/\/juliacomputing.com\/case-studies\/astra-zeneca\/. Accessed 1 Aug 2022"},{"key":"104_CR149","unstructured":"https:\/\/juliacomputing.com\/industries\/banking-and-finance\/. Accessed 1 Aug 2022"},{"key":"104_CR150","unstructured":"Solvency II compliance, one of Europe\u2019s largest insurers is using Julia for solvency II compliance. https:\/\/juliacomputing.com\/case-studies\/aviva\/. Accessed 1 Aug 2022"},{"key":"104_CR151","unstructured":"Macroeconomic modeling, the Federal reserve bank of New York publishes its trademark dynamic stochastic general equilibrium models in Julia. https:\/\/juliacomputing.com\/case-studies\/ny-fed\/. Accessed 1 Aug 2022"},{"key":"104_CR152","unstructured":"Holy T, Bezanson J, Nash J Analyzing sources of compiler latency in Julia: method invalidations. https:\/\/julialang.org\/blog\/2020\/08\/invalidations\/. Accessed 7 Apr 2022"},{"key":"104_CR153","unstructured":"Holy T Tutorial on precompilation. https:\/\/julialang.org\/blog\/2021\/01\/precompile_tutorial\/. Accessed 14 Oct 2022"},{"key":"104_CR154","unstructured":"SnoopCompile package code repository (2021) https:\/\/github.com\/timholy\/SnoopCompile.jl. Accessed 29 Sep 2021"},{"key":"104_CR155","unstructured":"PrecompileTools package code repository (2023) https:\/\/github.com\/JuliaLang\/PrecompileTools.jl. Accessed 5 Jun 2023"},{"key":"104_CR156","unstructured":"Packagecompiler manual: Sysimages. https:\/\/julialang.github.io\/PackageCompiler.jl\/v2.0\/sysimages.html. Accessed 15 Jun 2022"},{"key":"104_CR157","unstructured":"Collaboration C. CMS offline software repository. https:\/\/github.com\/cms-sw\/cmssw. Accessed 1 Aug 2022"},{"key":"104_CR158","unstructured":"Tokei computer program code repository (2021) https:\/\/github.com\/XAMPPRocky\/tokei. Accessed 29 Sep 2021"},{"key":"104_CR159","unstructured":"Differentialequations.jl: Scientific machine learning (SciML) enabled simulation and estimation. https:\/\/diffeq.sciml.ai\/v7.3.0\/. Accessed 15 Jun 2022"},{"key":"104_CR160","unstructured":"Holy T, Churavy V (2022) Improvements in package precompilation. Talk given at JuliaCon 2022. https:\/\/live.juliacon.org\/talk\/DUQQLN."},{"key":"104_CR161","unstructured":"Documenter.jl, a documentation generator for Julia. https:\/\/juliadocs.github.io\/Documenter.jl\/v0.27\/. Accessed 15 Jun 2022"},{"key":"104_CR162","unstructured":"Abgrall N et\u00a0al (2021) The Large enriched germanium experiment for neutrinoless\u00a0\u03b2\u03b2\u00a0decay: LEGEND-1000 preconceptual design report. http:\/\/arxiv.org\/abs\/2107.11462"},{"key":"104_CR163","unstructured":"Evaluation strategy. https:\/\/en.wikipedia.org\/wiki\/Evaluation_strateg. Accessed 1 Aug 2022"}],"container-title":["Computing and Software for Big Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-023-00104-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41781-023-00104-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-023-00104-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T16:19:51Z","timestamp":1696522791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41781-023-00104-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,5]]},"references-count":163,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["104"],"URL":"https:\/\/doi.org\/10.1007\/s41781-023-00104-x","relation":{},"ISSN":["2510-2036","2510-2044"],"issn-type":[{"value":"2510-2036","type":"print"},{"value":"2510-2044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,5]]},"assertion":[{"value":"6 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"10"}}