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: "secure index coding existence and construction"
  Abstract: We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of index codes that are secure against an eavesdropper with access to any subset of messages of cardinality t, for any fixed t. In contrast to the benefits of using random keys in secure network coding, we prove that random keys do not promote security in three classes of index-coding instances.

Connected through hyperedge HE-1 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity region for secure index coding"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "coded caching with distributed storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-2 (induced by source paper "optimal rate characterisation for pliable index coding using absent receivers"):
  with members:
    - "an information theoretic converse for the consecutive complete s picod problem"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a polynomial time algorithm for pliable index coding"
    - "an equivalence between secure network and index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "on the capacity region for secure index coding"):
  with members:
    - "privacy in index coding improved bounds and coding schemes"
    - "on the capacity for distributed index coding"
    - "private broadcasting an index coding approach"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the capacity region for index coding"
    - "an equivalence between network coding and index coding"
    - "achievability proof via output statistics of random binning"
    - "on the security of index coding with side information"

Connected through hyperedge HE-4 (induced by source paper "an equivalence between secure network and index coding"):
  with members:
    - "perfectly secure index coding"
    - "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)