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: "can negligible cooperation increase network reliability extended version"
  Abstract: In network cooperation strategies, nodes work together with the aim of increasing transmission rates or reliability. For example, cooperation can be employed to obtain a code with small maximal-error from a code with small average-error that does not make use of cooperation. In networks where rates achievable under a maximal-error constraint differ from those achievable under an average-error constraint, such a benefit can be potentially viewed as both increasing reliability and increasing rate. Let us define the cooperation rate as the number of bits per channel use shared with each node as part of the cooperation strategy. We here demonstrate that even a negligible cooperation rate can sometimes yield a non-negligible benefit. Precisely, we employ Dueck's example of a multiple access channel whose maximal and average-error sum-capacities differ, to show that there exists a network whose maximal-error sum-capacity is not continuous with respect to its edge capacities.

Connected through hyperedge HE-1 (induced by source paper "can negligible cooperation increase network reliability"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "on the capacity advantage of a single bit"
    - "network coding is zero error always possible"

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)