{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:45:04Z","timestamp":1767725104718,"version":"3.48.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Young Scientists Fund of the Natural Science Foundation of Shandong Province","award":["ZR2022QF134"],"award-info":[{"award-number":["ZR2022QF134"]}]},{"name":"Key Technologies for Cloud-Edge Collaborative Vehicle Exterior Error-Proof Detection Based on Federated Learning","award":["JJKH20240860KJ"],"award-info":[{"award-number":["JJKH20240860KJ"]}]},{"name":"Key Technologies for Fraud Call Detection Based on Federated Learning","award":["JJKH20240861KJ"],"award-info":[{"award-number":["JJKH20240861KJ"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tcss.2025.3565008","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T13:43:19Z","timestamp":1749217399000},"page":"4204-4216","source":"Crossref","is-referenced-by-count":0,"title":["HAS: Hypergraph Adaptive Sampling for Structural Characteristics Preservation"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5300-2650","authenticated-orcid":false,"given":"Jiaqi","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Changchun University of Technology, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2658-8845","authenticated-orcid":false,"given":"Jianwei","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Changchun University of Technology, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1018-8727","authenticated-orcid":false,"given":"Qi","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8907-2064","authenticated-orcid":false,"given":"Zhenzhen","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9747-8969","authenticated-orcid":false,"given":"Gang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Changchun University of Technology, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6017-975X","authenticated-orcid":false,"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[{"name":"Department of Computing Science, Georgia State University, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3605776"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-023-00995-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/21m1414024"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403060"},{"key":"ref6","first-page":"722","article-title":"search over large-scale hypergraphs","volume-title":"Proc. EDBT","author":"Liu","year":"2025"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599567"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3653976"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2024.9010048"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-023-00952-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679765"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-59835-7_30"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585136"},{"key":"ref16","first-page":"94:1","article-title":"Nearly tight spectral sparsification of directed hypergraphs","volume-title":"Proc. Int. Colloq. Automata Lang. Program. (ICALP)","author":"Oko","year":"2023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2024.3377915"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40897-7_19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/611"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.130257"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-023-01230-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3236335"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00576-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-024-01253-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2024.104710"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-023-01196-6"},{"article-title":"Identifying and characterising higher order interactions in mobility networks using hypergraphs","year":"2025","author":"Sambaturu","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00199"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112566"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752223"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00624-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848229"},{"article-title":"Network sampling via edge-based node selection with graph induction","year":"2011","author":"Ahmed","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.124"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772762"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001119"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"ref41","first-page":"19:1","article-title":"Parallel set cover and hypergraph matching via uniform random sampling","volume-title":"Disc","author":"Dhulipala","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21126"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2023.1301994"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa018"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00763-z"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512157"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.1145\/3366423.3380016","article-title":"How much and when do we need higher-order information in hypergraphs? A case study on hyperedge prediction","volume-title":"CoRR","author":"Yoon"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/296"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441835"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121067"},{"key":"ref51","first-page":"33:1","article-title":"Sparse cuts in hypergraphs from random walks on simplicial complexes","volume-title":"Proc. 19th Scand. Symp. Workshops Algorithm Theory, SWAT","author":"Louis","year":"2024"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3653306"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2733545"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.96"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5494931"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA210298"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2012.2192113"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0094-2"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11272985\/11027130.pdf?arnumber=11027130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:37:08Z","timestamp":1767724628000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11027130\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":58,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2025.3565008","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}