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 the algebraic structure of linear trellises"
  Abstract: Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In this paper we first develop a new algebraic framework for a systematic analysis of linear trellises which enables us to address open foundational questions. In particular, we present a useful and powerful characterization of linear trellis isomorphy. We also obtain a new proof of the Factorization Theorem of Koetter/Vardy and point out unnoticed problems for the group case. #R##N#Next, we apply our work to: describe all the elementary trellis factorizations of linear trellises and consequently to determine all the minimal linear trellises for a given code; prove that nonmergeable one-to-one linear trellises are strikingly determined by the edge-label sequences of certain closed paths; prove self-duality theorems for minimal linear trellises; analyze quasi-cyclic linear trellises and consequently extend results on reduced linear trellises to nonreduced ones. To achieve this, we also provide new insight into mergeability and path connectivity properties of linear trellises. #R##N#Our classification results are important for iterative decoding as we show that minimal linear trellises can yield different pseudocodewords even if they have the same graph structure.

Connected through hyperedge HE-1 (induced by source paper "codes on graphs fundamentals"):
  with members:
    - "local irreducibility of tail biting trellises"
    - "characteristic generators and dualization for tail biting trellises"
    - "partition functions of normal factor graphs"
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"
    - "the dynamics of group codes dual abelian group codes and 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)