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: "the two user gaussian compound interference channel"
  Abstract: We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel superposition coding, but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.

Connected through hyperedge HE-1 (induced by source paper "wireless network coding with local network views coded layer scheduling"):
  with members:
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on the capacity of multi hop wireless networks with partial network knowledge"

Connected through hyperedge HE-2 (induced by source paper "on achieving local view capacity via maximal independent graph scheduling"):
  with members:
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "distributed universally optimal strategies for interference channels with partial message passing"

Connected through hyperedge HE-3 (induced by source paper "isotropic mimo interference channels without csit the loss of degrees of freedom"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on degrees of freedom region of mimo networks without csit"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "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 "diversity multiplexing tradeoff of the two user interference channel"):
  with members:
    - "outage analysis of block fading gaussian interference channels"
    - "on the achievable diversity multiplexing tradeoff in interference channels"
    - "gaussian interference channel capacity to within one bit"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-5 (induced by source paper "on the achievable diversity multiplexing tradeoff in interference channels"):
  with members:
    - "diversity multiplexing tradeoff in fading interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "feedback capacity of the compound channel"):
  with members:
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-7 (induced by source paper "diversity multiplexing tradeoff in fading interference channels"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"

Connected through hyperedge HE-8 (induced by source paper "the diversity multiplexing tradeoff for interference networks"):
  with members:
    - "on the capacity and generalized degrees of freedom of the x channel"
    - "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)