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: "the capacity region of classes of product broadcast channels"
  Abstract: We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These classes include product of reversely semi-deterministic and product of reversely more-capable channels. A significant consequence of this new outer bound is that it establishes, via an example, that the previously best known outer-bound is strictly suboptimal for the general broadcast channel. Our example is comprised of a product broadcast channel with two semi-deterministic components in reverse orientation.

Connected through hyperedge HE-1 (induced by source paper "outer bounds on the admissible source region for broadcast channels with correlated sources"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "a note on outer bounds for broadcast channel"
    - "optimality and approximate optimality of source channel separation in networks"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "correlated sources over broadcast channels"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "approximate characterizations for the gaussian source broadcast distortion region"

Connected through hyperedge HE-2 (induced by source paper "secrecy capacity region of some classes of wiretap broadcast channels"):
  with members:
    - "multi receiver wiretap channel with public and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"

Connected through hyperedge HE-3 (induced by source paper "optimal power and rate allocation in the degraded gaussian relay channel with energy harvesting nodes"):
  with members:
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal transmission policies for energy harvesting two hop networks"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "two hop communication with energy harvesting"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "information capacity of energy harvesting sensor nodes"
    - "optimal packet scheduling on an energy harvesting broadcast link"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of communications in interference networks part i basic structures"):
  with members:
    - "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"
    - "on marton s inner bound for broadcast channels"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference networks with general message sets a random coding scheme"
    - "a new capacity result for the z gaussian cognitive interference channel"

Connected through hyperedge HE-5 (induced by source paper "evaluation of marton s inner bound for the general broadcast channel"):
  with members:
    - "an information inequality and evaluation of marton s inner bound for binary input broadcast channels"
    - "an information inequality for the bssc channel"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "an outer bound for 2 receiver discrete memoryless broadcast channels"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"):
  with members:
    - "a note on outer bounds for broadcast channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-7 (induced by source paper "optimum power allocations for fading decode and forward relay channel"):
  with members:
    - "study of gaussian relay channels with correlated noises"

Connected through hyperedge HE-8 (induced by source paper "evaluation of marton s inner bound for the general broadcast channel"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "an information inequality and evaluation of marton s inner bound for binary input broadcast channels"
    - "an information inequality for the bssc channel"
    - "an outer bound for 2 receiver discrete memoryless broadcast channels"
    - "rate regions for relay broadcast 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)