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: "codebook based sdma for coexistence with fixed wireless service"
  Abstract: A portion of frequency band for International Mobile Telecommunications (IMT)-Advanced is currently allocated to Fixed Wireless Service (FWS) such as Fixed Service (FS), Fixed Satellite Service (FSS), or Fixed Wireless Access (FWA), which requires frequency sharing between both the systems. SDMA, due to its high throughput nature, is candidate for IMT-Advanced. This paper proposes a systematic design of a precoder codebook for SDMA sharing spectrum with existing FWS. Based on an estimated direction angle of a victim FWS system, an interfering transmitter adaptively constructs a codebook forming a transmit null in the direction angle while satisfying orthogonal beamforming constraint. We derive not only asymptotic throughput scaling laws, but also an upperbound on throughput loss to analyze performance loss of the proposed SDMA relative to the popular SDMA called per-user unitary rate control (PU2RC). Furthermore, we develop a method of evaluating protection distance in order to analyze the spectrum sharing performance of the proposed approach. The simulation results of protection distance confirm that the proposed SDMA efficiently shares spectrum with FWS systems by reducing protection distance to more than 66%. Although our proposed SDMA always has lower throughput compared to PU2RC in non-coexistence scenario, it offers an intriguing opportunity to reuse spectrum already allocated to FWS.

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)