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: "average power limitations in sliding window contention resolution diversity slotted aloha"
  Abstract: Recently a new Random Access technique based on Aloha and using Interference Cancellation (IC) named Sliding Window Contention Resolution Diversity Slotted Aloha (SW-CRDSA) has been introduced. Differently from classic CRDSA that operates grouping slots in frames, this technique operates in an unframed manner yielding to better throughput results and smaller average packet delay with respect to frame-based CRDSA. However as classic CRDSA also SW-CRDSA relies on multiple transmission of the same packet. While this can be acceptable in systems where the only limit resides in the peak transmission power, it could represent a problem when constraints on the average power (e.g. at the transponder of a satellite system) are present. In this paper, a comparison in terms of normalized efficiency is carried out between Slotted Aloha and the two CRDSA techniques.

Connected through hyperedge HE-1 (induced by source paper "interference calculation in asynchronous random access protocols using diversity"):
  with members:
    - "random access in dvb rcs2 design and dynamic control for congestion avoidance"
    - "on the stability of asynchronous random access schemes"
    - "crdsa crdsa and irsa stability and performance evaluation"
    - "enhanced contention resolution aloha ecra"

Connected through hyperedge HE-2 (induced by source paper "random access in dvb rcs2 design and dynamic control for congestion avoidance"):
  with members:
    - "random access congestion control in dvb rcs2 interactive satellite terminals"
    - "crdsa crdsa and irsa stability and performance evaluation"

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)