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 "unicast uniprior index coding problems minrank and criticality"):
  Abstract: An index coding problem is called unicast-uniprior when each receiver demands a unique subset of messages while knowing another unique subset of messages apriori as side-information. In this work, we give an algorithm to compute the minrank of a unicast-uniprior problem. The proposed algorithm greatly simplifies the computation of minrank for unicast-uniprior problem settings, over the existing method whose complexity is exponential in the number of messages. First, we establish some properties that are exclusive to the fitting matrix of a unicast-uniprior problem. Further, these properties are used to lay down the algorithm that computes the minrank.

Includes members:
  Member "on the number of optimal index codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum likelihood decoder for index coded psk modulation for priority ordered receivers")
  Member "on critical index coding problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear index coding with multiple senders and extension to a cellular network")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "critical graphs in index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "optimal index codes for a class of multicast networks with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative multi sender index coding")
  Member "on the index coding problem and its relation to network coding and matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient 3d road map data exchange for intelligent vehicles in vehicular fog networks")

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)