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: "erasure codes with symbol locality and group decodability for distributed storage"
  Abstract: We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {\alpha; \beta; k; t}, where k is the number of information symbols, each codeword of an (\alpha; \beta; k; t)-group decodable code is a t-tuple of strings, called buckets, such that each bucket is a string of \beta symbols that is a codeword of a [\beta; \alpha] MDS code (which is encoded from \alpha information symbols). Such codes have the following two properties: (P1) Locally Repairable: Each code symbol has locality (\alpha; \beta-\alpha + 1). (P2) Group decodable: From each bucket we can decode \alpha information symbols. We establish an upper bound of the minimum distance of (\alpha; \beta; k; t)-group decodable code for any given set of {\alpha; \beta; k; t}; We also prove that the bound is achievable when the coding field F has size |F| > n-1 \choose k-1.

Connected through hyperedge HE-1 (induced by source paper "locally encodable and decodable codes for distributed storage systems"):
  with members:
    - "storage capacity of repairable networks"
    - "coding with constraints minimum distance bounds and systematic constructions"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

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)