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: "convolutional codes with maximum column sum rank for network streaming"
  Abstract: The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank, that parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several known column Hamming distance properties and introduce a new family of convolutional codes that maximize the column sum rank up to the code memory. Our construction involves finding a class of super-regular matrices that preserve this property after multiplication with non-singular block diagonal matrices in the ground field.

Connected through hyperedge HE-1 (induced by source paper "locally repairable convolutional codes with sliding window repair"):
  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"
    - "locally repairable codes with unequal local erasure correction"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "superregular matrices and applications to convolutional codes"
    - "convolutional codes in rank metric with application to random network coding"

Connected through hyperedge HE-2 (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"
    - "bounds on list decoding of rank metric codes"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin codes"

Connected through hyperedge HE-3 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "a singleton bound for generalized ferrers diagram rank metric codes"
    - "subspace codes from ferrers diagrams"

Connected through hyperedge HE-4 (induced by source paper "theory of supports for linear codes endowed with the sum rank metric"):
  with members:
    - "private information retrieval from locally repairable databases with colluding servers"
    - "on defining generalized rank weights"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "private information retrieval from coded databases with colluding servers"
    - "rank error correcting pairs"
    - "relative generalized rank weight of linear codes and its applications to network coding"

Connected through hyperedge HE-5 (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"
    - "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"
    - "multishot codes for network coding using rank metric codes"

Connected through hyperedge HE-6 (induced by source paper "on the construction of jointly superregular lower triangular toeplitz matrices"):
  with members:
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "a new class of superregular matrices and mdp convolutional codes"
    - "erasure coding for real time streaming"

Connected through hyperedge HE-7 (induced by source paper "streaming data transmission in the moderate deviations and central limit regimes"):
  with members:
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on error exponents and moderate deviations for lossless streaming compression of correlated sources"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"

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)