{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T12:41:53Z","timestamp":1780576913489,"version":"3.54.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T00:00:00Z","timestamp":1742342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB2901404"],"award-info":[{"award-number":["2022YFB2901404"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62132007, 62221003, 62472219"],"award-info":[{"award-number":["62132007, 62221003, 62472219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"China Post-Doctoral Science Foundation","award":["2024T171163"],"award-info":[{"award-number":["2024T171163"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>Time-Sensitive Networking (TSN), as an enhancement based on Ethernet, can ensure deterministic traffic transmission with low delays and minimal jitters. However, TSN switches have only eight priority queues inherited from Ethernet at each egress port, which limits the flexibility and efficiency of traffic scheduling, as well as the support for developing traffic management mechanisms. Although per-flow queues boost scheduling and Quality of Service (QoS), static per-flow hardware queues in switches are considered unpractical due to resource limits. In this article, we leverage the limitation of buffer size on the number of concurrent flows in shared buffer TSN switches to design Dynamic Per-Flow Queues (DFQ). DFQ only maintains a fixed number of virtual queues determined by the buffer size and dynamically manages the mapping between virtual queues and active flows to provide the capability of per-flow queuing. By constructing Flow Mapping Table\u00a0(FMT) with content-addressable memory (or hash bucket), DFQ can quickly match, create, and recycle queues to multiplex limited switch resource. We prototype DFQ on an FPGA switch and evaluate its performance in different scenarios. Experimental results show that DFQ can decrease the overhead of per-flow isolation with minimal impact on delay and throughput, indicating that DFQ is an effective per-flow queues solution.<\/jats:p>","DOI":"10.1145\/3718087","type":"journal-article","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T11:19:52Z","timestamp":1739963992000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Per-Flow Queues in Shared Buffer TSN Switches"],"prefix":"10.1145","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3551-606X","authenticated-orcid":false,"given":"Wenxue","family":"Wu","sequence":"first","affiliation":[{"name":"Lanzhou University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2477-7140","authenticated-orcid":false,"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1989-3068","authenticated-orcid":false,"given":"Zhen","family":"Li","sequence":"additional","affiliation":[{"name":"Lanzhou University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6138-6571","authenticated-orcid":false,"given":"Xiaoqin","family":"Feng","sequence":"additional","affiliation":[{"name":"Lanzhou University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8582-0902","authenticated-orcid":false,"given":"Liwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Lanzhou University, Lanzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6526-3889","authenticated-orcid":false,"given":"Fengyuan","family":"Ren","sequence":"additional","affiliation":[{"name":"Lanzhou University, Lanzhou, China and Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,3,19]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2011.5940562"},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","unstructured":"Delphine Reinhardt Parag S. Mogre and Matthias Hollick. 2010. Survey on wireless sensor network technologies for industrial automation: The security and quality of service perspectives. Future Internet 2 (2010) 96\u2013125.","DOI":"10.3390\/fi2020096"},{"key":"e_1_3_3_4_2","doi-asserted-by":"crossref","unstructured":"David Ger\u00f3nimo G\u00f3mez Antonio M. L\u00f3pez Angel Domingo Sappa and Thorsten Graf. 2010. Survey of pedestrian detection for advanced driver assistance systems. IEEE Transactions on Pattern Analysis and Machine Intelligence 32 (2010) 1239\u20131258.","DOI":"10.1109\/TPAMI.2009.122"},{"key":"e_1_3_3_5_2","first-page":"1","volume-title":"Proc. ACM\/IEEE Design Automation Conference (DAC\u201920)","author":"Yan Jinli","year":"2020","unstructured":"Jinli Yan, Wei Quan, Xiangrui Yang, Wenwen Fu, Yue Jiang, Hui Yang, and Zhigang Sun. 2020. TSN-Builder: Enabling rapid customization of resource-efficient switches for time-sensitive networking. In Proc. ACM\/IEEE Design Automation Conference (DAC\u201920). 1\u20136."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","unstructured":"Lucia Lo Bello Enrico Bini and Gaetano Patti. 2015. Priority-driven swapping-based scheduling of aperiodic real-time messages over EtherCAT networks. IEEE Transactions on Industrial Informatics 11 3 (2015) 741\u2013751. DOI:10.1109\/TII.2014.2350832","DOI":"10.1109\/TII.2014.2350832"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","unstructured":"Guilherme Serpa Sestito Afonso Celso Turcato Andre Luis Dias Murilo Silveira Rocha Maira Martins da Silva Paolo Ferrari and Dennis Brandao. 2018. A method for anomalies detection in real-time ethernet data traffic applied to PROFINET. IEEE Transactions on Industrial Informatics 14 5 (2018) 2171\u20132180. DOI:10.1109\/TII.2017.2772082","DOI":"10.1109\/TII.2017.2772082"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","unstructured":"Krystian Erwinski Marcin Paprocki Lech M. Grzesiak Kazimierz Karwowski and Andrzej Wawrzak. 2013. Application of ethernet powerlink for communication in a linux RTAI open CNC system. IEEE Transactions on Industrial Electronics 60 2 (2013) 628\u2013636. DOI:10.1109\/TIE.2012.2206348","DOI":"10.1109\/TIE.2012.2206348"},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","unstructured":"Ahmed Nasrallah Akhilesh S. Thyagaturu Ziyad Alharbi Cuixiang Wang Xing Shao Martin Reisslein and Hesham ElBakoury. 2019. Ultra-low latency (ULL) networks: The IEEE TSN and IETF DetNet standards and related 5G ULL research. IEEE Communications Surveys & Tutorials 21 1 (2019) 88\u2013145.","DOI":"10.1109\/COMST.2018.2869350"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Lucia Lo Bello Mohammad Ashjaei Gaetano Patti and Moris Behnam. 2020. Schedulability analysis of time-sensitive networks with scheduled traffic and preemption support. J. Parallel and Distrib. Comput. 144 (2020) 153\u2013171.DOI:10.1016\/j.jpdc.2020.06.001","DOI":"10.1016\/j.jpdc.2020.06.001"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997470"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","unstructured":"Jean Walrand. 2023. A concise tutorial on traffic shaping and scheduling in time-sensitive networks. IEEE Communications Surveys & Tutorials 25 3 (2023) 1941\u20131953.","DOI":"10.1109\/COMST.2023.3275038"},{"key":"e_1_3_3_13_2","unstructured":"2020. IEEE standard for local and metropolitan area networks\u2013bridges and bridged networks - amendment 34: Asynchronous traffic shaping. IEEE Std 802.1Qcr-2020 (Amendment to IEEE Std 802.1Q-2018 as Amended by IEEE Std 802.1Qcp-2018 IEEE Std 802.1Qcc-2018 IEEE Std 802.1Qcy-2019 and IEEE Std 802.1Qcx-2020) (2020) 1\u2013151."},{"key":"e_1_3_3_14_2","unstructured":"Broadcom. Broadcom 53154 TSN Chip. ([n. d.]). Retrieved August 29 2024 from https:\/\/www.broadcom.com\/products\/ethernet-connectivity\/switching\/roboswitch\/bcm53154"},{"key":"e_1_3_3_15_2","unstructured":"Kyland. SICOM3000TSN. ([n. d.]). Retrieved August 29 2024 from https:\/\/www.kyland.com.cn\/products\/SICOM3000TSN.html"},{"key":"e_1_3_3_16_2","unstructured":"Planet. TSN-5225-4T. ([n. d.]). Retrieved August 29 2024 from https:\/\/planet.com.br\/produtos\/tsn-5225-4t"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","unstructured":"Zonghui Li Hai Wan Yangdong Deng Xibin Zhao Yue Gao Xiaoyu Song and Ming Gu. 2020. Time-triggered switch-memory-switch architecture for time-sensitive networking switches. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 1 (2020) 185\u2013198.","DOI":"10.1109\/TCAD.2018.2883996"},{"key":"e_1_3_3_18_2","first-page":"1","volume-title":"Proceedings of the Annual Conference of the IEEE Industrial Electronics Society (IECON\u201921)","author":"Yun Qiwen","year":"2021","unstructured":"Qiwen Yun, Qimin Xu, Yanzhou Zhang, Yingxiu Chen, Yafei Sun, and Cailian Chen. 2021. Flexible switching architecture with virtual-queue for time-sensitive networking switches. In Proceedings of the Annual Conference of the IEEE Industrial Electronics Society (IECON\u201921). 1\u20136."},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","unstructured":"Abdesselem Kortebi Luca Muscariello Sara Oueslati and James Roberts. 2005. Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing. ACM SIGMETRICS Performance Evaluation Review 33 1 (2005) 217\u2013228.","DOI":"10.1145\/1071690.1064237"},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","unstructured":"B. Suter T. V. Lakshman D. Stiliadis and A. K. Choudhury. 1999. Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing. IEEE Journal on Selected Areas in Communications 17 6 (1999) 1159\u20131169.","DOI":"10.1109\/49.772451"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"Danfeng Shan Wanchun Jiang and Fengyuan Ren. 2017. Analyzing and enhancing dynamic threshold policy of data center switches. IEEE Transactions on Parallel and Distributed Systems 28 9 (2017) 2454\u20132470.","DOI":"10.1109\/TPDS.2017.2671429"},{"key":"e_1_3_3_22_2","first-page":"67","volume-title":"Proceedings of the ACM\/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA\u201912)","author":"Dai Zefu","year":"2012","unstructured":"Zefu Dai and Jianwen Zhu. 2012. Saturating the transceiver bandwidth: Switch fabric design on FPGAs. In Proceedings of the ACM\/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA\u201912). 67\u201376."},{"key":"e_1_3_3_23_2","first-page":"1169","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201999)","author":"Chuang Shang-Tse","year":"1999","unstructured":"Shang-Tse Chuang, A. Goel, N. McKeown, and B. Prabhakar. 1999. Matching output queueing with a combined input output queued switch. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201999). 1169\u20131178."},{"key":"e_1_3_3_24_2","first-page":"1909","volume-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201998)","author":"Prabhakar B.","year":"1998","unstructured":"B. Prabhakar and N. McKeown. 1998. On the speedup required for combined input and output queued switching. In Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201998). 1909\u20131920."},{"key":"e_1_3_3_25_2","unstructured":"Renesas. Dual-Port SRAM. ([n. d.]). Retrieved August 29 2024 from https:\/\/www.renesas.com\/us\/en\/document\/apn\/254-most-commonly-asked-questions-about-sync-dual-ports"},{"key":"e_1_3_3_26_2","volume-title":"The All-New Switch Book: The Complete Guide to LAN Switching Technology","author":"Seifert Rich","year":"2008","unstructured":"Rich Seifert and J. H. Edwards. 2008. The All-New Switch Book: The Complete Guide to LAN Switching Technology. Wiley."},{"key":"e_1_3_3_27_2","unstructured":"Broadcom. Trident3-X5\/BCM56770 Series. ([n. d.]). Retrieved August 29 2024 from https:\/\/www.broadcom.com\/products\/ethernet-connectivity\/switching\/strataxgs\/bcm56770-series"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","unstructured":"Curtis Villamizar and Cheng Song. 1994. High performance TCP in ANSNET. ACM SIGCOMM Computer Communication Review (Oct1994) 45\u201360.","DOI":"10.1145\/205511.205520"},{"key":"e_1_3_3_29_2","unstructured":"Rudy Belliardi J. Dorr T. Enzinger F. Essler J. Farkas M. Hantel M. Riegel M. P. Stanica G. Steindl R. Wam\u00dfer Karl Weber and Steven A. Zuponcic. 2018. Use Cases IEC\/IEEE 60802 v1.3. (2018)."},{"key":"e_1_3_3_30_2","first-page":"1185","volume-title":"Proceedings of the IEEE Symposium on Computers and Communications (ISCC\u201923)","author":"Jing Haokai","year":"2023","unstructured":"Haokai Jing and Tong Zhang. 2023. Improving traffic scheduling based on per-flow virtual queues in time-sensitive networking. In Proceedings of the IEEE Symposium on Computers and Communications (ISCC\u201923). 1185\u20131188."},{"key":"e_1_3_3_31_2","first-page":"1","volume-title":"Proceedings of the IEEE International Workshop on Factory Communication Systems (WFCS\u201918)","author":"Zhou Zifan","year":"2018","unstructured":"Zifan Zhou, Ying Yan, Michael Berger, and Sarah Ruepp. 2018. Analysis and modeling of asynchronous traffic shaping in time sensitive networks. In Proceedings of the IEEE International Workshop on Factory Communication Systems (WFCS\u201918). 1\u20134."},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Florian Heilmann and Gerhard Fohler. 2019. Size-based queuing: An approach to improve bandwidth utilization in TSN networks. ACM SIGBED Rev. 16 (2019) 9\u201314.","DOI":"10.1145\/3314206.3314207"},{"key":"e_1_3_3_33_2","first-page":"1","volume-title":"Proceedings of the ACM Workshop on Hot Topics in Networks (HotNets\u201918)","author":"Kim Daehyeok","year":"2018","unstructured":"Daehyeok Kim, Yibo Zhu, Changhoon Kim, Jeongkeun Lee, and Srinivasan Seshan. 2018. Generic external memory for switch data planes. In Proceedings of the ACM Workshop on Hot Topics in Networks (HotNets\u201918). ACM, 1\u20137."},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","unstructured":"Abhijit K. Choudhury and Ellen L. Hahne. 1998. Dynamic queue length thresholds for shared-memory packet switches. IEEE\/ACM Transactions On Networking 6 2 (1998) 130\u2013140.","DOI":"10.1109\/90.664262"},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","unstructured":"Farouk Kamoun and Leonard Kleinrock. 1980. Analysis of shared finite storage in a computer network node environment under general traffic conditions. IEEE Transactions on Communications 28 7 (1980) 992\u20131003.","DOI":"10.1109\/TCOM.1980.1094756"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"Aristides Nikologiannis Ioannis Papaefstathiou Georgios Kornaros and Christoforos Kachris. 2004. An FPGA-based queue management system for high speed networking devices. Microprocess and Microsystems 28 (2004) 223\u2013236.","DOI":"10.1016\/j.micpro.2004.03.014"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.189"},{"key":"e_1_3_3_38_2","unstructured":"Xilinx. SoCs with Hardware and Software Programmability. ([n. d.]). Retrieved August 29 2024 from https:\/\/www.amd.com\/en\/products\/adaptive-socs-and-fpgas\/soc\/zynq-7000.html"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","unstructured":"Xuan-Thuan Nguyen Trong-Thuc Hoang Hong-Thu Nguyen Katsumi Inoue and Cong-Kha Pham. 2019. An efficient I\/O architecture for RAM-based content-addressable memory on FPGA. IEEE Transactions on Circuits and Systems II: Express Briefs 66 3 (2019) 472\u2013476. DOI:10.1109\/TCSII.2018.2849925","DOI":"10.1109\/TCSII.2018.2849925"},{"key":"e_1_3_3_40_2","first-page":"19","volume-title":"Proceedings of the IEEE Symposium on High Performance Interconnects (HOTI\u201911)","author":"Wang Hao","year":"2011","unstructured":"Hao Wang and Bill Lin. 2011. Per-flow queue scheduling with pipelined counting priority index. In Proceedings of the IEEE Symposium on High Performance Interconnects (HOTI\u201911). 19\u201326."},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","unstructured":"Alfredo Viola. 2010. Distributional analysis of the parking problem and Robin Hood linear probing hashing with buckets. Discrete Mathematics & Theoretical Computer Science 12 (2010).","DOI":"10.46298\/dmtcs.519"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","unstructured":"Ronald Fagin Jurg Nievergelt Nicholas Pippenger and H. Raymond Strong. 1979. Extendible hashing\u2013a fast access method for dynamic files. ACM Trans. Database Syst. 4 3 (Sept.1979) 315\u2013344. DOI:10.1145\/320083.320092","DOI":"10.1145\/320083.320092"},{"key":"e_1_3_3_43_2","unstructured":"Intel. Intel\u00ae Ethernet Server Adapter I210-T1. ([n. d.]). Retrieved December 9 2024 from https:\/\/www.intel.com\/content\/www\/us\/en\/products\/sku\/68668\/intel-ethernet-server-adapter-i210t1\/specifications.html"},{"key":"e_1_3_3_44_2","doi-asserted-by":"crossref","unstructured":"J. Gomez-Cornejo A. Zuloaga I. Villalta J. Del Ser U. Kretzschmar and J. Lazaro. 2017. A novel BRAM content accessing and processing method based on FPGA configuration bitstream. Microprocessors and Microsystems 49 (2017) 64\u201376.","DOI":"10.1016\/j.micpro.2017.01.009"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","unstructured":"Jianhua Wei Lei Zhu Weichuan Zhang Zhi Feng and Peng Guo. 2014. Dynamic per-flow queuing to reduce competitions among large number of flows. Chinese Journal of Electronics 23 4 (2014) 783\u2013789.","DOI":"10.23919\/CJE.2014.10851931"},{"key":"e_1_3_3_46_2","doi-asserted-by":"crossref","unstructured":"Anastasios Psarras Michalis Paschou Chrysostomos Nicopoulos and Giorgos Dimitrakopoulos. 2017. A dual-clock multiple-queue shared buffer. IEEE Trans. Comput. 66 10 (2017) 1809\u20131815.","DOI":"10.1109\/TC.2017.2705141"},{"key":"e_1_3_3_47_2","first-page":"2048","volume-title":"Proceedings of the IEEE International Conference on Communications (ICC\u201901)","volume":"7","author":"Nikologiannis Aggelos","year":"2001","unstructured":"Aggelos Nikologiannis and Manolis Katevenis. 2001. Efficient per-flow queueing in DRAM at OC-192 line rate using out-of-order execution techniques. In Proceedings of the IEEE International Conference on Communications (ICC\u201901), Vol. 7. 2048\u20132052."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1064"},{"key":"e_1_3_3_49_2","first-page":"604","volume-title":"Proceedings of the 2021 IFIP\/IEEE International Symposium on Integrated Network Management (IM\u201921)","author":"Xue Junli","year":"2021","unstructured":"Junli Xue, Guochu Shou, Yaqiong Liu, Yihong Hu, and Zhigang Guo. 2021. Time-aware traffic scheduling with virtual queues in time-sensitive networking. In Proceedings of the 2021 IFIP\/IEEE International Symposium on Integrated Network Management (IM\u201921). IEEE, 604\u2013607."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3718087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3718087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:37Z","timestamp":1750295917000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3718087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,19]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3718087"],"URL":"https:\/\/doi.org\/10.1145\/3718087","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,19]]},"assertion":[{"value":"2024-09-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}