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: "an outer bound for 2 receiver discrete memoryless broadcast channels"
  Abstract: An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Connected through hyperedge HE-1 (induced by source paper "evaluation of marton s inner bound for the general broadcast channel"):
  with members:
    - "the capacity region of classes of product broadcast channels"
    - "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"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "construction of slepian wolf source code and broadcast channel code based on hash property"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "lecture notes on network information theory"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"
    - "disjoint ldpc coding for gaussian broadcast channels"
    - "hash property and fixed rate universal coding theorems"
    - "hash property and coding theorems for sparse matrices and maximum likelihood coding"

Connected through hyperedge HE-3 (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"
    - "the capacity region of classes of product broadcast channels"
    - "an information inequality and evaluation of marton s inner bound for binary input broadcast channels"
    - "an information inequality for the bssc channel"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "capacity bounds for broadcast channels with confidential messages"):
  with members:
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "rate regions for relay broadcast channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-5 (induced by source paper "correlated sources over broadcast channels"):
  with members:
    - "lecture notes on network information theory"
    - "outer bounds on the admissible source region for broadcast channels with dependent sources"
    - "comments on broadcast channels with arbitrarily correlated sources"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "outer bounds on the admissible source region for broadcast channels with dependent sources"):
  with members:
    - "comments on broadcast channels with arbitrarily correlated sources"

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)