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: "distributed sir aware scheduling in large scale wireless networks"
  Abstract: Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical they must do so with small amounts of timely side information. In this paper, we propose three techniques for low-overhead distributed opportunistic scheduling (DOS) and precisely determine their affect on the overall network outage probability and transmission capacity (TC). The first is distributed channel-aware scheduling (DCAS), the second is distributed interferer-aware scheduling (DIAS), and the third generalizes and combines those two and is called distributed interferer-channel-aware scheduling (DICAS). One contribution is determining the optimum channel and interference thresholds that a given isolated transmitter should estimate and apply when scheduling their own transmissions. Using this threshold, the precise network-wide gain of each technique is quantified and compared. We conclude by considering interference cancellation at the receivers, and finding how much it improves the outage probability.

Connected through hyperedge HE-1 (induced by source paper "downlink coordinated multi point with overhead modeling in heterogeneous cellular networks"):
  with members:
    - "interference coordination random clustering and adaptive limited feedback"
    - "joint beamforming and power control in coordinated multicell max min duality effective network and large system transition"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "fundamentals of inter cell overhead signaling in heterogeneous cellular networks"
    - "fundamental limits of cooperation"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "multi antenna communication in ad hoc networks achieving mimo gains with simo transmission"
    - "adaptive bit partitioning for multicell intercell interference nulling with delayed limited feedback"

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)