human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval from locally repairable databases with colluding servers"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "one shot pir refinement and lifting"
    - "private information retrieval over networks"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "bounds and constructions of codes with multiple localities"

Connected through hyperedge HE-2 (induced by source paper "locally repairable convolutional codes with sliding window repair"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "locally repairable codes with unequal local erasure correction"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "bounds and constructions of codes with multiple localities"
    - "superregular matrices and applications to convolutional codes"
    - "convolutional codes in rank metric with application to random network coding"
    - "convolutional codes with maximum column sum rank for network streaming"

Connected through hyperedge HE-3 (induced by source paper "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "extended integrated interleaved codes over any field with applications to locally recoverable codes"
    - "random construction of partial mds codes"
    - "how long can optimal locally repairable codes be"
    - "constructions of maximally recoverable local reconstruction codes via function fields"
    - "locally repairable codes with unequal local erasure correction"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "locally repairable codes with unequal local erasure correction"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-5 (induced by source paper "network traffic driven storage repair"):
  with members:
    - "repair duality with locally repairable and locally regenerating codes"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "hashtag erasure codes from theory to practice"
    - "balanced locally repairable codes"

Connected through hyperedge HE-6 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"

Connected through hyperedge HE-7 (induced by source paper "linear programming bounds for distributed storage codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with multiple localities"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-8 (induced by source paper "on the average locality of locally repairable codes"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "balanced locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"

Question: Please tell me which class the center node 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)