{"id":2753,"date":"2023-12-02T03:03:22","date_gmt":"2023-12-02T03:03:22","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?page_id=2753"},"modified":"2026-05-08T01:10:24","modified_gmt":"2026-05-08T00:10:24","slug":"subgraph-isomorphism","status":"publish","type":"page","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/subgraph-isomorphism\/","title":{"rendered":"Accelerating Subgraph Isomorphism Search Using Graphlets"},"content":{"rendered":"\n<div class=\"wp-block-media-text is-stacked-on-mobile\" style=\"grid-template-columns:33% auto\"><figure class=\"wp-block-media-text__media\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1024\" height=\"288\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-1024x288.png\" alt=\"\" class=\"wp-image-2754 size-full\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-1024x288.png 1024w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-300x84.png 300w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-768x216.png 768w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-1536x432.png 1536w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1-500x141.png 500w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/12\/si-intro-1.png 1622w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure><div class=\"wp-block-media-text__content\">\n<p class=\"wp-block-paragraph\">This is a collaborative project between Queen&#8217;s University Belfast, United Kingdom and Tezpur University, Assam, India. It was primarily sponsored by the Ministry of Education, Government of India.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The <strong>subgraph isomorphism search<\/strong> problem is a computational task in which two graphs <strong><em>G<\/em><\/strong> and <strong><em>H<\/em><\/strong> are given as input, and one must determine whether <strong><em>G<\/em><\/strong> contains a subgraph that is isomorphic to <strong><em>H<\/em><\/strong>.<\/p>\n<\/div><\/div>\n\n\n\n<p class=\"wp-block-paragraph\" id=\"p-rc_36bdaa7e6c5279d0-51\">The project addresses the computational challenges of the Subgraph Isomorphism (SI) search problem, which involves identifying all embeddings of a smaller pattern graph within a larger data graph<sup><\/sup>. Because this problem is NP-complete, it is highly computationally intensive<sup><\/sup>. The thesis explores adaptive, high-performance solutions using machine learning, heuristic development, and parallel computing<sup><\/sup>. It is divided into three main contributions:<\/p>\n\n\n\n<ol start=\"1\" class=\"wp-block-list\">\n<li><strong>Machine Learning-Based Algorithm Selection<\/strong>: Developing a framework that uses graph-specific features (summary statistics, local topological information, and label distributions) to dynamically predict the most efficient SI heuristic for a given pair of graphs.<\/li>\n\n\n\n<li><strong>OrbitSI Algorithm<\/strong>: A heuristic algorithm that exploits the local topological properties (orbits of 4-vertex graphlets) during preprocessing to reduce the search space and eliminate redundant computations.<\/li>\n\n\n\n<li><strong>NI-ORCA Algorithm<\/strong>: A parallel algorithm for efficiently counting the orbits of non-induced graphlets, distributing computational workloads across multiple processing units to improve execution times and scalability.<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\">List of Publications<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\" id=\"p-rc_36bdaa7e6c5279d0-55\">The research led to the following publications<sup><\/sup>:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>S. I. Tauhidi, A. Karmakar, T. S. Mai and H. Vandierendonck, &#8220;Parallel Counting of Non-Induced Graphlet Orbits,&#8221; in <em>2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops)<\/em>, Edinburgh, United Kingdom, 2025, pp. 1-2, doi: 10.1109\/CLUSTERWorkshops65972.2025.11164209.<\/li>\n\n\n\n<li>Tauhidi, S.I., Karmakar, A., Mai, T.S. and Vandierendonck, H., 2024, December. OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem. In <em>2024 IEEE International Conference on Knowledge Graph (ICKG)<\/em> (pp. 360-369). IEEE.<\/li>\n\n\n\n<li>Tauhidi, S.I., Karmakar, A., Mai, T.S. and Vandierendonck, H., 2023, Graphlet-based Filtering for High-Performance Subgraph Isomorphism Search. <em>HiPEAC 12th International Summer School on Advanced Computer Architecture and Compilation for High-Performance Embedded Systems<\/em>.<\/li>\n\n\n\n<li>Tauhidi, S.I., Karmakar, A., Mai, T.S. and Vandierendonck, H., 2023, November. Machine Learning-Based Per-Instance Algorithm Selection for High-Performance Subgraph Isomorphism Enumeration. In <em>International Conference on Metaheuristics and Nature-Inspired Computing<\/em> (pp. 214-229). Cham: Springer Nature Switzerland.<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Thesis<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">Syed Tauhidi&#8217;s thesis is available on Pure.<\/p>\n\n\n\n<div class=\"wp-block-buttons is-layout-flex wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button has-custom-width wp-block-button__width-25 is-style-outline is-style-outline--1\"><a class=\"wp-block-button__link wp-element-button\" href=\"https:\/\/pure.qub.ac.uk\/en\/studentTheses\/accelerating-subgraph-isomorphism-search-using-graphlets\/\">View Thesis<\/a><\/div>\n<\/div>\n\n\n\n<h3 class=\"wp-block-heading\">People<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Syed Ibtisam Tauhidi<\/li>\n\n\n\n<li>Prof. Hans Vandierendonck<\/li>\n\n\n\n<li>Dr. Thai Son Mai<\/li>\n\n\n\n<li>Dr. Arindam Karmakar<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Funding<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\" id=\"p-rc_36bdaa7e6c5279d0-64\">The research was supported by the following:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The Ministry of Education, Govt. of India (through Tezpur University, India).<\/li>\n\n\n\n<li>The Kelvin Living Lab under Grant No. EP\/Z531054\/1.<\/li>\n\n\n\n<li>The EPSRC under Grant No. EP\/T022175\/1.<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Latest News<\/h3>\n\n\n\n<div class=\"wp-block-group is-vertical is-layout-flex wp-container-core-group-is-layout-4fc3f8e1 wp-block-group-is-layout-flex\">\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-8f761849 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:100%\"><ul class=\"wp-block-latest-posts__list is-grid columns-3 has-dates wp-block-latest-posts\"><li><div class=\"wp-block-latest-posts__featured-image\"><img decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/Screenshot-from-2025-11-09-11-46-42-150x150.png\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/orbitsi-is-now-on-pypi\/\">OrbitSI is now on PyPi<\/a><time datetime=\"2025-11-05T01:08:43+00:00\" class=\"wp-block-latest-posts__post-date\">5 November 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">OrbitSI is an open-source Python framework designed to efficiently solve the subgraph isomorphism enumeration problem, i.e., identifying all subgraphs within a data graph that are structurally\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/orbitsi-is-now-on-pypi\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: OrbitSI is now on PyPi<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2025\/09\/PXL_20250905_122328203-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2025\/09\/PXL_20250905_122328203-150x150.jpg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2025\/09\/PXL_20250905_122328203-510x510.jpg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-at-the-cluster-2025-conference\/\">Poster presentation on NI-ORCA at the CLUSTER 2025 conference<\/a><time datetime=\"2025-09-08T17:19:00+01:00\" class=\"wp-block-latest-posts__post-date\">8 September 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">We attended the CLUSTER 2025 conference organised at the University of Edinburgh, Scotland, United Kingdom, between 2 and 5 September 2025. Syed Tauhidi presented a poster\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-at-the-cluster-2025-conference\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Poster presentation on NI-ORCA at the CLUSTER 2025 conference<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/PXL_20241210_082602436-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/PXL_20241210_082602436-150x150.jpg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/PXL_20241210_082602436-510x510.jpg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paper-presentation-on-orbitsi-at-ickg-2024\/\">Paper presentation on OrbitSI at ICKG 2024, Abu Dhabi, UAE<\/a><time datetime=\"2024-12-13T02:01:00+00:00\" class=\"wp-block-latest-posts__post-date\">13 December 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Syed Ibtisam Tauhidi recently attended the 2024 IEEE International Conference on Knowledge Graph (ICKG) in Abu Dhabi, United Arab Emirates, held from December 11 to December\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paper-presentation-on-orbitsi-at-ickg-2024\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Paper presentation on OrbitSI at ICKG 2024, Abu Dhabi, UAE<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231114_133505746.MP_-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231114_133505746.MP_-150x150.jpg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/PXL_20231114_133505746.MP_-510x510.jpg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-at-ni-hpc-user-conference-2023\/\">Poster presentation at NI-HPC user conference 2023<\/a><time datetime=\"2023-11-07T00:56:00+00:00\" class=\"wp-block-latest-posts__post-date\">7 November 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">The NI-HPC user conference was organised at Riddel Hall, Queen&#8217;s University, Belfast, on 7 November 2023. Syed Tauhidi attended the conference and presented his work on\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-at-ni-hpc-user-conference-2023\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Poster presentation at NI-HPC user conference 2023<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/ni5-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/machine-learning-based-per-instance-algorithm-selection-for-high-performance-subgraph-isomorphism-enumeration\/\">Paper presentation at META 2023 in Marrakech, Morocco<\/a><time datetime=\"2023-11-06T00:27:00+00:00\" class=\"wp-block-latest-posts__post-date\">6 November 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">I recently travelled to Marrakech, Morocco, to present my research at the 9th International Conference on Metaheuristics and Nature-Inspired Computing (META 2023). Held from November 1\u20134,\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/machine-learning-based-per-instance-algorithm-selection-for-high-performance-subgraph-isomorphism-enumeration\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Paper presentation at META 2023 in Marrakech, Morocco<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/05\/fern-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-graphlet-based-filtering-for-high-performance-subgraph-isomorphism-search\/\">Poster Presentation at the ACACES Summer School by HiPEAC<\/a><time datetime=\"2023-07-17T10:04:00+01:00\" class=\"wp-block-latest-posts__post-date\">17 July 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Syed Tauhidi presented a poster on &#8220;Graphlet-based Filtering for High-Performance Subgraph Isomorphism Search&#8221; at the 19th International Summer School on Advanced Computer Architecture and Compilation for\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-graphlet-based-filtering-for-high-performance-subgraph-isomorphism-search\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Poster Presentation at the ACACES Summer School by HiPEAC<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/dark_hedges-150x150.jpeg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/dark_hedges-150x150.jpeg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/dark_hedges-510x510.jpeg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/winner-intra-school-3-minute-thesis-competition\/\">(Winner) Intra-school 3 Minute Thesis competition<\/a><time datetime=\"2022-05-13T19:14:00+01:00\" class=\"wp-block-latest-posts__post-date\">13 May 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Syed Tauhidi was selected as the winner of the intra-school 3 Minute Thesis competition. His presentation is below. Some photos from the award ceremony:<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/02\/loriini-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/enhancing-biomedical-research-and-road-planning-with-machine-learning-powered-heuristics\/\">(Winner: Research Culture Poster Competition: EPS faculty) Enhancing Subgraph Isomorphism with Machine Learning-Powered Heuristics<\/a><time datetime=\"2021-10-02T01:02:00+01:00\" class=\"wp-block-latest-posts__post-date\">2 October 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">This submission won the first prize in the \u2018Faculty of Engineering and Physical Sciences\u2019 category at the \u2018Research Culture Poster Competition\u2019 organised by the Graduate School,\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/enhancing-biomedical-research-and-road-planning-with-machine-learning-powered-heuristics\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: (Winner: Research Culture Poster Competition: EPS faculty) Enhancing Subgraph Isomorphism with Machine Learning-Powered Heuristics<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/02\/poplar-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/high-performance-distributed-graph-analytics-sub-graph-isomorphism-initial-review\/\">High-Performance Distributed Graph Analytics | Sub-graph Isomorphism | Initial Review<\/a><time datetime=\"2021-05-24T10:04:00+01:00\" class=\"wp-block-latest-posts__post-date\">24 May 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In this post, I&#8217;ll be introducing the core aspects of my research, discussing the significance of subgraph isomorphism search in graphs, and outlining the objectives and\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/high-performance-distributed-graph-analytics-sub-graph-isomorphism-initial-review\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: High-Performance Distributed Graph Analytics | Sub-graph Isomorphism | Initial Review<\/span><\/a><\/div><\/li>\n<\/ul><\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>This is a collaborative project between Queen&#8217;s University Belfast, United Kingdom and Tezpur University, Assam, India. It was primarily sponsored by the Ministry of Education, Government of India. The subgraph isomorphism search problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains [&hellip;]<\/p>\n","protected":false},"author":1149,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-2753","page","type-page","status-publish","czr-hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/2753","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/1149"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=2753"}],"version-history":[{"count":13,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/2753\/revisions"}],"predecessor-version":[{"id":3981,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/2753\/revisions\/3981"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=2753"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}