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: "spectrum sharing with distributed relay selection and clustering"
  Abstract: We consider a spectrum-sharing network where n secondary relays are used to increase secondary rate and also mitigate interference on the primary by reducing the required overall secondary emitted power. We propose a distributed relay selection and clustering framework, obtain closed-form expressions for the secondary rate, and show that secondary rate increases proportionally to log n. Remarkably, this is on the same order as the growth rate obtained in the absence of a primary system and its imposed constraints. Our results show that to maximize the rate, the secondary relays must transmit with power proportional to n^(-1) (thus the sum of relay powers is bounded) and also that the secondary source may not operate at its maximum allowable power. The tradeoff between the secondary rate and the interference on the primary is also characterized, showing that the primary interference can be reduced asymptotically to zero as n increases, while still maintaining a secondary rate that grows proportionally to log n. Finally, to address the rate loss due to half-duplex relaying in the secondary, we propose an alternating relay protocol and investigate its performance.

Connected through hyperedge HE-1 (induced by source paper "mimo multiway distributed relay channel with full data exchange an achievable rate perspective"):
  with members:
    - "degrees of freedom of the symmetric multi relay mimo y channel"
    - "cyclic communication and the inseparability of mimo multi way relay channels"
    - "generalized signal alignment for mimo two way x relay channels"
    - "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom"
    - "towards the asymptotic sum capacity of the mimo cellular two way relay channel"
    - "degrees of freedom for the mimo multi way relay channel"
    - "multiple input multiple output two way relaying a space division approach"
    - "a simple proof for the existence of good pairs of nested lattices"

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)