human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "counterexample guided neural synthesis"):
  Abstract: Program synthesis is the generation of a program from a specification. Correct synthesis is difficult, and methods that provide formal guarantees suffer from scalability issues. On the other hand, neural networks are able to generate programs from examples quickly but are unable to guarantee that the program they output actually meets the logical specification. In this work we combine neural networks with formal reasoning: using the latter to convert a logical specification into a sequence of examples that guides the neural network towards a correct solution, and to guarantee that any solution returned satisfies the formal specification. We apply our technique to synthesising loop invariants and compare the performance to existing solvers that use SMT and existing techniques that use neural networks. Our results show that the formal reasoning based guidance improves the performance of the neural network substantially, nearly doubling the number of benchmarks it can solve.

Includes members:
  Member "neural program synthesis with priority queue training":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to generalize from sparse and underspecified rewards")
  Member "leveraging grammar and reinforcement learning for neural program synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improving molecular design by stochastic iterative target augmentation")
  Member "robustfill neural program learning under noisy i o":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "programming not only by example":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "program sketching with live bidirectional evaluation")
  Member "deepcoder learning to write programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "automated synthesis of semantic malware signatures using maximum satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new era of deeplearning based malware intrusion detection the malware detection and prediction based on deep learning")
  Member "component based synthesis of table consolidation and transformation tasks from examples":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource guided program synthesis")
  Member "neuro symbolic program synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")

Question: Please tell me which class the source paper 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.LO(Logic in Computer Science)