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 "constructing concrete hard instances of the maximum independent set problem"):
  Abstract: We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increasing size, which possesses similar characteristics to sparse random graphs and in which MIS cannot be solved efficiently. We analytically and numerically show that all algorithms employing cycle-chain refutation, which is a general refutation method we introduce for capturing the ability of many known algorithms, cannot upper bound the size of the maximum independent set tightly.

Includes members:
  Member "the backtracking survey propagation algorithm for solving random k sat problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the sdp value for random two eigenvalue csps")
  Member "on independent sets in random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the average case complexity of counting cliques in erdos renyi hypergraphs")
  Member "from average case complexity to improper learning complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "time space tradeoffs for distinguishing distributions and applications to security of goldreich s prg")
  Member "average case complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "plausibility and probability in deductive reasoning")
  Member "generating hard satisfiable formulas by hiding solutions deceptively":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of random satisfiability problems with planted solutions")

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.DS(Data Structures and Algorithms)