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: "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications"
  Abstract: Consider a wireless broadcast device-to-device (D2D) network wherein users' devices are interested in receiving some popular files. Each user's device possesses part of the content which is acquired in previous transmissions and cooperates with others to recover the missing packets by exchanging Instantly Decodable Network Coding (IDNC) packets. Recently, a distributed solution, relying on a non-cooperative game-theoretic formulation, has been proposed to reduce the communication time for fully connected D2D networks, i.e., single-hop D2D networks. In this paper, we develop a distributed game-theoretical solution to reduce the communication time for a more realistic scenario of a decentralized and partially connected, i.e., multi-hop, IDNC-enabled D2D network. The problem is modeled as a coalition game with cooperative-players wherein the payoff function is derived so that decreasing individual payoff results in the desired cooperative behavior. Given the intractability of the formulation, the coalition game is relaxed to a coalition formation game (CFG) involving the formation of disjoint coalitions. A distributed algorithm relying on merge-and-split rules is designed for solving the relaxed problem. The effectiveness of the proposed solution is validated through extensive numerical comparisons against existing methods in the literature.

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)