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: "multi tag backscattering to mimo reader channel estimation and throughput fairness"
  Abstract: Green low power networking with the least requirement of dedicated radio resources is need of the hour which has led to the upsurge of backscatter communication (BSC) technology. However, this inherent potential of BSC is challenged by hardware constraints of the underlying tags. We address this timely concern by investigating the practical efficacy of multiple-input-multiple-output (MIMO) technology in overcoming the fundamental limitations of BSC. Specifically, we first introduce a novel least-squares based channel estimation (CE) protocol for multi-tag BSC settings that takes care of both the unintended ambient reflections and the inability of tags in performing estimation by themselves. Then using it, a nontrivial low-complexity algorithm is proposed to obtain the optimal transceiver designs for the multiantenna reader to maximize the minimum value of the lower-bounded backscattered throughput among the single-antenna semi-passive tags. Additional analytical insights on both individually and jointly-optimal precoding vector and detector matrix at the reader are provided by exploring the asymptotically-optimal transceiver designs. Lastly detailed numerical investigation is carried out to validate the theoretical results and quantify the practically realizable throughput fairness. Specifically, more than seven-fold increase in the common-backscattered-throughput among tags as achieved by the proposed designs over the relevant benchmarks corroborates their practical significance.

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)