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 the binary erasure channel under map decoding"
  Abstract: We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of symmetry as well. The main idea is to combine the following observations: (i) monotone functions experience a sharp threshold behavior, (ii) the extrinsic information transfer (EXIT) functions are monotone, (iii) Reed--Muller codes are 2-transitive and thus the EXIT functions associated with their codeword bits are all equal, and (iv) therefore the Area Theorem for the average EXIT functions implies that RM codes' threshold is at channel capacity.

Connected through hyperedge HE-1 (induced by source paper "repairing generalized reed muller codes"):
  with members:
    - "locality and availability of array codes constructed from subspaces"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "cooperative local repair in distributed storage"
    - "repairing reed solomon codes"
    - "on locality in distributed storage systems"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (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 erasure channels"
    - "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-3 (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 erasure channels"
    - "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-4 (induced by source paper "on locality of generalized reed muller codes over the broadcast erasure channel"):
  with members:
    - "reed muller codes achieve capacity on erasure channels"
    - "binary systematic network coding for progressive packet decoding"
    - "isn t hybrid arq sufficient"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "network coding meets tcp"

Connected through hyperedge HE-5 (induced by source paper "decoding high rate reed muller codes from random errors in near linear time"):
  with members:
    - "recursive decoding and its performance for low rate reed muller codes"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes for random erasures and errors"
    - "list decoding reed muller codes over small fields"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-6 (induced by source paper "efficiently decoding reed muller codes from random errors"):
  with members:
    - "recursive decoding and its performance for low rate reed muller codes"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes for random erasures and errors"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "channel coding the road to channel capacity"

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)