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: "energy efficient and throughput optimal csma scheme"
  Abstract: Carrier Sense Multiple Access (CSMA) is widely used as a Medium Access Control (MAC) in wireless networks due to its simplicity and distributed nature. This motivated researchers to find CSMA schemes that achieve throughput optimality. In 2008, it has been shown that a simple CSMA-type algorithm is able to achieve optimality in terms of throughput and has been given the name "adaptive" CSMA. Lately, new technologies emerged where prolonged battery life is crucial such as environment and industrial monitoring. This inspired the foundation of new CSMA based MAC schemes where links are allowed to transition into sleep mode to reduce the power consumption. However, throughput optimality of these schemes was not established. This paper therefore aims to find a new CSMA scheme that combines both throughput optimality and energy efficiency by adapting to the throughput and power consumption needs of each link. This is done by controlling operational parameters such as back-off and sleeping timers with the aim of optimizing a certain objective function. The resulting CSMA scheme is characterized by being asynchronous, completely distributed and being able to adapt to different power consumption profiles required by each link while still ensuring throughput optimality. The performance gain in terms of energy efficiency compared to the conventional adaptive CSMA scheme is demonstrated through computer simulations.

Connected through hyperedge HE-1 (induced by source paper "minimizing the age of information in a csma environment"):
  with members:
    - "age of information in a network of preemptive servers"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "multicast with prioritized delivery how fresh is your data"
    - "content based status updates"
    - "age optimal information updates in multihop networks"

Connected through hyperedge HE-2 (induced by source paper "the age of updates in a simple relay network"):
  with members:
    - "age of information in a network of preemptive servers"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "multicast with prioritized delivery how fresh is your data"
    - "content based status updates"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "age optimal information updates in multihop networks"
    - "the age of information real time status updating by multiple sources"

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)