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: "on the capacity of gaussian weak interference channels with degraded message sets"
  Abstract: This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels (IFCs) where one of the two transmitters knows both the messages to be conveyed to the two receivers. Both achievability and converse arguments are provided for a channel with Gaussian inputs and Gaussian noise when the interference is weaker than the direct link (a so called weak IFC). In general, this region serves as an outer bound on the capacity of weak IFCs with no shared knowledge between transmitters.

Connected through hyperedge HE-1 (induced by source paper "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"):
  with members:
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-2 (induced by source paper "source and channel coding for correlated sources over multiuser channels"):
  with members:
    - "broadcast capacity region of two phase bidirectional relaying"
    - "a graph based framework for transmission of correlated sources over broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "on power control and frequency reuse in the two user cognitive channel"):
  with members:
    - "degrees of freedom of the mimo interference channel with cooperation and cognition"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "on the capacity of a class of mimo cognitive radios"):
  with members:
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-5 (induced by source paper "on the capacity of interference channels with one cooperating transmitter"):
  with members:
    - "on the capacity of a class of mimo cognitive radios"
    - "cognitive interference channels with confidential messages"
    - "interference channels with common information"
    - "cognitive radio an information theoretic perspective"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-6 (induced by source paper "degrees of freedom region for the mimo x channel"):
  with members:
    - "space time frequency degrees of freedom fundamental limits for spatial information"
    - "the multiplexing gain of mimo x channels with partial transmit side information"
    - "cognitive radio an information theoretic perspective"

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)