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: "on metrics for error correction in network coding"
  Abstract: The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and destination nodes, the error correction capability of an (outer) code is succinctly described by the rank metric; as a consequence, it is shown that universal network error correcting codes achieving the Singleton bound can be easily constructed and efficiently decoded. For noncoherent network coding, where knowledge of the network topology and network code is not assumed, the error correction capability of a (subspace) code is given exactly by a new metric, called the injection metric, which is closely related to, but different than, the subspace metric of KOumltter and Kschischang. In particular, in the case of a non-constant-dimension code, the decoder associated with the injection metric is shown to correct more errors then a minimum-subspace-distance decoder. All of these results are based on a general approach to adversarial error correction, which could be useful for other adversarial channels beyond network coding.

Connected through hyperedge HE-1 (induced by source paper "point line incidence on grassmannians and majority logic decoding of grassmann codes"):
  with members:
    - "automorphism groups of grassmann codes"
    - "weight spectrum of codes associated with the grassmannian g 3 7"
    - "duals of affine grassmann codes and their relatives"
    - "affine grassmann codes"

Connected through hyperedge HE-2 (induced by source paper "majority logic decoding for certain schubert codes using lines in schubert varieties"):
  with members:
    - "automorphism groups of grassmann codes"
    - "weight spectrum of codes associated with the grassmannian g 3 7"

Connected through hyperedge HE-3 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes"):
  with members:
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "sub quadratic decoding of gabidulin codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "bounds on list decoding of rank metric codes"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-4 (induced by source paper "on the sparseness of certain mrd codes"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-5 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials"):
  with members:
    - "a polymatroid approach to generalized weights of rank metric codes"
    - "rank metric codes and q polymatroids"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "adversarial network coding"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "algebraic structures of mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"

Connected through hyperedge HE-6 (induced by source paper "codes endowed with the rank metric"):
  with members:
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "rank distribution of delsarte codes"
    - "rank metric codes and their duality theory"
    - "subspace codes from ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "macwilliams identity for codes with the rank metric"

Connected through hyperedge HE-7 (induced by source paper "grassmannian codes with new distance measures for network coding"):
  with members:
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "the asymptotic behavior of grassmannian codes"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"):
  with members:
    - "generalized gabidulin codes over fields of any characteristic"
    - "matroidal structure of skew polynomial rings with application to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin 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)