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: "linear tail biting trellises characteristic generators and the bcjr construction"
  Abstract: We investigate the constructions of tail-biting trellises for linear block codes introduced by Koetter/Vardy (2003) and Nori/Shankar (2006). For a given code we will define the sets of characteristic generators more generally than by Koetter/Vardy and we will investigate how the choice of characteristic generators affects the set of resulting product trellises, called KV-trellises. Furthermore, we will show that each KV-trellis is a BCJR-trellis, defined in a slightly stronger sense than by Nori/Shankar, and that the latter are always non-mergeable. Finally, we will address a duality conjecture of Koetter/Vardy by making use of a dualization technique of BCJR-trellises and prove the conjecture for minimal trellises.

Connected through hyperedge HE-1 (induced by source paper "characteristic matrices and trellis reduction for tail biting convolutional codes"):
  with members:
    - "local irreducibility of tail biting trellises"
    - "characteristic generators and dualization for tail biting trellises"
    - "simultaneous code error trellis reduction for convolutional codes using shifted code error subsequences"

Connected through hyperedge HE-2 (induced by source paper "matrix theory for minimal trellises"):
  with members:
    - "characteristic generators and dualization for tail biting trellises"
    - "distance bounds for algebraic geometric codes"

Connected through hyperedge HE-3 (induced by source paper "algebraic construction of tail biting trellises for linear block codes"):
  with members:
    - "error trellis construction for tailbiting convolutional codes"
    - "characteristic generators and dualization for tail biting trellises"

Connected through hyperedge HE-4 (induced by source paper "on the algebraic structure of linear trellises"):
  with members:
    - "reducing complexity of tail biting trellises"

Connected through hyperedge HE-5 (induced by source paper "codes on graphs fundamentals"):
  with members:
    - "on the algebraic structure of linear trellises"
    - "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"
    - "the dynamics of group codes dual abelian group codes and systems"

Connected through hyperedge HE-6 (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"
    - "on minimal tree realizations of linear codes"
    - "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-7 (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"
    - "on minimal tree realizations of linear codes"

Connected through hyperedge HE-8 (induced by source paper "reducing complexity of tail biting trellises"):
  with members:
    - "codes on graphs observability controllability and local reducibility"
    - "observability controllability and local reducibility of linear codes on graphs"
    - "characteristic generators and dualization for tail biting trellises"

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)