{"total":20,"rows":[{"id":"2306.08385","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","created":"2023-06-14","cited_by_count":210,"area":null},{"id":"2202.02466","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","created":"2022-02-05","cited_by_count":164,"area":null},{"id":"2105.13448","title":"Open-world Machine Learning: Applications, Challenges, and Opportunities","created":"2021-05-27","cited_by_count":34,"area":null},{"id":"2308.13422","title":"QKSAN: A Quantum Kernel Self-Attention Network","created":"2023-08-25","cited_by_count":23,"area":null},{"id":"2110.04514","title":"Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach","created":"2021-10-09","cited_by_count":20,"area":null},{"id":"2404.11290","title":"Inductive Cognitive Diagnosis for Fast Student Learning in Web-Based Online Intelligent Education Systems","created":"2024-04-17","cited_by_count":16,"area":null},{"id":"2306.14462","title":"Multi-task Item-attribute Graph Pre-training for Strict Cold-start Item Recommendation","created":"2023-06-26","cited_by_count":13,"area":null},{"id":"2306.11264","title":"GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks","created":"2023-06-20","cited_by_count":12,"area":null},{"id":"2209.15292","title":"The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm","created":"2022-09-30","cited_by_count":9,"area":null},{"id":"2409.01012","title":"Improved Diversity-Promoting Collaborative Metric Learning for Recommendation","created":"2024-09-02","cited_by_count":9,"area":null},{"id":"2303.12341","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","created":"2023-03-22","cited_by_count":7,"area":null},{"id":"2311.04760","title":"Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach","created":"2023-11-08","cited_by_count":4,"area":null},{"id":"2212.08339","title":"Generalization Bounds for Inductive Matrix Completion in Low-noise Settings","created":"2022-12-16","cited_by_count":2,"area":null},{"id":"2302.03933","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2411.01376","title":"Multi-Channel Hypergraph Contrastive Learning for Matrix Completion","created":"2024-11-02","cited_by_count":1,"area":null},{"id":"2209.04154","title":"SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendation","created":"2022-09-09","cited_by_count":0,"area":null},{"id":"2404.15807","title":"One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion","created":"2024-04-24","cited_by_count":0,"area":null},{"id":"2506.08347","title":"Differentially Private Relational Learning with Entity-level Privacy Guarantees","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2510.21812","title":"Unifying Inductive, Cross-Domain, and Multimodal Learning for Robust and Generalizable Recommendation","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2603.10148","title":"Social Knowledge for Cross-Domain User Preference Modeling","created":"2026-03-10","cited_by_count":0,"area":null}],"next_cursor":null}