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: "fnt based reed solomon erasure codes"
  Abstract: This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems.

Connected through hyperedge HE-1 (induced by source paper "straggler resilient serverless computing based on polar codes"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "oversketch approximate matrix multiplication for the cloud"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "on the optimal recovery threshold of coded matrix multiplication"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "occupy the cloud distributed computing for the 99"
    - "block diagonal and lt codes for distributed computing with straggling servers"

Connected through hyperedge HE-2 (induced by source paper "polar coded distributed matrix multiplication"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "oversketch approximate matrix multiplication for the cloud"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "on the optimal recovery threshold of coded matrix multiplication"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "occupy the cloud distributed computing for the 99"
    - "block diagonal and lt codes for distributed computing with straggling servers"

Connected through hyperedge HE-3 (induced by source paper "coded fourier transform"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "coding for distributed fog computing"
    - "coded convolution for parallel and distributed computing within a deadline"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "how to optimally allocate resources for coded distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"

Connected through hyperedge HE-4 (induced by source paper "novel polynomial basis and its application to reed solomon erasure codes"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "composite cyclotomic fourier transforms with reduced complexities"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "efficient erasure decoding of reed solomon codes"
    - "cyclotomic ffts with reduced additive complexities based on a novel common subexpression elimination algorithm"

Connected through hyperedge HE-5 (induced by source paper "on the fly erasure coding for real time video applications"):
  with members:
    - "arq for network coding"

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)