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: "constructions of locally recoverable codes which are optimal"
  Abstract: We provide a Galois theoretical framework which allows to produce good polynomials for the Tamo and Barg construction of optimal locally recoverable codes (LRC). Our approach allows to prove existence results and to construct new good polynomials, which in turn allows to build new LRCs. The existing theory of good polynomials fits in our new framework.

Connected through hyperedge HE-1 (induced by source paper "optimal repairing schemes for reed solomon codes with alphabet sizes linear in lengths under the rack aware model"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "on two to one mappings over finite fields"
    - "rack aware regenerating codes for data centers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "repairing reed solomon codes"
    - "a family of optimal locally recoverable codes"
    - "a repair framework for scalar mds codes"
    - "a survey on network codes for distributed 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)