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: "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
  Abstract: We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration (but no explicit construction was given). This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length $\alpha$ (also called a sub-packetization level) that achieve the optimal repair bandwidth of MSR codes or near-optimal repair bandwidth depending on the sub-packetization level. We applied the technique of parity-splitting code construction. Additionally, we show that the lower bound on the size of the finite field where these codes are constructed, given in the same work of Kamath et al., can be lower. Finally, we discuss the importance of having two ways for node repair with locally regenerating HashTag codes: repair only with local parity nodes or repair with both local and global parity nodes. To the best of the authors' knowledge, this is the first work where this is discussed. Namely, we give a practical example where several optimization metrics such as the repair bandwidth, the number of I/O operations, the access time for the contacted parts and the size of the stored file determine the repair procedure.

Connected through hyperedge HE-1 (induced by source paper "partial mds codes with local regeneration"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "codes with combined locality and regeneration having optimal rate d_ text min and linear field size"):
  with members:
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a family of optimal locally recoverable codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-3 (induced by source paper "hashtag erasure codes from theory to practice"):
  with members:
    - "repair duality with locally repairable and locally regenerating codes"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a new piggybacking design for systematic mds storage codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "zigzag codes mds array codes with optimal rebuilding"

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)