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 "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  Abstract: The two-sender unicast index coding problem is the most fundamental multi-sender index coding problem. The two senders collectively cater to the demands of all the receivers, by taking advantage of the knowledge of their side-information. Each receiver demands a unique message and has some side-information. Weakly secure index coding problem is a practical version of the index coding problem in the presence of an eavesdropper. The eavesdropper can not gain any information about the messages he does not have, by listening to the senders' transmissions. We provide constructions of weakly secure linear codes for different classes of the two-sender unicast index coding problem, using those of its sub-problems. The constructions are valid only if such codes exist for all the sub-problems under consideration. We identify some classes of the two-sender problem, where the constructions provide optimal weakly secure linear index codes.

Includes members:
  Member "cooperative multi sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "on the capacity region for secure index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized alignment chain improved converse results for index coding")
  Member "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem")
  Member "structural characteristics of two sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear index coding with multiple senders and extension to a cellular network")
  Member "index coding rank invariant extensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem")
  Member "on the capacity for distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "coded caching with distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")
  Member "secure index coding existence and construction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal rate characterisation for pliable index coding using absent receivers")

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)