{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T09:18:22Z","timestamp":1774603102430,"version":"3.50.1"},"reference-count":83,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002822","name":"Central South University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002822","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020191","name":"Tr\u01b0\u1eddng \u0110\u1ea1i h\u1ecdc Nha Trang","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100020191","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272480"],"award-info":[{"award-number":["62272480"]}],"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":["62472444"],"award-info":[{"award-number":["62472444"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Visual Informatics"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.visinf.2025.100285","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T18:27:11Z","timestamp":1759343231000},"page":"100285","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["How well will LLMs perform for graph layout tasks?"],"prefix":"10.1016","volume":"10","author":[{"given":"Yilun","family":"Fan","sequence":"first","affiliation":[]},{"given":"Xianglei","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Fangfang","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0092-0793","authenticated-orcid":false,"given":"Yong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"177","key":"10.1016\/j.visinf.2025.100285_b1","first-page":"1","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"Abbe","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.visinf.2025.100285_b2","series-title":"Large language models for mathematical reasoning: Progresses and challenges","author":"Ahn","year":"2024"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1111\/j.1530-9290.2008.00002.x","article-title":"Understanding the organization of industrial ecosystems: A social network approach","volume":"12","author":"Ashton","year":"2008","journal-title":"J. Ind. Ecol."},{"key":"10.1016\/j.visinf.2025.100285_b4","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"42","article-title":"Eigensolver methods for progressive multidimensional scaling of large data","author":"Brandes","year":"2006"},{"key":"10.1016\/j.visinf.2025.100285_b5","series-title":"Graphinsight: Unlocking insights in large language models for graph structure understanding","author":"Cao","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b6","series-title":"Proceedings of the IEEE VIS Workshop on Visualization Education, Literacy, and Activities","first-page":"16","article-title":"Beyond generating code: Evaluating gpt on a data visualization course","author":"Chen","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b7","article-title":"Viseval: A benchmark for data visualization in the era of large language models","author":"Chen","year":"2024","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b8","series-title":"How do large language models understand graph patterns? A benchmark for graph pattern comprehension","author":"Dai","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b9","series-title":"Ask and you shall receive (a graph drawing): Testing ChatGPT\u2019s potential to apply graph layout algorithms","author":"Di Bartolomeo","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b10","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","year":"1999"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b11","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/j.visinf.2025.100285_b12","series-title":"Talk like a graph: Encoding graphs for large language models","author":"Fatemi","year":"2023"},{"issue":"11","key":"10.1016\/j.visinf.2025.100285_b13","first-page":"1129","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Softw.: Pr. Exp."},{"issue":"11","key":"10.1016\/j.visinf.2025.100285_b14","first-page":"1129","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Softw.: Pr. Exp."},{"key":"10.1016\/j.visinf.2025.100285_b15","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"222","article-title":"Grip: Graph drawing with intelligent placement","author":"Gajer","year":"2000"},{"issue":"6","key":"10.1016\/j.visinf.2025.100285_b16","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1109\/TVCG.2012.299","article-title":"A maxent-stress model for graph layout","volume":"19","author":"Gansner","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b17","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"364","article-title":"Improved force-directed layouts","author":"Gansner","year":"1998"},{"key":"10.1016\/j.visinf.2025.100285_b18","series-title":"Can graph descriptive order affect solving graph problems with LLMs?","author":"Ge","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b19","series-title":"Proceedings of the IEEE Symposium on Information Visualization","first-page":"17","article-title":"A comparison of the readability of graphs using node-link and matrix-based representations","author":"Ghoniem","year":"2004"},{"issue":"3\u20134","key":"10.1016\/j.visinf.2025.100285_b20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1177\/1473871612455749","article-title":"A survey of two-dimensional graph layout techniques for information visualisation","volume":"12","author":"Gibson","year":"2013","journal-title":"Inf. Vis."},{"issue":"2","key":"10.1016\/j.visinf.2025.100285_b21","doi-asserted-by":"crossref","first-page":"1516","DOI":"10.1109\/TVCG.2022.3222186","article-title":"Toward efficient deep learning for graph drawing (DL4GD)","volume":"30","author":"Giovannangeli","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"12","key":"10.1016\/j.visinf.2025.100285_b22","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.visinf.2025.100285_b23","series-title":"The llama 3 herd of models","author":"Grattafiori","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b24","series-title":"Gpt4graph: Can large language models understand graph structured data? an empirical evaluation and benchmarking","author":"Guo","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b25","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"285","article-title":"Drawing large graphs with a potential-field-based multilevel algorithm","author":"Hachul","year":"2004"},{"issue":"4","key":"10.1016\/j.visinf.2025.100285_b26","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MCG.2018.2881501","article-title":"Evaluating the readability of force directed graph layouts: A deep learning approach","volume":"39","author":"Haleem","year":"2019","journal-title":"IEEE Comput. Graph. Appl."},{"key":"10.1016\/j.visinf.2025.100285_b27","series-title":"Chartllama: A multimodal LLM for chart understanding and generation","author":"Han","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b28","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"207","article-title":"Graph drawing by high-dimensional embedding","author":"Harel","year":"2002"},{"issue":"6","key":"10.1016\/j.visinf.2025.100285_b29","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","article-title":"Nodetrix: A hybrid visualization of social networks","volume":"13","author":"Henry","year":"2007","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"8","key":"10.1016\/j.visinf.2025.100285_b30","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","article-title":"Computing connected components on parallel computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.visinf.2025.100285_b31","article-title":"Do LLMs have visualization literacy? An evaluation on modified visualizations to test generalization in data interpretation","author":"Hong","year":"2025","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b32","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"Hu","year":"2005","journal-title":"Math. J."},{"key":"10.1016\/j.visinf.2025.100285_b33","series-title":"Scalable and accurate graph reasoning with LLM-based multi-agents","author":"Hu","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b34","series-title":"Gpt-4o system card","author":"Hurst","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b35","series-title":"Mathprompter: Mathematical reasoning using large language models","author":"Imani","year":"2023"},{"issue":"6","key":"10.1016\/j.visinf.2025.100285_b36","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0098679","article-title":"ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software","volume":"9","author":"Jacomy","year":"2014","journal-title":"PLoS One"},{"key":"10.1016\/j.visinf.2025.100285_b37","series-title":"Structgpt: A general framework for large language model to reason over structured data","author":"Jiang","year":"2023"},{"issue":"01","key":"10.1016\/j.visinf.2025.100285_b38","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0218126691000215","article-title":"Embedding of cycles and grids in star graphs","volume":"1","author":"Jwo","year":"1991","journal-title":"J. Circuits Syst. Comput."},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b39","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"An algorithm for drawing general undirected graphs","volume":"31","author":"Kamada","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.visinf.2025.100285_b40","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/cgf.13187","article-title":"Graph layouts by t-SNE","volume":"36","author":"Kruiger","year":"2017","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b41","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TVCG.2017.2743858","article-title":"What would a graph look like in this layout? A machine learning approach to large graph visualization","volume":"24","author":"Kwon","year":"2017","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b42","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TVCG.2019.2934396","article-title":"A deep generative model for graph layout","volume":"26","author":"Kwon","year":"2019","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b43","series-title":"LLMs get lost in multi-turn conversation","author":"Laban","year":"2025"},{"key":"10.1016\/j.visinf.2025.100285_b44","series-title":"Proceedings of the AVI Workshop on beyond Time and Errors: Novel Evaluation Methods for Information Visualization","first-page":"1","article-title":"Task taxonomy for graph visualization","author":"Lee","year":"2006"},{"key":"10.1016\/j.visinf.2025.100285_b45","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s12650-016-0375-5","article-title":"Module-based visualization of large-scale graph network data","volume":"20","author":"Li","year":"2017","journal-title":"J. Vis."},{"key":"10.1016\/j.visinf.2025.100285_b46","series-title":"Visualization generation with large language models: An evaluation","author":"Li","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b47","series-title":"Proceedings of the Annual Meeting of the Association for Computational Linguistics","first-page":"13250","article-title":"Visualization recommendation with prompt-based reprogramming of large language models","volume":"Vol. 1","author":"Li","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b48","series-title":"Deepseek-v3 technical report","author":"Liu","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b49","series-title":"Exploring and evaluating hallucinations in LLM-powered code generation","author":"Liu","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b50","series-title":"Proceedings of the IEEE Pacific Visualization Symposium","first-page":"191","article-title":"AutoCaption: An approach to generate natural language description from visualization automatically","author":"Liu","year":"2020"},{"key":"10.1016\/j.visinf.2025.100285_b51","article-title":"How good (or bad) are LLMs at detecting misleading visualizations?","author":"Lo","year":"2024","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b52","series-title":"Proceedings of the International Conference on Parallel Processing","first-page":"1","article-title":"Fast spectral graph layout on multicore platforms","author":"Mishra","year":"2020"},{"key":"10.1016\/j.visinf.2025.100285_b53","series-title":"Clarifygpt: Empowering LLM-based code generation with intention clarification","author":"Mu","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b54","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"425","article-title":"An energy model for visual graph clustering","author":"Noack","year":"2003"},{"key":"10.1016\/j.visinf.2025.100285_b55","series-title":"Let your graph do the talking: Encoding structured data for LLMs","author":"Perozzi","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b56","series-title":"V-recs, a low-cost llm4vis recommender with explanations, captioning and suggestions","author":"Podo","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b57","series-title":"Proceedings of the International Symposium on Graph Drawing","first-page":"248","article-title":"Which aesthetic has the greatest effect on human understanding?","author":"Purchase","year":"1997"},{"issue":"8","key":"10.1016\/j.visinf.2025.100285_b58","doi-asserted-by":"crossref","first-page":"8846","DOI":"10.1109\/TITS.2023.3257759","article-title":"Graph neural networks for intelligent transportation systems: A survey","volume":"24","author":"Rahmani","year":"2023","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"7","key":"10.1016\/j.visinf.2025.100285_b59","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1109\/TVCG.2023.3238909","article-title":"Graph exploration with embedding-guided layouts","volume":"30","author":"Shen","year":"2023","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b60","series-title":"Handbook of Graph Drawing and Visualization","author":"Tamassia","year":"2013"},{"key":"10.1016\/j.visinf.2025.100285_b61","series-title":"Gemini: A family of highly capable multimodal models","author":"Team","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b62","article-title":"Chartgpt: Leveraging LLMs to generate charts from abstract natural language","author":"Tian","year":"2024","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"4","key":"10.1016\/j.visinf.2025.100285_b63","doi-asserted-by":"crossref","first-page":"4668","DOI":"10.1109\/TNNLS.2022.3184967","article-title":"Graph neural networks for graph drawing","volume":"35","author":"Tiezzi","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","article-title":"From Louvain to Leiden: Guaranteeing well-connected communities","volume":"9","author":"Traag","year":"2019","journal-title":"Sci. Rep."},{"issue":"6","key":"10.1016\/j.visinf.2025.100285_b65","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TVCG.2008.155","article-title":"Perceptual organization in user-generated graph layouts","volume":"14","author":"Van\u00a0Ham","year":"2008","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b66","series-title":"Proceedings of the IEEE Pacific Visualization Conference","first-page":"343","article-title":"Are LLMs ready for visualization?","author":"V\u00e1zquez","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b67","series-title":"Proceedings of the Advances in Neural Information Processing Systems","first-page":"30840","article-title":"Can language models solve graph problems in natural language?","volume":"Vol. 36","author":"Wang","year":"2023"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b68","first-page":"676","article-title":"Deepdrawing: A deep learning approach to graph drawing","volume":"26","author":"Wang","year":"2019","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"5","key":"10.1016\/j.visinf.2025.100285_b69","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MCG.2021.3093908","article-title":"DeepGD: A deep learning framework for graph drawing using GNN","volume":"41","author":"Wang","year":"2021","journal-title":"IEEE Comput. Graph. Appl."},{"issue":"8","key":"10.1016\/j.visinf.2025.100285_b70","doi-asserted-by":"crossref","first-page":"5666","DOI":"10.1109\/TVCG.2023.3306356","article-title":"SmartGD: A GAN-based graph drawing framework for diverse aesthetic goals","volume":"30","author":"Wang","year":"2023","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b71","series-title":"LLM4vis: Explainable visualization recommendation using chatgpt","author":"Wang","year":"2023"},{"key":"10.1016\/j.visinf.2025.100285_b72","series-title":"Chartinsights: Evaluating multimodal large language models for low-level chart question answering","author":"Wu","year":"2024"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b73","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TVCG.2023.3326913","article-title":"Let the chart spark: Embedding semantic context into chart with text-to-image generative model","volume":"30","author":"Xiao","year":"2023","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b74","series-title":"Cognitive overload: Jailbreaking large language models with overloaded logical thinking","author":"Xu","year":"2023"},{"issue":"1","key":"10.1016\/j.visinf.2025.100285_b75","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1109\/TVCG.2022.3209371","article-title":"Taurus: Towards a unified force representation and universal solver for graph layout","volume":"29","author":"Xue","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b76","series-title":"Proceedings of the International Conference on Machine Learning","first-page":"460","article-title":"Optimization equivalence of divergences improves neighbor embedding","author":"Yang","year":"2014"},{"key":"10.1016\/j.visinf.2025.100285_b77","series-title":"Qwen2. 5 technical report","author":"Yang","year":"2024"},{"key":"10.1016\/j.visinf.2025.100285_b78","series-title":"Proceedings of the IEEE Pacific Visualization Symposium","first-page":"61","article-title":"UNICON: A uniform constraint based graph layout framework","author":"Yu","year":"2022"},{"key":"10.1016\/j.visinf.2025.100285_b79","series-title":"Graph2text or graph2token: A perspective of large language models for graph learning","author":"Yu","year":"2025"},{"issue":"12","key":"10.1016\/j.visinf.2025.100285_b80","doi-asserted-by":"crossref","first-page":"2699","DOI":"10.1109\/TVCG.2012.236","article-title":"Intelligent graph layout using many users\u2019 input","volume":"18","author":"Yuan","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b81","article-title":"Advancing multimodal large language models in chart question answering with visualization-referenced instruction tuning","author":"Zeng","year":"2024","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"10.1016\/j.visinf.2025.100285_b82","series-title":"When scaling meets LLM finetuning: The effect of data, model and finetuning method","author":"Zhang","year":"2024"},{"issue":"2","key":"10.1016\/j.visinf.2025.100285_b83","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/TVCG.2020.3030447","article-title":"DRGraph: An efficient graph layout algorithm for large-scale graphs by dimensionality reduction","volume":"27","author":"Zhu","year":"2020","journal-title":"IEEE Trans. Vis. Comput. Graphics"}],"container-title":["Visual Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2468502X25000683?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2468502X25000683?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:44:40Z","timestamp":1774601080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2468502X25000683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":83,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["S2468502X25000683"],"URL":"https:\/\/doi.org\/10.1016\/j.visinf.2025.100285","relation":{},"ISSN":["2468-502X"],"issn-type":[{"value":"2468-502X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"How well will LLMs perform for graph layout tasks?","name":"articletitle","label":"Article Title"},{"value":"Visual Informatics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.visinf.2025.100285","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V. on behalf of Zhejiang University and Zhejiang University Press.","name":"copyright","label":"Copyright"}],"article-number":"100285"}}