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: "heap reference analysis using access graphs"
  Abstract: Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static data is well understood while that of heap data seems arbitrary and is unbounded. We devise bounded representations that summarize properties of the heap data. This summarization is based on the structure of the program that manipulates the heap. The resulting summary representations are certain kinds of graphs called access graphs. The boundedness of these representations and the monotonicity of the operations to manipulate them make it possible to compute them through data flow analysis.   An important application that benefits from heap reference analysis is garbage collection, where currently liveness is conservatively approximated by reachability from program variables. As a consequence, current garbage collectors leave a lot of garbage uncollected, a fact that has been confirmed by several empirical studies. We propose the first ever end-to-end static analysis to distinguish live objects from reachable objects. We use this information to make dead objects unreachable by modifying the program. This application is interesting because it requires discovering data flow information representing complex semantics. In particular, we formulate the following new analyses for heap data: liveness, availability, and anticipability and propose solution methods for them. Together, they cover various combinations of directions of analysis (i.e., forward and backward) and confluence of information (i.e. union and intersection). Our analysis can also be used for plugging memory leaks in C/Cpp languages.

Connected through hyperedge HE-1 (induced by source paper "demand driven alias analysis formalizing bidirectional analyses for soundness and precision"):
  with members:
    - "heap abstractions for static analysis"
    - "interprocedural data flow analysis in soot using value contexts"

Connected through hyperedge HE-2 (induced by source paper "heap abstractions for static analysis"):
  with members:
    - "liveness based garbage collection for lazy languages"
    - "flow and context sensitive points to analysis using higher order reachability"
    - "interprocedural data flow analysis in soot using value contexts"
    - "abstracting runtime heaps for program understanding"

Connected through hyperedge HE-3 (induced by source paper "liveness based garbage collection for lazy languages"):
  with members:
    - "liveness of heap data for functional programs"
    - "effectiveness of garbage collection in mit gnu scheme"

Connected through hyperedge HE-4 (induced by source paper "generalizing the liveness based points to analysis"):
  with members:
    - "interprocedural data flow analysis in soot using value contexts"

Connected through hyperedge HE-5 (induced by source paper "monotonicity constraints for termination in the integer domain"):
  with members:
    - "buchi complementation and size change termination"
    - "size change termination monotonicity constraints and ranking functions"
    - "ranking functions for size change termination ii"
    - "a general framework for automatic termination analysis of logic programs"

Connected through hyperedge HE-6 (induced by source paper "constraint solving in non permutative nominal abstract syntax"):
  with members:
    - "nominal unification from a higher order perspective"
    - "nominal logic programming"

Connected through hyperedge HE-7 (induced by source paper "data linkage dynamics with shedding"):
  with members:
    - "data linkage algebra data linkage dynamics and priority rewriting"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "tuplix calculus specifications of financial transfer networks"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"

Connected through hyperedge HE-8 (induced by source paper "heap reference analysis for functional programs"):
  with members:
    - "liveness of heap data for functional programs"
    - "effectiveness of garbage collection in mit gnu scheme"

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)