[ { "@graph" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE", "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ], "http://www.nanopub.org/nschema#hasAssertion" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/pubinfo" } ] } ], "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/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#KgLlmFramework" } ], "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#GraphEdit" }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#InstructGraph" }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#KgLlmAblationFramework" }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#MuseGraph" }, { "@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#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#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#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#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#label" : [ { "@value" : "DistMult" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#GraphEdit", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "GraphEdit" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#InstructGraph", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "InstructGraph" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#KgLlmAblationFramework", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "KG-LLM (ablation) framework" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#KgLlmFramework", "@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 is a novel method that converts structured knowledge graph paths into natural language Chain-of-Thought (CoT) prompts. These prompts are then used to instruction fine-tune Large Language Models (LLMs) and integrate In-Context Learning (ICL) for enhancing multi-hop link and relation prediction in KGs. This method leverages LLMs to improve knowledge graph completion tasks." } ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "Knowledge Graph Large Language Model (KG-LLM) Framework" } ], "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#MuseGraph", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "MuseGraph" } ] }, { "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#Rescal", "@type" : [ "http://purl.org/spar/fabio/Workflow" ], "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#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#label" : [ { "@value" : "wsGAT" } ] } ], "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/assertion" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/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/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/provenance" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE", "http://purl.org/dc/terms/created" : [ { "@type" : "http://www.w3.org/2001/XMLSchema#dateTime", "@value" : "2026-02-26T15:15:19.201Z" } ], "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/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s" } ], "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/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/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" : "WUeNVKZTnnpfvDsRj9xrud8Pth1nc534EKiKfILWETRshkdKIb7OO+2cEkATv7VedNp52AMy05Z+WMOF4LTKjcuonoaSrqJxMnlQ1YSiFwkYMcg9IGrFEcmWWMAjVgeFoxQxNpRgW+fkpahNXcbJgmCo/gTyDX2Lun3BQpPzW2Q45jI1wxrLiCb7jP+qx+kzA5TXsYL5x92FBtgaRW9YjbgSi9Ua2xc52RdXO/4Rg6YcG+Z8lyrJqAZUyoBnUJGKH39ADwUxPT6l77TSs/IX9XCJkPRmAXqKdor+j85vX3U3RlcZlugo1c+XxWyO4exYzEM5ECnRWMOfEr7zau2t8Q==" } ], "http://purl.org/nanopub/x/hasSignatureTarget" : [ { "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE" } ], "http://purl.org/nanopub/x/signedBy" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/agent" } ] } ], "@id" : "https://w3id.org/np/RAtsoiWc5ZvdO9lft0xqhlYJoPJRdoCN-epHOOm4VSpZE/pubinfo" } ]