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: "reed muller codes achieve capacity on erasure channels"
  Abstract: This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this method requires only that the codes are highly symmetric. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge to a number between 0 and 1, and the permutation group of each code is doubly transitive. This also provides a rare example in information theory where symmetry alone implies near-optimal performance. #R##N#An important consequence of this result is that a sequence of Reed-Muller codes with increasing blocklength achieves capacity if its code rate converges to a number between 0 and 1. This possibility has been suggested previously in the literature but it has only been proven for cases where the limiting code rate is 0 or 1. Moreover, these results extend naturally to affine-invariant codes and, thus, to all extended primitive narrow-sense BCH codes. The primary tools used in the proof are the sharp threshold property for monotone boolean functions and the area theorem for extrinsic information transfer functions.

Connected through hyperedge HE-1 (induced by source paper "partially symmetric monomial codes"):
  with members:
    - "permutation decoding of polar codes"
    - "recursive projection aggregation decoding of reed muller codes"
    - "a new permutation decoding method for reed muller codes"
    - "soft decision decoding of reed muller codes recursive lists"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "list decoding of polar codes"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-2 (induced by source paper "reed muller codes polarize"):
  with members:
    - "recursive projection aggregation decoding of reed muller codes"
    - "general strong polarization"
    - "on the performance of reed muller codes with respect to random errors and erasures"
    - "decoding reed muller codes using minimum weight parity checks"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "high girth matrices and polarization"

Connected through hyperedge HE-3 (induced by source paper "on the construction of g_n coset codes for parallel decoding"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "permutation decoding of polar codes"
    - "a new permutation decoding method for reed muller codes"
    - "a 5 16gbps decoder asic for polar code in 16nm finfet"
    - "a flip syndrome list polar decoder architecture for ultra low latency communications"
    - "strange attractor for efficient polar code design"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "low degree almost boolean functions are sparse juntas"):
  with members:
    - "analysis of boolean functions"
    - "making the long code shorter with applications to the unique games conjecture"

Connected through hyperedge HE-5 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "irregular product codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"
    - "low density parity check codes for nonergodic block fading channels"

Connected through hyperedge HE-6 (induced by source paper "duality between erasures and defects"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "rewriting flash memories by message passing"
    - "cyclic lrc codes and their subfield subcodes"
    - "coding scheme for 3d vertical flash memory"
    - "writing on dirty flash memory"
    - "on the duality of erasures and defects"
    - "a family of optimal locally recoverable codes"
    - "coding for memory with stuck at defects"

Connected through hyperedge HE-7 (induced by source paper "algebraic properties of polar codes from a new polynomial formalism"):
  with members:
    - "the fractality of polar and reed muller codes"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "on locality of generalized reed muller codes over the broadcast erasure channel"):
  with members:
    - "binary systematic network coding for progressive packet decoding"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "isn t hybrid arq sufficient"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "network coding meets tcp"

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)