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: "weight distribution and decoding of codes on hypergraphs"
  Abstract: Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular [t] -partite hypergraphs whose minimum distance improves earlier estimates of the distance of bipartite-graph codes. They also suggested a decoding algorithm for such codes and estimated its error-correcting capability. In this paper we study two aspects of hypergraph codes. First, we compute the weight enumerators of several ensembles of such codes, establishing conditions under which they attain the Gilbert-Varshamov bound and deriving estimates of their distance. In particular, we show that this bound is attained by codes constructed on a fixed bipartite graph with a large spectral gap. We also suggest a new decoding algorithm of hypergraph codes that corrects a constant fraction of errors, improving upon the algorithm of Bilu and Hoory.

Connected through hyperedge HE-1 (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-2 (induced by source paper "an upper bound on the size of locally recoverable codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "xoring elephants novel erasure codes for big data"
    - "explicit mbr all symbol locality codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "codes with local regeneration"
    - "optimal linear codes with a local error correction property"

Connected through hyperedge HE-3 (induced by source paper "minimum distance distribution of irregular generalized ldpc code ensembles"):
  with members:
    - "spectral shape of doubly generalized ldpc codes efficient and exact evaluation"
    - "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "on the number of errors correctable with codes on graphs"):
  with members:
    - "distance properties of expander codes"

Connected through hyperedge HE-5 (induced by source paper "woven graph codes asymptotic performances and examples"):
  with members:
    - "distance properties of expander codes"

Connected through hyperedge HE-6 (induced by source paper "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"):
  with members:
    - "doubly generalized ldpc codes stability bound over the bec"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "distance properties of 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)