[ {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c",
    "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ],
    "http://www.nanopub.org/nschema#hasAssertion" : [ {
      "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/assertion"
    } ],
    "http://www.nanopub.org/nschema#hasProvenance" : [ {
      "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/provenance"
    } ],
    "http://www.nanopub.org/nschema#hasPublicationInfo" : [ {
      "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/pubinfo"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/Head"
}, {
  "@graph" : [ {
    "@id" : "https://doi.org/10.48550/arXiv.2403.07311",
    "@type" : [ "http://www.w3.org/ns/prov#Entity" ],
    "http://purl.org/dc/terms/title" : [ {
      "@value" : "Knowledge Graph Large Language Model (KG-LLM) for Link Prediction"
    } ],
    "http://purl.org/spar/cito/describes" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#KnowledgeGraphLargeLanguageModel"
    } ],
    "http://purl.org/spar/cito/discusses" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Analogy"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#CompleX"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ConGLR"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ConvRot"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#DistMult"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#RESCAL"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#TransE"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#WsGAT"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Analogy",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "Analogy is a knowledge graph embedding model designed to capture graph structures. It is used as a baseline for comparison against the KG-LLM framework in multi-hop link prediction tasks."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "Analogy"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#CompleX",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "CompleX utilizes complex embeddings for entities and relations to capture asymmetric relationships in knowledge graphs. It is used as a baseline for comparison against the KG-LLM framework in multi-hop link prediction tasks."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "CompleX"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ConGLR",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "ConGLR is a GNN-based model that leverages context-aware graph representation learning and logical reasoning for improved inductive relation prediction. It is used as a baseline for comparison against the KG-LLM framework."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "ConGLR"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ConvRot",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "ConvRot integrates convolutional networks and rotational embeddings to enhance link prediction performance in knowledge graphs. It is used as a GNN-based baseline for comparison against the KG-LLM framework."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "ConvRot"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#DistMult",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "DistMult represents relations as diagonal matrices for simplicity and efficiency in knowledge graph embedding. It is used as a baseline for comparison against the KG-LLM framework in multi-hop link prediction tasks."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "DistMult"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#KnowledgeGraphLargeLanguageModel",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://purl.org/dc/terms/subject" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/categories#LLMAugmentedKGCompletion"
    } ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "The KG-LLM framework proposes a novel approach that converts multi-hop knowledge graph paths into structured natural language Chain-of-Thought prompts. These prompts are then used to instruction fine-tune large language models, incorporating In-Context Learning to enhance their performance in multi-hop link prediction and multi-hop relation prediction tasks, leveraging LLMs to complete missing facts within KGs."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "Knowledge Graph Large Language Model (KG-LLM)"
    } ],
    "https://neverblink.eu/ontologies/llm-kg/hasTopCategory" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/top-categories#LLMAugmentedKG"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#RESCAL",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "RESCAL is a tensor factorization method used for knowledge graph embedding that captures rich interactions between entities and relations. It is used as a baseline for comparison against the KG-LLM framework in multi-hop link prediction tasks."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "RESCAL"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#TransE",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "TransE is a traditional knowledge graph embedding model that represents relationships as translations in the embedding space. It is used as a baseline for comparison against the KG-LLM framework in multi-hop link prediction tasks."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "TransE"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#WsGAT",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "wsGAT is a graph attention network model that uses weighted self-attention mechanisms to perform various knowledge graph tasks, including link prediction. It is used as a GNN-based baseline for comparison against the KG-LLM framework."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "wsGAT"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/assertion"
}, {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/assertion",
    "http://www.w3.org/ns/prov#wasAttributedTo" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/agent"
    } ],
    "http://www.w3.org/ns/prov#wasDerivedFrom" : [ {
      "@id" : "https://doi.org/10.48550/arXiv.2403.07311"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/provenance"
}, {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c",
    "http://purl.org/dc/terms/created" : [ {
      "@type" : "http://www.w3.org/2001/XMLSchema#dateTime",
      "@value" : "2026-03-13T16:03:07.317Z"
    } ],
    "http://purl.org/dc/terms/creator" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/agent"
    } ],
    "http://purl.org/nanopub/x/hasNanopubType" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/PaperAssessmentResult"
    } ],
    "http://purl.org/nanopub/x/supersedes" : [ {
      "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE"
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "LLM-KG assessment for paper 10.48550/arXiv.2403.07311"
    } ]
  }, {
    "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/sig",
    "http://purl.org/nanopub/x/hasAlgorithm" : [ {
      "@value" : "RSA"
    } ],
    "http://purl.org/nanopub/x/hasPublicKey" : [ {
      "@value" : "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAwNz2QK3SEifno78S7+48zUB0xpTex3mAzW73ZimHqNcdEMU5/apslrGrTHGFAt/Chocgo++r6JQp5ygY7NyJHGWdaIqnt85pjX4PbNfLAvapyUO00qZP34fY61w4eZ9UMtleWEsmZKRtQPyJ8ODl46i/rfPuZlcJGpM9Nmy5mpGWuepqIEvF4a/t7pLVeCEDFSYXT+yaiygt6ynIK5f7TtEDhZpeUf/Q74WhMPJXm4yTU/hqOX4IW+50kWHNArGGZwUaXwzyG6M3Zd6UMModryGkLqS4H/MSE3ZA1Ylnms7BfWLEXhMWlaKi6HRV4nGRDLhxVSi9LSRi3LWKLhNIIQIDAQAB"
    } ],
    "http://purl.org/nanopub/x/hasSignature" : [ {
      "@value" : "M8A86QxaelEblRjE6EJVb/G181uD5Mr5emikye+XbhLXhmpxa/59PdgCAIpnXlJ5g0iwsfFkcaJQnPsyr+8w7kCG/pll0z1V12nxSRBjWL+zhRSWNdqtuXcEgFfHAlxGhYkg49OI7pNLjwtakobWrRmFfoXD4GodW7vFyMwS3GyBGeUlfmO4D4giKTP/ZRQueUldq5qVBIFSaTc7sEbZV7BeJfFsZMZ2aaQVnjcV6k6SYd6sk2Ml6Y1crMoXuaO93e9/MnyGWiwPvoNAo2PmiR8pMHO42BSg8BYLpoN8wa7bfg0UatTJb++KWzwmrKTuALfNR2cKMrnC921loiVDbg=="
    } ],
    "http://purl.org/nanopub/x/hasSignatureTarget" : [ {
      "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c"
    } ],
    "http://purl.org/nanopub/x/signedBy" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/agent"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RAQKBbEQ--W2vSHDaZ0LrgiFnCkSkeH3JX7ZrENSNnS4c/pubinfo"
} ]