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: "opportunity cost algorithms for combinatorial auctions"
  Abstract: Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available goods and the auctioneer can only accept non-intersecting bids. Since this problem is difficult even to approximate in general, the algorithms are most useful when the bids are restricted to be connected node subsets of an underlying object graph that represents which objects are relevant to each other. The approximation ratios of the algorithms depend on structural properties of this graph and are small constants for many interesting families of object graphs. The running times of the algorithms are linear in the size of the bid graph, which describes the conflicts between bids. Extensions of the algorithms allow for efficient processing of additional constraints, such as budget constraints that associate bids with particular bidders and limit how many bids from a particular bidder can be accepted.

Connected through hyperedge HE-1 (induced by source paper "effective wireless scheduling via hypergraph sketches"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "jamming resistant learning in wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"

Connected through hyperedge HE-2 (induced by source paper "spanning trees with edge conflicts and wireless connectivity"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"

Connected through hyperedge HE-3 (induced by source paper "universal framework for wireless scheduling problems"):
  with members:
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "wireless scheduling with power control"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"

Connected through hyperedge HE-4 (induced by source paper "the price of local power control in wireless scheduling"):
  with members:
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "the power of non uniform wireless power"
    - "towards tight bounds for local broadcasting"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"

Connected through hyperedge HE-5 (induced by source paper "how well can graphs represent wireless interference"):
  with members:
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity and admission control in cognitive radio"

Connected through hyperedge HE-6 (induced by source paper "the clique problem on inductive k independent graphs"):
  with members:
    - "listing all maximal cliques in sparse graphs in near optimal time"
    - "an o m algorithm for cores decomposition of networks"

Connected through hyperedge HE-7 (induced by source paper "online independent set beyond the worst case secretaries prophets and periods"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "universally truthful secondary spectrum auctions"
    - "primal beats dual on online packing lps in the random order model"
    - "matroid prophet inequalities"
    - "the power of non uniform wireless power"
    - "geometry of online packing linear programs"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-8 (induced by source paper "secondary spectrum auctions for symmetric and submodular bidders"):
  with members:
    - "the power of non uniform wireless power"
    - "a truthful randomized mechanism for combinatorial public projects via convex optimization"
    - "from convex optimization to randomized mechanisms toward optimal combinatorial auctions"
    - "wireless capacity with oblivious power in general metrics"
    - "truthfulness via proxies"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "approximation algorithms for secondary spectrum auctions"
    - "mechanisms for multi unit auctions"

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.CE(Computational Engineering, Finance, and Science)