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: "optimal rate code constructions for computationally simple channels"
  Abstract: We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the errors can be described by a sufficiently simple circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. #R##N#For two classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. The encoders are randomized, and probabilities are taken over the (local, unknown to the decoder) coins of the encoder and those of the channel. #R##N#(1) Unique decoding for additive errors: We give the first construction of a polynomial-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity $1-H(p)$. These channels add an arbitrary error vector $e\in\{0,1\}^N$ of weight at most $pN$ to the transmitted word; the vector $e$ can depend on the code but not on the particular transmitted word. #R##N#(2) List-decoding for polynomial-time channels: For every constant $c>0$, we give a Monte Carlo construction of an code with optimal rate (arbitrarily close to $1-H(p)$) that efficiently recovers a short list containing the correct message with high probability for channels describable by circuits of size at most $N^c$. We justify the relaxation to list-decoding by showing that even with bounded channels, uniquely decodable codes cannot have positive rate for $p>1/4$.

Connected through hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"

Connected through hyperedge HE-2 (induced by source paper "leakage resilient non malleable secret sharing in non compartmentalized models"):
  with members:
    - "secret sharing with binary shares"
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "repairing reed solomon codes"
    - "non malleable extractors and codes with their many tampered extensions"
    - "non malleable coding against bit wise and split state tampering"
    - "non malleable extractors two source extractors and privacy amplification"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-3 (induced by source paper "on locally decodable codes in resource bounded channels"):
  with members:
    - "relaxed locally correctable codes in computationally bounded channels"
    - "sustained space complexity"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"

Connected through hyperedge HE-4 (induced by source paper "relaxed locally correctable codes in computationally bounded channels"):
  with members:
    - "sustained space complexity"
    - "optimal hashing based time space trade offs for approximate near neighbors"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-5 (induced by source paper "secret sharing with binary shares"):
  with members:
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-6 (induced by source paper "an operational characterization of mutual information in algorithmic information theory"):
  with members:
    - "optimal probabilistic polynomial time compression and the slepian wolf theorem tighter version and simple proofs"
    - "kolmogorov complexity version of slepian wolf coding"
    - "conditional information inequalities and combinatorial applications"
    - "linear list approximation for short programs or the power of a few random bits"
    - "conditional information inequalities for entropic and almost entropic points"
    - "common information and secret key capacity"
    - "common information revisited"
    - "variations on muchnik s conditional complexity theorem"

Connected through hyperedge HE-7 (induced by source paper "coding against deletions in oblivious and online models"):
  with members:
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "an improved bound on the fraction of correctable deletions"
    - "a characterization of the capacity of online causal binary channels"
    - "causal erasure channels"
    - "upper bounds on the capacity of binary channels with causal adversaries"
    - "on the zero error capacity threshold for deletion channels"

Connected through hyperedge HE-8 (induced by source paper "disjoint difference families and their applications"):
  with members:
    - "non overlapping codes"
    - "new families of optimal frequency hopping sequence sets"
    - "a combinatorial model of interference in frequency hopping schemes"
    - "high rate self synchronizing codes"
    - "information theoretic authentication and secrecy codes in the splitting model"
    - "combinatorial bounds and characterizations of splitting authentication codes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "authentication and secrecy codes for equiprobable source probability distributions"

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)