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 "codes with unequal locality"):
  Abstract: For a code $\code$, its $i$-th symbol is said to have locality $r$ if its value can be recovered by accessing some other $r$ symbols of $\code$. Locally repairable codes (LRCs) are the family of codes such that every symbol has locality $r$. #R##N#In this paper, we focus on (linear) codes whose individual symbols can be partitioned into disjoint subsets such that the symbols in one subset have different locality than the symbols in other. We call such codes as "codes with unequal locality". For codes with "unequal information locality", we compute a tight upper bound on the minimum distance as a function of number of information symbols of each locality. We demonstrate that the construction of Pyramid codes can be adapted to design codes with unequal information locality that achieve the minimum distance bound. This result generalizes the classical result of Gopalan et al. for codes with unequal locality. Next, we consider codes with "unequal all symbol locality", and establish an upper bound on the minimum distance as a function of number of symbols of each locality. We show that the construction based on rank-metric codes by Silberstein et al. can be adapted to obtain codes with unequal all symbol locality that achieve the minimum distance bound. Finally, we introduce the concept of "locality requirement" on a code, which can be viewed as a recoverability requirement on symbols. Information locality requirement on a code essentially specifies the minimum number of information symbols of different localities that must be present in the code. We present a greedy algorithm that assigns localities to information symbols so as to maximize the minimum distance among all codes that satisfy a given locality requirement.

Includes members:
  Member "bounds and constructions of codes with multiple localities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal binary locally repairable codes via anticodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "binary linear locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "linear locally repairable codes with random matrices":
    also connected through other hyperedges:
      (none)
  Member "locality and availability in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    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 locality for two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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)