human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "limited magnitude error correcting gray codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "perfectly secure index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the equivalency of reliability and security metrics for wireline networks")
  Member "snake in the box codes for rank modulation under kendall s tau metric":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "duality codes and the integrality gap bound for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative multi sender index coding")
  Member "systematic error correcting codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "constructions of snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "local graph coloring and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "embedded index coding")

Question: Please tell me which class the source paper 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)