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: "characterizations and construction methods for linear functional repair storage codes"
  Abstract: We present a precise characterization of linear functional-repair storage codes in terms of {\em admissible states/}, with each state made up from a collection of vector spaces over some fixed finite field. To illustrate the usefulness of our characterization, we provide several applications. We first describe a simple construction of functional-repair storage codes for a family of code parameters meeting the cutset bound outside the MBR and MSR points; these codes are conjectured to have optimal rate with respect to their repair locality. Then, we employ our characterization to develop a construction method to obtain functional repair codes for given parameters using symmetry groups, which can be used both to find new codes and to improve known ones. As an example of the latter use, we describe a beautiful functional-repair storage code that was found by this method, with parameters belonging to the family investigated earlier, which can be specified in terms of only eight different vector spaces.

Connected through hyperedge HE-1 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes"):
  with members:
    - "functional repair codes a view from projective geometry"
    - "centralized multi node repair regenerating codes"
    - "broadcast repair for wireless distributed storage systems"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "cooperative regenerating codes"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "functional repair codes a view from projective geometry"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "on the achievability region of regenerating codes for multiple erasures"
    - "a class of msr codes for clustered distributed storage"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "fractional repetition and erasure batch codes"

Connected through hyperedge HE-3 (induced by source paper "pir array codes with optimal virtual server rate"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "nearly optimal constructions of pir and batch codes"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "locality and availability of array codes constructed from subspaces"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir schemes with small download complexity and low storage requirements"
    - "private information retrieval from coded databases with colluding servers"

Connected through hyperedge HE-4 (induced by source paper "locally repairable codes with functional repair and multiple erasure tolerance"):
  with members:
    - "repair locality with multiple erasure tolerance"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "locally repairable codes with multiple repair alternatives"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "simple regenerating codes network coding for cloud storage"

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)