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: "error correcting codes and phase transitions"
  Abstract: The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous curve in the space of parameters. The main goal of this paper is to relate the asymptotic bound to phase diagrams of quantum statistical mechanical systems. We first identify the code parameters with Hausdorff and von Neumann dimensions, by considering fractals consisting of infinite sequences of code words. We then construct operator algebras associated to individual codes. These are Toeplitz algebras with a time evolution for which the KMS state at critical temperature gives the Hausdorff measure on the corresponding fractal. We extend this construction to algebras associated to limit points of codes, with non-uniform multi-fractal measures, and to tensor products over varying parameters.

Connected through hyperedge HE-1 (induced by source paper "syntactic structures and code parameters"):
  with members:
    - "persistent topology of syntax"
    - "spin glass models of syntax and language evolution"
    - "prevalence and recoverability of syntactic parameters in sparse distributed memories"
    - "complexity vs energy theory of computation and theoretical physics"
    - "kolmogorov complexity and the asymptotic bound for error correcting codes"

Connected through hyperedge HE-2 (induced by source paper "principles and parameters a coding theory perspective"):
  with members:
    - "kolmogorov complexity and the asymptotic bound for error correcting codes"
    - "codes as fractals and noncommutative spaces"
    - "a computability challenge asymptotic bounds and isolated error correcting codes"

Connected through hyperedge HE-3 (induced by source paper "kolmogorov complexity and the asymptotic bound for error correcting codes"):
  with members:
    - "a computability challenge asymptotic bounds and isolated error correcting codes"

Connected through hyperedge HE-4 (induced by source paper "codes as fractals and noncommutative spaces"):
  with members:
    - "kolmogorov complexity and the asymptotic bound for error correcting codes"
    - "a computability challenge asymptotic bounds and isolated error correcting 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)