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: "an outer bound for the memoryless two user interference channel with general cooperation"
  Abstract: The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network, where two nodes are sources and the other two are destinations. All nodes are full-duplex and cooperate to mitigate interference. A sum-rate outer bound is derived, which is shown to unify a number of previously derived outer bounds for special cases of cooperation. The approach is shown to extend to cooperative interference networks with more than two source-destination pairs and for any partial sum-rate. How the derived bound relates to similar bounds for channel models including cognitive nodes, i.e., nodes that have non-causal knowledge of the messages of some other node, is also discussed. Finally, the bound is evaluated for the Gaussian noise channel and used to compare different modes of cooperation.

Connected through hyperedge HE-1 (induced by source paper "approximate capacity of the gaussian interference channel with noisy channel output feedback"):
  with members:
    - "noisy channel output feedback capacity of the linear deterministic interference channel"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "perfect output feedback in the two user decentralized interference channel"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "the two user gaussian interference channel a deterministic view"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "the k user interference channel strong interference regime"
    - "on the capacity region of the two user interference channel"
    - "interference mitigation through limited transmitter cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "compound multiple access channels with partial cooperation"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"

Connected through hyperedge HE-3 (induced by source paper "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "new outer bounds for the interference channel with unilateral source cooperation"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-4 (induced by source paper "noisy channel output feedback capacity of the linear deterministic interference channel"):
  with members:
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "perfect output feedback in the two user decentralized interference channel"
    - "interference channels with source cooperation"
    - "interference channels with rate limited feedback"
    - "interference channels with destination cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "shannon meets nash on the interference channel"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-5 (induced by source paper "on the capacity of the two user gaussian causal cognitive interference channel"):
  with members:
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "experiment driven characterization of full duplex wireless systems"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "partial decode forward binning schemes for the causal cognitive relay channels"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"

Connected through hyperedge HE-6 (induced by source paper "achieving net feedback gain in the butterfly network with a full duplex bidirectional relay"):
  with members:
    - "joint physical layer coding and network coding for bi directional relaying"
    - "a deterministic approach to wireless relay networks"

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)