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: "resource usage analysis of logic programs via abstract interpretation using sized types"
  Abstract: We present a novel general resource analysis for logic programs based on sized types. Sized#R##N#types are representations that incorporate structural (shape) information and allow expressing#R##N#both lower and upper bounds on the size of a set of terms and their subterms at any position#R##N#and depth. They also allow relating the sizes of terms and subterms occurring at different#R##N#argument positions in logic predicates. Using these sized types, the resource analysis can infer#R##N#both lower and upper bounds on the resources used by all the procedures in a program#R##N#as functions on input term (and subterm) sizes, overcoming limitations of existing resource#R##N#analyses and enhancing their precision. Our new resource analysis has been developed within#R##N#the abstract interpretation framework, as an extension of the sized types abstract domain,#R##N#and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations#R##N#are integrated with the setting up and solving of recurrence equations for inferring both size#R##N#and resource usage functions. We show that the analysis is an improvement over the previous#R##N#resource analysis present in CiaoPP and compares well in power to state of the art systems.

Connected through hyperedge HE-1 (induced by source paper "towards a general framework for static cost analysis of parallel logic programs"):
  with members:
    - "interval based resource usage verification by translation into horn clauses and an application to energy consumption"
    - "a general framework for static profiling of parametric resource usage"

Connected through hyperedge HE-2 (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"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "higher order symbolic execution via contracts"
    - "more precise yet efficient type inference for logic programs"

Connected through hyperedge HE-3 (induced by source paper "an approach to static performance guarantees for programs with run time checks"):
  with members:
    - "combining static and dynamic contract checking for curry"
    - "just in time static type checking for dynamic languages"
    - "a general framework for static profiling of parametric resource usage"
    - "practical run time checking via unobtrusive property caching"

Connected through hyperedge HE-4 (induced by source paper "entra whole systems energy transparency"):
  with members:
    - "data dependent energy modeling for worst case energy consumption analysis"
    - "inferring energy bounds statically by evolutionary analysis of basic blocks"
    - "probabilistic resource analysis by program transformation"
    - "on the infeasibility of analysing worst case dynamic energy"
    - "fine grained energy modeling for the source code of a mobile application"
    - "on the value and limits of multi level energy consumption static analysis for deeply embedded single and multi threaded programs"
    - "probabilistic output analysis by program manipulation"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"

Connected through hyperedge HE-5 (induced by source paper "flowchart programs regular expressions and decidability of polynomial growth rate"):
  with members:
    - "monotonicity constraints for termination in the integer domain"
    - "a focused sequent calculus framework for proof search in pure type systems"
    - "on decidable growth rate properties of imperative programs"

Connected through hyperedge HE-6 (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"
    - "towards energy consumption verification via static analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"

Connected through hyperedge HE-7 (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"
    - "towards energy consumption verification via static analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"

Connected through hyperedge HE-8 (induced by source paper "inferring parametric energy consumption functions at different software levels isa vs llvm ir"):
  with members:
    - "data dependent energy modeling for worst case energy consumption analysis"
    - "static analysis of energy consumption for llvm ir programs"

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)