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: "noisy interference sum rate capacity of parallel gaussian interference channels"
  Abstract: The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power constraints satisfy a certain condition. The condition requires the interference to be weak, a situation commonly encountered in, e.g., digital subscriber line transmission. The optimal power allocation is characterized by using the concavity of sum-rate capacity as a function of the power constraints.

Connected through hyperedge HE-1 (induced by source paper "ergodic fading interference channels sum capacity and separability"):
  with members:
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "ergodic interference alignment"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "on the separability of parallel gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "multiple access outerbounds and the inseparability of parallel interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "sum capacity of ergodic fading interference and compound multiaccess channels"

Connected through hyperedge HE-2 (induced by source paper "interference channel with an out of band relay"):
  with members:
    - "ergodic fading interference channels sum capacity and separability"
    - "the multi way relay channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "noisy network coding"
    - "the mimo wireless switch relaying can increase the multiplexing gain"
    - "multiple multicasts with the help of a relay"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-3 (induced by source paper "a general coding scheme for two user fading interference channels"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
    - "capacity bounds for the gaussian interference channel"
    - "sum capacity of ergodic fading interference and compound multiaccess channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "interference channel with a half duplex out of band relay"):
  with members:
    - "ergodic fading interference channels sum capacity and separability"
    - "on the separability of parallel gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-5 (induced by source paper "capacity regions and sum rate capacities of vector gaussian interference channels"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "k user fading interference channels the ergodic very strong case"):
  with members:
    - "ergodic interference alignment"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "on the separability of parallel gaussian interference channels"
    - "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
    - "capacity bounds for the gaussian interference channel"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "new outer bounds on the capacity region of gaussian interference channels"

Connected through hyperedge HE-7 (induced by source paper "mimo z interference channels capacity under strong and noisy interference"):
  with members:
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

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)