{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:11:10Z","timestamp":1773407470517,"version":"3.50.1"},"reference-count":67,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2023-JCJQ-QT-048"],"award-info":[{"award-number":["2023-JCJQ-QT-048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302511"],"award-info":[{"award-number":["62302511"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372458"],"award-info":[{"award-number":["62372458"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009377","name":"Education Department of Hunan Province","doi-asserted-by":"publisher","award":["CX20230076"],"award-info":[{"award-number":["CX20230076"]}],"id":[{"id":"10.13039\/100009377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007085","name":"National University of Defense Technology","doi-asserted-by":"publisher","award":["ZK22-11"],"award-info":[{"award-number":["ZK22-11"]}],"id":[{"id":"10.13039\/501100007085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1016\/j.ipm.2025.104092","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T10:19:22Z","timestamp":1739441962000},"page":"104092","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Information bottleneck-driven prompt on graphs for unifying downstream few-shot classification tasks"],"prefix":"10.1016","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-1592","authenticated-orcid":false,"given":"Xin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Wanyu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Jianming","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Zhiqiang","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8582-859X","authenticated-orcid":false,"given":"Yupu","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Honghui","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipm.2025.104092_b1","doi-asserted-by":"crossref","unstructured":"Abdelrazek, M., Purificato, E., Boratto, L., & Luca, E. W. D. (2023). FairUP: A Framework for Fairness Analysis of Graph Neural Network-Based User Profiling Models. In SIGIR (pp. 3165\u20133169).","DOI":"10.1145\/3539618.3591814"},{"issue":"1","key":"10.1016\/j.ipm.2025.104092_b2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1093\/bioinformatics\/bti1007","article-title":"Protein function prediction via graph kernels","volume":"21","author":"Borgwardt","year":"2005","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ipm.2025.104092_b3","unstructured":"Chauhan, J., Nathani, D., & Kaul, M. (2020). Few-Shot Learning on graphs via super-Classes based on Graph spectral Measures. In ICLR."},{"key":"10.1016\/j.ipm.2025.104092_b4","doi-asserted-by":"crossref","unstructured":"Chen, L., Jose, J. M., Yu, H., & Yuan, F. (2017). A Semantic Graph-Based Approach for Mining Common Topics from Multiple Asynchronous Text Streams. In WWW (pp. 1201\u20131209).","DOI":"10.1145\/3038912.3052630"},{"issue":"5","key":"10.1016\/j.ipm.2025.104092_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103775","article-title":"Identifying influential nodes in complex networks via Transformer","volume":"61","author":"Chen","year":"2024","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2025.104092_b6","series-title":"Prompt learning on temporal interaction graphs","author":"Chen","year":"2024"},{"issue":"50","key":"10.1016\/j.ipm.2025.104092_b7","doi-asserted-by":"crossref","first-page":"19735","DOI":"10.1073\/pnas.0708838104","article-title":"The heat kernel as the pagerank of a graph","volume":"104","author":"Chung","year":"2007","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.1016\/j.ipm.2025.104092_b8","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Li, J., Shu, K., Liu, C., et al. (2020). Graph Prototypical Networks for Few-shot Learning on Attributed Networks. In CIKM (pp. 295\u2013304).","DOI":"10.1145\/3340531.3411922"},{"issue":"4","key":"10.1016\/j.ipm.2025.104092_b9","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","article-title":"Distinguishing enzyme structures from non-enzymes without alignments","volume":"330","author":"Dobson","year":"2003","journal-title":"Journal of Molecular Biology"},{"key":"10.1016\/j.ipm.2025.104092_b10","doi-asserted-by":"crossref","unstructured":"Du, J., Wang, S., Miao, H., & Zhang, J. (2021). Multi-Channel Pooling Graph Neural Networks. In IJCAI (pp. 1442\u20131448).","DOI":"10.24963\/ijcai.2021\/199"},{"issue":"3","key":"10.1016\/j.ipm.2025.104092_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103639","article-title":"G-Prompt: Graphon-based Prompt Tuning for graph classification","volume":"61","author":"Duan","year":"2024","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2025.104092_b12","series-title":"Prompt tuning for graph neural networks","author":"Fang","year":"2022"},{"key":"10.1016\/j.ipm.2025.104092_b13","unstructured":"Fang, T., Zhang, Y., Yang, Y., Wang, C., & Chen, L. (2023). Universal Prompt Tuning for Graph Neural Networks. In neurIPS (pp. 52464\u201352489)."},{"key":"10.1016\/j.ipm.2025.104092_b14","unstructured":"Finn, C., Abbeel, P., & Levine, S. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. In ICML (pp. 1126\u20131135)."},{"key":"10.1016\/j.ipm.2025.104092_b15","doi-asserted-by":"crossref","unstructured":"Guo, Z., Zhang, C., Yu, W., Herr, J., Wiest, O., et al. (2021). Few-Shot Graph Learning for Molecular Property Prediction. In WWW (pp. 2559\u20132567).","DOI":"10.1145\/3442381.3450112"},{"key":"10.1016\/j.ipm.2025.104092_b16","unstructured":"Hamilton, W., Ying, Z., & Leskovec, J. (2017). Inductive Representation Learning on Large Graphs. In NeurIPS (pp. 1024\u20131034)."},{"issue":"5","key":"10.1016\/j.ipm.2025.104092_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103790","article-title":"Simplices-based higher-order enhancement graph neural network for multi-behavior recommendation","volume":"61","author":"Hao","year":"2024","journal-title":"Information Processing & Management"},{"issue":"2","key":"10.1016\/j.ipm.2025.104092_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2021.102859","article-title":"Towards transdisciplinary impact of scientific publications: A longitudinal, comprehensive, and large-scale analysis on Microsoft Academic Graph","volume":"59","author":"Huang","year":"2022","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2025.104092_b19","unstructured":"Kingma, D. P., & Ba, J. (2015). Adam: A Method for Stochastic Optimization. In ICLR (poster)."},{"key":"10.1016\/j.ipm.2025.104092_b20","unstructured":"Kipf, T. N., & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. In ICLR (poster)."},{"key":"10.1016\/j.ipm.2025.104092_b21","unstructured":"Klicpera, J., Wei\u00dfenberger, S., & G\u00fcnnemann, S. (2019). Diffusion Improves Graph Learning. In NeurIPS (pp. 13333\u201313345)."},{"key":"10.1016\/j.ipm.2025.104092_b22","unstructured":"Lan, L., Wang, P., Du, X., Song, K., Tao, J., & Guan, X. (2020). Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding. In NeurIPS (pp. 16520\u201316531)."},{"key":"10.1016\/j.ipm.2025.104092_b23","doi-asserted-by":"crossref","unstructured":"Lee, N., Hyun, D., Lee, J., & Park, C. (2022). Relational Self-Supervised Learning on Graphs. In CIKM (pp. 1054\u20131063).","DOI":"10.1145\/3511808.3557428"},{"issue":"2","key":"10.1016\/j.ipm.2025.104092_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2021.102797","article-title":"Group event recommendation based on graph multi-head attention network combining explicit and implicit information","volume":"59","author":"Liao","year":"2022","journal-title":"Information Processing & Management"},{"issue":"4","key":"10.1016\/j.ipm.2025.104092_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2022.102947","article-title":"Category-universal witness discovery with attention mechanism in social network","volume":"59","author":"Liu","year":"2022","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2025.104092_b26","doi-asserted-by":"crossref","unstructured":"Liu, X., Ji, K., Fu, Y., Tam, W., Du, Z., et al. (2022). P-Tuning: Prompt Tuning Can Be Comparable to Fine-tuning Across Scales and Tasks. In ACL no. 2 (pp. 61\u201368).","DOI":"10.18653\/v1\/2022.acl-short.8"},{"key":"10.1016\/j.ipm.2025.104092_b27","doi-asserted-by":"crossref","unstructured":"Liu, Z., Yu, X., Fang, Y., & Zhang, X. (2023). GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks. In WWW (pp. 417\u2013428).","DOI":"10.1145\/3543507.3583386"},{"issue":"9","key":"10.1016\/j.ipm.2025.104092_b28","doi-asserted-by":"crossref","first-page":"195:1","DOI":"10.1145\/3560815","article-title":"Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing","volume":"55","author":"Liu","year":"2023","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.ipm.2025.104092_b29","doi-asserted-by":"crossref","unstructured":"Ma, N., Bu, J., Yang, J., Zhang, Z., Yao, C., et al. (2020). Adaptive-Step Graph Meta-Learner for Few-Shot Graph Classification. In CIKM (pp. 1055\u20131064).","DOI":"10.1145\/3340531.3411951"},{"key":"10.1016\/j.ipm.2025.104092_b30","unstructured":"Morris, C., Kriege, N. M., Bause, F., Kersting, K., Mutzel, P., & Neumann, M. (2020). TUDataset: A collection of benchmark datasets for learning with graphs. In ICML 2020 workshop."},{"key":"10.1016\/j.ipm.2025.104092_b31","unstructured":"Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank Citation Ranking: Bringing Order to the Web. In The web conference."},{"key":"10.1016\/j.ipm.2025.104092_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.media.2024.103225","article-title":"MMGPL: Multimodal medical data analysis with graph prompt learning","volume":"97","author":"Peng","year":"2024","journal-title":"Medical Image Analysis"},{"issue":"6","key":"10.1016\/j.ipm.2025.104092_b33","doi-asserted-by":"crossref","first-page":"8609","DOI":"10.1109\/TNNLS.2022.3230979","article-title":"GRLC: graph representation learning with constraints","volume":"35","author":"Peng","year":"2024","journal-title":"IEEE Transcations of Neural Networks and Learning Systems"},{"key":"10.1016\/j.ipm.2025.104092_b34","unstructured":"Perez, E., Kiela, D., & Cho, K. (2021). True Few-Shot Learning with Language Models. In NeurIPS (pp. 11054\u201311070)."},{"key":"10.1016\/j.ipm.2025.104092_b35","doi-asserted-by":"crossref","unstructured":"Schick, T., & Sch\u00fctze, H. (2021). Exploiting Cloze-Questions for Few-Shot Text Classification and Natural Language Inference. In EACL (pp. 255\u2013269).","DOI":"10.18653\/v1\/2021.eacl-main.20"},{"key":"10.1016\/j.ipm.2025.104092_b36","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1162\/tacl_a_00485","article-title":"True few-shot learning with prompts - A real-world perspective","volume":"10","author":"Schick","year":"2022","journal-title":"Transcations of the Association for Computational Linguistics"},{"issue":"1","key":"10.1016\/j.ipm.2025.104092_b37","doi-asserted-by":"crossref","first-page":"D431","DOI":"10.1093\/nar\/gkh081","article-title":"BRENDA, the enzyme database: updates and major new developments","volume":"32","author":"Schomburg","year":"2004","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/j.ipm.2025.104092_b38","doi-asserted-by":"crossref","unstructured":"Sun, X., Cheng, H., Li, J., & Liu, B. (2023). All in One: Multi-Task Prompting for Graph Neural Networks. In KDD (pp. 2120\u20132131).","DOI":"10.1145\/3580305.3599256"},{"issue":"11","key":"10.1016\/j.ipm.2025.104092_b39","doi-asserted-by":"crossref","first-page":"11860","DOI":"10.1109\/TKDE.2023.3235312","article-title":"Self-supervised hypergraph representation learning for sociological analysis","volume":"35","author":"Sun","year":"2023","journal-title":"IEEE Transcations on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2025.104092_b40","unstructured":"Sun, F., Hoffmann, J., Verma, V., & Tang, J. (2020). InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization. In ICLR."},{"issue":"9","key":"10.1016\/j.ipm.2025.104092_b41","doi-asserted-by":"crossref","first-page":"9128","DOI":"10.1109\/TKDE.2022.3221438","article-title":"Structure learning via meta-hyperedge for dynamic rumor detection","volume":"35","author":"Sun","year":"2023","journal-title":"IEEE Transcations on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2025.104092_b42","series-title":"Graph prompt learning: A comprehensive survey and beyond","author":"Sun","year":"2023"},{"key":"10.1016\/j.ipm.2025.104092_b43","doi-asserted-by":"crossref","unstructured":"Sun, M., Zhou, K., He, X., Wang, Y., & Wang, X. (2022). GPPT: Graph Pre-training and Prompt Tuning to Generalize Graph Neural Networks. In KDD (pp. 1717\u20131727).","DOI":"10.1145\/3534678.3539249"},{"issue":"6","key":"10.1016\/j.ipm.2025.104092_b44","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1021\/ci034143r","article-title":"Spline-fitting with a genetic algorithm: A method for developing classification structure activity relationships","volume":"43","author":"Sutherland","year":"2003","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"10.1016\/j.ipm.2025.104092_b45","doi-asserted-by":"crossref","unstructured":"Tan, Z., Ding, K., Guo, R., & Liu, H. (2022). Graph Few-shot Class-incremental Learning. In WSDM (pp. 987\u2013996).","DOI":"10.1145\/3488560.3498455"},{"key":"10.1016\/j.ipm.2025.104092_b46","unstructured":"Tan, Z., Guo, R., Ding, K., & Liu, H. (2023). Virtual Node Tuning for Few-shot Node Classification. In KDD (pp. 2177\u20132188)."},{"key":"10.1016\/j.ipm.2025.104092_b47","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., et al. (2017). Attention is All you Need. In NIPS (pp. 5998\u20136008)."},{"key":"10.1016\/j.ipm.2025.104092_b48","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., et al. (2018). Graph Attention Networks. In ICLR (poster)."},{"key":"10.1016\/j.ipm.2025.104092_b49","unstructured":"Wang, Y., Abuduweili, A., Yao, Q., & Dou, D. (2021). Property-Aware Relation Networks for Few-Shot Molecular Property Prediction. In NeurIPS (pp. 17441\u201317454)."},{"key":"10.1016\/j.ipm.2025.104092_b50","doi-asserted-by":"crossref","unstructured":"Wang, S., Dong, Y., Ding, K., Chen, C., & Li, J. (2023). Few-shot Node Classification with Extremely Weak Supervision. In WSDM (pp. 276\u2013284).","DOI":"10.1145\/3539597.3570435"},{"key":"10.1016\/j.ipm.2025.104092_b51","doi-asserted-by":"crossref","unstructured":"Wang, S., Dong, Y., Huang, X., Chen, C., & Li, J. (2022). FAITH: Few-Shot Graph Classification with Hierarchical Task Graphs. In IJCAI (pp. 2284\u20132290).","DOI":"10.24963\/ijcai.2022\/317"},{"key":"10.1016\/j.ipm.2025.104092_b52","series-title":"Advanced drug interaction event prediction","author":"Wang","year":"2024"},{"key":"10.1016\/j.ipm.2025.104092_b53","doi-asserted-by":"crossref","unstructured":"Wang, X., Zhu, M., Bo, D., Cui, P., Shi, C., & Pei, J. (2020). AM-GCN: Adaptive Multi-channel Graph Convolutional Networks. In KDD (pp. 1243\u20131253).","DOI":"10.1145\/3394486.3403177"},{"key":"10.1016\/j.ipm.2025.104092_b54","unstructured":"Wu, T., Ren, H., Li, P., & Leskovec, J. (2020). Graph Information Bottleneck. In NeurIPS (pp. 20437\u201320448)."},{"key":"10.1016\/j.ipm.2025.104092_b55","doi-asserted-by":"crossref","unstructured":"Wu, J., Wang, X., Feng, F., He, X., Chen, L., Lian, J., et al. (2021). Self-supervised Graph Learning for Recommendation. In SIGIR (pp. 726\u2013735).","DOI":"10.1145\/3404835.3462862"},{"key":"10.1016\/j.ipm.2025.104092_b56","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How Powerful are Graph Neural Networks?. In ICLR."},{"key":"10.1016\/j.ipm.2025.104092_b57","doi-asserted-by":"crossref","unstructured":"Yanardag, P., & Vishwanathan, S. V. N. (2015). Deep Graph Kernels. In KDD (pp. 1365\u20131374).","DOI":"10.1145\/2783258.2783417"},{"key":"10.1016\/j.ipm.2025.104092_b58","unstructured":"Yang, Z., Cohen, W. W., & Salakhutdinov, R. (2016). Revisiting Semi-Supervised Learning with Graph Embeddings. In ICML (pp. 40\u201348)."},{"key":"10.1016\/j.ipm.2025.104092_b59","doi-asserted-by":"crossref","unstructured":"Yao, T., Wang, Y., Zhang, K., & Liang, S. (2023). Improving the Expressiveness of K-hop Message-Passing GNNs by Injecting Contextualized Substructure Information. In KDD (pp. 3070\u20133081).","DOI":"10.1145\/3580305.3599390"},{"key":"10.1016\/j.ipm.2025.104092_b60","doi-asserted-by":"crossref","unstructured":"Yao, H., Zhang, C., Wei, Y., Jiang, M., Wang, S., et al. (2020). Graph Few-Shot Learning via Knowledge Transfer. In AAAI (pp. 6656\u20136663).","DOI":"10.1609\/aaai.v34i04.6142"},{"key":"10.1016\/j.ipm.2025.104092_b61","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., et al. (2020). Graph Contrastive Learning with Augmentations. In NeurIPS (pp. 5812\u20135823)."},{"key":"10.1016\/j.ipm.2025.104092_b62","series-title":"Graph masked autoencoders with transformers","author":"Zhang","year":"2022"},{"key":"10.1016\/j.ipm.2025.104092_b63","doi-asserted-by":"crossref","unstructured":"Zhang, C., Ding, K., Li, J., Zhang, X., Ye, Y., et al. (2022). Few-Shot Learning on Graphs. In IJCAI (pp. 5662\u20135669).","DOI":"10.24963\/ijcai.2022\/789"},{"issue":"1","key":"10.1016\/j.ipm.2025.104092_b64","first-page":"5:1","article-title":"Deep learning based recommender system: A survey and new perspectives","volume":"52","author":"Zhang","year":"2019","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.ipm.2025.104092_b65","doi-asserted-by":"crossref","unstructured":"Zhao, H., Chen, A., Sun, X., Cheng, H., & Li, J. (2024). All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining. In KDD (pp. 4443\u20134454).","DOI":"10.1145\/3637528.3671913"},{"key":"10.1016\/j.ipm.2025.104092_b66","doi-asserted-by":"crossref","unstructured":"Zhou, F., Cao, C., Zhang, K., Trajcevski, G., Zhong, T., et al. (2019). Meta-GNN: On Few-shot Node Classification in Graph Meta-learning. In CIKM (pp. 2357\u20132360).","DOI":"10.1145\/3357384.3358106"},{"key":"10.1016\/j.ipm.2025.104092_b67","series-title":"ProG: A graph prompt learning benchmark","author":"Zi","year":"2024"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457325000342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457325000342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:50:55Z","timestamp":1762293055000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457325000342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S0306457325000342"],"URL":"https:\/\/doi.org\/10.1016\/j.ipm.2025.104092","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Information bottleneck-driven prompt on graphs for unifying downstream few-shot classification tasks","name":"articletitle","label":"Article Title"},{"value":"Information Processing & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipm.2025.104092","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104092"}}