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 "sum set inequalities from aligned image sets instruments for robust gdof bounds"):
  Abstract: We present sum-set inequalities specialized to the generalized degrees of freedom (GDoF) framework. These are information theoretic lower bounds on the entropy of bounded density linear combinations of discrete, power-limited dependent random variables in terms of the joint entropies of arbitrary linear combinations of new random variables that are obtained by power level partitioning of the original random variables. The bounds are useful instruments to obtain GDoF characterizations for wireless interference networks, especially with multiple antenna nodes, subject to arbitrary channel strength and channel uncertainty levels.

Includes members:
  Member "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit":
    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 "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "sumset and inverse sumset inequalities for differential entropy and mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)