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: "linear time approximation schemes for the gale berlekamp game and related minimization problems"
  Abstract: We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further applications include, among other things, finding a constrained form of matrix rigidity and maximum likelihood decoding of an error correcting code. As another application of our method we give the first linear time approximation schemes for correlation clustering with a fixed number of clusters and its hierarchical generalization. Our results depend on a new technique for dealing with small objective function values of optimization problems and could be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "near optimal lp rounding algorithm for correlation clustering on complete and complete k partite graphs"):
  with members:
    - "correlation clustering with noisy partial information"
    - "online correlation clustering"
    - "a note on the inapproximability of correlation clustering"

Connected through hyperedge HE-2 (induced by source paper "limits of csp problems and efficient parameter testing"):
  with members:
    - "on refined versions of the azuma hoeffding inequality with applications in information theory"
    - "approximation schemes for the betweenness problem in tournaments and related ranking problems"

Connected through hyperedge HE-3 (induced by source paper "speeding up graph algorithms via switching classes"):
  with members:
    - "simple dfs on the complement of a graph and on partially complemented digraphs"

Connected through hyperedge HE-4 (induced by source paper "local correlation clustering"):
  with members:
    - "active learning using smooth relative regret approximations with applications"
    - "fast local computation algorithms"
    - "a local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning"

Connected through hyperedge HE-5 (induced by source paper "online correlation clustering"):
  with members:
    - "correlation clustering with a fixed number of clusters"

Connected through hyperedge HE-6 (induced by source paper "approximation schemes for the betweenness problem in tournaments and related ranking problems"):
  with members:
    - "faster algorithms for feedback arc set tournament kemeny rank aggregation and betweenness tournament"
    - "betweenness parameterized above tight lower bound"
    - "noisy sorting without resampling"

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