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 "locality and availability of array codes constructed from subspaces"):
  Abstract: Ever-increasing amounts of data are created and processed in internet-scale companies such as Google, Facebook, and Amazon. The efficient storage of such copious amounts of data has thus become a fundamental and acute problem in modern computing. No single machine can possibly satisfy such immense storage demands. Therefore, distributed storage systems (DSS), which rely on tens of thousands of storage nodes, are the only viable solution. Such systems are broadly used in all modern internet-scale systems. However, the design of a DSS poses a number of crucial challenges, markedly different from single-user storage systems. Such systems must be able to reconstruct the data efficiently, to overcome failure of servers, to correct errors, etc. Lots of research was done in the last few years to answer these challenges and the research is increasing in parallel to the increasing amount of stored data. #R##N#The main goal of this paper is to consider codes which have two of the most important features of distributed storage systems, namely, locality and availability. Our codes are array codes which are based on subspaces of a linear space over a finite field. We present several constructions of such codes which are $q$-analog to some of the known block codes. Some of these codes possess independent intellectual merit. We examine the locality and availability of the constructed codes. In particular we distinguish between two types of locality and availability, node vs.~symbol, locality and availability. To our knowledge this is the first time that such a distinction is given in the literature.

Includes members:
  Member "nearly optimal constructions of pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "array codes for functional pir and batch codes")
  Member "lengthening and extending binary private information retrieval codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pir codes with short block length")
  Member "binary shortened projective reed muller codes for coded private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a general private information retrieval scheme for mds coded databases with colluding servers")
  Member "locality via partially lifted codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pir codes with short block length")
  Member "pir array codes with optimal virtual server rate":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "array codes for functional pir and batch codes")
  Member "bounds and constructions of codes with multiple localities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "codes with unequal locality":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "on private information retrieval array codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "array codes for functional pir and batch 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)