human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "codes on graphs fundamentals"):
  Abstract: This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization duality; analysis of systems-theoretic properties of fragments of realizations and their connections; "minimal = trim and proper" theorem for cycle-free codes; results showing that all constraint codes except interface nodes may be assumed to be trim and proper, and that the interesting part of a cyclic realization is its "2-core;" notions of observability and controllability for fragments, and related tests; relations between state-trimness and controllability, and dual state-trimness and observability.

Includes members:
  Member "on the algebraic structure of linear trellises":
    also connected through other hyperedges:
      (none)
  Member "local irreducibility of tail biting trellises":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "characteristic matrices and trellis reduction for tail biting convolutional codes")
  Member "characteristic generators and dualization for tail biting trellises":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "characteristic matrices and trellis reduction for tail biting convolutional codes")
  Member "partition functions of normal factor graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "normal factor graphs and holographic transformations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "linear tail biting trellises characteristic generators and the bcjr construction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "characteristic matrices and trellis reduction for tail biting convolutional codes")
  Member "the dynamics of group codes dual abelian group codes and systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nested lattice codes for secure bidirectional relaying with asymmetric channel gains")

Question: Please tell me which class the source paper 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)