{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:50Z","timestamp":1740107870372,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T00:00:00Z","timestamp":1647993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T00:00:00Z","timestamp":1647993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00500-022-06948-6","type":"journal-article","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T07:02:42Z","timestamp":1648018962000},"page":"5025-5042","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secreted graphs to binary codes and applications"],"prefix":"10.1007","volume":"26","author":[{"given":"M.","family":"Hamidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9495-6027","authenticated-orcid":false,"given":"A. Borumand","family":"Saeid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,23]]},"reference":[{"issue":"2","key":"6948_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.3934\/amc.2008.2.433","volume":"18","author":"A Barg","year":"2008","unstructured":"Barg A, Mazumdar A, Z\u00e9mor G (2008) Weight distribution and decoding of codes on hypergraphs. Adv Math Commun 18(2):433\u2013450","journal-title":"Adv Math Commun"},{"key":"6948_CR2","unstructured":"Berge C (1979) Graphs and hypergraphs. North Holland"},{"key":"6948_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejc.2003.10.002","volume":"25","author":"O Bilua","year":"2004","unstructured":"Bilua O, Hooryb S (2004) On codes from hypergraphs. Eur J Combin 25:339\u2013354","journal-title":"Eur J Combin"},{"issue":"3","key":"6948_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.socnet.2004.01.001","volume":"26","author":"P Bocacich","year":"2004","unstructured":"Bocacich P, Holdren AC, Johnston M (2004) Hyperedges and multidimensional centrality. Soc. Netw. 26(3):189\u2013203","journal-title":"Soc. Netw."},{"key":"6948_CR5","first-page":"111","volume-title":"Applications of hypergraph theory, a brief overview, hypergraph theory","author":"A Bretto","year":"2013","unstructured":"Bretto A (2013) Applications of hypergraph theory, a brief overview, hypergraph theory. Springer, New York, pp 111\u2013116"},{"key":"6948_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3714-1","volume-title":"Applications of hyperstructure theory","author":"P Corsini","year":"2003","unstructured":"Corsini P, Leoreanu V (2003) Applications of hyperstructure theory. Kluwer Academical Publications, Dordrecht"},{"key":"6948_CR7","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estradaa","year":"2006","unstructured":"Estradaa E, Velazquez JAR (2006) Subgraph centrality and clustering in complex hyper-networks. Phys A 364:581\u2013594","journal-title":"Phys A"},{"issue":"2","key":"6948_CR8","first-page":"21","volume":"8","author":"M Hamidi","year":"2019","unstructured":"Hamidi M, Borumand Saeid A (2019a) On derivable trees. Trans Comb 8(2):21\u201343","journal-title":"Trans Comb"},{"issue":"1","key":"6948_CR9","first-page":"139","volume":"43","author":"M Hamidi","year":"2019","unstructured":"Hamidi M, Borumand Saeid A (2019b) Creating and computing graphs from hypergraphs. Kragujev J Math 43(1):139\u2013164","journal-title":"Kragujev J Math"},{"key":"6948_CR10","doi-asserted-by":"crossref","unstructured":"Hamidi M, Borumand Saied A (2018a) Accessible single-valued neutrosophic graphs. J Appl Math Comput 57:121\u2013146","DOI":"10.1007\/s12190-017-1098-z"},{"key":"6948_CR11","doi-asserted-by":"crossref","unstructured":"Hamidi M, Borumand Saied A (2018b) Achievable single-valued neutrosophic graphs in wireless sensor networks. New Math Nat Comput 14(2):157\u2013185","DOI":"10.1142\/S1793005718500114"},{"key":"6948_CR12","doi-asserted-by":"crossref","unstructured":"Hamidi M, Borumand Saied A (2018c) Accessible hypergraphs from BCH codes. In: Proceedings of the 6th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS), IEEE","DOI":"10.1109\/CFIS.2018.8336667"},{"issue":"3 & 4","key":"6948_CR13","first-page":"237","volume":"16","author":"Y Hwang","year":"2016","unstructured":"Hwang Y, Heo J (2016) On the relation between a graph code and a graph state. Quant Inf Comput 16(3 & 4):237\u2013250","journal-title":"Quant Inf Comput"},{"key":"6948_CR14","volume-title":"Graph-based codes and iterative decoding","author":"A Khandekar","year":"2002","unstructured":"Khandekar A (2002) Graph-based codes and iterative decoding. California Institute of Technology Pasadena, California"},{"key":"6948_CR15","first-page":"215","volume-title":"Graph based social media analysis","author":"C Kotropoulos","year":"2016","unstructured":"Kotropoulos C (2016) Multimedia social search based on hypergraph learning. In: Pitas I (ed) Graph based social media analysis. CRC Press, Boca Raton, FL, pp 215\u2013273"},{"key":"6948_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding theory a first course","author":"S Ling","year":"2004","unstructured":"Ling S, Xing C (2004) Coding theory a first course. United States of America by Cambridge University Press, New York"},{"key":"6948_CR17","doi-asserted-by":"crossref","unstructured":"Liu M, Zhang J, Yap P, Shen D (2017) View-aligned hypergraph learning for Alzheimers disease diagnosis with incomplete multimodality data. Med Image Anal 36:123\u2013134","DOI":"10.1016\/j.media.2016.11.002"},{"key":"6948_CR18","first-page":"261","volume":"42","author":"B Molnar","year":"2014","unstructured":"Molnar B (2014) Applications of hypergraphs in informatics a survey and opportunities for research. Ann Univ Sci Budapest Sect Comp 42:261\u2013282","journal-title":"Ann Univ Sci Budapest Sect Comp"},{"key":"6948_CR19","unstructured":"Najafi A, Borumand Saeid A (2019) Fuzzy points in $$BB$$-algebras. J Mahani Math Res Center 8(1\u20132):69\u201380"},{"key":"6948_CR20","doi-asserted-by":"crossref","unstructured":"Pu L, Faltings B (2012) Hypergraph learning with hyperedge expansion. Joint Eur Conf Mach Learn Knowl Discov Databases 410\u2013425","DOI":"10.1007\/978-3-642-33460-3_32"},{"issue":"8","key":"6948_CR21","doi-asserted-by":"publisher","first-page":"5755","DOI":"10.1109\/TIT.2018.2847679","volume":"64","author":"C Shangguan","year":"2018","unstructured":"Shangguan C, Zhang Y, Ge G (2018) Centralized coded caching schemes: a hypergraph theoretical approach. IEEE Trans Inform Theory 64(8):5755\u20135766","journal-title":"IEEE Trans Inform Theory"},{"key":"6948_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0012-365X(94)90132-5","volume":"128","author":"P Sole","year":"1994","unstructured":"Sole P, Zaslavsky T (1994) The covering radius of the cycle code of a graph. Disc Math 128:401\u2013405","journal-title":"Disc Math"},{"key":"6948_CR23","unstructured":"Tallini G (1985) On Steiner hyper groups and Linear codes. Altre Strutture multivoche e loro applicazioni, Udine, Convegno Ipergruppi, pp 87\u201391"},{"key":"6948_CR24","doi-asserted-by":"crossref","unstructured":"Tsuda K (2005) Propagating distributions on a hypergraph by dual information regularization. In: Proceedings of the 22th international conference on machine learning","DOI":"10.1145\/1102351.1102467"},{"key":"6948_CR25","unstructured":"Urquidi JMP (2010) Expander graphs and error correcting codes, Universite de Bordeaux 1 Sciences et Technologies U.F.R. Math ematiques et Informatique"},{"issue":"12","key":"6948_CR26","doi-asserted-by":"publisher","first-page":"5834","DOI":"10.1109\/TNNLS.2018.2812888","volume":"29","author":"W Zhao","year":"2018","unstructured":"Zhao W, Tan S, Guan Z, Zhang B, Gong M, Cao Z, Wang Q (2018) Learning to map social network users by unified manifold alignment on hypergraph. IEEE Trans Neural Netw Learn Syst 29(12):5834\u20135846","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"6948_CR27","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10623-015-0169-0","volume":"81","author":"S Zhou","year":"2016","unstructured":"Zhou S (2016) Total perfect codes in Cayley graphs. Des Codes Cryptogr 81:489\u2013504","journal-title":"Des Codes Cryptogr"},{"issue":"11","key":"6948_CR28","doi-asserted-by":"publisher","first-page":"3941","DOI":"10.1109\/TCYB.2016.2591068","volume":"47","author":"L Zhu","year":"2017","unstructured":"Zhu L, Shen J, Xie L, Cheng Z (2017) Unsupervised topic hypergraph hashing for efficient mobile image retrieval. IEEE Trans Cybern 47(11):3941\u20133954","journal-title":"IEEE Trans Cybern"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06948-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-06948-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06948-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T11:16:01Z","timestamp":1652440561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-06948-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,23]]},"references-count":28,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6948"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-06948-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2022,3,23]]},"assertion":[{"value":"19 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}