{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T17:50:56Z","timestamp":1788371456671,"version":"build-2803163510"},"reference-count":40,"publisher":"IOP Publishing","issue":"3","license":[{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"vor","delay-in-days":21,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"tdm","delay-in-days":21,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"name":"EPSRC Centre for Doctoral Training"},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"crossref","award":["MR\/S03174X\/1"],"award-info":[{"award-number":["MR\/S03174X\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CANES","award":["EP\/L015854\/1"],"award-info":[{"award-number":["EP\/L015854\/1"]}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["J. Phys. Complex."],"published-print":{"date-parts":[[2022,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We introduce a model for the retrieval of information hidden in legal texts. These are typically organised in a hierarchical (tree) structure, which a reader interested in a given provision needs to explore down to the \u2018deepest\u2019 level (articles, clauses, \u2026). We assess the structural complexity of legal trees by computing the mean first-passage time a random reader takes to retrieve information planted in the leaves. The reader is assumed to skim through the content of a legal text based on their interests\/keywords, and be drawn towards the sought information based on keywords affinity, i.e. how well the Chapters\/Section headers of the hierarchy seem to match the informational content of the leaves. Using randomly generated keyword patterns, we investigate the effect of two main features of the text\u2014the horizontal and vertical coherence\u2014on the searching time, and consider ways to validate our results using real legal texts. We obtain numerical and analytical results, the latter based on a mean-field approximation on the level of patterns, which lead to an explicit expression for the complexity of legal trees as a function of the structural parameters of the model.<\/jats:p>","DOI":"10.1088\/2632-072x\/ac8e48","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T22:41:48Z","timestamp":1661985708000},"page":"035008","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Information retrieval and structural complexity of legal trees"],"prefix":"10.1088","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5101-5064","authenticated-orcid":false,"given":"Yanik-Pascal","family":"F\u00f6rster","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4010-6742","authenticated-orcid":true,"given":"Alessia","family":"Annibale","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Gamberi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evan","family":"Tzanis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2366-3080","authenticated-orcid":true,"given":"Pierpaolo","family":"Vivo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"266","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"key":"jpcomplexac8e48bib1","article-title":"Legislation for the United Kingdom, Housing Act 1985","author":"","year":"1986"},{"key":"jpcomplexac8e48bib2","doi-asserted-by":"publisher","first-page":"4201","DOI":"10.1016\/j.physa.2010.06.003","article-title":"Distance measures for dynamic citation networks","volume":"389","author":"Bommarito","year":"2010","journal-title":"Physica A"},{"key":"jpcomplexac8e48bib3","article-title":"Properties of the United States code citation network","author":"Bommarito","year":"2011"},{"key":"jpcomplexac8e48bib4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10506-014-9160-8","article-title":"Measuring the complexity of the law: the United States code","volume":"22","author":"Katz","year":"2014","journal-title":"Artif. Intell. Law"},{"key":"jpcomplexac8e48bib5","doi-asserted-by":"publisher","first-page":"18737","DOI":"10.1038\/s41598-020-73623-x","article-title":"Complex societies and the growth of the law","volume":"10","author":"Katz","year":"2020","journal-title":"Sci. Rep."},{"key":"jpcomplexac8e48bib6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0209844","article-title":"Network structure reveals patterns of legal complexity in human society: the case of the constitutional legal network","volume":"14","author":"Lee","year":"2019","journal-title":"PLoS One"},{"key":"jpcomplexac8e48bib7","first-page":"297","article-title":"Law is code: a software engineering approach to analyzing the United States code","volume":"10","author":"Li","year":"2015","journal-title":"J. Bus. Tech. Law"},{"key":"jpcomplexac8e48bib8","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.3943378","article-title":"Law smells\u2014defining and detecting problematic patterns in legal drafting","author":"Coupette","year":"2021"},{"key":"jpcomplexac8e48bib9","first-page":"993","article-title":"Latent Dirichlet\u00a0allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"jpcomplexac8e48bib10","first-page":"837","article-title":"The Supreme Court and the judicial genre","volume":"59","author":"Livermore","year":"2010","journal-title":"Ariz. Law Rev."},{"key":"jpcomplexac8e48bib11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10506-018-9224-2","article-title":"Bending the law: geometric tools for quantifying influence in the multinetwork of legal opinions","volume":"26","author":"Leibon","year":"2018","journal-title":"Artif. Intell. Law"},{"key":"jpcomplexac8e48bib12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10506-020-09261-5","article-title":"Modeling law search as prediction","volume":"29","author":"Dadgosari","year":"2021","journal-title":"Artif. Intell. Law"},{"key":"jpcomplexac8e48bib13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1372753","article-title":"Legal complexity: some causes, consequences, and cures","volume":"42","author":"Schuck","year":"1992","journal-title":"Duke Law J."},{"key":"jpcomplexac8e48bib14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0144-8188(92)90016-k","article-title":"Legal complexity and lawyers\u2019 benefit from litigation","volume":"12","author":"White","year":"1992","journal-title":"Int. Rev. Law Econ."},{"key":"jpcomplexac8e48bib15","first-page":"193","article-title":"Representational complexity in law","author":"Surden","year":"2007"},{"key":"jpcomplexac8e48bib16","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2021.665054","article-title":"Quantifying legal entropy","volume":"9","author":"Sichelman","year":"2021","journal-title":"Front. Phys."},{"key":"jpcomplexac8e48bib17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/3480139","article-title":"Legal uncertainty","volume":"71","author":"D\u2019Amato","year":"1983","journal-title":"Calif. Law Rev."},{"key":"jpcomplexac8e48bib18","first-page":"211","article-title":"Toward measures of complexity in legal systems","author":"Bourcier","year":"2007"},{"key":"jpcomplexac8e48bib19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0022-0531(74)90061-1","article-title":"The theory of search","volume":"9","author":"Kohn","year":"1974","journal-title":"J. Econ. Theory"},{"key":"jpcomplexac8e48bib20","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1086\/261099","article-title":"Aggregate demand management in search equilibrium","volume":"90","author":"Diamond","year":"1982","journal-title":"J. Polit. Econ."},{"key":"jpcomplexac8e48bib21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00265-003-0700-6","article-title":"L\u00e9vy walk patterns in the foraging movements of spider monkeys (Ateles geoffroyi)","volume":"55","author":"Ramos-Fern\u00e1ndez","year":"2004","journal-title":"Behav. Ecol. Sociobiol."},{"key":"jpcomplexac8e48bib22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.physa.2004.04.091","article-title":"Modeling the searching behavior of social monkeys","volume":"342","author":"Boyer","year":"2004","journal-title":"Physica A"},{"key":"jpcomplexac8e48bib23","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.3690508","article-title":"Structure and content in the United States code","author":"Carlson","year":"2020"},{"key":"jpcomplexac8e48bib24","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab7cfe","article-title":"Stochastic resetting and applications","volume":"53","author":"Evans","year":"2020","journal-title":"J. Phys. A: Math. Theor."},{"key":"jpcomplexac8e48bib25","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aafc92","article-title":"A random walk perspective on hide-and-seek games","volume":"52","author":"Pandey","year":"2019","journal-title":"J. Phys. A: Math. Theor."},{"key":"jpcomplexac8e48bib26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1214\/07-aoas114","article-title":"A correlated topic model of science","volume":"1","author":"Blei","year":"2007","journal-title":"Ann. Appl. Stat."},{"key":"jpcomplexac8e48bib27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/2133806.2133826","article-title":"Probabilistic topic models","volume":"55","author":"Blei","year":"2012","journal-title":"Commun. ACM"},{"key":"jpcomplexac8e48bib28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1108\/eb026702","article-title":"On user studies and information needs","volume":"37","author":"Wilson","year":"1981","journal-title":"J. Doc."},{"key":"jpcomplexac8e48bib29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/s0740-8188(01)00082-2","article-title":"Information sources used by lawyers in problem solving","volume":"23","author":"Wilkinson","year":"2001","journal-title":"Libr. Inf. Sci. Res."},{"key":"jpcomplexac8e48bib30","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/aris.2007.1440410113","article-title":"Context in information behavior research","volume":"41","author":"Courtright","year":"2007","journal-title":"Ann. Rev. Inf. Sci. Tech."},{"key":"jpcomplexac8e48bib31","author":"Case","year":"2007","edition":"2nd edn"},{"key":"jpcomplexac8e48bib32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","article-title":"Random walks and diffusion on networks","volume":"716\u2013717","author":"Masuda","year":"2017","journal-title":"Phys. Rep."},{"key":"jpcomplexac8e48bib33","article-title":"Reversible Markov chains and random walks on graphs","author":"Aldous","year":"1999"},{"key":"jpcomplexac8e48bib34","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ac4ece","article-title":"Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach","volume":"55","author":"F\u00f6rster","year":"2022","journal-title":"J. Phys. A: Math. Theor."},{"key":"jpcomplexac8e48bib35","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.3150\/16-bej916","article-title":"Tree formulas, mean first passage times and Kemeny\u2019s constant of a Markov chain","volume":"24","author":"Pitman","year":"2018","journal-title":"Bernoulli"},{"key":"jpcomplexac8e48bib36","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1038\/s42005-021-00580-w","article-title":"First-passage times to quantify and compare structural correlations and heterogeneity in complex systems","volume":"4","author":"Bassolas","year":"2021","journal-title":"Commun. Phys."},{"key":"jpcomplexac8e48bib37","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/comnet\/cnx029","article-title":"Network analysis in the legal domain: a complex model for European Union legal sources","volume":"6","author":"Koniaris","year":"2018","journal-title":"J. Complex Netw."},{"key":"jpcomplexac8e48bib38","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/net.20461","article-title":"A model of self-avoiding random walks for searching complex networks","volume":"60","author":"L\u00f3pez Mill\u00e1n","year":"2012","journal-title":"Networks"},{"key":"jpcomplexac8e48bib39","author":"Mihalcea","year":"2011"},{"key":"jpcomplexac8e48bib40","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1080\/01621459.1972.10482404","article-title":"Negative moments of positive random variables","volume":"67","author":"Chao","year":"1972","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Journal of Physics: Complexity"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T03:58:09Z","timestamp":1663732689000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-072X\/ac8e48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,1]]},"references-count":40,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,9,22]]},"published-print":{"date-parts":[[2022,9,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-072x\/ac8e48","relation":{},"ISSN":["2632-072X"],"issn-type":[{"value":"2632-072X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,1]]},"assertion":[{"value":"Information retrieval and structural complexity of legal trees","name":"article_title","label":"Article Title"},{"value":"Journal of Physics: Complexity","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2022 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2022-03-14","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-08-31","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-09-22","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}