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: "distance properties of expander codes"
  Abstract: We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bound. #R##N#Constructive families of expander codes are presented whose minimum distance asymptotically exceeds the product bound for all code rates between 0 and 1.

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 "analog subspace coding a new approach to coding for non coherent wireless networks"):
  with members:
    - "algorithms for enhanced inter cell interference coordination eicic in lte hetnets"
    - "list decoding subspace codes from insertions and deletions"
    - "algebraic list decoding of subspace codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "bounds on the parameters of locally recoverable codes"):
  with members:
    - "cooperative local repair in distributed storage"
    - "cyclic lrc codes and their subfield subcodes"
    - "achieving arbitrary locality and availability in binary codes"
    - "locally recoverable codes on algebraic curves"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "linear time list recovery of high rate expander codes"):
  with members:
    - "local correctability of expander codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-5 (induced by source paper "local correctability of expander codes"):
  with members:
    - "new affine invariant codes from lifting"
    - "improved constructions for query efficient locally decodable codes of subexponential length"
    - "query efficient locally decodable codes of subexponential length"

Connected through hyperedge HE-6 (induced by source paper "searching for voltage graph based ldpc tailbiting codes with large girth"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "woven graph codes asymptotic performances and examples"
    - "girth 12 quasi cyclic ldpc codes with consecutive lengths"
    - "shortened array codes of large girth"

Connected through hyperedge HE-7 (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"
    - "improved nearly mds expander codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

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

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)