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: "capacity of sum networks for different message alphabets"
  Abstract: A sum-network is a directed acyclic network in which all terminal nodes demand the `sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem also hold for sum-networks due to a known reduction between instances of these two problems. Our main result is that unlike a multiple unicast network, the coding capacity of a sum-network is dependent on the message alphabet. We demonstrate this using a construction procedure and show that the choice of a message alphabet can reduce the coding capacity of a sum-network from $1$ to close to $0$.

Connected through hyperedge HE-1 (induced by source paper "coded caching schemes with reduced subpacketization from linear block codes"):
  with members:
    - "asynchronous coded caching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching for networks with the resolvability property"
    - "sum networks from incidence structures construction and capacity analysis"
    - "finite length analysis of caching aided coded multicasting"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-2 (induced by source paper "sum networks from incidence structures construction and capacity analysis"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "sum networks from undirected graphs construction and capacity analysis"
    - "coded caching with low subpacketization levels"
    - "coded caching for networks with the resolvability property"
    - "upper bound on function computation in directed acyclic networks"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "on network coding for sum networks"

Connected through hyperedge HE-3 (induced by source paper "a relation between network computation and functional index coding problems"):
  with members:
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "an equivalence between network coding and index coding"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "optimal computation of symmetric boolean functions in collocated networks"

Connected through hyperedge HE-4 (induced by source paper "on computation rates for arithmetic sum"):
  with members:
    - "sum networks from undirected graphs construction and capacity analysis"
    - "upper bound on function computation in directed acyclic networks"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "optimal function computation in directed and undirected graphs"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-5 (induced by source paper "sum networks from undirected graphs construction and capacity analysis"):
  with members:
    - "on the multiple unicast capacity of 3 source 3 terminal directed acyclic networks"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "an achievable region for the double unicast problem based on a minimum cut analysis"
    - "linear codes target function classes and network computing capacity"
    - "communicating the sum of sources over a network"

Connected through hyperedge HE-6 (induced by source paper "fractional repetition codes with flexible repair from combinatorial designs"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal fractional repetition codes based on graphs and designs"
    - "replication based storage systems with local repair"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes a system perspective"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"

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)