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 "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes"):
  Abstract: We propose a novel technique for constructing a graph representation of a code through which we establish a significant connection between the service rate problem and the well-known fractional matching problem. Using this connection, we show that the service capacity of a coded storage system equals the fractional matching number in the graph representation of the code, and thus is lower bounded and upper bounded by the matching number and the vertex cover number, respectively. This is of great interest because if the graph representation of a code is bipartite, then the derived upper and lower bounds are equal, and we obtain the capacity. Leveraging this result, we characterize the service capacity of the binary simplex code whose graph representation, as we show, is bipartite. Moreover, we show that the service rate problem can be viewed as a generalization of the multiset primitive batch codes problem.

Includes members:
  Member "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes":
    also connected through other hyperedges:
      (none)
  Member "load balancing performance in distributed storage with regular balanced redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes")
  Member "analyzing the download time of availability codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic gradient coding for straggler mitigation in distributed learning")
  Member "service rate region of content access from erasure coded storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes")
  Member "simplex queues for hot data download":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes")
  Member "batch and pir codes and their connections to locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pir codes with short block length")
  Member "on distributed storage allocations of large files for maximum service rate":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes")
  Member "on the service capacity region of accessing erasure coded content":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes")

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)