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: "characteristic generators and dualization for tail biting trellises"
  Abstract: This paper focuses on dualizing tail-biting trellises, particularly KV-trellises. These trellises are based on characteristic generators, as introduced by Koetter/Vardy (2003), and may be regarded as a natural generalization of minimal conventional trellises, even though they are not necessarily minimal. Two dualization techniques will be investigated: the local dualization, introduced by Forney (2001) for general normal graphs, and a linear algebra based dualization tailored to the specific class of tail-biting BCJR-trellises, introduced by Nori/Shankar (2006). It turns out that, in general, the BCJR-dual is a subtrellis of the local dual, while for KV-trellises these two coincide. Furthermore, making use of both the BCJR-construction and the local dualization, it will be shown that for each complete set of characteristic generators of a code there exists a complete set of characteristic generators of the dual code such that their resulting KV-trellises are dual to each other if paired suitably. This proves a stronger version of a conjecture formulated by Koetter/Vardy.

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"
    - "simultaneous code error trellis reduction for convolutional codes using shifted code error subsequences"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

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

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"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

Connected through hyperedge HE-4 (induced by source paper "codes on graphs fundamentals"):
  with members:
    - "on the algebraic structure of linear trellises"
    - "local irreducibility of 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"

Connected through hyperedge HE-5 (induced by source paper "codes on graphs observability controllability and local reducibility"):
  with members:
    - "on the pseudocodeword redundancy of binary linear codes"
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"
    - "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-6 (induced by source paper "local irreducibility of tail biting trellises"):
  with members:
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"
    - "on minimal tree realizations of linear codes"

Connected through hyperedge HE-7 (induced by source paper "observability controllability and local reducibility of linear codes on graphs"):
  with members:
    - "codes on graphs observability controllability and local reducibility"
    - "minimal realizations of linear systems the shortest basis approach"
    - "the dynamics of group codes dual abelian group codes and systems"

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"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

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)