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: "cascaded coded distributed computing on heterogeneous networks"
  Abstract: Coded distributed computing (CDC) introduced by Li et al. in 2015 offers an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. For the more general cascaded CDC, Map computations are repeated at $r$ nodes to significantly reduce the communication load among nodes tasked with computing $Q$ Reduce functions $s$ times. While an achievable cascaded CDC scheme was proposed, it only operates on homogeneous networks, where the storage, computation load and communication load of each computing node is the same. In this paper, we address this limitation by proposing a novel combinatorial design which operates on heterogeneous networks where nodes have varying storage and computing capabilities. We provide an analytical characterization of the computation-communication trade-off and show that it is optimal within a constant factor and could outperform the state-of-the-art homogeneous schemes.

Connected through hyperedge HE-1 (induced by source paper "heterogeneous coded distributed computing joint design of file allocation and function assignment"):
  with members:
    - "coded distributed computing with heterogeneous function assignments"
    - "leveraging coding techniques for speeding up distributed computing"
    - "storage computation and communication a fundamental tradeoff in distributed computing"
    - "wireless mapreduce distributed computing"
    - "a new combinatorial design of coded distributed computing"
    - "on heterogeneous coded distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a scalable framework for wireless distributed computing"

Connected through hyperedge HE-2 (induced by source paper "coded distributed computing with heterogeneous function assignments"):
  with members:
    - "leveraging coding techniques for speeding up distributed computing"
    - "distributed computing with heterogeneous communication constraints the worst case computation load and proof by contradiction"
    - "a new combinatorial design of coded distributed computing"
    - "on heterogeneous coded distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "on caching with more users than files"
    - "on the optimality of uncoded cache placement"

Connected through hyperedge HE-3 (induced by source paper "fundamental limits of decentralized data shuffling"):
  with members:
    - "coded distributed computing with heterogeneous function assignments"
    - "embedded index coding"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "speeding up distributed machine learning using codes"
    - "storage computation and communication a fundamental tradeoff in distributed computing"
    - "coded computing for distributed graph analytics"
    - "on the fundamental limits of coded data shuffling for distributed learning 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)