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: "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
  Abstract: The static estimation of the energy consumed by program executions is an important challenge, which has applications in program optimization and verification, and is instrumental in energy-aware software development. Our objective is to estimate such energy consumption in the form of functions on the input data sizes of programs. We have developed a tool for experimentation with static analysis which infers such energy functions at two levels, the instruction set architecture (ISA) and the intermediate code (LLVM IR) levels, and reflects it upwards to the higher source code level. This required the development of a translation from LLVM IR to an intermediate representation and its integration with existing components, a translation from ISA to the same representation, a resource analyzer, an ISA-level energy model, and a mapping from this model to LLVM IR. The approach has been applied to programs written in the XC language running on XCore architectures, but is general enough to be applied to other languages. Experimental results show that our LLVM IR level analysis is reasonably accurate (less than 6.4% average error vs. hardware measurements) and more powerful than analysis at the ISA level. This paper provides insights into the trade-off of precision versus analyzability at these levels.

Connected through hyperedge HE-1 (induced by source paper "resource analysis driven by conditional termination proofs"):
  with members:
    - "an iterative approach to precondition inference using constrained horn clauses"
    - "static analysis of energy consumption for llvm ir programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"

Connected through hyperedge HE-2 (induced by source paper "deductive proof of ethereum smart contracts using why3"):
  with members:
    - "raziel private and verifiable smart contracts on blockchains"
    - "smart contract templates foundations design landscape and research directions"

Connected through hyperedge HE-3 (induced by source paper "on the limitations of analyzing worst case dynamic energy of processing"):
  with members:
    - "energy transparency for deeply embedded programs"
    - "data dependent energy modeling for worst case energy consumption analysis"
    - "data dependent energy modelling a worst case perspective"
    - "on the value and limits of multi level energy consumption static analysis for deeply embedded single and multi threaded programs"
    - "a high level model of embedded flash energy consumption"
    - "static analysis of energy consumption for llvm ir programs"

Connected through hyperedge HE-4 (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"
    - "towards energy consumption verification via static analysis"
    - "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-5 (induced by source paper "an approach to incremental and modular context sensitive analysis of logic programs"):
  with members:
    - "enforcing termination of interprocedural analysis"
    - "incremental tabling in support of knowledge representation and reasoning"
    - "analysis and transformation tools for constrained horn clause verification"

Connected through hyperedge HE-6 (induced by source paper "the iot energy challenge a software perspective"):
  with members:
    - "on the limitations of analyzing worst case dynamic energy of processing"
    - "energy transparency for deeply embedded programs"

Connected through hyperedge HE-7 (induced by source paper "incrementalizing context sensitive analyses for modularized programs"):
  with members:
    - "interval based resource usage verification by translation into horn clauses and an application to energy consumption"
    - "incremental tabling in support of knowledge representation and reasoning"

Connected through hyperedge HE-8 (induced by source paper "data dependent energy modeling for worst case energy consumption analysis"):
  with members:
    - "energy transparency for deeply embedded programs"
    - "on the infeasibility of analysing worst case dynamic energy"
    - "static analysis of energy consumption for llvm ir programs"
    - "optimizing the flash ram energy trade off in deeply embedded systems"
    - "beebs open benchmarks for energy measurements on embedded platforms"

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)