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: "towards energy consumption verification via static analysis"
  Abstract: In this paper we leverage an existing general framework for resource usage verification and specialize it for verifying energy consumption specifications of embedded programs. Such specifications can include both lower and upper bounds on energy usage, and they can express intervals within which energy usage is to be certified to be within such bounds. The bounds of the intervals can be given in general as functions on input data sizes. Our verification system can prove whether such energy usage specifications are met or not. It can also infer the particular conditions under which the specifications hold. To this end, these conditions are also expressed as intervals of functions of input data sizes, such that a given specification can be proved for some intervals but disproved for others. The specifications themselves can also include preconditions expressing intervals for input data sizes. We report on a prototype implementation of our approach within the CiaoPP system for the XC language and XS1-L architecture, and illustrate with an example how embedded software developers can use this tool, and in particular for determining values for program parameters that ensure meeting a given energy budget while minimizing the loss in quality of service.

Connected through hyperedge HE-1 (induced by source paper "interval based resource usage verification by translation into horn clauses and an application to energy consumption"):
  with members:
    - "energy transparency for deeply embedded programs"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "resource usage analysis of logic programs via abstract interpretation using sized types"
    - "higher order symbolic execution via contracts"
    - "more precise yet efficient type inference for logic programs"

Connected through hyperedge HE-2 (induced by source paper "inferring energy bounds via static program analysis and evolutionary modeling of basic blocks"):
  with members:
    - "data dependent energy modeling for worst case energy consumption analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "resource usage analysis of logic programs via abstract interpretation using sized types"

Connected through hyperedge HE-3 (induced by source paper "inferring energy bounds statically by evolutionary analysis of basic blocks"):
  with members:
    - "data dependent energy modeling for worst case energy consumption analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "resource usage analysis of logic programs via abstract interpretation using sized types"

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.PL(Programming Languages)