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 "automatic throughput and critical path analysis of x86 and arm assembly kernels"):
  Abstract: Useful models of loop kernel runtimes on out-of-order architectures require an analysis of the the in-core performance behavior of instructions and their dependencies. While an instruction throughput prediction sets a lower bound to the kernel runtime, the critical path defines an upper bound. Such predictions are an essential part of analytic (i.e., white-box) performance models like the Roofline and ECM model. They enable a better understanding of the performance-relevant interactions between hardware architecture and loop code. #R##N#The Open Source Architecture Code Analyzer (OSACA) is a static analysis tool for predicting the execution time of sequential loops. It previously supported only x86 (Intel and AMD) architectures and simple, optimistic full-throughput execution. We have heavily extended OSACA to support ARM instructions and critical path prediction including the detection of loop-carried dependencies, which turns it into a versatile cross-architecture modeling tool. We show runtime predictions for code on Intel Cascade Lake, AMD Zen, and Marvell Vulcan micro-architectures based on machine models from available documentation and semi-automatic benchmarking. The predictions are compared with actual measurements.

Includes members:
  Member "uops info characterizing latency throughput and port usage of instructions on intel microarchitectures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "collecting and presenting reproducible intranode stencil performance inspect")
  Member "ithemal accurate portable and fast basic block throughput estimation using deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning execution through neural code fusion")
  Member "automated instruction stream throughput prediction for intel and amd microarchitectures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smotherspectre exploiting speculative execution through port contention")
  Member "kerncraft a tool for analytic performance modeling of loop kernels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "collecting and presenting reproducible intranode stencil performance inspect")
  Member "quantifying performance bottlenecks of stencil computations using the execution cache memory model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "desynchronization and wave pattern formation in mpi parallel and hybrid memory bound programs")

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.PF(Performance)