{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:45:42Z","timestamp":1753274742575,"version":"3.41.0"},"reference-count":97,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>Instruction reordering and interleavings in program execution under relaxed memory semantics result in non-intuitive behaviors, making it difficult to provide assurances about program correctness. Studies have shown that up to 90% of the concurrency bugs reported by state-of-the-art static analyzers are false alarms. As a result, filtering false alarms and detecting real concurrency bugs is a challenging problem. Unsurprisingly, this problem has attracted the interest of the research community over the past few decades. Nonetheless, many of the existing techniques rely on analyzing source code, rarely consider the effects introduced by compilers, and assume a sequentially consistent memory model. In a practical setting, however, developers often do not have access to the source code, and even commodity architectures such as x86 and ARM are not sequentially consistent.<\/jats:p>\n          <jats:p>\n            In this work, we present\n            <jats:sc>B<\/jats:sc>\n            i\n            <jats:sc>rd<\/jats:sc>\n            , a prototype tool, to dynamically detect harmful data races in x86 binaries under relaxed memory models, TSO and PSO.\n            <jats:sc>B<\/jats:sc>\n            i\n            <jats:sc>rd<\/jats:sc>\n            employs\n            <jats:italic>source-DPOR<\/jats:italic>\n            to explore all distinct feasible interleavings for a multithreaded application. Our evaluation of\n            <jats:sc>B<\/jats:sc>\n            i\n            <jats:sc>rd<\/jats:sc>\n            on 42 publicly available benchmarks and its comparison with the state-of-the-art tools indicate\n            <jats:sc>B<\/jats:sc>\n            i\n            <jats:sc>rd<\/jats:sc>\n            \u2019s potential in effectively detecting data races in software binaries.\n          <\/jats:p>","DOI":"10.1145\/3498538","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T17:38:58Z","timestamp":1643650738000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["BiRD: Race Detection in Software Binaries under Relaxed Memory Models"],"prefix":"10.1145","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-7114","authenticated-orcid":false,"given":"Ridhi","family":"Jain","sequence":"first","affiliation":[{"name":"Indraprastha Institute of Information Technology Delhi, New Delhi, India"}]},{"given":"Rahul","family":"Purandare","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology Delhi, New Delhi, India"}]},{"given":"Subodh","family":"Sharma","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"volume-title":"COMP 2019\u20148th International Competition on Software Verification","year":"2019","key":"e_1_3_2_2_2","unstructured":"ETAPS 2019. COMP 2019\u20148th International Competition on Software Verification. Retrieved February 19, 2022 from https:\/\/sv-comp.sosy-lab.org\/2019\/."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1119479.1119480"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535845"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0275-0"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3073408"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3073408"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314649"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/978-3-319-63387-9_26","volume-title":"Computer Aided Verification","author":"Albert Elvira","year":"2017","unstructured":"Elvira Albert, Puri Arenas, Mar\u00eda Garc\u00eda de la Banda, Miguel G\u00f3mez-Zamalloa, and Peter J. Stuckey. 2017. Context-sensitive dynamic partial order reduction. In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International, Cham, Switzerland, 526\u2013543."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_28"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19835-9_5"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2016.04.002"},{"key":"e_1_3_2_13_2","volume-title":"Practical Binary Analysis: Build Your Own Linux Tools for Binary Instrumentation, Analysis, and Disassembly","author":"Andriesse Dennis","year":"2018","unstructured":"Dennis Andriesse. 2018. Practical Binary Analysis: Build Your Own Linux Tools for Binary Instrumentation, Analysis, and Disassembly. No Starch Press."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.68"},{"key":"e_1_3_2_15_2","volume-title":"Proceedings of the 1st Workshop on Software Tools for MultiCore Systems (STMCS\u201906)","author":"Banerjee Utpal","year":"2006","unstructured":"Utpal Banerjee, Brian Bliss, Zhiqiang Ma, and Paul Petersen. 2006. Unraveling data race detection in the Intel thread checker. In Proceedings of the 1st Workshop on Software Tools for MultiCore Systems (STMCS\u201906)."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926394"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3022671.2984036"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19835-9_3"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/1064500.1064503"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/109626.109641"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375620"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.654"},{"key":"e_1_3_2_23_2","first-page":"467","volume-title":"ACM SIGPLAN Notices","author":"Effinger-Dean Laura","year":"2012","unstructured":"Laura Effinger-Dean, Brandon Lucia, Luis Ceze, Dan Grossman, and Hans-J. Boehm. 2012. IFRit: Interference-free regions for dynamic data-race detection. ACM SIGPLAN Notices 47 (2012), 467\u2013484."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062342"},{"key":"e_1_3_2_25_2","first-page":"245","volume-title":"ACM SIGPLAN Notices","author":"Elmas Tayfun","year":"2007","unstructured":"Tayfun Elmas, Shaz Qadeer, and Serdar Tasiran. 2007. Goldilocks: A race and transaction-aware Java runtime. ACM SIGPLAN Notices 42 (2007), 245\u2013255."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835927"},{"key":"e_1_3_2_27_2","first-page":"121","volume-title":"ACM SIGPLAN Notices","author":"Flanagan Cormac","year":"2009","unstructured":"Cormac Flanagan and Stephen N. Freund. 2009. FastTrack: Efficient and precise dynamic race detection. ACM SIGPLAN Notices 44 (2009), 121\u2013133."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1047659.1040315"},{"key":"e_1_3_2_29_2","first-page":"176","volume-title":"Proceedings of the International Conference on Computer Aided Verification","author":"Godefroid Patrice","year":"1990","unstructured":"Patrice Godefroid. 1990. Using partial orders to improve automatic verification methods. In Proceedings of the International Conference on Computer Aided Verification. 176\u2013185."},{"key":"e_1_3_2_30_2","volume-title":"Proceedings of the CAV Workshop on Exploiting Concurrency Efficiently and Correctly","author":"Godefroid Patrice","year":"2008","unstructured":"Patrice Godefroid and Nachiappan Nagappan. 2008. Concurrency at Microsoft: An exploratory survey. In Proceedings of the CAV Workshop on Exploiting Concurrency Efficiently and Correctly."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/547238"},{"key":"e_1_3_2_32_2","first-page":"13","volume-title":"ACM SIGPLAN Notices","author":"Grossman Dan","year":"2003","unstructured":"Dan Grossman. 2003. Type-safe multithreading in cyclone. ACM SIGPLAN Notices 38 (2003), 13\u201325."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2103380.2103441"},{"key":"e_1_3_2_34_2","unstructured":"Marc Hartung. n.d. DataRaceBenchmark: Concurrency Benchmarks. Retrieved February 19 2022 from https:\/\/github.com\/marchartung\/DataRaceBenchmark\/; https:\/\/github.com\/marchartung\/DataRaceBenchmark\/find\/master."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSREW.2019.00100"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001438"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3022671.2984025"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3339186.3339195"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00017"},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/11817963_28","volume-title":"Computer Aided Verification","author":"Kahlon Vineet","year":"2006","unstructured":"Vineet Kahlon, Aarti Gupta, and Nishant Sinha. 2006. Symbolic model checking of concurrent programs using partial orders and on-the-fly transactions. In Computer Aided Verification, Thomas Ball and Robert B. Jones (Eds.). Springer, Berlin, Germany, 286\u2013299."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595701"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_26"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2248487.2150997"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.82"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158105"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314609"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378480"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374503"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2914770.2837643"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314604"},{"key":"e_1_3_2_52_2","first-page":"179","volume-title":"Concurrency: The Works of Leslie Lamport","author":"Lamport Leslie","year":"2019","unstructured":"Leslie Lamport. 2019. Time, clocks, and the ordering of events in a distributed system. In Concurrency: The Works of Leslie Lamport, Dahlia Malkhi (Ed). ACM Books, New York, NY, 179\u2013196."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3093333.3009857"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009857"},{"key":"e_1_3_2_55_2","first-page":"190","volume-title":"ACM SIGPLAN Notices","author":"Luk Chi-Keung","year":"2005","unstructured":"Chi-Keung Luk, Robert Cohn, Robert Muth, Harish Patil, Artur Klauser, Geoff Lowney, Steven Wallace, Vijay Janapa Reddi, and Kim Hazelwood. 2005. Pin: Building customized program analysis tools with dynamic instrumentation. ACM SIGPLAN Notices 40 (2005), 190\u2013200."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446711"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17906-2_30"},{"key":"e_1_3_2_58_2","first-page":"17","article-title":"Partial order backtracking","volume":"1","author":"McAllester David A.","year":"1993","unstructured":"David A. McAllester. 1993. Partial order backtracking. Journal of Artificial Intelligence Research 1 (1993), 17\u201324.","journal-title":"Journal of Artificial Intelligence Research"},{"volume-title":"SCTBench: C\/C++ Pthread Benchmarks. Retrieved February 19, 2022 from https:\/\/github.com\/mc-imperial\/sctbench.","author":"Group Imperial College London Multicore","key":"e_1_3_2_59_2","unstructured":"Imperial College London Multicore Group. n.d. SCTBench: C\/C++ Pthread Benchmarks. Retrieved February 19, 2022 from https:\/\/github.com\/mc-imperial\/sctbench."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.32"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_62_2","first-page":"22","volume-title":"ACM SIGPLAN Notices","author":"Narayanasamy Satish","year":"2007","unstructured":"Satish Narayanasamy, Zhenghao Wang, Jordan Tigani, Andrew Edwards, and Brad Calder. 2007. Automatically classifying benign and harmful data races using replay analysis. ACM SIGPLAN Notices 42 (2007), 22\u201331."},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509514"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781528"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806838"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3371085"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8_6"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011202615884"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2008.22"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3032293"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158107"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385993"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/2688204.2688205"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11747-3_3"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065958"},{"key":"e_1_3_2_77_2","article-title":"Thread-modular analysis of release-acquire concurrency","author":"Sharma Divyanjali","unstructured":"Divyanjali Sharma and Subodh Sharma. n.d. Thread-modular analysis of release-acquire concurrency. arXiv preprint arXiv:2107.02346 [accepted in SAS\u201921] (n.d.).","journal-title":"arXiv preprint arXiv:2107.02346 [accepted in SAS\u201921]"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985848"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.17"},{"key":"e_1_3_2_80_2","first-page":"387","volume-title":"ACM SIGPLAN Notices","author":"Smaragdakis Yannis","year":"2012","unstructured":"Yannis Smaragdakis, Jacob Evans, Caitlin Sadowski, Jaeheon Yi, and Cormac Flanagan. 2012. Sound predictive race detection in polynomial time. ACM SIGPLAN Notices 47 (2012), 387\u2013400."},{"key":"e_1_3_2_81_2","first-page":"97","volume-title":"Proceedings of the USENIX Winter 1993 Conference","author":"Sterling Nicholas","year":"1993","unstructured":"Nicholas Sterling. 1993. WARLOCK\u2014A static data race analysis tool. In Proceedings of the USENIX Winter 1993 Conference. 97\u2013106."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737992"},{"key":"e_1_3_2_83_2","first-page":"941","volume-title":"Proceedings of the 23rd USENIX Security Symposium (USENIX\u201914)","author":"Tice Caroline","year":"2014","unstructured":"Caroline Tice, Tom Roeder, Peter Collingbourne, Stephen Checkoway, \u00dalfar Erlingsson, Luis Lozano, and Geoff Pike. 2014. Enforcing forward-edge control-flow integrity in GCC and LLVM. In Proceedings of the 23rd USENIX Security Symposium (USENIX\u201914). 941\u2013955."},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/3093336.3037719"},{"key":"e_1_3_2_85_2","first-page":"429","volume-title":"Advanced Course on Petri Nets","author":"Valmari Antti","year":"1996","unstructured":"Antti Valmari. 1996. The state explosion problem. In Advanced Course on Petri Nets. Springer, 429\u2013528."},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043590"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287654"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_29"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1145\/2499368.2451120"},{"key":"e_1_3_2_90_2","volume-title":"Binary Analysis for Code Reconstruction of Control Software","author":"Wichmann Arne","year":"2012","unstructured":"Arne Wichmann. 2012. Binary Analysis for Code Reconstruction of Control Software. Diploma Thesis. Hamburg University of Technology."},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178514"},{"key":"e_1_3_2_92_2","unstructured":"Yu Yang Xiaofang Chen and Ganesh Gopalakrishnan. 2008. Inspect: A Runtime Model Checker for Multithreaded C Programs . Technical Report UUCS-08-004. University of Utah."},{"key":"e_1_3_2_93_2","volume-title":"Model Checking Software","author":"Yang Yu","year":"2008","unstructured":"Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, and Robert M. Kirby. 2008. Efficient stateful dynamic partial order reduction. In Model Checking Software, Klaus Havelund, Rupak Majumdar, and Jens Palsberg (Eds.). Springer, Berlin, Germany."},{"key":"e_1_3_2_94_2","first-page":"485","volume-title":"ACM SIGPLAN Notices","author":"Yu Jie","year":"2012","unstructured":"Jie Yu, Satish Narayanasamy, Cristiano Pereira, and Gilles Pokam. 2012. Maple: A coverage-driven testing tool for multithreaded programs. ACM SIGPLAN Notices 47 (2012), 485\u2013502."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095832"},{"volume-title":"DPthread\u2014Deterministic Pthread Benchmarks. Retrieved February 19, 2022 from https:\/\/github.com\/heechul\/dpthread","author":"Yun Heecul","key":"e_1_3_2_96_2","unstructured":"Heecul Yun. n.d. DPthread\u2014Deterministic Pthread Benchmarks. Retrieved February 19, 2022 from https:\/\/github.com\/heechul\/dpthread."},{"key":"e_1_3_2_97_2","first-page":"250","volume-title":"ACM SIGPLAN Notices","author":"Zhang Naling","year":"2015","unstructured":"Naling Zhang, Markus Kusano, and Chao Wang. 2015. Dynamic partial order reduction for relaxed memory models. ACM SIGPLAN Notices 50 (2015), 250\u2013259."},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1145\/3093336.3037708"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3498538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:27Z","timestamp":1750188627000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":97,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3498538"],"URL":"https:\/\/doi.org\/10.1145\/3498538","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"type":"print","value":"1049-331X"},{"type":"electronic","value":"1557-7392"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2021-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}