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: "protocol coding through reordering of user resources applications and capacity results"
  Abstract: While there are continuous efforts to introduce new communication systems and standards, it is legitimate to ask the question: how can one send additional bits by minimally changing the systems that are already operating? This is of a significant practical interest, since it has a potential to generate additional value of the systems through, for example, introduction of new devices and only a software update of the access points or base stations, without incurring additional cost for infrastructure hardware installation. The place to look for such an opportunity is the communication protocol and we use the term *protocol coding* to refer to strategies for sending information by using the degrees of freedom available when one needs to decide the actions taken by a particular communication protocol. In this paper we consider protocol coding that gives a rise to *secondary communication channels*, defined by combinatorial ordering of the user resources (packets, channels) in a primary (legacy) communication system. We introduce communication models that enable us to compute the capacity of such secondary channels under suitable restrictions imposed by the primary systems. We first show the relation to the capacity of channels with causal channel state information at the transmitter (CSIT), originally considered by Shannon. By using the specific communication setup, we develop an alternative framework for achieving the capacity and we discuss coding strategies that need to be used over the secondary channels. We also discuss some practical features of the secondary channels and their applications that add value to the existing wireless systems.

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)