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 "quasi concavity for gaussian multicast relay channels"):
  Abstract: Upper and lower bounds on the capacity of Gaussian multicast relay channels are shown to be quasi-concave in the receiver signal-to-noise ratios and the transmit correlation coefficient. The bounds considered are the cut-set bound, decode-forward (DF) rates, and quantize-forward rates. The DF rates are shown to be quasi-concave in the relay position and this property is used to optimize the relay position for several networks.

Includes members:
  Member "reducibility of joint relay positioning and flow optimization problem":
    also connected through other hyperedges:
      (none)
  Member "on the geometry of wireless network multicast in 2 d":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reducibility of joint relay positioning and flow optimization problem")
  Member "optimal relay location and power allocation for low snr broadcast relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deploy as you go wireless relay placement an optimal sequential decision approach using the multi relay channel model")
  Member "on maximizing coverage in gaussian relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coverage region analysis for mimo amplify and forward relay channel with the source to destination link")

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)