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 the capacity of the 2 user interference channel with transmitter cooperation and secrecy constraints"
  Abstract: This paper studies how cooperation between the transmitters can help manage interference and simultaneously ensure secrecy, in the 2-user Gaussian symmetric interference channel. First, the problem is studied in the linear deterministic setting, and achievable schemes are proposed, which use a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. Outer bounds on the secrecy rate are also derived. The novelty in the derivation lies in the careful selection of side information, and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The inner and outer bounds are derived under all possible parameter settings. It is found that, for some parameter settings, the inner and outer bounds match, yielding the capacity of the symmetric linear deterministic IC (SLDIC) under transmitter cooperation and secrecy constraints. In other scenarios, the achievable rate matches with the capacity region of the 2-user SLDIC without secrecy constraints derived by Wang and Tse; thus, the proposed scheme offers secrecy for free. Inspired by the achievable schemes and outer bounds in the deterministic case, achievable schemes and outer bounds are derived in the Gaussian case. The proposed achievable scheme for the Gaussian case uses a combination of Marton's coding scheme and stochastic encoding along with dummy message transmission. For both the models, one of the key techniques used in the achievable scheme is interference cancelation, which offers two seemingly conflicting benefits simultaneously: it cancels interference and ensures secrecy. The results show that limited transmitter cooperation can greatly facilitate secure communications over 2-user ICs.

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)