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: "on broadcast channels with binary inputs and symmetric outputs"
  Abstract: We study the capacity regions of broadcast channels with binary inputs and symmetric outputs. We study the partial order induced by the more capable ordering of broadcast channels for channels belonging to this class. This study leads to some surprising connections regarding various notions of dominance of receivers. The results here also help us isolate some classes of symmetric channels where the best known inner and outer bounds differ.

Connected through hyperedge HE-1 (induced by source paper "superposition coding is almost always optimal for the poisson broadcast channel"):
  with members:
    - "a comparison of superposition coding schemes"
    - "the poisson channel with side information"
    - "capacity regions of two new classes of 2 receiver broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "universal polar codes for more capable and less noisy channels and sources"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the compound capacity of polar codes"

Connected through hyperedge HE-3 (induced by source paper "achievable rate region for three user discrete broadcast channel based on coset codes"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "interference alignment and a noisy interference regime for many to one interference channels"

Connected through hyperedge HE-4 (induced by source paper "the capacity region of classes of product broadcast channels"):
  with members:
    - "a note on outer bounds for broadcast channel"
    - "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)