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: "network coding with modular lattices"
  Abstract: In [1], K\"otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this alphabet is the map d: (U, V) \longmapsto dim(U + V) - dim(U \bigcap V). In this paper we generalize this model to arbitrary modular lattices, i.e. we consider codes, which are subsets of modular lattices. The used metric in this general case is the map d: (x, y) \longmapsto h(x \bigvee y) - h(x \bigwedge y), where h is the height function of the lattice. We apply this model to submodule lattices. Moreover, we show a method to compute the size of spheres in certain modular lattices and present a sphere packing bound, a sphere covering bound, and a singleton bound for codes, which are subsets of modular lattices. #R##N#[1] R. K\"otter, F.R. Kschischang: Coding for errors and erasures in random network coding, IEEE Trans. Inf. Theory, Vol. 54, No. 8, 2008

Connected through hyperedge HE-1 (induced by source paper "communication over finite chain ring matrix channels"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "on multiplicative matrix channels over finite chain rings"
    - "an algebraic approach to physical layer network coding"
    - "on the capacity of multiplicative finite field matrix channels"
    - "communication over finite field matrix channels"
    - "compute and forward harnessing interference through structured codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "a singleton bound for lattice schemes"):
  with members:
    - "linearity and complements in projective space"
    - "codes and designs related to lifted mrd codes"
    - "projective space codes for the injection metric"
    - "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-3 (induced by source paper "codes on lattices for random saf routing"):
  with members:
    - "a new construction for constant weight codes"
    - "a matroid framework for noncoherent random network communications"

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)