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: "improved nearly mds expander codes"
  Abstract: A construction of expander codes is presented with the following three properties: i) the codes lie close to the Singleton bound, ii) they can be encoded in time complexity that is linear in their code length, and iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace maximum-distance separable (MDS) outer codes in concatenated constructions, thus resulting in linear-time encodable and decodable codes that approach the Zyablov bound or the capacity of memoryless channels. The presented construction improves on an earlier result by Guruswami and Indyk in that any rate and relative minimum distance that lies below the Singleton bound is attainable for a significantly smaller alphabet size

Connected through hyperedge HE-1 (induced by source paper "linear time erasure list decoding of expander codes"):
  with members:
    - "ldpc codes achieve list decoding capacity"
    - "improved decoding of folded reed solomon and multiplicity codes"
    - "local list recovery of high rate tensor codes and applications"
    - "linear time list recovery of high rate expander codes"
    - "deletion codes in the high noise and high rate regimes"
    - "erasure list decodable codes from random and algebraic geometry codes"
    - "local correctability of expander codes"
    - "folded codes from function field towers and improved optimal rate list decoding"

Connected through hyperedge HE-2 (induced by source paper "correcting a fraction of errors in nonbinary expander codes with linear programming"):
  with members:
    - "linear programming decoding of nonbinary linear codes"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "distance properties of expander codes"

Connected through hyperedge HE-3 (induced by source paper "a combination of testability and decodability by tensor products"):
  with members:
    - "list decoding tensor products and interleaved codes"
    - "adaptive simulated annealing a near optimal connection between sampling and counting"
    - "robust locally testable codes and products of codes"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-4 (induced by source paper "upper and lower bounds on the minimum distance of expander codes"):
  with members:
    - "distance properties of expander codes"

Connected through hyperedge HE-5 (induced by source paper "decoding of expander codes at rates close to capacity"):
  with members:
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

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)