[ { "@graph" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s", "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ], "http://www.nanopub.org/nschema#hasAssertion" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/assertion" } ], "http://www.nanopub.org/nschema#hasProvenance" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/pubinfo" } ] } ], "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/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#kgLlmAblationFramework" }, { "@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#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#kgLlmAblationFramework", "@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" : "This is an ablation variant of the KG-LLM framework, where the knowledge prompt structure is simplified by removing explicit instructions, textualized IDs, and Chain-of-Thought reasoning from the expected response. It is explicitly designed and evaluated as a baseline within the same LLM-augmented KG completion approach." } ], "http://www.w3.org/2000/01/rdf-schema#label" : [ { "@value" : "KG-LLM (ablation) 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#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 converts multi-hop knowledge graph paths into natural language Chain-of-Thought prompts. These prompts are then used for instruction fine-tuning of Large Language Models (LLMs) to perform multi-hop link and relation prediction, which are tasks aimed at completing missing information within Knowledge Graphs." } ], "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#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/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/assertion" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/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/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/provenance" }, { "@graph" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s", "http://purl.org/dc/terms/created" : [ { "@type" : "http://www.w3.org/2001/XMLSchema#dateTime", "@value" : "2026-02-26T14:20:11.306Z" } ], "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/RA8stpgjrc1GL41JRuwlasWusKapHxYrLBJIMrxz-l-UI" } ], "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/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/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" : "PdstFRl74moXHSsaZPXbpsqAOaGL8EbbxHY/K4g+ZxUGwhByhht82ZFr1MLPF+/gp/hU2+ZtPCNMt8AzD0fOXFGp5y4SPv6aTkuLTeEtLwxR5U6HME6+qvxzT2V0WvAFGFuf3SbT5Hv9hn21RK5WVVX5M0q+eniYR5S+f4hcLFaFmxS99ISd0HS6H23eN+r50linncayUYEatcgw/k02pOMeg/t+56kwm3n2PGa7DpyCPjx+ggBRiUyMhfyFcotYyAHTd3wpKbBcH2E/OVshuwEJwxaddFuChD45SYYAdZwHS9oMtnCUiBmgvSR42naGMAyohWgrecWRSQMF0GAuYg==" } ], "http://purl.org/nanopub/x/hasSignatureTarget" : [ { "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s" } ], "http://purl.org/nanopub/x/signedBy" : [ { "@id" : "https://neverblink.eu/ontologies/llm-kg/agent" } ] } ], "@id" : "https://w3id.org/np/RAbmlZSAHz9d7WzSKH7aijHq6-GuUzOjoVBqtz3rvzu2s/pubinfo" } ]