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: "lazy evaluation and delimited control"
  Abstract: The call-by-need lambda calculus provides an equational framework for#N#reasoning syntactically about lazy evaluation. This paper examines its#N#operational characteristics. By a series of reasoning steps, we systematically#N#unpack the standard-order reduction relation of the calculus and discover a#N#novel abstract machine definition which, like the calculus, goes "under#N#lambdas." We prove that machine evaluation is equivalent to standard-order#N#evaluation. Unlike traditional abstract machines, delimited control plays a#N#significant role in the machine's behavior. In particular, the machine replaces#N#the manipulation of a heap using store-based effects with disciplined#N#management of the evaluation stack using control-based effects. In short, state#N#is replaced with control. To further articulate this observation, we present a#N#simulation of call-by-need in a call-by-value language using delimited control#N#operations.

Connected through hyperedge HE-1 (induced by source paper "types by need extended version"):
  with members:
    - "towards a semantic measure of the execution time in call by value lambda calculus"
    - "tight typings and split bounds"
    - "call by need neededness and all that"
    - "proof nets and the linear substitution calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "the call by need lambda calculus revisited"

Connected through hyperedge HE-2 (induced by source paper "realizability interpretation and normalization of typed call by need lambda calculus with control"):
  with members:
    - "a classical realizability model for a semantical value restriction"
    - "on the structure of classical realizability models of zf"
    - "classical realizability and arithmetical formul ae"
    - "the call by need lambda calculus revisited"
    - "existential witness extraction in classical realizability and via a negative translation"

Connected through hyperedge HE-3 (induced by source paper "the call by need lambda calculus revisited"):
  with members:
    - "small step and big step semantics for call by need"

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)