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: "sum capacity of ergodic fading interference and compound multiaccess channels"
  Abstract: The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IPCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit- receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions defining the classes of strong and very strong ergodic IPCs are presented and the multicast sum-capacity is shown to be tight for both classes.

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"
    - "noisy interference sum rate capacity of parallel 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"

Connected through hyperedge HE-2 (induced by source paper "a general coding scheme for two user fading interference channels"):
  with members:
    - "noisy interference sum rate capacity of parallel gaussian interference channels"
    - "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"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "outage analysis of block fading gaussian interference channels"):
  with members:
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "on the achievable diversity multiplexing tradeoff in interference channels"
    - "the diversity multiplexing tradeoff for interference networks"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "multiple access outerbounds and the inseparability of parallel interference channels"
    - "gaussian interference channel capacity to within one bit"
    - "interference alignment and the degrees of freedom for the k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "ergodic layered erasure one sided interference channels"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "ergodic interference alignment"
    - "fading broadcast channels with state information at the receivers"
    - "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"
    - "the two user gaussian interference channel a deterministic view"

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)