{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:29:16Z","timestamp":1763706556547,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012709","name":"Strategic Project Digital Business within the Framework of the Strategic Academic Leadership Program \u201cPriority 2030\u201d with National University of Science and Technology (NUST) MISiS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012709","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3281337","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:24:48Z","timestamp":1685467488000},"page":"54588-54595","source":"Crossref","is-referenced-by-count":2,"title":["Fast Approximate Convex Hull Construction in Networks via Node Embedding"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6904-2852","authenticated-orcid":false,"given":"Dmitrii","family":"Gavrilev","sequence":"first","affiliation":[{"name":"Skolkovo Institute of Science and Technology, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3308-8825","authenticated-orcid":false,"given":"Ilya","family":"Makarov","sequence":"additional","affiliation":[{"name":"AI Center, NUST MISiS, Moscow, Russia"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-030-20518-8_55"},{"key":"ref35","first-page":"1","article-title":"Deep graph library: Towards efficient and scalable deep learning on graphs","author":"wang","year":"2019","journal-title":"Proc ICLR Workshop Represent Learn Graphs Manifolds"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/SMAP.2019.8864887"},{"key":"ref34","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume":"32","author":"paszke","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","article-title":"A fast heuristic for computing geodesic cores in large networks","author":"seiffarth","year":"2022","journal-title":"arXiv 2206 07350"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/TMM.2023.3260649"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.disc.2008.04.020"},{"key":"ref36","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/1217299.1217301"},{"year":"2022","author":"newman","journal-title":"Mark Newman’s Compilation of Networks","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.7717\/peerj-cs.526"},{"key":"ref33","article-title":"Searching for activation functions","author":"ramachandran","year":"2017","journal-title":"arXiv 1710 05941"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/3197026.3203911"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/2898361"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1090\/conm\/453\/08795"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-1-4614-8699-2"},{"key":"ref17","article-title":"Random graph models and matchings","author":"rooney","year":"2019","journal-title":"arXiv 1909 01723"},{"key":"ref16","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"chartrand","year":"1967","journal-title":"Annales de l’IHP Probabilités et statistiques"},{"key":"ref38","volume":"319","author":"bridson","year":"2013","journal-title":"Metric Spaces of Non-Positive Curvature"},{"key":"ref19","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume":"30","author":"hamilton","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.2200\/S01045ED1V01Y202009AIM046"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1038\/35004572"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/S0925-7721(96)00023-5"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1140\/epjb\/e2011-10979-2","article-title":"Robust network community detection using balanced propagation","volume":"81","author":"bajec","year":"2011","journal-title":"Eur Phys J B"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1103\/PhysRevE.74.036104"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-3-030-11027-7_3"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ACCESS.2021.3122100"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/978-3-030-11027-7_4"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/2487788.2488173"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/1134271.1134277"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1038\/30918"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-031-26412-2_22"},{"key":"ref7","first-page":"23413","article-title":"Active learning of convex halfspaces on graphs","volume":"34","author":"thiessen","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.7717\/peerj-cs.357"},{"year":"2022","author":"cormen","journal-title":"Introduction to Algorithms","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.4310\/jdg\/1214436096"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1098\/rsif.2018.0422","article-title":"Convex skeletons of complex networks","volume":"15","author":"\u0161ubelj","year":"2018","journal-title":"J Roy Soc Interface"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1017\/nws.2017.37"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10138570.pdf?arnumber=10138570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T19:55:43Z","timestamp":1686858943000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10138570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3281337","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}