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: "coinductive big step operational semantics"
  Abstract: Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We formalize the connections between the coinductive big-step semantics and the standard small-step semantics, proving that both semantics are equivalent. We then study the use of coinductive big-step semantics in proofs of type soundness and proofs of semantic preservation for compilers. A methodological originality of this paper is that all results have been proved using the Coq proof assistant. We explain the proof-theoretic presentation of coinductive definitions and proofs offered by Coq, and show that it facilitates the discovery and the presentation of the results.

Connected through hyperedge HE-1 (induced by source paper "program sketching with live bidirectional evaluation"):
  with members:
    - "program synthesis by type guided abstraction refinement"
    - "live functional programming with typed holes"
    - "bidirectional evaluation with directmanipulation"
    - "synthesizing symmetric lenses"
    - "programming not only by example"
    - "programmatic and direct manipulation together at last"
    - "program synthesis from polymorphic refinement types"
    - "type directed synthesis of products"

Connected through hyperedge HE-2 (induced by source paper "soundness conditions for big step semantics"):
  with members:
    - "coaxioms flexible coinductive definitions by inference systems"
    - "java lambda a featherweight story"
    - "flag based big step semantics"
    - "general recursion via coinductive types"

Connected through hyperedge HE-3 (induced by source paper "flexible coinduction in agda"):
  with members:
    - "coaxioms flexible coinductive definitions by inference systems"

Connected through hyperedge HE-4 (induced by source paper "position paper towards transparent machine learning"):
  with members:
    - "billion scale semi supervised learning for image classification"
    - "unexplainability and incomprehensibility of artificial intelligence"
    - "unpredictability of ai"
    - "a dual approach to scalable verification of deep networks"
    - "methods for interpreting and understanding deep neural networks"
    - "explainable artificial intelligence understanding visualizing and interpreting deep learning models"
    - "towards better analysis of machine learning models a visual analytics perspective"
    - "towards verified artificial intelligence"

Connected through hyperedge HE-5 (induced by source paper "interaction trees representing recursive and impure programs in coq"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"
    - "programming with algebraic effects and handlers"
    - "handling algebraic effects"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "general recursion via coinductive types"

Connected through hyperedge HE-6 (induced by source paper "a new coinductive confluence proof for infinitary lambda calculus"):
  with members:
    - "coinductive foundations of infinitary rewriting and infinitary equational logic"
    - "strict ideal completions of the lambda calculus"
    - "coinduction an elementary approach"
    - "partial order infinitary term rewriting"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "on streams that are finitely red"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "infinitary combinatory reduction systems normalising reduction strategies"

Connected through hyperedge HE-7 (induced by source paper "coaxioms flexible coinductive definitions by inference systems"):
  with members:
    - "extending coinductive logic programming with co facts"
    - "generalizing inference systems by coaxioms"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"
    - "tabling rational terms and coinduction finally together"

Connected through hyperedge HE-8 (induced by source paper "formal small step verification of a call by value lambda calculus machine"):
  with members:
    - "from mathematics to abstract machine a formal derivation of an executable krivine machine"

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)