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: "error correcting regenerating and locally repairable codes via rank metric codes"
  Abstract: This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance (MRD) code as an outer code and either a globally regenerating or a locally repairable code as an inner code. Also, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code and proves that this concatenated coding coding scheme attains the upper bound on resilience capacity for the first type of adversary. Further, the paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors.

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"
    - "fractional decoding error correction from partial information"
    - "a complete classification of partial mds maximally recoverable codes with one global parity"
    - "decoding of interleaved reed solomon codes using improved power decoding"

Connected through hyperedge HE-2 (induced by source paper "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"):
  with members:
    - "systematic maximum sum rank codes"
    - "equivalence and characterizations of linear rank metric codes based on invariants"
    - "random construction of partial mds codes"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "fuzzy authentication using rank distance"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"

Connected through hyperedge HE-3 (induced by source paper "from uncoded prefetching to coded prefetching in coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"
    - "on caching with more users than files"

Connected through hyperedge HE-4 (induced by source paper "architecture aware coding for distributed storage repairable block failure resilient codes"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal fractional repetition codes based on graphs and designs"
    - "repairable block failure resilient codes"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-5 (induced by source paper "caching and delivery via interference elimination"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "wireless device to device caching networks basic principles and system performance"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "hierarchical coded caching"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "online coded caching"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-6 (induced by source paper "locally recoverable codes from rational maps"):
  with members:
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-7 (induced by source paper "some contributions to the construction of locally recoverable codes from algebraic curves"):
  with members:
    - "locally recoverable codes on algebraic curves"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-8 (induced by source paper "a piggybacking design framework for read and download efficient distributed storage codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing reed solomon codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "a family of optimal locally recoverable codes"
    - "update efficient regenerating codes with minimum per node storage"
    - "repair optimal mds array codes over gf 2"
    - "quasi cyclic flexible regenerating 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)