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: "a note on outer bounds for broadcast channel"
  Abstract: In this note we establish two facts concerning the so-called {\em New-Jersey} outer bound. We show that this outer bound is equivalent to a much simpler {\em computable} region; and secondly we show that in the absence of private information this bound is exactly same as the $UV$-outerbound.

Connected through hyperedge HE-1 (induced by source paper "broadcast channels with privacy leakage constraints"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "a technique for deriving one shot achievability results in network information theory"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-2 (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"
    - "the capacity region of classes of product broadcast channels"
    - "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-3 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "private broadcasting over independent parallel channels"
    - "the two user gaussian fading broadcast channel"
    - "interference networks with general message sets a random coding scheme"
    - "ergodic fading interference channels sum capacity and separability"
    - "fading cognitive multiple access channels with confidential messages"
    - "capacity bounds for broadcast channels with confidential messages"
    - "fading broadcast channels with state information at the receivers"

Connected through hyperedge HE-4 (induced by source paper "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"):
  with members:
    - "the capacity region of classes of product broadcast channels"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-5 (induced by source paper "cooperative strategies for simultaneous and broadcast relay channels"):
  with members:
    - "capacity of a class of broadcast relay channels"
    - "broadcasting over the relay channel with oblivious cooperative strategy"
    - "compute and forward harnessing interference through structured codes"
    - "the impact of csi and power allocation on relay channel capacity and cooperation strategies"
    - "capacity of a class of modulo sum relay channels"
    - "rate regions for relay broadcast channels"
    - "broadcast channels with cooperating decoders"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "on state dependent broadcast channels with side information at the transmitter"):
  with members:
    - "secure broadcasting with side information"
    - "two classes of broadcast channels with side information capacity outer bounds"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "broadcasting with side information"

Connected through hyperedge HE-7 (induced by source paper "capacity bounds for state dependent broadcast channels"):
  with members:
    - "secure broadcasting with side information"
    - "two classes of broadcast channels with side information capacity outer bounds"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "broadcasting with side information"

Connected through hyperedge HE-8 (induced by source paper "the capacity region of classes of product broadcast channels"):
  with members:
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "an information inequality for the bssc channel"

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)