human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the coco beholder enabling comprehensive evaluation of congestion control algorithms"):
  Abstract: The recent endeavors of the research community to unite efforts on the design and evaluation of congestion control algorithms have created a growing collection of congestion control schemes called Pantheon. However, the virtual network emulator that comes with the collection has very limited capabilities: it can run flows of only one scheme at once, and the flows cannot have individual network settings, as the topology is point-to-point. This thesis addresses those limitations and presents CoCo-Beholder, a human-friendly emulator providing the popular dumbbell topology of any size, each link of which may have individual rate, delay, and queue size. The central link of the topology may also have a variable delay with optional jitter. Flows of different schemes may run between the halves of the topology at once, and for each flow, the direction and starting time can be chosen. CoCo-Beholder's reliability is ensured by testing schemes in the dumbbell topology of size one and comparing the results against those of Pantheon emulator. With CoCo-Beholder, the thesis successfully reproduces experiments from a recent paper that evaluated the fairness and RTT-fairness of schemes using a real hardware dumbbell testbed. Finally, the thesis explores the behavior of schemes under the square-wave delay using CoCo-Beholder's variable delay feature.

Includes members:
  Member "fifty shades of congestion control a performance and interactions evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an evaluation of bbr and its variants")
  Member "an evaluation of bbr and its variants":
    also connected through other hyperedges:
      (none)
  Member "fairness of congestion based congestion control experimental evaluation and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pbe cc congestion control via endpoint centric physical layer bandwidth measurements")
  Member "pcc re architecting congestion control for consistent high performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "taurus an intelligent data plane")
  Member "congestion avoidance in computer networks with a connectionless network layer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "congestion control and traffic management in atm networks recent advances and a survey")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)