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: "robust locally testable codes and products of codes"
  Abstract: We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of {\em robust} probabilistically checkable proofs, we introduce the notion of {\em robust} local testability of codes. We relate this notion to a product of codes introduced by Tanner, and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally, by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low-degree multivariate polynomials (which are a special case of tensor codes). #R##N#Combining these two results gives us a generic construction of codes of inverse polynomial rate, that are testable with poly-logarithmically many queries. We note these locally testable tensor codes can be obtained from {\em any} linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes.

Connected through hyperedge HE-1 (induced by source paper "high rate locally correctable and locally testable codes with sub polynomial query complexity"):
  with members:
    - "linear time list recovery of high rate expander codes"
    - "some remarks on multiplicity codes"
    - "local correctability of expander codes"
    - "some improvements to total degree tests"
    - "new affine invariant codes from lifting"
    - "a combination of testability and decodability by tensor products"
    - "dense locally testable codes cannot have constant rate and distance"
    - "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers"

Connected through hyperedge HE-2 (induced by source paper "can almost everybody be almost happy pcp for ppad and the inapproximability of nash"):
  with members:
    - "eth hardness for densest k subgraph with perfect completeness"
    - "inapproximability of nash equilibrium"
    - "am with multiple merlins"
    - "the complexity of fairness through equilibrium"
    - "on oblivious ptas s for nash equilibrium"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-3 (induced by source paper "lower bounds for constant query affine invariant lccs and ltcs"):
  with members:
    - "bias vs structure of polynomials in large fields and applications in effective algebraic geometry and coding theory"
    - "using higher order fourier analysis over general fields"
    - "new affine invariant codes from lifting"
    - "quadratic goldreich levin theorems"

Connected through hyperedge HE-4 (induced by source paper "a combination of testability and decodability by tensor products"):
  with members:
    - "list decoding tensor products and interleaved codes"
    - "adaptive simulated annealing a near optimal connection between sampling and counting"
    - "improved nearly mds expander codes"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-5 (induced by source paper "list decoding tensor products and interleaved codes"):
  with members:
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

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.IT(Information Theory)