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: "coded caching via line graphs of bipartite graphs"
  Abstract: We present a coded caching framework using line graphs of bipartite graphs. A clique cover of the line graph describes the uncached subfiles at users. A clique cover of the complement of the square of the line graph gives a transmission scheme that satisfies user demands. We then define a specific class of such caching line graphs, for which the subpacketization, rate, and uncached fraction of the coded caching problem can be captured via its graph theoretic parameters. We present a construction of such caching line graphs using projective geometry. The presented scheme has a rate bounded from above by a constant with subpacketization level $q^{O((log_qK)^2)}$ and uncached fraction $\Theta(\frac{1}{\sqrt{K}})$, where $K$ is the number of users and $q$ is a prime power. We also present a subpacketization-dependent lower bound on the rate of coded caching schemes for a given broadcast setup.

Connected through hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry"):
  with members:
    - "some new constructions of coded caching schemes with reduced subpacketization"
    - "a multi antenna coded caching scheme with linear subpacketization"
    - "decentralized coded caching without file splitting"
    - "subpacketization rate trade off in multi antenna coded caching"
    - "coded caching based on combinatorial designs"
    - "a unified framework for constructing centralized coded caching schemes"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "coded caching via projective geometry a new low subpacketization scheme"

Connected through hyperedge HE-2 (induced by source paper "a unified framework for constructing centralized coded caching schemes"):
  with members:
    - "coded caching based on combinatorial designs"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching schemes with reduced subpacketization from linear block codes"

Connected through hyperedge HE-3 (induced by source paper "some new constructions of coded caching schemes with reduced subpacketization"):
  with members:
    - "coded caching based on combinatorial designs"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "constructions of coded caching schemes with flexible memory size"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"

Connected through hyperedge HE-4 (induced by source paper "cache aided interference management with subexponential subpacketization"):
  with members:
    - "cache aided interference management using hypercube combinatorial cache designs"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "coded caching via projective geometry a new low subpacketization scheme"
    - "degrees of freedom of cache aided wireless interference networks"
    - "on the optimality of uncoded cache placement"
    - "cache aided interference channels"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching"

Connected through hyperedge HE-5 (induced by source paper "low subpacketization coded caching via projective geometry for broadcast and d2d networks"):
  with members:
    - "coded caching via projective geometry a new low subpacketization scheme"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching in wireless d2d networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "coded caching via projective geometry a new low subpacketization scheme"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (induced by source paper "coded caching based on combinatorial designs"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (induced by source paper "linear coded caching scheme for centralized networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "uncoded placement optimization for coded delivery"
    - "a novel recursive construction for coded caching schemes"

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)