human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "interference cooperation and connectivity a degrees of freedom perspective"
  Abstract: We explore the interplay between interference, cooperation and connectivity in heterogeneous wireless interference networks. Specifically, we consider a 4-user locally-connected interference network with pairwise clustered decoding and show that its degrees of freedom (DoF) are bounded above by 12 over 5. Interestingly, when compared to the corresponding fully connected setting which is known to have 8 over 3 DoF, the locally connected network is only missing interference-carrying links, but still has lower DoF, i.e., eliminating these interference-carrying links reduces the DoF. The 12 over 5 DoF outer bound is obtained through a novel approach that translates insights from interference alignment over linear vector spaces into corresponding sub-modularity relationships between entropy functions.

Connected through hyperedge HE-1 (induced by source paper "cognitive wyner networks with clustered decoding"):
  with members:
    - "on optimal message assignments for interference channels with comp transmission"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "fundamental limits of cooperation"
    - "index coding an interference alignment perspective"
    - "interference channels with coordinated multi point transmission degrees of freedom message assignment and fractional reuse"
    - "on the sum capacity of k user cascade gaussian z interference channel"
    - "on the capacity of the k user cyclic gaussian interference channel"

Connected through hyperedge HE-2 (induced by source paper "interference networks with no csit impact of topology"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "degrees of freedom of two hop wireless networks everyone gets the entire cake"
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "dynamic interference mitigation for generalized partially connected quasi static mimo interference channel"
    - "on achieving local view capacity via maximal independent graph scheduling"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom of interference channels with comp transmission and reception"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on optimal message assignments for interference channels with comp transmission"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "achievable degrees of freedom of the k user interference channel with partial cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-4 (induced by source paper "achievable degrees of freedom of the k user interference channel with partial cooperation"):
  with members:
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "gaussian interference channel capacity to within one bit"

Question: Please tell me which class the center node 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)