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: "multibeam satellite frequency time duality study and capacity optimization"
  Abstract: In this paper, we investigate two new candidate transmission schemes, Non-Orthogonal Frequency Reuse (NOFR) and Beam-Hoping (BH). They operate in different domains (frequency and time/space, respectively), and we want to know which domain shows overall best performance. We propose a novel formulation of the Signal-to-Interference plus Noise Ratio (SINR) which allows us to prove the frequency/time duality of these schemes. Further, we propose two novel capacity optimization approaches assuming per-beam SINR constraints in order to use the satellite resources (e.g. power and bandwidth) more efficiently. Moreover, we develop a general methodology to include technological constraints due to realistic implementations, and obtain the main factors that prevent the two technologies dual of each other in practice, and formulate the technological gap between them. The Shannon capacity (upper bound) and current state-of-the-art coding and modulations are analyzed in order to quantify the gap and to evaluate the performance of the two candidate schemes. Simulation results show significant improvements in terms of power gain, spectral efficiency and traffic matching ratio when comparing with conventional systems, which are designed based on uniform bandwidth and power allocation. The results also show that BH system turns out to show a less complex design and performs better than NOFR system specially for non-real time services.

Connected through hyperedge HE-1 (induced by source paper "dynamic energy efficient power allocation in multibeam satellite systems"):
  with members:
    - "generic optimization of linear precoding in multibeam satellite systems"

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)