@prefix this: <
https://w3id.org/np/RAkJupd9oXmfxA7z3Rs8f-I-C__DTArSrtUncFkiBlf8o
> .
@prefix sub: <
https://w3id.org/np/RAkJupd9oXmfxA7z3Rs8f-I-C__DTArSrtUncFkiBlf8o/
> .
@prefix np: <
http://www.nanopub.org/nschema#
> .
@prefix dct: <
http://purl.org/dc/terms/
> .
@prefix xsd: <
http://www.w3.org/2001/XMLSchema#
> .
@prefix rdfs: <
http://www.w3.org/2000/01/rdf-schema#
> .
@prefix prov: <
http://www.w3.org/ns/prov#
> .
@prefix npx: <
http://purl.org/nanopub/x/
> .
sub:Head
{
this:
np:hasAssertion
sub:assertion
;
np:hasProvenance
sub:provenance
;
np:hasPublicationInfo
sub:pubinfo
;
a
np:Nanopublication
.
}
sub:assertion
{
<
https://doi.org/10.48550/arXiv.2510.09711
>
dct:title
"ReaLM: Residual Quantization Bridging Knowledge Graph Embeddings and Large Language Models" ;
<
http://purl.org/spar/cito/describes
> <
https://neverblink.eu/ontologies/llm-kg/methods#ReaLM
> ;
<
http://purl.org/spar/cito/discusses
> <
https://neverblink.eu/ontologies/llm-kg/methods#Alpaca
> , <
https://neverblink.eu/ontologies/llm-kg/methods#ConvE
> , <
https://neverblink.eu/ontologies/llm-kg/methods#GPT35
> , <
https://neverblink.eu/ontologies/llm-kg/methods#HittER
> , <
https://neverblink.eu/ontologies/llm-kg/methods#HyConvE
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KGAlpaca
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KGBERT
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KGFIT
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KGLLaMA
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KICGPT
> , <
https://neverblink.eu/ontologies/llm-kg/methods#KoPA
> , <
https://neverblink.eu/ontologies/llm-kg/methods#MKGL
> , <
https://neverblink.eu/ontologies/llm-kg/methods#RotatE
> , <
https://neverblink.eu/ontologies/llm-kg/methods#SSQR
> , <
https://neverblink.eu/ontologies/llm-kg/methods#TCRA
> , <
https://neverblink.eu/ontologies/llm-kg/methods#TransE
> ;
a
prov:Entity
.
<
https://neverblink.eu/ontologies/llm-kg/methods#Alpaca
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"Alpaca" .
<
https://neverblink.eu/ontologies/llm-kg/methods#ConvE
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"ConvE" .
<
https://neverblink.eu/ontologies/llm-kg/methods#GPT35
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"GPT-3.5" .
<
https://neverblink.eu/ontologies/llm-kg/methods#HittER
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"HittER" .
<
https://neverblink.eu/ontologies/llm-kg/methods#HyConvE
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"HyConvE" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KGAlpaca
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KG-Alpaca" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KGBERT
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KG-BERT" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KGFIT
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KG-FIT" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KGLLaMA
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KG-LLaMA" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KICGPT
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KICGPT" .
<
https://neverblink.eu/ontologies/llm-kg/methods#KoPA
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"KoPA" .
<
https://neverblink.eu/ontologies/llm-kg/methods#MKGL
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"MKGL" .
<
https://neverblink.eu/ontologies/llm-kg/methods#ReaLM
>
dct:subject
<
https://neverblink.eu/ontologies/llm-kg/categories#LLMAugmentedKGCompletion
> ;
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:comment
"ReaLM is a novel framework designed to enhance Knowledge Graph Completion (KGC) tasks by bridging the gap between continuous KG embeddings and discrete LLM token spaces. It achieves this by quantizing pretrained KG embeddings into compact code sequences, integrating them as learnable tokens within the LLM's vocabulary, and using ontology-guided class constraints to refine predictions. This method directly aims to improve LLM performance on KG tasks like link prediction and triple classification." ;
rdfs:label
"ReaLM" ;
<
https://neverblink.eu/ontologies/llm-kg/hasTopCategory
> <
https://neverblink.eu/ontologies/llm-kg/top-categories#LLMAugmentedKG
> .
<
https://neverblink.eu/ontologies/llm-kg/methods#RotatE
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"RotatE" .
<
https://neverblink.eu/ontologies/llm-kg/methods#SSQR
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"SSQR" .
<
https://neverblink.eu/ontologies/llm-kg/methods#TCRA
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"TCRA" .
<
https://neverblink.eu/ontologies/llm-kg/methods#TransE
>
a
<
http://purl.org/spar/fabio/Workflow
> ;
rdfs:label
"TransE" .
}
sub:provenance
{
sub:assertion
prov:wasAttributedTo
<
https://neverblink.eu/ontologies/llm-kg/agent
> ;
prov:wasDerivedFrom
<
https://doi.org/10.48550/arXiv.2510.09711
> .
}
sub:pubinfo
{
this:
dct:created
"2026-02-26T15:25:49.100Z"^^
xsd:dateTime
;
dct:creator
<
https://neverblink.eu/ontologies/llm-kg/agent
> ;
npx:hasNanopubType
<
https://neverblink.eu/ontologies/llm-kg/PaperAssessmentResult
> ;
rdfs:label
"LLM-KG assessment for paper 10.48550/arXiv.2510.09711" .
sub:sig
npx:hasAlgorithm
"RSA" ;
npx:hasPublicKey
"MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAwNz2QK3SEifno78S7+48zUB0xpTex3mAzW73ZimHqNcdEMU5/apslrGrTHGFAt/Chocgo++r6JQp5ygY7NyJHGWdaIqnt85pjX4PbNfLAvapyUO00qZP34fY61w4eZ9UMtleWEsmZKRtQPyJ8ODl46i/rfPuZlcJGpM9Nmy5mpGWuepqIEvF4a/t7pLVeCEDFSYXT+yaiygt6ynIK5f7TtEDhZpeUf/Q74WhMPJXm4yTU/hqOX4IW+50kWHNArGGZwUaXwzyG6M3Zd6UMModryGkLqS4H/MSE3ZA1Ylnms7BfWLEXhMWlaKi6HRV4nGRDLhxVSi9LSRi3LWKLhNIIQIDAQAB" ;
npx:hasSignature
"FDMwEj4Y7hBr5r4HQW/5a/XyRUJ3AMyFRPfKiKIFQvIE5UKEnv4KENXcs5ltRj7Hk72rmY+Vh9VNXP5xySh7cVQ+nmMeah2kK9JOQY9cH9W64xuWgsRjELaFfztf01cjv8ijTBpBILWo8k0728uoJXtB9/ncnfcaaNac3QBbsJ8UazikvStj3z98HisRkLitu+AeWsIEDsAt9S4w0dpFM6IE8V1hc3GDK1w70mYcMv0desTssW+JOBNnCh7H9XAqXh2XqC5+UlgcxW7j8xyvwV1rct1sT/EzhXb7RvjnfswOjD2Lv1HKbWaEjOLef7dwCL8BVnW/66RJ3BxMKZakpw==" ;
npx:hasSignatureTarget
this:
;
npx:signedBy
<
https://neverblink.eu/ontologies/llm-kg/agent
> .
}