{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T23:02:11Z","timestamp":1780527731974,"version":"3.54.1"},"reference-count":75,"publisher":"Oxford University Press (OUP)","license":[{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-2453378"],"award-info":[{"award-number":["IIS-2453378"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-2610618"],"award-info":[{"award-number":["DMS-2610618"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1956330"],"award-info":[{"award-number":["IIS-1956330"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Robert H. Topel Faculty Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We introduce a new method for neighbourhood selection in linear structural equation models that improves over classical methods such as best subset selection (BSS) and the Lasso. Our method, called KL-BSS, takes advantage of the existence of underlying structure in SEM\u2014even when this structure is unknown\u2014and is easily implemented using existing solvers. Under weaker eigenvalue conditions compared to BSS and the Lasso, KL-BSS can provably recover the support of linear models with fewer samples. We establish both the pointwise and minimax sample complexity for support recovery, which KL-BSS obtains. Extensive experiments on both real and simulated data confirm the improvements offered by KL-BSS. While it is well-known that the Lasso encounters difficulties under structured dependencies, it is less well-known that even BSS runs into trouble as well, and can be substantially improved. These results have implications for structure learning in graphical models, which often relies on neighbourhood selection as a subroutine.<\/jats:p>","DOI":"10.1093\/jrsssb\/qkag078","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T11:43:49Z","timestamp":1779277429000},"source":"Crossref","is-referenced-by-count":0,"title":["KL-BSS: rethinking optimality for neighbourhood selection in structural equation models"],"prefix":"10.1093","author":[{"given":"Ming","family":"Gao","sequence":"first","affiliation":[{"name":"University of Chicago Booth School of Business, , Chicago, IL ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wai Ming","family":"Tai","sequence":"additional","affiliation":[{"name":"University of Chicago Booth School of Business, , Chicago, IL ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryon","family":"Aragam","sequence":"additional","affiliation":[{"name":"University of Chicago Booth School of Business, , Chicago, IL ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"issue":"10","key":"2026060318125818800_qkag078-B1","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1109\/TIT.2010.2059891","article-title":"Information theoretic bounds for compressed sensing","volume":"56","author":"Aeron","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026060318125818800_qkag078-B2","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1109\/TIT.2009.2034796","article-title":"Shannon-theoretic limits on noisy compressive sampling","volume":"56","author":"Ak\u00e7akaya","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026060318125818800_qkag078-B3","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/TIT.2016.2605122","article-title":"Sparse signal processing with linear and nonlinear observations: A unified shannon-theoretic approach","volume":"63","author":"Aksoylar","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026060318125818800_qkag078-B4","first-page":"171","article-title":"Local causal and Markov blanket induction for causal discovery and feature selection for classification part I: Algorithms and empirical evaluation","volume":"11","author":"Aliferis","year":"2010","journal-title":"Journal of Machine Learning Research: JMLR"},{"key":"2026060318125818800_qkag078-B5","author":"Azadkia","year":"2021"},{"issue":"2","key":"2026060318125818800_qkag078-B6","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","article-title":"Best subset selection via a modern optimization lens","volume":"44","author":"Bertsimas","year":"2016","journal-title":"Annals of Statistics"},{"issue":"2","key":"2026060318125818800_qkag078-B7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1093\/biomet\/asq008","article-title":"Variable selection in high-dimensional linear models: Partially faithful distributions and the PC-simple algorithm","volume":"97","author":"B\u00fchlmann","year":"2010","journal-title":"Biometrika"},{"issue":"6","key":"2026060318125818800_qkag078-B8","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1214\/14-AOS1260","article-title":"CAM: Causal additive models, high-dimensional order search and penalized regression","volume":"42","author":"B\u00fchlmann","year":"2014","journal-title":"Annals of Statistics"},{"issue":"7","key":"2026060318125818800_qkag078-B9","doi-asserted-by":"publisher","first-page":"4680","DOI":"10.1109\/TIT.2011.2146090","article-title":"Orthogonal matching pursuit for sparse signal recovery with noise","volume":"57","author":"Cai","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026060318125818800_qkag078-B10","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","article-title":"The Dantzig selector: Statistical estimation when p is much larger than n","volume":"35","author":"Candes","year":"2007","journal-title":"Annals of Statistics"},{"issue":"4","key":"2026060318125818800_qkag078-B11","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1093\/biomet\/asz049","article-title":"On causal discovery with an equal-variance assumption","volume":"106","author":"Chen","year":"2019","journal-title":"Biometrika"},{"key":"2026060318125818800_qkag078-B12","first-page":"35","volume-title":"Algebraic problems in structural equation modeling","author":"Drton","year":"2018"},{"issue":"1","key":"2026060318125818800_qkag078-B13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1146\/annurev-statistics-060116-053803","article-title":"Structure learning in graphical modeling","volume":"4","author":"Drton","year":"2017","journal-title":"Annual Review of Statistics and Its Application"},{"issue":"1","key":"2026060318125818800_qkag078-B14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1146\/annurev-soc-071913-043455","article-title":"Endogenous selection bias: The problem of conditioning on a collider variable","volume":"40","author":"Elwert","year":"2014","journal-title":"Annual Review of Sociology"},{"issue":"456","key":"2026060318125818800_qkag078-B15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","article-title":"Variable selection via nonconcave penalized likelihood and its oracle properties","volume":"96","author":"Fan","year":"2001","journal-title":"Journal of the American Statistical Association"},{"issue":"6","key":"2026060318125818800_qkag078-B16","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1214\/18-AOS1759","article-title":"Sorted concave penalized regression","volume":"47","author":"Feng","year":"2019","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B17","doi-asserted-by":"publisher","author":"Fiorini","year":"2016","DOI":"10.24432\/C5R88H"},{"issue":"12","key":"2026060318125818800_qkag078-B18","doi-asserted-by":"publisher","first-page":"5758","DOI":"10.1109\/TIT.2009.2032726","article-title":"Necessary and sufficient conditions for sparsity pattern recovery","volume":"55","author":"Fletcher","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026060318125818800_qkag078-B19","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1214\/aos\/1176325766","article-title":"The risk inflation criterion for multiple regression","volume":"22","author":"Foster","year":"1994","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B20","author":"Gao","year":"2025"},{"key":"2026060318125818800_qkag078-B21","first-page":"11599","article-title":"A polynomial-time algorithm for learning nonparametric causal graphs","volume":"33","author":"Gao","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026060318125818800_qkag078-B22","author":"Gao","year":"2022"},{"issue":"5","key":"2026060318125818800_qkag078-B23","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1109\/TCYB.2016.2539338","article-title":"Efficient Markov blanket discovery and its application","volume":"47","author":"Gao","year":"2016","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"2026060318125818800_qkag078-B24","first-page":"2107","article-title":"A comparison of the lasso and marginal regression","volume":"13","author":"Genovese","year":"2012","journal-title":"Journal of Machine Learning Research: JMLR"},{"key":"2026060318125818800_qkag078-B25","first-page":"767","volume-title":"Information-theoretic limits of Bayesian network structure learning","author":"Ghoshal","year":"2017"},{"key":"2026060318125818800_qkag078-B26","first-page":"6457","article-title":"Learning identifiable Gaussian Bayesian networks in polynomial time and sample complexity","volume":"30","author":"Ghoshal","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1","key":"2026060318125818800_qkag078-B27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1097\/00001648-199901000-00008","article-title":"Causal diagrams for epidemiologic research","volume":"10","author":"Greenland","year":"1999","journal-title":"Epidemiology"},{"key":"2026060318125818800_qkag078-B28","author":"Guo","year":"2022"},{"issue":"4","key":"2026060318125818800_qkag078-B29","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1214\/19-STS733","article-title":"Best subset, forward stepwise or lasso? Analysis and recommendations based on extensive comparisons","volume":"35","author":"Hastie","year":"2020","journal-title":"Statistical Science: A Review Journal of the Institute of Mathematical Statistics"},{"issue":"5","key":"2026060318125818800_qkag078-B30","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1097\/01.ede.0000135174.63482.43","article-title":"A structural approach to selection bias","volume":"15","author":"Hern\u00e1n","year":"2004","journal-title":"Epidemiology"},{"issue":"1","key":"2026060318125818800_qkag078-B31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1214\/11-AOS947","article-title":"UPS delivers optimal phase diagram in high-dimensional variable selection","volume":"40","author":"Ji","year":"2012","journal-title":"Annals of Statistics"},{"issue":"1","key":"2026060318125818800_qkag078-B32","first-page":"2723","article-title":"Optimality of graphlet screening in high dimensional variable selection","volume":"15","author":"Jin","year":"2014","journal-title":"Journal of Machine Learning Research: JMLR"},{"issue":"7","key":"2026060318125818800_qkag078-B33","first-page":"1771","article-title":"Variable selection in high-dimension with random designs and orthogonal matching pursuit","volume":"14","author":"Joseph","year":"2013","journal-title":"Journal of Machine Learning Research: JMLR"},{"key":"2026060318125818800_qkag078-B34","volume-title":"Probabilistic graphical models: Principles and techniques","author":"Koller","year":"2009"},{"key":"2026060318125818800_qkag078-B35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"Lauritzen","year":"1996"},{"key":"2026060318125818800_qkag078-B36","first-page":"289","volume-title":"Neighborhood selection methods","author":"Loh","year":"2018"},{"issue":"1","key":"2026060318125818800_qkag078-B37","first-page":"3065","article-title":"High-dimensional learning of linear causal networks via inverse covariance estimation","volume":"15","author":"Loh","year":"2014","journal-title":"Journal of Machine Learning Research: JMLR"},{"issue":"6","key":"2026060318125818800_qkag078-B38","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1214\/16-AOS1530","article-title":"Support recovery without incoherence: A case for nonconvex regularization","volume":"45","author":"Loh","year":"2017","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B39","first-page":"505","article-title":"Bayesian network induction via local neighborhoods","volume":"12","author":"Margaritis","year":"1999","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"2026060318125818800_qkag078-B40","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1214\/009053606000000281","article-title":"High-dimensional graphs and variable selection with the lasso","volume":"34","author":"Meinshausen","year":"2006","journal-title":"Annals of Statistics"},{"issue":"1","key":"2026060318125818800_qkag078-B41","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1214\/07-AOS582","article-title":"Lasso-type recovery of sparse representations for high-dimensional data","volume":"37","author":"Meinshausen","year":"2009","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B42","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035933","volume-title":"Subset selection in regression","author":"Miller","year":"2002"},{"key":"2026060318125818800_qkag078-B43","first-page":"2888","volume-title":"Information theoretic optimal learning of gaussian graphical models","author":"Misra","year":"2020"},{"issue":"4","key":"2026060318125818800_qkag078-B44","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.1109\/TIT.18","article-title":"Optimal variable selection and adaptive noisy compressed sensing","volume":"66","author":"Ndaoud","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026060318125818800_qkag078-B45","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1214\/aos\/1176346522","article-title":"Asymptotic properties of criteria for selection of variables in multiple regression","volume":"12","author":"Nishii","year":"1984","journal-title":"Annals of Statistics"},{"issue":"2","key":"2026060318125818800_qkag078-B46","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ijar.2006.06.008","article-title":"Towards scalable and data efficient learning of Markov boundaries","volume":"45","author":"Pena","year":"2007","journal-title":"International Journal of Approximate Reasoning: Official Publication of the North American Fuzzy Information Processing Society"},{"issue":"1","key":"2026060318125818800_qkag078-B47","first-page":"2009","article-title":"Causal discovery with continuous additive noise models","volume":"15","author":"Peters","year":"2014","journal-title":"Journal of Machine Learning Research: JMLR"},{"issue":"7","key":"2026060318125818800_qkag078-B48","doi-asserted-by":"publisher","first-page":"4672","DOI":"10.1109\/TIT.2011.2145670","article-title":"Nearly sharp sufficient conditions on exact sparsity pattern recovery","volume":"57","author":"Rad","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026060318125818800_qkag078-B49","first-page":"18660","article-title":"Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families","volume":"34","author":"Rajendran","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026060318125818800_qkag078-B50","author":"Reeves","year":"2008"},{"issue":"6","key":"2026060318125818800_qkag078-B51","doi-asserted-by":"publisher","first-page":"3451","DOI":"10.1109\/TIT.2013.2253852","article-title":"Approximate sparsity pattern recovery: Information-theoretic lower bounds","volume":"59","author":"Reeves","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026060318125818800_qkag078-B52","first-page":"221","article-title":"An asymptotic theory for linear model selection","volume":"7","author":"Shao","year":"1997","journal-title":"Statistica Sinica"},{"issue":"497","key":"2026060318125818800_qkag078-B53","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/01621459.2011.645783","article-title":"Likelihood-based selection and sharp parameter estimation","volume":"107","author":"Shen","year":"2012","journal-title":"Journal of the American Statistical Association"},{"issue":"5","key":"2026060318125818800_qkag078-B54","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s10463-012-0396-3","article-title":"On constrained and regularized high-dimensional regression","volume":"65","author":"Shen","year":"2013","journal-title":"Annals of the Institute of Statistical Mathematics"},{"issue":"1","key":"2026060318125818800_qkag078-B55","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1093\/biomet\/68.1.45","article-title":"An optimal selection of regression variables","volume":"68","author":"Shibata","year":"1981","journal-title":"Biometrika"},{"issue":"3","key":"2026060318125818800_qkag078-B56","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1093\/biomet\/asq038","article-title":"Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs","volume":"97","author":"Shojaie","year":"2010","journal-title":"Biometrika"},{"key":"2026060318125818800_qkag078-B57","volume-title":"Causation, prediction, and search","author":"Spirtes","year":"2000"},{"issue":"1","key":"2026060318125818800_qkag078-B58","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"12","key":"2026060318125818800_qkag078-B59","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026060318125818800_qkag078-B60","author":"Tsamardinos","year":"2003"},{"key":"2026060318125818800_qkag078-B61","author":"Tsamardinos","year":"2003"},{"issue":"2","key":"2026060318125818800_qkag078-B62","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/12-AOS1080","article-title":"Geometry of the faithfulness assumption in causal inference","volume":"41","author":"Uhler","year":"2013","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B63","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1214\/09-EJS506","article-title":"On the conditions used to prove oracle results for the lasso","volume":"3","author":"van de Geer","year":"2009","journal-title":"Electronic Journal of Statistics"},{"key":"2026060318125818800_qkag078-B64","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1214\/12-EJS666","article-title":"Minimax risks for sparse regressions: Ultra-high dimensional phenomenons","volume":"6","author":"Verzelen","year":"2012","journal-title":"Electronic Journal of Statistics"},{"issue":"12","key":"2026060318125818800_qkag078-B65","doi-asserted-by":"publisher","first-page":"5728","DOI":"10.1109\/TIT.2009.2032816","article-title":"Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting","volume":"55","author":"Wainwright","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026060318125818800_qkag078-B66","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","article-title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using \u21131-constrained quadratic programming (lasso)","volume":"55","author":"Wainwright","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026060318125818800_qkag078-B67","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1214\/19-AOS1906","article-title":"Which bridge estimator is the best for variable selection?","volume":"48","author":"Wang","year":"2020","journal-title":"Annals of Statistics"},{"key":"2026060318125818800_qkag078-B68","author":"Wang","year":"2010"},{"issue":"6","key":"2026060318125818800_qkag078-B69","doi-asserted-by":"publisher","first-page":"2967","DOI":"10.1109\/TIT.2010.2046199","article-title":"Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices","volume":"56","author":"Wang","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5A","key":"2026060318125818800_qkag078-B70","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1214\/08-aos646","article-title":"High dimensional variable selection","volume":"37","author":"Wasserman","year":"2009","journal-title":"Annals of Statistics"},{"issue":"2","key":"2026060318125818800_qkag078-B71","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Annals of Statistics"},{"issue":"4","key":"2026060318125818800_qkag078-B72","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/07-AOS520","article-title":"The sparsity and bias of the lasso selection in high-dimensional linear regression","volume":"36","author":"Zhang","year":"2008","journal-title":"Annals of Statistics"},{"issue":"5A","key":"2026060318125818800_qkag078-B73","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1214\/08-AOS659","article-title":"Some sharp performance bounds for least squares regression with L1 regularization","volume":"37","author":"Zhang","year":"2009","journal-title":"Annals of Statistics"},{"issue":"9","key":"2026060318125818800_qkag078-B74","doi-asserted-by":"publisher","first-page":"6215","DOI":"10.1109\/TIT.2011.2162263","article-title":"Sparse recovery with orthogonal matching pursuit under RIP","volume":"57","author":"Zhang","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026060318125818800_qkag078-B75","first-page":"2541","article-title":"On model selection consistency of lasso","volume":"7","author":"Zhao","year":"2006","journal-title":"Journal of Machine Learning Research: JMLR"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jrsssb\/advance-article-pdf\/doi\/10.1093\/jrsssb\/qkag078\/68461612\/qkag078.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/advance-article-pdf\/doi\/10.1093\/jrsssb\/qkag078\/68461612\/qkag078.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T22:13:08Z","timestamp":1780524788000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/advance-article\/doi\/10.1093\/jrsssb\/qkag078\/8700801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,3]]},"references-count":75,"URL":"https:\/\/doi.org\/10.1093\/jrsssb\/qkag078","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,3]]},"article-number":"qkag078"}}