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: "the dynamics of group codes dual abelian group codes and systems"
  Abstract: Fundamental results concerning the dynamics of abelian group codes (behaviors) and their duals are developed. Duals of sequence spaces over locally compact abelian (LCA) groups may be defined via Pontryagin duality; dual group codes are orthogonal subgroups of dual sequence spaces. The dual of a complete code or system is finite, and the dual of a Laurent code or system is (anti-)Laurent. If C and C/sup /spl perp// are dual codes, then the state spaces of C act as the character groups of the state spaces of C/sup /spl perp//. The controllability properties of C are the observability properties of C/sup /spl perp//. In particular, C is (strongly) controllable if and only if C/sup /spl perp// is (strongly) observable, and the controller memory of C is the observer memory of C/sup /spl perp//. The controller granules of C act as the character groups of the observer granules of C/sup /spl perp//. Examples of minimal observer-form encoder and syndrome-former constructions are given. Finally, every observer granule of C is an "end-around" controller granule of C.

Connected through hyperedge HE-1 (induced by source paper "nested lattice codes for secure bidirectional relaying with asymmetric channel gains"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "reliable physical layer network coding"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "providing secrecy with lattice codes"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (induced by source paper "unique factorization and controllability of tail biting trellis realizations via controller granule decompositions"):
  with members:
    - "codes on graphs fundamentals"

Connected through hyperedge HE-3 (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"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

Connected through hyperedge HE-4 (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"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "observability controllability and local reducibility of linear codes on graphs"):
  with members:
    - "codes on graphs observability controllability and local reducibility"
    - "characteristic generators and dualization for tail biting trellises"
    - "minimal realizations of linear systems the shortest basis approach"

Connected through hyperedge HE-6 (induced by source paper "a macwilliams identity for convolutional codes the general case"):
  with members:
    - "on the macwilliams identity for convolutional codes"
    - "on the weight distribution of convolutional codes"

Connected through hyperedge HE-7 (induced by source paper "on the macwilliams identity for convolutional codes"):
  with members:
    - "on the weight distribution of convolutional 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)