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: "throughput bit cost network state information tradeoffs in cooperative csma protocols"
  Abstract: In wireless local area networks, spatially varying channel conditions result in a severe performance discrepancy between different nodes in the uplink, depending on their position. Both throughput and energy expense are affected. Cooperative protocols were proposed to mitigate these discrepancies. However, additional network state information (NSI) from other nodes is needed to enable cooperation. The aim of this work is to assess how NSI and the degree of cooperation affect throughput and energy expenses. To this end, a CSMA protocol called fairMAC is defined, which allows to adjust the amount of NSI at the nodes and the degree of cooperation among the nodes in a distributed manner. By analyzing the data obtained by Monte Carlo simulations with varying protocol parameters for fairMAC, two fundamental tradeoffs are identified: First, more cooperation leads to higher throughput, but also increases energy expenses. Second, using more than one helper increases throughput and decreases energy expenses, however, more NSI has to be acquired by the nodes in the network. The obtained insights are used to increase the lifetime of a network. While full cooperation shortens the lifetime compared to no cooperation at all, lifetime can be increased by over 25% with partial cooperation.

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)