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 "optimum transmission through the multiple antenna gaussian multiple access channel"):
  Abstract: This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas, and various power constraints. The points of interest maximize general rate objectives that arise in practical communication scenarios. Achieving these points constitutes the task of jointly optimizing the time-sharing parameters, the input covariance matrices, and the order of decoding used by the successive interference cancellation receiver. To approach this problem, Caratheodory’s theorem is invoked to represent time-sharing and decoding orders jointly as a finite-dimensional matrix variable. This variable enables us to use variational inequalities to extend results pertaining to problems with linear rate objectives to more general, potentially nonconvex, problems, and to obtain a necessary and sufficient condition for the optimality of the transmission parameters in a wide range of problems. Using the insights gained from this condition, we develop and analyze the convergence of an algorithm for solving, otherwise daunting, GMAC-based optimization problems.

Includes members:
  Member "completion time in multi access channel an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fog aided wireless networks for content delivery fundamental latency tradeoffs")
  Member "fairness in multiuser systems with polymatroid capacity region":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "to prolong the lifetime of wireless sensor networks the min max fair scheduling in a multi access contra polymatroid")
  Member "optimal order of decoding for max min fairness in k user memoryless interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "to prolong the lifetime of wireless sensor networks the min max fair scheduling in a multi access contra polymatroid")

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)