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: "repairable fountain codes"
  Abstract: We introduce a new family of Fountain codes that are systematic and also have sparse parities. Given an input of $k$ symbols, our codes produce an unbounded number of output symbols, generating each parity independently by linearly combining a logarithmic number of randomly selected input symbols. The construction guarantees that for any $\epsilon>0$ accessing a random subset of $(1+\epsilon)k$ encoded symbols, asymptotically suffices to recover the $k$ input symbols with high probability. #R##N#Our codes have the additional benefit of logarithmic locality: a single lost symbol can be repaired by accessing a subset of $O(\log k)$ of the remaining encoded symbols. This is a desired property for distributed storage systems where symbols are spread over a network of storage nodes. Beyond recovery upon loss, local reconstruction provides an efficient alternative for reading symbols that cannot be accessed directly. In our code, a logarithmic number of disjoint local groups is associated with each systematic symbol, allowing multiple parallel reads. #R##N#Our main mathematical contribution involves analyzing the rank of sparse random matrices with specific structure over finite fields. We rely on establishing that a new family of sparse random bipartite graphs have perfect matchings with high probability.

Connected through hyperedge HE-1 (induced by source paper "locally repairable convolutional codes with sliding window repair"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "locally repairable codes with unequal local erasure correction"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "superregular matrices and applications to convolutional codes"
    - "convolutional codes in rank metric with application to random network coding"

Connected through hyperedge HE-2 (induced by source paper "locality via partially lifted codes"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "batch codes through dense graphs without short cycles"

Connected through hyperedge HE-3 (induced by source paper "capacity bounds for distributed storage"):
  with members:
    - "maximally recoverable codes for grid like topologies"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols"
    - "raptor codes based distributed storage algorithms for wireless sensor networks"

Connected through hyperedge HE-4 (induced by source paper "secure repairable fountain codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "locally repairable codes"
    - "information theoretically secure regenerating codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "binary linear locally repairable codes"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "repair locality with multiple erasure tolerance"
    - "constructions of optimal and almost optimal locally repairable codes"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-6 (induced by source paper "locality and availability in distributed storage"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-7 (induced by source paper "incremental redundancy fountain codes and advanced topics"):
  with members:
    - "on the locality of codeword symbols"

Connected through hyperedge HE-8 (induced by source paper "update efficiency and local repairability limits for capacity approaching codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit mbr all symbol locality codes"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "capacity achieving linear codes with random binary sparse generating matrices"

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)