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: "verifying and synthesizing constant resource implementations with types"
  Abstract: We propose a novel type system for verifying that programs correctly implement constant-resource behavior. Our type system extends recent work on automatic amortized resource analysis (AARA), a set of techniques that automatically derive provable upper bounds on the resource consumption of programs. We devise new techniques that build on the potential method to achieve compositionality, precision, and automation. #R##N#A strict global requirement that a program always maintains constant resource usage is too restrictive for most practical applications. It is sufficient to require that the program's resource behavior remain constant with respect to an attacker who is only allowed to observe part of the program's state and behavior. To account for this, our type system incorporates information flow tracking into its resource analysis. This allows our system to certify programs that need to violate the constant-time requirement in certain cases, as long as doing so does not leak confidential information to attackers. We formalize this guarantee by defining a new notion of resource-aware noninterference, and prove that our system enforces it. #R##N#Finally, we show how our type inference algorithm can be used to synthesize a constant-time implementation from one that cannot be verified as secure, effectively repairing insecure programs automatically. We also show how a second novel AARA system that computes lower bounds on resource usage can be used to derive quantitative bounds on the amount of information that a program leaks through its resource use. We implemented each of these systems in Resource Aware ML, and show that it can be applied to verify constant-time behavior in a number of applications including encryption and decryption routines, database queries, and other resource-aware functionality.

Connected through hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis"):
  with members:
    - "analysis of logarithmic amortised complexity"
    - "bounded expectations resource analysis for probabilistic programs"
    - "work analysis with resource aware session types"
    - "non polynomial worst case analysis of recursive programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "a combination framework for complexity"

Connected through hyperedge HE-2 (induced by source paper "revisiting and evaluating software side channel vulnerabilities and countermeasures in cryptographic applications"):
  with members:
    - "when human cognitive modeling meets pins user independent inter keystroke timing attacks"
    - "identifying cache based side channels through secret augmented abstract interpretation"
    - "sgxpectre stealing intel secrets from sgx enclaves via speculative execution"
    - "spoiler speculative load hazards boost rowhammer and cache attacks"
    - "meltdownprime and spectreprime automatically synthesized attacks exploiting invalidation based coherence protocols"
    - "spectre attacks exploiting speculative execution"
    - "robust website fingerprinting through the cache occupancy channel"
    - "a systematic evaluation of transient execution attacks and defenses"

Connected through hyperedge HE-3 (induced by source paper "resource guided program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "towards automatic resource bound analysis for ocaml"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "synthesis of recursive adt transformations from reusable templates"
    - "program synthesis from polymorphic refinement types"
    - "denotational cost semantics for functional languages with inductive types"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"

Connected through hyperedge HE-4 (induced by source paper "expected runtime of quantum programs"):
  with members:
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "verification of quantum programs"

Connected through hyperedge HE-5 (induced by source paper "syminfer inferring program invariants using symbolic states"):
  with members:
    - "using dynamic analysis to generate disjunctive invariants"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-6 (induced by source paper "relational cost analysis for functional imperative programs"):
  with members:
    - "bidirectional type checking for relational properties"
    - "automating induction for solving horn clauses"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "effect dependent transformations for concurrent programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "linear dependent types and relative completeness"
    - "abstract effects and proof relevant logical relations"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-7 (induced by source paper "bounded expectations resource analysis for probabilistic programs"):
  with members:
    - "how long o bayesian network will i sample thee a program analysis perspective on expected sampling times"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "non polynomial worst case analysis of recursive programs"
    - "a program logic for union bounds"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-8 (induced by source paper "work analysis with resource aware session types"):
  with members:
    - "design and implementation of concurrent c0"
    - "non blocking concurrent imperative programming with session types"
    - "the complexity of interaction"
    - "towards automatic resource bound analysis for ocaml"
    - "amortised resource analysis with separation logic"

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)