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 "gdof of interference channel with limited cooperation under finite precision csit"):
  Abstract: The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount of (half-duplex or full-duplex) cooperation is allowed between the transmitters in the form of $\pi$ DoF of shared messages. In all cases, the number of over-the-air bits that each cooperation bit buys is shown to be equal to either $0, 1, 1/2$ or $1/3$. The most interesting aspect of the result is the $1/3$ slope, which appears only under finite precision CSIT and strong interference, and as such has not been encountered in previous studies that invariably assumed perfect CSIT. Indeed, the achievability and converse for the parameter regimes with $1/3$ slope are the most challenging aspects of this work. In particular, the converse relies on non-trivial applications of Aligned Images bounds.

Includes members:
  Member "towards an extremal network theory robust gdof gain of transmitter cooperation over tin":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "channels with cooperation links that may be absent":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiplexing gain region of sectorized cellular networks with mixed delay constraints")
  Member "sum set inequalities from aligned image sets instruments for robust gdof bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit":
    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 synergistic benefits of alternating csit for the miso bc":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two way function computation")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity bounds for a class of interference relay channels")

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)