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: "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
  Abstract: The generalized degrees of freedom (GDoF) of the two user symmetric multiple input multiple output (MIMO) interference channel (IC) are characterized as a function of the channel strength levels and the level of channel state information at the transmitters (CSIT). In this symmetric setting, each transmitter is equipped with M antennas, each receiver is equipped with N antennas, and both cross links have the same strength parameter $\alpha$ and the same channel uncertainty parameter $\beta$. The main challenge resides in the proof of the outer bound which is accomplished by a generalization of the aligned image sets approach.

Connected through hyperedge HE-1 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "rate splitting for mimo wireless networks a promising phy layer strategy for lte evolution"

Connected through hyperedge HE-2 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"

Connected through hyperedge HE-3 (induced by source paper "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "sum set inequalities from aligned image sets instruments for robust gdof bounds"):
  with members:
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "wireless network information flow a deterministic approach"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

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)