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: "on the weight distribution of random binary linear codes"
  Abstract: We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their span. Given $0<\gamma<1/2$ with $0< \lambda < h(\gamma)$ let $X$ be the random variable that counts the number of words in $C$ of Hamming weight $\gamma n$. In this paper we determine the asymptotics of the moments of $X$ of all orders $o(\frac{n}{\log n})$.

Connected through hyperedge HE-1 (induced by source paper "list decoding random euclidean codes and infinite constellations"):
  with members:
    - "good distance lattices from high dimensional expanders"
    - "improved list decodability of random linear binary codes"
    - "quadratically constrained myopic adversarial channels"
    - "list decoding with double samplers"
    - "sufficiently myopic adversaries are blind"
    - "it ll probably work out improved list decoding through random operations"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"

Connected through hyperedge HE-2 (induced by source paper "distribution of the minimal distance of random linear codes"):
  with members:
    - "asymptotic improvement of the gilbert varshamov bound for linear codes"

Connected through hyperedge HE-3 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes"):
  with members:
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "extended formulations for independence polytopes of regular matroids"
    - "a polynomial time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid"
    - "matroid secretary for regular and decomposable matroids"
    - "a decomposition theory for binary linear 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.IT(Information Theory)