{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T05:59:44Z","timestamp":1776146384769,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23K03210"],"award-info":[{"award-number":["23K03210"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Approximation Theory"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jat.2026.106301","type":"journal-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:29:54Z","timestamp":1775057394000},"page":"106301","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e55\" altimg=\"si12.svg\">\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>L<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                    <\/mml:math>\n                    -approximation using randomized lattice algorithms"],"prefix":"10.1016","volume":"318","author":[{"given":"Mou","family":"Cai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6055-8055","authenticated-orcid":false,"given":"Takashi","family":"Goda","sequence":"additional","affiliation":[]},{"given":"Yoshihito","family":"Kazashi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jat.2026.106301_b1","first-page":"64","article-title":"Estimates in the mean of the remainder term of quadratic formulas","volume":"1","author":"Bahvalov","year":"1961","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"10.1016\/j.jat.2026.106301_b2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.jat.2016.02.012","article-title":"Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in H\u03b3","volume":"207","author":"Byrenheid","year":"2016","journal-title":"J. Approx. Theory"},{"key":"10.1016\/j.jat.2026.106301_b3","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1007\/s00211-016-0861-7","article-title":"Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness","volume":"136","author":"Byrenheid","year":"2017","journal-title":"Numer. Math."},{"key":"10.1016\/j.jat.2026.106301_b4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1090\/conm\/754\/15150","article-title":"Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters","volume":"754","author":"Cools","year":"2020","journal-title":"Contemp. Math."},{"issue":"328","key":"10.1016\/j.jat.2026.106301_b5","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1090\/mcom\/3586","article-title":"Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights","volume":"90","author":"Cools","year":"2021","journal-title":"Math. Comp."},{"issue":"3","key":"10.1016\/j.jat.2026.106301_b6","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1214\/11-AOS880","article-title":"Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands","volume":"39","author":"Dick","year":"2011","journal-title":"Ann. Stat."},{"issue":"338","key":"10.1016\/j.jat.2026.106301_b7","first-page":"2771","article-title":"Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate","volume":"91","author":"Dick","year":"2022","journal-title":"Math. Comp."},{"issue":"4\u20136","key":"10.1016\/j.jat.2026.106301_b8","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.jco.2007.03.004","article-title":"Lattice-Nystr\u00f6m method for fredholm integral equations of the second kind with convolution type kernels","volume":"23","author":"Dick","year":"2007","journal-title":"J. Complexity"},{"key":"10.1016\/j.jat.2026.106301_b9","series-title":"Springer Series in Computational Mathematics","article-title":"Lattice Rules: Numerical Integration, Approximation, and Discrepancy","author":"Dick","year":"2022"},{"issue":"357","key":"10.1016\/j.jat.2026.106301_b10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/mcom\/4051","article-title":"A randomized lattice rule without component-by-component construction","volume":"95","author":"Goda","year":"2026","journal-title":"Math. Comp."},{"issue":"5","key":"10.1016\/j.jat.2026.106301_b11","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1007\/s10208-014-9226-8","article-title":"Construction of interlaced scrambled polynomial lattice rules of arbitrary high order","volume":"15","author":"Goda","year":"2015","journal-title":"Found. Comput. Math."},{"issue":"348","key":"10.1016\/j.jat.2026.106301_b12","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1090\/mcom\/3910","article-title":"Randomizing the trapezoidal rule gives the optimal RMSE rate in Gaussian Sobolev spaces","volume":"93","author":"Goda","year":"2024","journal-title":"Math. Comp."},{"key":"10.1016\/j.jat.2026.106301_b13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00211-021-01242-3","article-title":"Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification","volume":"150","author":"Kaarnioja","year":"2022","journal-title":"Numer. Math."},{"issue":"4","key":"10.1016\/j.jat.2026.106301_b14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.jco.2015.02.004","article-title":"Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling","volume":"31","author":"K\u00e4mmerer","year":"2015","journal-title":"J. Complexity"},{"key":"10.1016\/j.jat.2026.106301_b15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jat.2019.05.001","article-title":"Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices","volume":"246","author":"K\u00e4mmerer","year":"2019","journal-title":"J. Approx. Theory"},{"issue":"4","key":"10.1016\/j.jat.2026.106301_b16","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1007\/s10208-020-09481-w","article-title":"Function values are enough for L2-approximation","volume":"21","author":"Krieg","year":"2021","journal-title":"Found. Comput. Math."},{"key":"10.1016\/j.jat.2026.106301_b17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jat.2018.09.011","article-title":"Lattice rules with random n achieve nearly the optimal O(n\u2212\u03b1\u22121\/2) error independently of the dimension","volume":"240","author":"Kritzer","year":"2019","journal-title":"J. Approx. Theory"},{"issue":"330","key":"10.1016\/j.jat.2026.106301_b18","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1090\/mcom\/3595","article-title":"Function integration, reconstruction and approximation using rank-1 lattices","volume":"90","author":"Kuo","year":"2021","journal-title":"Math. Comp."},{"issue":"1","key":"10.1016\/j.jat.2026.106301_b19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00365-024-09688-y","article-title":"Constructing embedded lattice-based algorithms for multivariate function approximation with a composite number of points","volume":"61","author":"Kuo","year":"2025","journal-title":"Constr. Approx."},{"key":"10.1016\/j.jat.2026.106301_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.jco.2023.101785","article-title":"Random-prime\u2013fixed-vector randomised lattice-based algorithm for high-dimensional integration","volume":"79","author":"Kuo","year":"2023","journal-title":"J. Complexity"},{"key":"10.1016\/j.jat.2026.106301_b21","series-title":"Monte Carlo and Quasi-Monte Carlo Methods 2004","first-page":"289","article-title":"Lattice rules for multivariate approximation in the worst case setting","author":"Kuo","year":"2006"},{"key":"10.1016\/j.jat.2026.106301_b22","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079794","article-title":"Deterministic and Stochastic Error Bounds in Numerical Analysis","author":"Novak","year":"1988"},{"issue":"1","key":"10.1016\/j.jat.2026.106301_b23","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0885-064X(92)90032-7","article-title":"Optimal linear randomized methods for linear operators in Hilbert spaces","volume":"8","author":"Novak","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/j.jat.2026.106301_b24","series-title":"EMS Tracts in Mathematics","doi-asserted-by":"crossref","DOI":"10.4171\/026","article-title":"Tractability of Multivariate Problems, Volume I: Linear Information","author":"Novak","year":"2008"},{"key":"10.1016\/j.jat.2026.106301_b25","series-title":"EMS Tracts in Mathematics","doi-asserted-by":"crossref","DOI":"10.4171\/084","article-title":"Tractability of Multivariate Problems, Volume II: Standard Information for Functionals","author":"Novak","year":"2010"},{"issue":"254","key":"10.1016\/j.jat.2026.106301_b26","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1090\/S0025-5718-06-01785-6","article-title":"Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces","volume":"75","author":"Nuyens","year":"2006","journal-title":"Math. Comp."},{"key":"10.1016\/j.jat.2026.106301_b27","series-title":"Monte Carlo and Quasi-Monte Carlo Methods 2022","first-page":"507","article-title":"A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with 0<\u03b1\u22641\/2","author":"Nuyens","year":"2024"},{"issue":"4","key":"10.1016\/j.jat.2026.106301_b28","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1214\/aos\/1031594731","article-title":"Scrambled net variance for integrals of smooth functions","volume":"25","author":"Owen","year":"1997","journal-title":"Ann. Stat."},{"key":"10.1016\/j.jat.2026.106301_b29","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Illinois J. Math."},{"issue":"1","key":"10.1016\/j.jat.2026.106301_b30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcom.1997.0463","article-title":"When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?","volume":"14","author":"Sloan","year":"1998","journal-title":"J. Complexity"},{"issue":"3","key":"10.1016\/j.jat.2026.106301_b31","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1137\/16M1075557","article-title":"A Monte Carlo method for integration of multivariate smooth functions","volume":"55","author":"Ullrich","year":"2017","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.jat.2026.106301_b32","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s00365-009-9072-0","article-title":"Spline methods using integration lattices and digital nets","volume":"30","author":"Zeng","year":"2009","journal-title":"Constr. Approx."},{"key":"10.1016\/j.jat.2026.106301_b33","series-title":"Monte Carlo and Quasi-Monte Carlo Methods 2004","first-page":"501","article-title":"Error analysis of splines for periodic problems using lattice designs","author":"Zeng","year":"2006"}],"container-title":["Journal of Approximation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0021904526000183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0021904526000183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T05:17:36Z","timestamp":1776143856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0021904526000183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":33,"alternative-id":["S0021904526000183"],"URL":"https:\/\/doi.org\/10.1016\/j.jat.2026.106301","relation":{},"ISSN":["0021-9045"],"issn-type":[{"value":"0021-9045","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"-approximation using randomized lattice algorithms","name":"articletitle","label":"Article Title"},{"value":"Journal of Approximation Theory","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jat.2026.106301","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"106301"}}