A new benchmark dataset called RelSC has been introduced for graph regression tasks.
RelSC is built from program graphs that combine syntactic and semantic information extracted from source code, and each graph is labeled with the execution-time cost of the program.
RelSC is released in two variants - RelSC-H with rich node features under a single edge type and RelSC-M that preserves the original multi-relational structure.
The dataset aims to provide a challenging and versatile benchmark for advancing graph regression methods by evaluating different graph neural network architectures on both variants of RelSC.