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: "making the long code shorter with applications to the unique games conjecture"
  Abstract: The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more efficient, but can still be used in many of these applications. Using the new code we obtain exponential improvements over several known results, including the following: #R##N#1. For any eps > 0, we show the existence of an n vertex graph G where every set of o(n) vertices has expansion 1 - eps, but G's adjacency matrix has more than exp(log^delta n) eigenvalues larger than 1 - eps, where delta depends only on eps. This answers an open question of Arora, Barak and Steurer (FOCS 2010) who asked whether one can improve over the noise graph on the Boolean hypercube that has poly(log n) such eigenvalues. #R##N#2. A gadget that reduces unique games instances with linear constraints modulo K into instances with alphabet k with a blowup of K^polylog(K), improving over the previously known gadget with blowup of 2^K. #R##N#3. An n variable integrality gap for Unique Games that that survives exp(poly(log log n)) rounds of the SDP + Sherali Adams hierarchy, improving on the previously known bound of poly(log log n). #R##N#We show a connection between the local testability of linear codes and small set expansion in certain related Cayley graphs, and use this connection to derandomize the noise graph on the Boolean hypercube.

Connected through hyperedge HE-1 (induced by source paper "boolean functions on high dimensional expanders"):
  with members:
    - "good distance lattices from high dimensional expanders"
    - "small set expansion in shortcode graph and the 2 to 2 conjecture"
    - "low degree almost boolean functions are sparse juntas"

Connected through hyperedge HE-2 (induced by source paper "super polylogarithmic hypergraph coloring hardness via low degree long codes"):
  with members:
    - "hardness of finding independent sets in 2 colorable and almost 2 colorable hypergraphs"
    - "a new multilayered pcp and the hardness of hypergraph vertex cover"

Connected through hyperedge HE-3 (induced by source paper "low degree almost boolean functions are sparse juntas"):
  with members:
    - "reed muller codes achieve capacity on erasure channels"
    - "analysis of boolean functions"

Connected through hyperedge HE-4 (induced by source paper "robust multiplication based tests for reed muller codes"):
  with members:
    - "super polylogarithmic hypergraph coloring hardness via low degree long codes"
    - "2 log n 1 10 o 1 hardness for hypergraph coloring"
    - "reducing uniformity in khot saket hypergraph coloring hardness reductions"
    - "some improvements to total degree tests"

Connected through hyperedge HE-5 (induced by source paper "derandomized graph product results using the low degree long code"):
  with members:
    - "super polylogarithmic hypergraph coloring hardness via low degree long codes"
    - "reducing uniformity in khot saket hypergraph coloring hardness reductions"
    - "a prg for lipschitz functions of polynomials with applications to sparsest cut"
    - "bounded independence fools halfspaces"
    - "pseudorandom generators for polynomial threshold functions"
    - "conditional hardness for approximate coloring"

Connected through hyperedge HE-6 (induced by source paper "a characterization of hard to cover csps"):
  with members:
    - "super polylogarithmic hypergraph coloring hardness via low degree long codes"
    - "reducing uniformity in khot saket hypergraph coloring hardness reductions"
    - "hardness of finding independent sets in 2 colorable hypergraphs and of satisfiable csps"
    - "approximation resistant predicates from pairwise independence"

Connected through hyperedge HE-7 (induced by source paper "unique games on the hypercube"):
  with members:
    - "analysis of boolean functions"
    - "hypercontractivity sum of squares proofs and their applications"
    - "spectral algorithms for unique games"
    - "how to play unique games on expanders"

Connected through hyperedge HE-8 (induced by source paper "reducing uniformity in khot saket hypergraph coloring hardness reductions"):
  with members:
    - "super polylogarithmic hypergraph coloring hardness via low degree long codes"

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.CC(Computational Complexity)