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: "gradual parametricity revisited"
  Abstract: Bringing the benefits of gradual typing to a language with parametric polymorphism like System F, while preserving relational parametricity, has proven extremely challenging: first attempts were formulated a decade ago, and several recent developments have been published in the past year. In addition to leaving some properties as conjectures or future work, we observe that all prior work improperly handle type instantiations when imprecise types are involved. This observation further suggests that existing polymorphic cast calculi are not well suited for supporting a gradual counterpart of System F. Consequently, we revisit the challenge of designing a gradual language with explicit parametric polymorphism, exploring the extent to which the Abstracting Gradual Typing methodology helps us derive such a language, GSF. We present the design and metatheory of GSF. In addition to avoiding the uncovered semantic issues, GSF satisfies all the expected properties of a gradual parametric language, save for one property: the dynamic gradual guarantee, which was left as conjecture in all prior work, is here proven to be simply incompatible with parametricity. We nevertheless establish a weaker property that allows us to disprove several claims about gradual free theorems, clarifying the kind of reasoning supported by gradual parametricity.

Connected through hyperedge HE-1 (induced by source paper "approximate normalization for gradual dependent types"):
  with members:
    - "live functional programming with typed holes"
    - "gradual session types"
    - "dependent types in haskell theory and practice"
    - "gradual certified programming in coq"
    - "equations for hereditary substitution in leivant s predicative system f a case study"
    - "irrelevance heterogeneous equality and call by value dependent type systems"

Connected through hyperedge HE-2 (induced by source paper "gradual typing for extensibility by rows"):
  with members:
    - "dynamic type inference for gradual hindley milner typing"
    - "sums of uncertainty refinements go gradual"
    - "do be do be do"
    - "koka programming with row polymorphic effect types"

Connected through hyperedge HE-3 (induced by source paper "space efficient gradual typing in coercion passing style"):
  with members:
    - "space efficient manifest contracts"

Connected through hyperedge HE-4 (induced by source paper "gradual session types"):
  with members:
    - "gradual liquid type inference"
    - "depending on session typed processes"
    - "fast and precise type checking for javascript"
    - "sums of uncertainty refinements go gradual"
    - "design and implementation of concurrent c0"
    - "do be do be do"
    - "an erlang implementation of multiparty session actors"
    - "programming with algebraic effects and handlers"

Connected through hyperedge HE-5 (induced by source paper "call by name gradual type theory"):
  with members:
    - "gradual session types"

Connected through hyperedge HE-6 (induced by source paper "gradual parametricity revisited with appendix"):
  with members:
    - "deriving a simple gradual security language"

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)