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: "practical inner codes for batched sparse codes in wireless multihop networks"
  Abstract: Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that typically is a random linear network code, one main research topic for BATS codes is to design an inner code with good performance in transmission efficiency and complexity. In this paper, this issue is addressed with a focus on the problem of minimizing the total number of packets transmitted by the source and intermediate nodes. Subsequently, the problem is formulated as a mixed integer nonlinear programming (MINLP) problem that is NP-hard in general. By exploiting the properties of inner codes and the incomplete beta function, we construct a nonlinear programming (NLP) problem that gives a valid upper bound on the best performance that can be achieved by any feasible solutions. Moreover, both centralized and decentralized real-time optimization strategies are developed. In particular, the decentralized approach is performed independently by each node to find a feasible solution in linear time with the use of look-up tables. Numerical results show that the gap in performance between our proposed approaches and the upper bound is very small, which demonstrates that all feasible solutions developed in the paper are near-optimal with a guaranteed performance bound.

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)