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: "on minimal tree realizations of linear codes"
  Abstract: A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the underlying tree, by specifying a state space at each edge of the tree, and a local constraint code at each vertex of the tree. The constraint complexity of a tree realization is the maximum dimension of any of its local constraint codes. A measure of the complexity of maximum-likelihood (ML) decoding for a code is its treewidth, which is the least constraint complexity of any of its tree realizations.It is known that among all tree realizations of a linear code that extends a given tree decomposition, there exists a unique minimal realization that minimizes the state-space dimension at each vertex of the underlying tree. In this paper, we give two new constructions of these minimal realizations. As a by-product of the first construction, a generalization of the state-merging procedure for trellis realizations, we obtain the fact that the minimal tree realization also minimizes the local constraint code dimension at each vertex of the underlying tree. The second construction relies on certain code decomposition techniques that we develop. We further observe that the treewidth of a code is related to a measure of graph complexity, also called treewidth. We exploit this connection to resolve a conjecture of Forney's regarding the gap between the minimum trellis constraint complexity and the treewidth of a code. We present a family of codes for which this gap can be arbitrarily large.

Connected through hyperedge HE-1 (induced by source paper "codes on graphs observability controllability and local reducibility"):
  with members:
    - "characteristic generators and dualization for tail biting trellises"
    - "on the pseudocodeword redundancy of binary linear codes"
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"
    - "constraint complexity of realizations of linear codes on arbitrary graphs"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"
    - "the dynamics of group codes dual abelian group codes and systems"

Connected through hyperedge HE-2 (induced by source paper "local irreducibility of tail biting trellises"):
  with members:
    - "characteristic generators and dualization for tail biting trellises"
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

Connected through hyperedge HE-3 (induced by source paper "the treewidth of mds and reed muller codes"):
  with members:
    - "constraint complexity of realizations of linear codes on arbitrary graphs"
    - "the extraction and complexity limits of graphical models for linear codes"

Connected through hyperedge HE-4 (induced by source paper "constraint complexity of realizations of linear codes on arbitrary graphs"):
  with members:
    - "the extraction and complexity limits of graphical models for linear codes"

Connected through hyperedge HE-5 (induced by source paper "the extraction and complexity limits of graphical models for linear codes"):
  with members:
    - "a decomposition theory for binary linear codes"
    - "conditionally cycle free generalized tanner graphs theory and application to high rate serially concatenated codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "the distribution of loop lengths in graphical models for turbo decoding"

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)