human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "spatially coupled ldpc ensembles on burst erasure channels"
  Abstract: Spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus on the performance of these ensembles over binary erasure channels affected additionally by bursts. We assume that the burst can erase either a complete spatial position, modeling node failures in distributed storage, or can span across multiple spatial positions. We study the expected performance of random regular SC-LDPC ensembles on single-burst-erasure channels and provide tight lower bounds for the block erasure probability ($P_B$) at finite block length and bounds on the coupling parameter for being asymptotically able to recover the burst. Subsequently, we show the effect of introducing additional random erasures to these channels. Finally, we show that expurgation can bring substantial improvements in the block error rate by analyzing the minimal stopping sets of some expurgated code ensembles. Our study shows that for a fixed asymptotic code rate, the combination of increasing the variable node degree and expurgating the ensemble can improve the block error probability by several orders of magnitude. All the results are verified using Monte-Carlo simulations.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)