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: "fractional decoding error correction from partial information"
  Abstract: We consider error correction by maximum distance separable (MDS) codes based on a part of the received codeword. Our problem is motivated by applications in distributed storage. While efficiently correcting erasures by MDS storage codes (the "repair problem") has been widely studied in recent literature, the problem of correcting errors in a similar setting seems to represent a new question in coding theory. #R##N#Suppose that $k$ data symbols are encoded using an $(n,k)$ MDS code, and some of the codeword coordinates are located on faulty storage nodes that introduce errors. We want to recover the original data from the corrupted codeword under the constraint that the decoder can download only an $\alpha$ proportion of the codeword ({\em fractional decoding}). For any $(n,k)$ code we show that the number of correctable errors under this constraint is bounded above by $\lfloor (n-k/\alpha)/2 \rfloor.$ Moreover, we present two families of MDS array codes which achieves this bound with equality under a simple decoding procedure. The decoder downloads an $\alpha$ proportion of each of the codeword's coordinates, and provides a much larger decoding radius compared to the naive approach of reading some $\alpha n$ coordinates of the codeword. One of the code families is formed of Reed-Solomon (RS) codes with well-chosen evaluation points, while the other is based on folded RS codes. #R##N#Finally, we show that folded RS codes also have the optimal list decoding radius under the fractional decoding constraint.

Connected through hyperedge HE-1 (induced by source paper "on error decoding of locally repairable and partial mds codes"):
  with members:
    - "on decoding and applications of interleaved goppa codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "a public key cryptosystem from interleaved goppa codes"
    - "list decoding of locally repairable codes"
    - "a complete classification of partial mds maximally recoverable codes with one global parity"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "maximally recoverable codes for grid like topologies"

Connected through hyperedge HE-2 (induced by source paper "hierarchical erasure correction of linear codes"):
  with members:
    - "ldpc codes over the q ary multi bit channel"
    - "on universally decodable matrices for space time coding"
    - "on the existence of universally decodable matrices"

Connected through hyperedge HE-3 (induced by source paper "on fractional decoding of reed solomon codes"):
  with members:
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-4 (induced by source paper "erasure correction of scalar codes in the presence of stragglers"):
  with members:
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "ldpc codes over the q ary multi bit channel"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "repairing reed solomon codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"

Connected through hyperedge HE-5 (induced by source paper "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"):
  with members:
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"

Connected through hyperedge HE-6 (induced by source paper "optimal repair of reed solomon codes achieving the cut set bound"):
  with members:
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "repairing reed solomon codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "error correction based on partial information"):
  with members:
    - "on fractional decoding of reed solomon codes"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "repairing reed solomon codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)