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 channels with source cooperation"
  Abstract: In this paper, the role of cooperation in managing interference-a fundamental feature of the wireless channel-is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full duplex. The sum capacity of this channel is obtained within a gap of a constant number of bits. The coding scheme used builds up on the superposition scheme of Han and Kobayashi for the two-user interference channel without cooperation. New upperbounds on the sum capacity are also derived. The same coding scheme is shown to obtain the sum capacity of the symmetric two-user Gaussian interference channel with noiseless feedback within a constant gap.

Connected through hyperedge HE-1 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "channels with cooperation links that may be absent"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "on the synergistic benefits of alternating csit for the miso bc"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-2 (induced by source paper "two way function computation"):
  with members:
    - "two way interference channel capacity how to have the cake and eat it too"
    - "feedback through overhearing"
    - "capacity of a post channel with and without feedback"
    - "perfect output feedback in the two user decentralized interference channel"
    - "computation in multicast networks function alignment and converse theorems"
    - "two way interference channels"
    - "on network coding for sum networks"
    - "two way networks when adaptation is useless"

Connected through hyperedge HE-3 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit"):
  with members:
    - "cooperation for interference management a gdof perspective"
    - "capacity bounds for a class of interference relay channels"
    - "capacity results for binary fading interference channels with delayed csit"
    - "ergodic interference alignment with delayed feedback"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"

Connected through hyperedge HE-4 (induced by source paper "two way interference channel capacity how to have the cake and eat it too"):
  with members:
    - "two way function computation"
    - "fundamental limits of caching"
    - "computation in multicast networks function alignment and converse theorems"
    - "two way interference channels"
    - "approximate feedback capacity of the gaussian multicast channel"
    - "two way networks when adaptation is useless"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"

Connected through hyperedge HE-5 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "topological interference management through index coding"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"

Connected through hyperedge HE-6 (induced by source paper "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"

Connected through hyperedge HE-7 (induced by source paper "capacity bounds for a class of interference relay channels"):
  with members:
    - "new outer bounds for the interference channel with unilateral source cooperation"
    - "mixed noisy network coding and cooperative unicasting in wireless networks"
    - "a new achievable scheme for interference relay channels"
    - "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate"
    - "wireless network information flow a deterministic approach"
    - "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-8 (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"
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "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 destination cooperation"

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)