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: "on multi point local decoding of reed muller codes"
  Abstract: Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple coordinates simultaneously, the naive way is to repeat the local decoding for recovery of a single coordinate. This decoding algorithm might be more expensive, i.e., require higher query complexity. In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d . σ √ q for some σ ∈ (0, 1). By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing [6, 7], we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O(k √ q) coordinates, where q is the code alphabet size. It turns out that our local decoding of ReedMuller codes shows (perhaps surprisingly) that accessing k locations is in fact cheaper than repeating the procedure for accessing a single location for k times. In contrast, by repetition of local decoding for recovery of a single coordinate, one has to query Ω(k √ q log k/ log q) coordinates for k = q √ q) (and query O(kq) coordinates for k = q √ , respectively). Furthermore, our decoding success probability is 1 − ǫ with ǫ = O (

Connected through hyperedge HE-1 (induced by source paper "on taking advantage of multiple requests in error correcting codes"):
  with members:
    - "local list recovery of high rate tensor codes and applications"
    - "locality via partially lifted codes"
    - "cooperative local repair in distributed storage"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"

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)