{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:51Z","timestamp":1774679511101,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/tsp.2013.2259161","type":"journal-article","created":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T18:02:25Z","timestamp":1366394545000},"page":"3173-3182","source":"Crossref","is-referenced-by-count":25,"title":["Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs"],"prefix":"10.1109","volume":"61","author":[{"given":"Christopher J.","family":"Quinn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd P.","family":"Coleman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00221-006-0556-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/nn1802"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095883"},{"key":"ref31","first-page":"29","article-title":"An algorithm to construct a minimum directed spanning tree in a directed network","volume":"1","author":"bock","year":"1971","journal-title":"Development in Operations Research"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"ref37","author":"li","year":"2009"},{"key":"ref36","article-title":"Universal estimation of directed information","author":"jiao","year":"2012"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","author":"grnwald","year":"2007","journal-title":"The Minimum Description Length Principle"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1152\/jn.00697.2004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2042347"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2183170"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284017"},{"key":"ref13","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1973.1091610"},{"key":"ref15","first-page":"27","article-title":"Causality, feedback and directed information","author":"massey","year":"1990","journal-title":"Proc 1990 IEEE Int Symp Inf Theory and Its Appl"},{"key":"ref16","author":"kramer","year":"1998","journal-title":"Directed Information for Channels with Feedback"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008147"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009849"},{"key":"ref19","article-title":"The information flow and capacity of channels with noisy feedback","author":"li","year":"2011"},{"key":"ref28","author":"royden","year":"1988","journal-title":"Real Analysis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649470"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1912791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref29","first-page":"270","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"chu","year":"1965","journal-title":"Sci Sinica"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73133-7_11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2139204"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2129515"},{"key":"ref2","article-title":"Directed information graphs","author":"quinn","year":"2012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160412"},{"key":"ref1","author":"koller","year":"2009","journal-title":"Probabilistic Graphical Models Principles and Techniques"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896887"},{"key":"ref22","author":"gorantla","year":"2012","journal-title":"The interplay between information and control theory within interactive decision-making problems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.929361"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10827-010-0247-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2136270"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227677"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1090-5"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6516065\/06506113.pdf?arnumber=6506113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:56:01Z","timestamp":1638219361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6506113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":39,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2013.2259161","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}