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: "coding with constraints minimum distance bounds and systematic constructions"
  Abstract: We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes with good minimum distance that can be decoded efficiently. On this note, we provide theoretical bounds on the minimum distance of such a code based on the coded symbol constraints. We refine these bounds in the case where we demand a systematic linear code. Finally, we provide conditions under which each of these bounds can be achieved by choosing our code to be a subcode of a Reed-Solomon code, allowing for efficient decoding. This problem has been considered in multisource multicast network error correction. The problem setup is also reminiscent of locally repairable codes.

Connected through hyperedge HE-1 (induced by source paper "generalized reed solomon codes with sparsest and balanced generator matrices"):
  with members:
    - "an algebraic combinatorial proof technique for the gm mds conjecture"
    - "cooperative data exchange based on mds codes"
    - "balanced reed solomon codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-2 (induced by source paper "an algebraic combinatorial proof technique for the gm mds conjecture"):
  with members:
    - "balanced reed solomon codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "balanced sparsest generator matrices for mds codes"

Connected through hyperedge HE-3 (induced by source paper "balanced reed solomon codes"):
  with members:
    - "a family of optimal locally recoverable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "xoring elephants novel erasure codes for big data"
    - "balanced sparsest generator matrices for mds codes"
    - "rapidraid pipelined erasure codes for fast data archival in distributed storage systems"
    - "on the locality of codeword symbols"
    - "a rank metric approach to error control in random network coding"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-4 (induced by source paper "locally encodable and decodable codes for distributed storage systems"):
  with members:
    - "storage capacity of repairable networks"
    - "erasure codes with symbol locality and group decodability for distributed storage"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

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)