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 regions of two new classes of 2 receiver broadcast channels"
  Abstract: Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity regions of these classes by borrowing on existing techniques to obtain the characterization of the capacity region for certain new and interesting classes of broadcast channels. We also establish the relationships between the new classes and the existing classes.

Connected through hyperedge HE-1 (induced by source paper "comparison of channels criteria for domination by a symmetric channel"):
  with members:
    - "strong data processing inequalities for channels and bayesian networks"
    - "bounds between contraction coefficients"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "dissipation of information in channels with input constraints"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "strong data processing inequalities and phi sobolev inequalities for discrete channels"

Connected through hyperedge HE-2 (induced by source paper "superposition coding is almost always optimal for the poisson broadcast channel"):
  with members:
    - "a comparison of superposition coding schemes"
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "the poisson channel with side information"

Connected through hyperedge HE-3 (induced by source paper "coding schemes with rate limited feedback that improve over the nofeedback capacity for a large class of broadcast channels"):
  with members:
    - "the awgn bc with mac feedback a reduction to noiseless feedback via interaction"
    - "on the noisy feedback capacity of gaussian broadcast channels"
    - "feedback and partial message side information on the semideterministic broadcast channel"
    - "insufficiency of linear feedback schemes in gaussian broadcast channels with common message"
    - "an achievable rate region for the broadcast channel with feedback"
    - "short message noisy network coding with a decode forward option"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"

Connected through hyperedge HE-4 (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"
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "secure transmission of sources over noisy channels with side information at the receivers"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "discriminatory lossy source coding side information privacy"
    - "secure lossy source coding with side information at the decoders"
    - "lecture notes on network information theory"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "two way source coding with a helper"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

Connected through hyperedge HE-6 (induced by source paper "broadcast channels with confidential messages by randomness constrained stochastic encoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure communication with constrained randomization"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "capacity results for relay channels with confidential messages"
    - "3 receiver broadcast channels with common and confidential messages"
    - "secure multiplex coding to attain the channel capacity in wiretap channels"

Connected through hyperedge HE-7 (induced by source paper "three receiver broadcast channels with side information"):
  with members:
    - "the state dependent semideterministic broadcast channel"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "the capacity of a class of 3 receiver broadcast channels with degraded message sets"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-8 (induced by source paper "expurgation exponent of leaked information in privacy amplification for binary sources"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"
    - "applications of ldpc codes to the wiretap 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)