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: "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"
  Abstract: We considered the optimal memory-transmission-rate tradeoff of caching systems. Different from the conventional analytical approach usually seen in the information theory literature, we rely on a computer-aided approach in this investigation. The linear programming (LP) outer bound of the entropy space serves as the starting point of this approach, however our effort goes significantly beyond using it to prove information inequalities. We first identify and formalize the symmetry structure in the problem, which enables us to show the existence of optimal symmetric solutions. A symmetry-reduced linear program is then used to identify the boundary of the memory-transmission-rate tradeoff for several simple cases, for which we obtain a set of tight outer bounds. General hypotheses on the optimal tradeoff region are formed from these computed data, which are then analytically proved. This leads to a complete characterization of the optimal tradeoff for systems with only two users, and certain partial characterization for systems with only two files. Next, we show that by carefully analyzing the joint entropy structure of the outer bounds for certain cases, a novel code construction can be reverse-engineered, which eventually leads to a general class of codes. Finally, we show that strong outer bounds can be computed through strategically relaxing the LP. This allows us firstly to deduce generic characteristic of the converse proof, and secondly to compute outer bounds for larger problem cases, despite the seemingly impossible computation scale.

Connected through hyperedge HE-1 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "speeding up distributed machine learning using codes"
    - "wireless mapreduce distributed computing"
    - "a pliable index coding approach to data shuffling"
    - "coded computation over heterogeneous clusters"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching in partially cooperative d2d communication networks"
    - "how to optimally allocate resources for coded distributed computing"

Connected through hyperedge HE-2 (induced by source paper "on the storage cost of private information retrieval"):
  with members:
    - "how to use undiscovered information inequalities direct applications of the copy lemma"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the capacity of locally decodable codes"

Connected through hyperedge HE-3 (induced by source paper "capacity achieving private information retrieval codes from mds coded databases with minimum message size"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "weakly private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "optimal download cost of private information retrieval for arbitrary message length"

Connected through hyperedge HE-4 (induced by source paper "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"):
  with members:
    - "caching and delivery via interference elimination"
    - "multilevel diversity coding with regeneration"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "multilevel diversity coding systems rate regions codes computation forbidden minors"
    - "fundamental limits of caching"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching"):
  with members:
    - "coding for distributed fog computing"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "how to optimally allocate resources for coded distributed computing"
    - "information theoretic caching the multi user case"
    - "degrees of freedom of cache aided wireless interference networks"
    - "noisy broadcast networks with receiver caching"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "fundamental limits of cache aided interference management"

Connected through hyperedge HE-6 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching in a multi server system with random topology"
    - "benefits of cache assignment on degraded broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "cache aided content delivery over erasure broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "capacity achieving private information retrieval codes with optimal message size and upload cost"):
  with members:
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of cache aided private information retrieval"
    - "on the placement delivery array design for centralized coded caching scheme"

Connected through hyperedge HE-8 (induced by source paper "optimization of heterogeneous coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "alpha fair coded caching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "opportunistic content delivery in fading broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "noisy broadcast networks with receiver caching"
    - "on the coded caching delivery design over wireless networks"

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)