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: "private broadcasting over independent parallel channels"
  Abstract: We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one receiver. Each message must be kept confidential from the receiver(s) in the other group. Each of the sub-channels is degraded, but the order of receivers on each channel can be different. While corner points of the capacity region were characterized in earlier works, we establish the capacity region and show the optimality of a superposition strategy. For the case of parallel Gaussian channels, we show that a Gaussian input distribution is optimal. We also discuss an extension of our setup to broadcasting over a block-fading channel and demonstrate significant performance gains using the proposed scheme over a baseline time-sharing scheme.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information"):
  with members:
    - "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
    - "vector gaussian rate distortion with variable side information"
    - "broadcasting correlated vector gaussians"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "information theoretic proofs of entropy power inequalities"
    - "secure lossy transmission of vector gaussian sources"
    - "capacity equivocation region of the gaussian mimo wiretap channel"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "the secrecy capacity of gaussian mimo channels with finite memory full version"):
  with members:
    - "on the capacity of narrowband plc channels"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "source channel coding theorems for the multiple access relay channel"
    - "for the grid and through the grid the role of power line communications in the smart grid"
    - "secured communication over frequency selective fading channels a practical vandermonde precoding"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the capacity region of the degraded finite state broadcast channel"

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"
    - "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"
    - "a note on outer bounds for broadcast channel"
    - "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"

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)