{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T12:05:59Z","timestamp":1784721959428,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:00:00Z","timestamp":1780704000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N629092512041"],"award-info":[{"award-number":["N629092512041"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["SoftwareX"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.softx.2026.102779","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:01:28Z","timestamp":1781276488000},"page":"102779","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["DisCoConnect: Computing connectivity in hypergraph category string diagrams via metagraph algorithms"],"prefix":"10.1016","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8602-0277","authenticated-orcid":false,"given":"Yumeng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.softx.2026.102779_bib0005","author":"De Felice"},{"key":"10.1016\/j.softx.2026.102779_bib0010","author":"Toumi"},{"key":"10.1016\/j.softx.2026.102779_bib0015","author":"Ahrens"},{"key":"10.1016\/j.softx.2026.102779_bib0020","author":"Fong"},{"key":"10.1016\/j.softx.2026.102779_bib0025","author":"Fong"},{"key":"10.1016\/j.softx.2026.102779_bib0030","series-title":"Metagraphs and their applications","author":"Basu","year":"2007"},{"key":"10.1016\/j.softx.2026.102779_bib0035","series-title":"2024 14th international workshop on resilient networks design and modeling (RNDM)","first-page":"1","article-title":"Higher-order graph models in network security","author":"Parsonage","year":"2024"},{"key":"10.1016\/j.softx.2026.102779_bib0040","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.softx.2017.04.001","article-title":"MGtoolkit: a Python package for implementing metagraphs","volume":"6","author":"Ranathunga","year":"2017","journal-title":"Softwarex"},{"issue":"5","key":"10.1016\/j.softx.2026.102779_bib0045","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/269005.266669","article-title":"A decentralized model for information flow control","volume":"31","author":"Myers","year":"1997","journal-title":"ACM SIGOPS Oper Syst Rev"},{"key":"10.1016\/j.softx.2026.102779_bib0055","author":"Shayegani"},{"issue":"11","key":"10.1016\/j.softx.2026.102779_bib0060","doi-asserted-by":"crossref","first-page":"4746","DOI":"10.1016\/j.jpaa.2019.02.014","article-title":"Hypergraph categories","volume":"223","author":"Fong","year":"2019","journal-title":"J Pure Appl Algebra"},{"key":"10.1016\/j.softx.2026.102779_bib0065","series-title":"Proceedings of the 2022 European interdisciplinary cybersecurity conference","first-page":"114","article-title":"Next generation of hybrid threats","author":"Valenza","year":"2022"},{"key":"10.1016\/j.softx.2026.102779_bib0070","series-title":"2014 IEEE 27th computer security foundations symposium","first-page":"277","article-title":"Compositional information-flow security for interactive systems","author":"Rafnsson","year":"2014"}],"container-title":["SoftwareX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711026002712?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711026002712?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T11:58:01Z","timestamp":1784721481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352711026002712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":13,"alternative-id":["S2352711026002712"],"URL":"https:\/\/doi.org\/10.1016\/j.softx.2026.102779","relation":{},"ISSN":["2352-7110"],"issn-type":[{"value":"2352-7110","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DisCoConnect: Computing connectivity in hypergraph category string diagrams via metagraph algorithms","name":"articletitle","label":"Article Title"},{"value":"SoftwareX","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.softx.2026.102779","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102779"}}