human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "exact cramer rao bounds for semi blind channel estimation in amplify and forward two way relay networks"):
  Abstract: In this paper, we derive for the first time the exact Cramer-Rao bounds (CRBs) on semi-blind channel estimation for amplify-and-forward two-way relay networks. The bounds cover a wide range of modulation schemes that satisfy a certain symmetry condition. In particular, the important classes of PSK and square QAM are covered. For the case square QAM, we also provide simplified expressions that lend themselves more easily to numerical implementation. The derived bounds are used to show that the semi-blind approach, which exploits both the transmitted pilots and the transmitted data symbols, can provide substantial improvements in estimation accuracy over the training-based approach which only uses pilot symbols to estimate the channel parameters. We also derive the more tractable modified CRB which accurately approximates the exact CRB at high SNR for low modulation orders.

Includes members:
  Member "partially blind estimation of reciprocal channels for af two way relay networks employing m psk modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel estimation and optimal training design for correlated mimo two way relay systems in colored environment")
  Member "blind channel estimation for amplify and forward two way relay networks employing m psk modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "channel estimation and optimal training design for correlated mimo two way relay systems in colored environment")

Question: Please tell me which class the source paper 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)