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 "on the optimality of treating inter cell interference as noise in uplink cellular networks"):
  Abstract: In this paper, we explore the optimality of treating interference as noise (TIN) in cellular networks. We focus on uplink scenarios modeled by the Gaussian interfering multiple access channel (IMAC), comprising $K$ mutually interfering multiple access channels (MACs), each formed by an arbitrary number of transmitters communicating independent messages to one receiver. We define TIN for this setting as a scheme in which each MAC (or cell) performs a power-controlled version of its capacity-achieving strategy, with Gaussian codebooks and successive decoding, while treating interference from all other MACs (i.e. inter-cell interference) as noise. We characterize the generalized degrees-of-freedom (GDoF) region achieved through the proposed TIN scheme, and then identify conditions under which this achievable region is a polyhedron (and hence convex) without the need for time-sharing. We then tighten these polyhedrality conditions and identify a regime in which the proposed TIN scheme achieves the entire GDoF region of the IMAC and is within a constant gap of the entire capacity region.

Includes members:
  Member "on multi cell uplink downlink duality with treating inter cell interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "on the optimality of treating interference as noise for interfering multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "opportunistic treating interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "interference as noise friend or foe":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on linearly precoded rate splitting for mimo broadcast channels")
  Member "optimality of treating interference as noise a combinatorial perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "on the optimality of treating interference as noise compound interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "on the optimality of treating interference as noise general message sets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "on the optimality of treating interference as noise for k user parallel gaussian interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")

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)