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: "perfectly secure index coding"
  Abstract: In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set. This problem is a generalization of the Shannon's cipher system. We study the minimum key lengths for zero-error and perfectly secure index coding problems.

Connected through hyperedge HE-1 (induced by source paper "secure index coding existence and construction"):
  with members:
    - "limited magnitude error correcting gray codes for rank modulation"
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "systematic error correcting codes for rank modulation"
    - "constructions of snake in the box codes for rank modulation"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-2 (induced by source paper "on the equivalency of reliability and security metrics for wireline networks"):
  with members:
    - "graph theory versus minimum rank for index coding"
    - "using feedback for secrecy over graphs"
    - "on the capacity region for index coding"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "on secure network coding with uniform wiretap sets"
    - "achievability proof via output statistics of random binning"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-3 (induced by source paper "an equivalence between secure network and index coding"):
  with members:
    - "secure index coding existence and construction"
    - "a rate distortion approach to index coding"
    - "an equivalence between network coding and index coding"
    - "on secure network coding with uniform wiretap sets"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

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)