{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:54:28Z","timestamp":1756000468005,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2018-05175"],"award-info":[{"award-number":["RGPIN-2018-05175"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3534540.3534690","type":"proceedings-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T22:31:35Z","timestamp":1653345095000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Anti-vertex for neighborhood constraints in subgraph queries"],"prefix":"10.1145","author":[{"given":"Kasra","family":"Jamshidi","sequence":"first","affiliation":[{"name":"Simon Fraser University, British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mugilan","family":"Mariappan","sequence":"additional","affiliation":[{"name":"Simon Fraser University, British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keval","family":"Vora","sequence":"additional","affiliation":[{"name":"Simon Fraser University, British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mining contrasting quasi-clique patterns. CoRR, abs\/1810.01836","author":"Alonso Roberto","year":"2018","unstructured":"Roberto Alonso and Stephan G\u00fcnnemann . Mining contrasting quasi-clique patterns. CoRR, abs\/1810.01836 , 2018 . Roberto Alonso and Stephan G\u00fcnnemann. Mining contrasting quasi-clique patterns. CoRR, abs\/1810.01836, 2018."},{"key":"e_1_3_2_1_2_1","unstructured":"Amazon Inc. Amazon Neptune 2022. Version 1.1.0.0. Amazon Inc. Amazon Neptune 2022. Version 1.1.0.0."},{"issue":"6","key":"e_1_3_2_1_3_1","first-page":"691","volume":"11","author":"Ammar Khaled","year":"2018","unstructured":"Khaled Ammar , Frank McSherry , Semih Salihoglu , and Manas Joglekar. Distributed Evaluation of Subgraph Queries Using Worst-Case Optimal Low-Memory Dataflows. Proceedings of the VLDB Endowment , 11 ( 6 ): 691 -- 704 , February 2018 . Khaled Ammar, Frank McSherry, Semih Salihoglu, and Manas Joglekar. Distributed Evaluation of Subgraph Queries Using Worst-Case Optimal Low-Memory Dataflows. Proceedings of the VLDB Endowment, 11(6):691--704, February 2018.","journal-title":"Manas Joglekar. Distributed Evaluation of Subgraph Queries Using Worst-Case Optimal Low-Memory Dataflows. Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_1_4_1","first-page":"1421","volume-title":"Proceedings of the ACM International Conference on Management of Data, SIGMOD '18","author":"Angles Renzo","year":"2018","unstructured":"Renzo Angles , Marcelo Arenas , Pablo Barcelo , Peter Boncz , George Fletcher , Claudio Gutierrez , Tobias Lindaaker , Marcus Paradies , Stefan Plantikow , Juan Sequeda , Oskar van Rest , and Hannes Voigt . G-CORE : A core for future graph query languages . In Proceedings of the ACM International Conference on Management of Data, SIGMOD '18 , page 1421 -- 1432 , 2018 . Renzo Angles, Marcelo Arenas, Pablo Barcelo, Peter Boncz, George Fletcher, Claudio Gutierrez, Tobias Lindaaker, Marcus Paradies, Stefan Plantikow, Juan Sequeda, Oskar van Rest, and Hannes Voigt. G-CORE: A core for future graph query languages. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '18, page 1421--1432, 2018."},{"key":"e_1_3_2_1_5_1","volume-title":"September","author":"Angles Renzo","year":"2017","unstructured":"Renzo Angles , Marcelo Arenas , Pablo Barcel\u00f3 , Aidan Hogan , Juan Reutter , and Domagoj Vrgo\u010d . Foundations of Modern Query Languages for Graph Databases. ACM Computing Surveys, 50(5) , September 2017 . Renzo Angles, Marcelo Arenas, Pablo Barcel\u00f3, Aidan Hogan, Juan Reutter, and Domagoj Vrgo\u010d. Foundations of Modern Query Languages for Graph Databases. ACM Computing Surveys, 50(5), September 2017."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"issue":"4","key":"e_1_3_2_1_8_1","volume":"36","author":"Cheng James","year":"2011","unstructured":"James Cheng , Yiping Ke , Ada Wai-Chee Fu , Jeffrey Xu Yu , and Linhong Zhu. Finding Maximal Cliques in Massive Networks. ACM Transactions on Database Systems , 36 ( 4 ), December 2011 . James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, and Linhong Zhu. Finding Maximal Cliques in Massive Networks. ACM Transactions on Database Systems, 36(4), December 2011.","journal-title":"Linhong Zhu. Finding Maximal Cliques in Massive Networks. ACM Transactions on Database Systems"},{"key":"e_1_3_2_1_9_1","volume-title":"A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13(6):377--387,June","author":"Codd E. F.","year":"1970","unstructured":"E. F. Codd . A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13(6):377--387,June 1970 . E. F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13(6):377--387,June 1970."},{"key":"e_1_3_2_1_10_1","volume-title":"W3","author":"Cyganiak Richard","year":"2014","unstructured":"Richard Cyganiak , David Wood , and Markus Lanthaler . RDF 1.1 Concepts and Abstract Syntax . Technical report , W3 Consortium , 2014 . Richard Cyganiak, David Wood, and Markus Lanthaler. RDF 1.1 Concepts and Abstract Syntax. Technical report, W3 Consortium, 2014."},{"key":"e_1_3_2_1_11_1","volume-title":"Graph Pattern Matching in GQL and SQL\/PGQ. CoRR, abs\/2112.06217","author":"Deutsch Alin","year":"2021","unstructured":"Alin Deutsch , Nadime Francis , Alastair Green , Keith Hare , Bei Li , Leonid Libkin , Tobias Lindaaker , Victor Marsault , Wim Martens , Jan Michels , Filip Murlak , Stefan Plantikow , Petra Selmer , Hannes Voigt , Oskar van Rest , Domagoj Vrgoc , Mingxi Wu , and Fred Zemke . Graph Pattern Matching in GQL and SQL\/PGQ. CoRR, abs\/2112.06217 , 2021 . Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Hannes Voigt, Oskar van Rest, Domagoj Vrgoc, Mingxi Wu, and Fred Zemke. Graph Pattern Matching in GQL and SQL\/PGQ. CoRR, abs\/2112.06217, 2021."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386144"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.91"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Graph Grammars with Applications to Semantic Networks. Computers & Mathematics with Applications, 23(6--9):557--572","author":"Ehrig Hartmut","year":"1992","unstructured":"Hartmut Ehrig , Annegret Habel , and Hans-J\u00f6rg Kreowski . Introduction to Graph Grammars with Applications to Semantic Networks. Computers & Mathematics with Applications, 23(6--9):557--572 , 1992 . Hartmut Ehrig, Annegret Habel, and Hans-J\u00f6rg Kreowski. Introduction to Graph Grammars with Applications to Semantic Networks. Computers & Mathematics with Applications, 23(6--9):557--572, 1992."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380585"},{"key":"e_1_3_2_1_16_1","first-page":"1843","volume-title":"Jingbo Xu. Functional Dependencies for Graphs. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16","author":"Fan Wenfei","year":"2016","unstructured":"Wenfei Fan , Yinghui Wu , and Jingbo Xu. Functional Dependencies for Graphs. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16 , page 1843 -- 1857 , 2016 . Wenfei Fan, Yinghui Wu, and Jingbo Xu. Functional Dependencies for Graphs. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16, page 1843--1857, 2016."},{"key":"e_1_3_2_1_17_1","first-page":"1433","volume-title":"Andr\u00e9s Taylor. Cypher: An Evolving Query Language for Property Graphs. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '18","author":"Francis Nadime","year":"2018","unstructured":"Nadime Francis , Alastair Green , Paolo Guagliardo , Leonid Libkin , Tobias Lindaaker , Victor Marsault , Stefan Plantikow , Mats Rydberg , Petra Selmer , and Andr\u00e9s Taylor. Cypher: An Evolving Query Language for Property Graphs. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '18 , page 1433 -- 1445 , 2018 . Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, and Andr\u00e9s Taylor. Cypher: An Evolving Query Language for Property Graphs. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '18, page 1433--1445, 2018."},{"key":"e_1_3_2_1_18_1","first-page":"92","volume-title":"Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology","author":"Joshua","year":"2007","unstructured":"Joshua A. Grochow and Manolis Kellis . Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology , pages 92 -- 106 , 2007 . Joshua A. Grochow and Manolis Kellis. Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology, pages 92--106, 2007."},{"key":"e_1_3_2_1_19_1","volume-title":"Graph Grammars with Negative Application Conditions. Fundamenta Informaticae, 26(3--4):287--313","author":"Habel Annegret","year":"1996","unstructured":"Annegret Habel , Reiko Heckel , and Gabriele Taentzer . Graph Grammars with Negative Application Conditions. Fundamenta Informaticae, 26(3--4):287--313 , 1996 . Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph Grammars with Negative Application Conditions. Fundamenta Informaticae, 26(3--4):287--313, 1996."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_21_1","first-page":"337","volume-title":"Jeong-Hoon Lee. Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '13","author":"Han Wook-Shin","year":"2013","unstructured":"Wook-Shin Han , Jinsoo Lee , and Jeong-Hoon Lee. Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '13 , pages 337 -- 348 , 2013 . Wook-Shin Han, Jinsoo Lee, and Jeong-Hoon Lee. Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '13, pages 337--348, 2013."},{"key":"e_1_3_2_1_22_1","volume-title":"W3","author":"Harris Steve","year":"2013","unstructured":"Steve Harris and Andy Seaborne . SPARQL 1.1 Query Language . Technical report , W3 Consortium , 2013 . Steve Harris and Andy Seaborne. SPARQL 1.1 Query Language. Technical report, W3 Consortium, 2013."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807620"},{"key":"e_1_3_2_1_24_1","volume-title":"Keval Vora. Peregrine: A Pattern-Aware Graph Mining System. In Proceedings of the Fifteenth European Conference on Computer Systems, EuroSys '20","author":"Jamshidi Kasra","year":"2020","unstructured":"Kasra Jamshidi , Rakesh Mahadasa , and Keval Vora. Peregrine: A Pattern-Aware Graph Mining System. In Proceedings of the Fifteenth European Conference on Computer Systems, EuroSys '20 , 2020 . Kasra Jamshidi, Rakesh Mahadasa, and Keval Vora. Peregrine: A Pattern-Aware Graph Mining System. In Proceedings of the Fifteenth European Conference on Computer Systems, EuroSys '20, 2020."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469381"},{"key":"e_1_3_2_1_26_1","first-page":"1695","volume-title":"Semih Salihoglu. Graphflow: An Active Graph Database. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '17","author":"Kankanamge Chathura","year":"2017","unstructured":"Chathura Kankanamge , Siddhartha Sahu , Amine Mhedbhi , Jeremy Chen , and Semih Salihoglu. Graphflow: An Active Graph Database. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '17 , page 1695 -- 1698 , 2017 . Chathura Kankanamge, Siddhartha Sahu, Amine Mhedbhi, Jeremy Chen, and Semih Salihoglu. Graphflow: An Active Graph Database. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '17, page 1695--1698, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915209"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Kyoungmin Kim In Seo Wook-Shin Han Jeong-Hoon Lee Sungpack Hong Hassan Chafi Hyungyu Shin and Geonhwa Jeong. TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data. In Proceedings of the ACM International Conference on Management of Data SIGMOD '18 pages 411--426 2018. Kyoungmin Kim In Seo Wook-Shin Han Jeong-Hoon Lee Sungpack Hong Hassan Chafi Hyungyu Shin and Geonhwa Jeong. TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data. In Proceedings of the ACM International Conference on Management of Data SIGMOD '18 pages 411--426 2018.","DOI":"10.1145\/3183713.3196917"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_1_32_1","unstructured":"Neo4j Inc. Neo4j Graph Database 2022. Version 4.4. Neo4j Inc. Neo4j Graph Database 2022. Version 4.4."},{"key":"e_1_3_2_1_33_1","first-page":"631","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03","author":"Caleb","year":"2003","unstructured":"Caleb C. Noble and Diane J. Cook. Graph-Based Anomaly Detection . In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03 , page 631 -- 636 , 2003 . Caleb C. Noble and Diane J. Cook. Graph-Based Anomaly Detection. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, page 631--636, 2003."},{"key":"e_1_3_2_1_34_1","first-page":"321","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation, NSDI '21","author":"Qian Zhengping","year":"2021","unstructured":"Zhengping Qian , Chenqiang Min , Longbin Lai , Yong Fang , Gaofeng Li , Youyang Yao , Bingqing Lyu , Xiaoli Zhou , Zhimin Chen , and Jingren Zhou . GAIA : A System for Interactive Analysis on Distributed Graphs Using a High-Level Language . In 18th USENIX Symposium on Networked Systems Design and Implementation, NSDI '21 , pages 321 -- 335 . USENIX Association , April 2021 . Zhengping Qian, Chenqiang Min, Longbin Lai, Yong Fang, Gaofeng Li, Youyang Yao, Bingqing Lyu, Xiaoli Zhou, Zhimin Chen, and Jingren Zhou. GAIA: A System for Interactive Analysis on Distributed Graphs Using a High-Level Language. In 18th USENIX Symposium on Networked Systems Design and Implementation, NSDI '21, pages 321--335. USENIX Association, April 2021."},{"issue":"2","key":"e_1_3_2_1_35_1","first-page":"176","volume":"11","author":"Qiao Miao","year":"2017","unstructured":"Miao Qiao , Hao Zhang , and Hong Cheng. Subgraph Matching: On Compression and Computation. Proceedings of the VLDB Endowment , 11 ( 2 ): 176 -- 188 , October 2017 . Miao Qiao, Hao Zhang, and Hong Cheng. Subgraph Matching: On Compression and Computation. Proceedings of the VLDB Endowment, 11(2):176--188, October 2017.","journal-title":"Hong Cheng. Subgraph Matching: On Compression and Computation. Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342272"},{"key":"e_1_3_2_1_37_1","first-page":"1","volume-title":"Rodriguez. The Gremlin Graph Traversal Machine and Language. In Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015","author":"Marko","year":"2015","unstructured":"Marko A. Rodriguez. The Gremlin Graph Traversal Machine and Language. In Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015 , page 1 -- 10 , 2015 . Marko A. Rodriguez. The Gremlin Graph Traversal Machine and Language. In Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015, page 1--10, 2015."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078454"},{"key":"e_1_3_2_1_39_1","first-page":"1083","volume-title":"Sun and Qiong Luo. In-Memory Subgraph Matching: An In-Depth Study. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '20","author":"Shixuan","year":"2020","unstructured":"Shixuan Sun and Qiong Luo. In-Memory Subgraph Matching: An In-Depth Study. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '20 , page 1083 -- 1098 , 2020 . Shixuan Sun and Qiong Luo. In-Memory Subgraph Matching: An In-Depth Study. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '20, page 1083--1098, 2020."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210271"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_1_42_1","first-page":"2049","volume-title":"Wenjie Zhang. HUGE: An Efficient and Scalable Subgraph Enumeration System. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '21","author":"Yang Zhengyi","year":"2021","unstructured":"Zhengyi Yang , Longbin Lai , Xuemin Lin , Kongzhang Hao , and Wenjie Zhang. HUGE: An Efficient and Scalable Subgraph Enumeration System. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '21 , page 2049 -- 2062 , 2021 . Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, and Wenjie Zhang. HUGE: An Efficient and Scalable Subgraph Enumeration System. In Proceedings of the ACM International Conference on Management of Data, SIGMOD '21, page 2049--2062, 2021."},{"key":"e_1_3_2_1_43_1","first-page":"832","volume-title":"CP 2005","author":"Zampelli St\u00e9phane","year":"2005","unstructured":"St\u00e9phane Zampelli , Yves Deville , and Pierre Dupont . Approximate Constrained Subgraph Matching. In Peter van Beek, editor, Principles and Practice of Constraint Programming , CP 2005 , pages 832 -- 836 , Berlin, Heidelberg , 2005 . Springer Berlin Heidelberg. St\u00e9phane Zampelli, Yves Deville, and Pierre Dupont. Approximate Constrained Subgraph Matching. In Peter van Beek, editor, Principles and Practice of Constraint Programming, CP 2005, pages 832--836, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia Pennsylvania","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534540.3534690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534540.3534690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:10Z","timestamp":1750186810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534540.3534690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":43,"alternative-id":["10.1145\/3534540.3534690","10.1145\/3534540"],"URL":"https:\/\/doi.org\/10.1145\/3534540.3534690","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}