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: "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"
  Abstract: We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's inner bound achieves the capacity of the vector Gaussian broadcast channels with common message.

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 "mimo gaussian broadcast channels with common private and confidential messages"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "multi receiver wiretap channel with public and confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"):
  with members:
    - "linear information coupling problems"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "evaluation of marton s inner bound for the general broadcast channel"

Connected through hyperedge HE-4 (induced by source paper "an alternative proof of an extremal entropy inequality"):
  with members:
    - "on the equivalence between stein and de bruijn identities"
    - "information theoretic proofs of entropy power inequalities"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "degraded compound multi receiver wiretap channels"
    - "the secrecy capacity of the mimo wiretap channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "mutual information and minimum mean square error in gaussian channels"

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)