{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:31:58Z","timestamp":1772137918711,"version":"3.50.1"},"reference-count":51,"publisher":"IOP Publishing","issue":"3","license":[{"start":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T00:00:00Z","timestamp":1663113600000},"content-version":"vor","delay-in-days":13,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T00:00:00Z","timestamp":1663113600000},"content-version":"tdm","delay-in-days":13,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"name":"Helmholtz-Gemeinschaft","award":["HAICORE@KIT partition"],"award-info":[{"award-number":["HAICORE@KIT partition"]}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2022,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this work, we present a neural approach to reconstructing rooted tree graphs describing hierarchical interactions, using a novel representation we term the lowest common ancestor generations (LCAG) matrix. This compact formulation is equivalent to the adjacency matrix, but enables learning a tree\u2019s structure from its leaves alone without the prior assumptions required if using the adjacency matrix directly. Employing the LCAG therefore enables the first end-to-end trainable solution which learns the hierarchical structure of varying tree sizes directly, using only the terminal tree leaves to do so. In the case of high-energy particle physics, a particle decay forms a hierarchical tree structure of which only the final products can be observed experimentally, and the large combinatorial space of possible trees makes an analytic solution intractable. We demonstrate the use of the LCAG as a target in the task of predicting simulated particle physics decay structures using both a Transformer encoder and a neural relational inference encoder graph neural network. With this approach, we are able to correctly predict the LCAG purely from leaf features for a maximum tree-depth of 8 in\n                    <jats:inline-formula>\n                      <jats:tex-math>\n                        \n                      <\/jats:tex-math>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\">\n                        <mml:mn>92.5<\/mml:mn>\n                        <mml:mi mathvariant=\"normal\">%<\/mml:mi>\n                      <\/mml:math>\n                      <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"mlstac8de0ieqn1.gif\" xlink:type=\"simple\"\/>\n                    <\/jats:inline-formula>\n                    of cases for trees up to 6 leaves (including) and\n                    <jats:inline-formula>\n                      <jats:tex-math>\n                        \n                      <\/jats:tex-math>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\">\n                        <mml:mn>59.7<\/mml:mn>\n                        <mml:mi mathvariant=\"normal\">%<\/mml:mi>\n                      <\/mml:math>\n                      <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"mlstac8de0ieqn2.gif\" xlink:type=\"simple\"\/>\n                    <\/jats:inline-formula>\n                    for trees up to 10 in our simulated dataset.\n                  <\/jats:p>","DOI":"10.1088\/2632-2153\/ac8de0","type":"journal-article","created":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T18:42:36Z","timestamp":1661884956000},"page":"035012","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Learning tree structures from leaves for particle decay reconstruction"],"prefix":"10.1088","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8517-2359","authenticated-orcid":true,"given":"James","family":"Kahn","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3584-4484","authenticated-orcid":false,"given":"Ilias","family":"Tsaklidis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3707-499X","authenticated-orcid":false,"given":"Oskar","family":"Taubert","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5930-6237","authenticated-orcid":false,"given":"Lea","family":"Reuter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1345-8163","authenticated-orcid":false,"given":"Giulio","family":"Dujany","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Boeckh","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Thaller","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Goldenzweig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8153-2719","authenticated-orcid":false,"given":"Florian","family":"Bernlochner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5065-469X","authenticated-orcid":false,"given":"Achim","family":"Streit","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2233-1041","authenticated-orcid":true,"given":"Markus","family":"G\u00f6tz","sequence":"additional","affiliation":[]}],"member":"266","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"mlstac8de0bib1","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/3\/08\/S08001","article-title":"LHC machine","volume":"3","author":"Evans","year":"2008","journal-title":"J. Instrum."},{"key":"mlstac8de0bib2","article-title":"Belle II technical design report","author":"Abe","year":"2010"},{"key":"mlstac8de0bib3","author":"Kahn","year":"2022"},{"key":"mlstac8de0bib4","author":"","year":"2021"},{"key":"mlstac8de0bib5","first-page":"pp 2841","article-title":"Graph-to-tree neural networks for learning structured input-output translation with applications to semantic parsing and math word problem","author":"Li","year":"2020"},{"key":"mlstac8de0bib6","first-page":"pp 3806","article-title":"Integrating tree structures and graph structures with neural networks to classify discussion discourse acts","author":"Miura","year":"2018"},{"key":"mlstac8de0bib7","first-page":"pp 432","article-title":"Tree structure-aware graph representation learning via integrated hierarchical aggregation and relational metric learning","author":"Qiao","year":"2020"},{"key":"mlstac8de0bib8","first-page":"pp 4805","article-title":"Hierarchical graph representation learning with differentiable pooling","volume":"vol 31","author":"Ying","year":"2018"},{"key":"mlstac8de0bib9","article-title":"Hierarchical message-passing graph neural networks","author":"Zhong","year":"2020"},{"key":"mlstac8de0bib10","first-page":"pp 2688","article-title":"Neural relational inference for interacting systems","volume":"vol 80","author":"Kipf","year":"2018"},{"key":"mlstac8de0bib11","article-title":"Hierarchical relational inference","author":"Stani\u0107","year":"2020"},{"key":"mlstac8de0bib12","first-page":"pp 11","article-title":"Edge-labeling graph neural network for few-shot learning","author":"Kim","year":"2019"},{"key":"mlstac8de0bib13","first-page":"pp 217","article-title":"Supervised clustering with support vector machines","author":"Finley","year":"2005"},{"key":"mlstac8de0bib14","article-title":"Unifying graph convolutional neural networks and label propagation","author":"Wang","year":"2020"},{"key":"mlstac8de0bib15","first-page":"pp 5470","article-title":"ASAP: adaptive structure aware pooling for learning hierarchical graph representations","volume":"vol 34","author":"Ranjan","year":"2020"},{"key":"mlstac8de0bib16","article-title":"Attention is all you need","volume":"vol 30","author":"Vaswani","year":"2017"},{"key":"mlstac8de0bib17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1146\/annurev-nucl-101917-021019","article-title":"Deep learning and its application to LHC physics","volume":"68","author":"Guest","year":"2018","journal-title":"Annu. Rev. Nucl. Part. Sci."},{"key":"mlstac8de0bib18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2019.11.001","article-title":"Jet substructure at the Large Hadron Collider: a review of recent advances in theory and machine learning","volume":"841","author":"Larkoski","year":"2020","journal-title":"Phys. Rep."},{"key":"mlstac8de0bib19","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1085\/2\/022008","article-title":"Machine learning in high energy physics community white paper","volume":"1085","author":"Albertsson","year":"2018","journal-title":"J. Phys.: Conf. Ser."},{"key":"mlstac8de0bib20","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abbf9a","article-title":"Graph neural networks in particle physics","volume":"2","author":"Shlomi","year":"2021","journal-title":"Mach. Learn.: Sci. Technol."},{"key":"mlstac8de0bib21","article-title":"Graph neural networks for particle tracking and reconstruction","author":"Duarte","year":"2020"},{"key":"mlstac8de0bib22","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/12\/10\/P10003","article-title":"Particle-flow reconstruction and global event description with the CMS detector","volume":"12","author":"Sirunyan","year":"2017","journal-title":"J. Instrum."},{"key":"mlstac8de0bib23","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1140\/epjc\/s10052-017-5031-2","article-title":"Jet reconstruction and performance using particle flow with the ATLAS Detector","volume":"77","author":"Aaboud","year":"2017","journal-title":"Eur. Phys. J. C"},{"key":"mlstac8de0bib24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1140\/epjc\/s10052-021-09158-w","article-title":"MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks","volume":"81","author":"Pata","year":"2021","journal-title":"Eur. Phys. J. C"},{"key":"mlstac8de0bib25","article-title":"Explaining machine-learned particle-flow reconstruction","author":"Mokhtar","year":"2021"},{"key":"mlstac8de0bib26","doi-asserted-by":"publisher","DOI":"10.1051\/epjconf\/201715000003","article-title":"The HEP.TrkX project: deep neural networks for HL-LHC online and offline tracking","volume":"150","author":"Farrell","year":"2017","journal-title":"EPJ Web Conf."},{"key":"mlstac8de0bib27","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1140\/epjc\/s10052-021-09675-8","article-title":"Performance of a geometric deep learning pipeline for HL-LHC particle tracking","volume":"81","author":"Ju","year":"2021","journal-title":"Eur. Phys. J. C"},{"key":"mlstac8de0bib28","article-title":"Graph neural networks for particle reconstruction in high energy physics detectors","author":"Ju","year":"2020"},{"key":"mlstac8de0bib29","first-page":"pp 1","article-title":"Neural message passing for jet physics","author":"Henrion","year":"2017"},{"key":"mlstac8de0bib30","doi-asserted-by":"crossref","DOI":"10.1140\/epjc\/s10052-021-09342-y","article-title":"Secondary vertex finding in jets with neural networks","author":"Shlomi","year":"2021"},{"key":"mlstac8de0bib31","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1140\/epjc\/s10052-020-7608-4","article-title":"JEDI-net: a jet identification algorithm based on interaction networks","volume":"80","author":"Moreno","year":"2020","journal-title":"Eur. Phys. J. C"},{"key":"mlstac8de0bib32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.101.056019","article-title":"Jet tagging via particle clouds","volume":"101","author":"Qu","year":"2020","journal-title":"Phys. Rev. D"},{"key":"mlstac8de0bib33","doi-asserted-by":"publisher","first-page":"146:1","DOI":"10.1145\/3326362","article-title":"Dynamic graph CNN for learning on point clouds","volume":"38","author":"Wang","year":"2019","journal-title":"ACM Trans. Graph."},{"key":"mlstac8de0bib34","first-page":"pp 18281","article-title":"Particle transformer for jet tagging","author":"Qu","year":"2022"},{"key":"mlstac8de0bib35","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s41781-019-0021-8","article-title":"The full event interpretation","volume":"3","author":"Keck","year":"2019","journal-title":"Comput. Softw. Big Sci."},{"key":"mlstac8de0bib36","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"mlstac8de0bib37","first-page":"pp 253","article-title":"On finding lowest common ancestors in trees","author":"Aho","year":"1973"},{"key":"mlstac8de0bib38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-29135-8_9","article-title":"The tracking machine learning challenge: accuracy phase","author":"Amrouche","year":"2020"},{"key":"mlstac8de0bib39","article-title":"Shared data and algorithms for deep learning in fundamental physics","author":"Benato","year":"2021"},{"key":"mlstac8de0bib40","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.21105\/joss.01570","article-title":"phasespace: n-body phase space generation in Python","volume":"4","author":"Navarro","year":"2019","journal-title":"J. Open Source Softw."},{"key":"mlstac8de0bib41","doi-asserted-by":"publisher","author":"James","year":"1968","DOI":"10.5170\/CERN-1968-015"},{"key":"mlstac8de0bib42","doi-asserted-by":"publisher","first-page":"083C01","DOI":"10.1093\/ptep\/ptaa104","article-title":"Review of particle physics, 2020\u20132021","volume":"2020","author":"Zyla","year":"2020","journal-title":"Prog. Theor. Exp. Phys."},{"key":"mlstac8de0bib43","first-page":"pp 8024","article-title":"PyTorch: an imperative style, high-performance deep learning library","volume":"vol 32","author":"Paszke","year":"2019"},{"key":"mlstac8de0bib44","article-title":"High-level library to help with training neural networks in PyTorch","author":"Fomin","year":"2020"},{"key":"mlstac8de0bib45","article-title":"Fast and accurate deep network learning by exponential linear units (ELUs)","author":"Clevert","year":"2016"},{"key":"mlstac8de0bib46","article-title":"Batch normalization: accelerating deep network training by reducing internal covariate shift","author":"Ioffe","year":"2015"},{"key":"mlstac8de0bib47","first-page":"pp 2623","article-title":"Optuna: a next-generation hyperparameter optimization framework","author":"Akiba","year":"2019"},{"key":"mlstac8de0bib48","first-page":"pp 2546","article-title":"Algorithms for hyper-parameter optimization","author":"Bergstra","year":"2011"},{"key":"mlstac8de0bib49","first-page":"pp 2980","article-title":"Focal loss for dense object detection","author":"Lin","year":"2017"},{"key":"mlstac8de0bib50","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/8\/04\/P04022","article-title":"The LHCb trigger and its performance in 2011","volume":"8","author":"Aaij","year":"2013","journal-title":"J. Instrum."},{"key":"mlstac8de0bib51","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/8\/02\/P02013","article-title":"Efficient, reliable and fast high-level triggering using a bonsai boosted decision tree","volume":"8","author":"Gligorov","year":"2013","journal-title":"J. Instrum."}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T09:12:10Z","timestamp":1663146730000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac8de0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,1]]},"references-count":51,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,9,14]]},"published-print":{"date-parts":[[2022,9,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/ac8de0","relation":{"has-review":[{"id-type":"doi","id":"10.1088\/2632-2153\/AC8DE0\/v2\/response1","asserted-by":"object"},{"id-type":"doi","id":"10.1088\/2632-2153\/AC8DE0\/v2\/decision1","asserted-by":"object"},{"id-type":"doi","id":"10.1088\/2632-2153\/AC8DE0\/v1\/review2","asserted-by":"object"},{"id-type":"doi","id":"10.1088\/2632-2153\/AC8DE0\/v1\/review1","asserted-by":"object"},{"id-type":"doi","id":"10.1088\/2632-2153\/AC8DE0\/v1\/decision1","asserted-by":"object"}]},"ISSN":["2632-2153"],"issn-type":[{"value":"2632-2153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,1]]},"assertion":[{"value":"Learning tree structures from leaves for particle decay reconstruction","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","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-05-31","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-08-30","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-09-14","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}