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 observability controllability and local reducibility"):
  Abstract: This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. #R##N#Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint code that is not both trim and proper is locally reducible. A linear or group realization on a finite cycle-free graph is minimal if and only if every local constraint code is trim and proper. #R##N#A realization is called observable if there is a one-to-one correspondence between codewords and configurations, and controllable if it has independent constraints. A linear or group realization is observable if and only if its dual is controllable. A simple counting test for controllability is given. An unobservable or uncontrollable realization is locally reducible. Parity-check realizations are controllable if and only if they have independent parity checks. In an uncontrollable tail-biting trellis realization, the behavior partitions into disconnected subbehaviors, but this property does not hold for non-trellis realizations. On a general graph, the support of an unobservable configuration is a generalized cycle.

Includes members:
  Member "characteristic generators and dualization for 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 "on the pseudocodeword redundancy of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance")
  Member "normal factor graphs and holographic transformations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "characteristic matrices and trellis reduction for tail biting convolutional codes")
  Member "on minimal tree realizations of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "local irreducibility of tail biting trellises")
  Member "constraint complexity of realizations of linear codes on arbitrary graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the treewidth of mds and reed muller codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)