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 definitions of general channels with receiver side information"
  Abstract: We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or information stable. The Shannon capacity is the highest rate asymptotically achievable with arbitrarily small error probability. The outage capacity is the highest rate asymptotically achievable with a given probability of decoder-recognized outage. The expected capacity is the highest expected rate asymptotically achievable with a single encoder and multiple decoders, where the channel side information determines the decoder in use. Expected capacity equals Shannon capacity for channels governed by a stationary ergodic random process but is typically greater for general channels. These alternative definitions essentially relax the constraint that all transmitted information must be decoded at the receiver. We derive equations for these capacity definitions through information density. Examples are also provided to demonstrate their implications.

Connected through hyperedge HE-1 (induced by source paper "green communication via power optimized harq protocols"):
  with members:
    - "fundamental limits of cooperation"
    - "bit allocation law for multiantenna channel feedback quantization single user case"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-2 (induced by source paper "outage analysis of uplink two tier networks"):
  with members:
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "uplink interference analysis for two tier cellular networks with diverse users under random spatial patterns"
    - "understanding the benefits of open access in femtocell networks stochastic geometric analysis in the uplink"
    - "analytical modeling of uplink cellular networks"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "open vs closed access femtocells in the uplink"

Connected through hyperedge HE-3 (induced by source paper "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"):
  with members:
    - "optimal throughput diversity delay tradeoff in mimo arq block fading channels"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "source channel coding and separation for generalized communication systems"):
  with members:
    - "joint source channel codes for mimo block fading channels"
    - "minimum expected distortion in gaussian layered broadcast coding with successive refinement"

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)