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: "partial spreads in random network coding"
  Abstract: Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular, following an idea in finite projective geometry, we introduce a class of network codes which we call "partial spread codes". Partial spread codes naturally generalize spread codes. In this paper we provide an easy description of such codes in terms of matrices, discuss their maximality, and provide an efficient decoding algorithm.

Connected through hyperedge HE-1 (induced by source paper "hamming and simplex codes for the sum rank metric"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "on the locality of codeword symbols"
    - "multishot codes for network coding using rank metric codes"
    - "coding for errors and erasures in random network coding"
    - "properties of codes in rank metric"

Connected through hyperedge HE-2 (induced by source paper "maximal ferrers diagram codes constructions and genericity considerations"):
  with members:
    - "on the sparseness of certain mrd codes"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "algebraic structures of mrd codes"
    - "construction of subspace codes through linkage"
    - "row reduction applied to decoding of rank metric and subspace codes"
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"

Connected through hyperedge HE-3 (induced by source paper "partition balanced families of codes and asymptotic enumeration in coding theory"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "automorphism groups of gabidulin like codes"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "algebraic structures of mrd codes"
    - "rank distribution of delsarte codes"

Connected through hyperedge HE-4 (induced by source paper "geometric decoding of subspace codes with explicit schubert calculus applied to spread codes"):
  with members:
    - "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"
    - "an algebraic approach for decoding spread codes"
    - "spread decoding in extension fields"
    - "spread codes and spread decoding in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "an algebraic framework for end to end physical layer network coding"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "compute and forward harnessing interference through structured codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "construction of subspace codes through linkage"):
  with members:
    - "algebraic structures of mrd codes"
    - "grassmannian codes as lifts of matrix codes derived as images of linear block codes over finite fields"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "cyclic orbit codes"
    - "new improvements on the echelon ferrers construction"
    - "an algebraic approach for decoding spread codes"

Connected through hyperedge HE-7 (induced by source paper "equidistant subspace codes"):
  with members:
    - "distributed storage systems based on equidistant subspace codes"
    - "an algebraic approach for decoding spread codes"
    - "spread codes and spread decoding in network coding"
    - "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 "message encoding and retrieval for spread and cyclic orbit codes"):
  with members:
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "message encoding for spread and orbit codes"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "cyclic orbit codes"
    - "canonical forms and automorphisms in the projective space"
    - "gray codes and enumerative coding for vector spaces"

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)