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: "capacity bounds for two hop interference networks"
  Abstract: This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two relay nodes serve as intermediaries between the transmitters and receivers. Each hop, one from the transmitters to the relays and the other from the relays to the receivers, is modeled as a Gaussian interference channel, thus the network is essentially a cascade of two interference channels. For this network, achievable symmetric rates for different parameter regimes under decode-and- forward relaying and amplify-and-forward relaying are proposed and the corresponding coding schemes are carefully studied. Numerical results are also provided.

Connected through hyperedge HE-1 (induced by source paper "distributed power splitting for swipt in relay interference channels using game theory"):
  with members:
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "simultaneous information and energy transfer in large scale networks with without relaying"
    - "beamforming for miso interference channels with qos and rf energy transfer"
    - "cooperative energy harvesting networks with spatially random users"
    - "simultaneous information and power transfer for broadband wireless systems"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer a dynamic power splitting approach"

Connected through hyperedge HE-2 (induced by source paper "interference channels with half duplex source cooperation"):
  with members:
    - "partial decode forward binning schemes for the causal cognitive relay channels"
    - "wireless network information flow a deterministic approach"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "capacity bounds of half duplex gaussian cooperative interference channel"
    - "interference mitigation through limited receiver cooperation"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-3 (induced by source paper "cooperative algorithms for mimo amplify and forward relay networks"):
  with members:
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "aligned interference neutralization and the degrees of freedom of the 2 user interference channel with instantaneous relay"
    - "cooperative algorithms for mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "the mimo wireless switch relaying can increase the multiplexing gain"
    - "on feasibility of interference alignment in mimo interference networks"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-4 (induced by source paper "the degrees of freedom of the 2 hop 2 user interference channel with feedback"):
  with members:
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "on degrees of freedom region of mimo networks without csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "capacity of linear two hop mesh networks with rate splitting decode and forward relaying and cooperation"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"
    - "ergodic interference alignment"

Connected through hyperedge HE-6 (induced by source paper "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "completely stale transmitter channel state information is still very useful"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "the degrees of freedom region of the mimo cognitive interference channel with no csit"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "dirty paper coding for the mimo cognitive radio channel with imperfect csit"
    - "interference alignment under limited feedback for mimo interference channels"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"

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)