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: "throughput and delay in random wireless networks with restricted mobility"
  Abstract: Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of $\Theta(1)$ is achievable. El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay associated with this throughput scales as $\Theta(n\log n)$, when each node moves according to an independent random walk. In a later work, Diggavi, Grossglauser and Tse (2002) considered a random network on a sphere with a restricted mobility model, where each node moves along a randomly chosen great circle on the unit sphere. They showed that even with this one-dimensional restriction on mobility, constant throughput scaling is achievable. Thus, this particular mobility restriction does not affect the throughput scaling. This raises the question whether this mobility restriction affects the delay scaling. #R##N#This paper studies the delay scaling at $\Theta(1)$ throughput for a random network with restricted mobility. First, a variant of the scheme presented by Diggavi, Grossglauser and Tse (2002) is presented and it is shown to achieve $\Theta(1)$ throughput using different (and perhaps simpler) techniques. The exact order of delay scaling for this scheme is determined, somewhat surprisingly, to be of $\Theta(n\log n)$, which is the same as that without the mobility restriction. Thus, this particular mobility restriction \emph{does not} affect either the maximal throughput scaling or the corresponding delay scaling of the network. This happens because under this 1-D restriction, each node is in the proximity of every other node in essentially the same manner as without this restriction.

Connected through hyperedge HE-1 (induced by source paper "on throughput capacity for a class of buffer limited manets"):
  with members:
    - "throughput capacity of two hop relay manets under finite buffers"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "end to end delay in two hop relay manets with limited buffer"):
  with members:
    - "throughput capacity of two hop relay manets under finite buffers"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "capacity and delay throughput tradeoff in icmns with poisson meeting process"):
  with members:
    - "network capacity region and minimum energy function for a delay tolerant mobile ad hoc network"

Connected through hyperedge HE-4 (induced by source paper "mobility diversity in mobile wireless networks"):
  with members:
    - "network capacity region and minimum energy function for a delay tolerant mobile ad hoc network"

Connected through hyperedge HE-5 (induced by source paper "gossip based information spreading in mobile networks"):
  with members:
    - "tight bounds on information dissemination in sparse mobile networks"
    - "information spreading in stationary markovian evolving graphs"
    - "information propagation speed in mobile and delay tolerant networks"
    - "manets high mobility can make up for low transmission power"
    - "the impact of mobility on gossip algorithms"
    - "product multicommodity flow in wireless networks"
    - "fast distributed algorithms for computing separable functions"

Connected through hyperedge HE-6 (induced by source paper "optimal delay throughput trade offs in mobile ad hoc networks hybrid random walk and one dimensional mobility models"):
  with members:
    - "wireless ad hoc networks strategies and scaling laws for the fixed snr regime"

Connected through hyperedge HE-7 (induced by source paper "coding improves the optimal delay throughput trade offs in mobile ad hoc networks two dimensional i i d mobility models"):
  with members:
    - "optimal delay throughput trade offs in mobile ad hoc networks hybrid random walk and one dimensional mobility models"
    - "wireless ad hoc networks strategies and scaling laws for the fixed snr regime"

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)