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 "the generalized orthogonality dimension of generalized kneser graphs bounds and applications"):
  Abstract: The orthogonality dimension of a graph $G=(V,E)$ over a field $\mathbb{F}$ is the smallest integer $t$ for which there exists an assignment of a vector $u_v \in \mathbb{F}^t$ with $\langle u_v,u_v \rangle \neq 0$ to every vertex $v \in V$, such that $\langle u_v, u_{v'} \rangle = 0$ whenever $v$ and $v'$ are adjacent vertices in $G$. The study of the orthogonality dimension of graphs is motivated by various application in information theory and in theoretical computer science. The contribution of the present work is two-folded. #R##N#First, we prove that there exists a constant $c$ such that for every sufficiently large integer $t$, it is $\mathsf{NP}$-hard to decide whether the orthogonality dimension of an input graph over $\mathbb{R}$ is at most $t$ or at least $3t/2-c$. At the heart of the proof lies a geometric result, which might be of independent interest, on a generalization of the orthogonality dimension parameter for the family of Kneser graphs, analogously to a long-standing conjecture of Stahl (J. Comb. Theo. Ser. B, 1976). #R##N#Second, we study the smallest possible orthogonality dimension over finite fields of the complement of graphs that do not contain certain fixed subgraphs. In particular, we provide an explicit construction of triangle-free $n$-vertex graphs whose complement has orthogonality dimension over the binary field at most $n^{1-\delta}$ for some constant $\delta >0$. Our results involve constructions from the family of generalized Kneser graphs and they are motivated by the rigidity approach to circuit lower bounds. We use them to answer a couple of questions raised by Codenotti, Pudlak, and Resta (Theor. Comput. Sci., 2000), and in particular, to disprove their Odd Alternating Cycle Conjecture over every finite field.

Includes members:
  Member "improved hardness for h colourings of g colourable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of 3 colouring h colourable graphs")
  Member "approximating the orthogonality dimension of graphs and hypergraphs":
    also connected through other hyperedges:
      (none)
  Member "on a fractional version of haemers bound":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximating the orthogonality dimension of graphs and hypergraphs")
  Member "algebraic approach to promise constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the power of the combined basic lp and affine relaxation for promise csps")
  Member "on minrank and forbidden subgraphs":
    also connected through other hyperedges:
      (none)
  Member "matrix rigidity and the croot lev pach lemma":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence of systematic linear data structures and matrix rigidity")
  Member "probabilistic rank and matrix rigidity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate is good enough probabilistic variants of dimensional and margin complexity")
  Member "linear index coding via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximating the orthogonality dimension of graphs and hypergraphs")

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