[ {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA",
    "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ],
    "http://www.nanopub.org/nschema#hasAssertion" : [ {
      "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/assertion"
    } ],
    "http://www.nanopub.org/nschema#hasProvenance" : [ {
      "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/provenance"
    } ],
    "http://www.nanopub.org/nschema#hasPublicationInfo" : [ {
      "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/pubinfo"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/Head"
}, {
  "@graph" : [ {
    "@id" : "https://doi.org/10.48550/arXiv.2601.19447",
    "@type" : [ "http://www.w3.org/ns/prov#Entity" ],
    "http://purl.org/dc/terms/title" : [ {
      "@value" : "KG-CRAFT: Knowledge Graph-based Contrastive Reasoning with LLMs for Enhancing Automated Fact-checking"
    } ],
    "http://purl.org/spar/cito/describes" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#kg-craft"
    } ],
    "http://purl.org/spar/cito/discusses" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#co-gat-electra"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#cofced"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#corxfact"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#defend"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#factl-lama"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#factl-lama-know"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#fire"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#genfe"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#genfe-mt"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#graphcheck"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#graphfc"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ika"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#l-defense"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#mla-roberta"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#multivers"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#pacar"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#programfc"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#sbert-fc"
    }, {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#teller"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#co-gat-electra",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "CO-GAT (ELECTRA) is discussed as a competing method for claim verification that applies graph attention over scientific evidence, utilizing a pre-trained ELECTRA encoder."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "CO-GAT (ELECTRA)"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#cofced",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "CofCED is discussed as a traditional automated fact-checking (AFC) baseline that introduced a hierarchical encoder with cascaded evidence selectors to process reports from multiple sources for claim verification."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "CofCED"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#corxfact",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "CorXFact is discussed as an LLM-based fact-checking approach that simulates human fact-checking principles by analyzing claim-evidence correlations."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "CorXFact"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#defend",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "dEFEND is discussed as a traditional automated fact-checking (AFC) baseline method that employs a sentence-comment co-attention network to jointly analyze news content and user comments for claim verification."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "dEFEND"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#factl-lama",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "FactL-LaMA is discussed as a specialized LLM-based fact-checking method that combines instruction-following with external evidence retrieval, implemented as a Low-Rank Adaptation (LoRA) fine-tuned Llama 2 7B."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "FactL-LaMA"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#factl-lama-know",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "FactL-LaMA-Know is discussed as a specialized LLM-based fact-checking method that augments the FactL-LaMA model with external knowledge sources to improve fact-checking accuracy."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "FactL-LaMA-Know"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#fire",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "FIRE is discussed as a recent LLM-based fact-checking approach that proposes an iterative verification method aiming to improve scalability and efficiency in assessing claims."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "FIRE"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#genfe",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "GenFE is discussed as a traditional automated fact-checking (AFC) baseline that performs joint optimization of veracity prediction and explanation generation, showing improved classification and output quality."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "GenFE"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#genfe-mt",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "GenFE-MT is discussed as a traditional automated fact-checking (AFC) baseline that performs joint optimization of veracity prediction and explanation generation, showing improved classification and output quality."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "GenFE-MT"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#graphcheck",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "GraphCheck is discussed as a recent LLM-based verifier that incorporates lightweight graph signals and instruction-style prompting for fact-checking."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "GraphCheck"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#graphfc",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "GraphFC is discussed as a competing method for claim verification that encodes the report structure with an explicit graph and graph reasoning components."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "GraphFC"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#ika",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "IKA is discussed as an LLM-based fact-checking framework that builds a graph of positive and negative examples from labelled data to enhance fact-checking and explanation capabilities."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "IKA"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#kg-craft",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://purl.org/dc/terms/subject" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/categories#KGEnhancedLLMInference"
    } ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "KG-CRAFT is a novel method that enhances LLM performance in automated fact-checking. It leverages knowledge graphs to construct structured contrastive questions from claims and reports, which then guide an LLM to generate evidence-based summaries for veracity assessment during the inference stage. This process enables LLMs to access and reason with contextualized knowledge more effectively."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "KG-CRAFT"
    } ],
    "https://neverblink.eu/ontologies/llm-kg/hasTopCategory" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/top-categories#KGEnhancedLLM"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#l-defense",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "L-Defense is discussed as a specialized LLM-based fact-checking framework that leverages the wisdom of crowds by partitioning evidence into competing narratives for robust claim verification using LLMs like Llama 2 7B and ChatGPT 3.5 Turbo."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "L-Defense"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#mla-roberta",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "MLA (RoBERTa) is discussed as a competing method for claim verification that uses a sequence inference model with self-attention at token and sentence levels, powered by a pre-trained RoBERTa encoder."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "MLA (RoBERTa)"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#multivers",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "MULTIVERS is discussed as a competing method for claim verification that leverages a multi-task learning approach for scientific verification and rationale extraction from abstracts."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "MULTIVERS"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#pacar",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "PACAR is discussed as a competing prompting-based approach for fact verification that aggregates evidence with consistency-oriented reasoning using large language models."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "PACAR"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#programfc",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "ProgramFC is discussed as a competing method for claim verification that formulates fact verification as a programmatic pipeline with modular steps for evidence usage and decision-making."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "ProgramFC"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#sbert-fc",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "SBERT-FC is discussed as a traditional automated fact-checking (AFC) baseline method that uses SBERT to encode claims and documents, performing verification via supervised classifiers and providing explainability analysis."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "SBERT-FC"
    } ]
  }, {
    "@id" : "https://neverblink.eu/ontologies/llm-kg/methods#teller",
    "@type" : [ "http://purl.org/spar/fabio/Workflow" ],
    "http://www.w3.org/2000/01/rdf-schema#comment" : [ {
      "@value" : "TELLER is discussed as an LLM-based fact-checking framework that is a dual-system approach integrating human expertise with LLM reasoning to emphasize trustworthiness."
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "TELLER"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/assertion"
}, {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/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.2601.19447"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/provenance"
}, {
  "@graph" : [ {
    "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA",
    "http://purl.org/dc/terms/created" : [ {
      "@type" : "http://www.w3.org/2001/XMLSchema#dateTime",
      "@value" : "2026-03-13T16:08:16.428Z"
    } ],
    "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/RAWAHIxoaUsGqS5tkJf2hWOoBuz5tOddbhuGDhfRGFdrY"
    } ],
    "http://www.w3.org/2000/01/rdf-schema#label" : [ {
      "@value" : "LLM-KG assessment for paper 10.48550/arXiv.2601.19447"
    } ]
  }, {
    "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/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" : "Vd3waP8e4zJi2Pk1git+rh/78E7EK+nKm7KEAnnDs8XqfEGUbt2GyK54kfWA7dh0twJrike2REjpnCoHnLjoZsxyJMw1x+Nh2uUzvkMFHKz+d3Ul23abkTUlEeKEZZa/BMByBoRg33e7eBuNpdER+3eVNLV4GUFoVF1DT1WaHIWTCesshHTez4lyb1gewCYhOycAJMlFLoMbG5HXXmQy5bfuY7qf7rDn7JKK0/qEnR0e0UUpe9Azq0aBx9LtZe6WfhnSHtmdlnvYeqYUqUfxPhor4cMeqoMgW5/UUse1XCauu7Na/C5ms35GBjZRfrlGrSUt5bp2zZIrCi0wXYUg0A=="
    } ],
    "http://purl.org/nanopub/x/hasSignatureTarget" : [ {
      "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA"
    } ],
    "http://purl.org/nanopub/x/signedBy" : [ {
      "@id" : "https://neverblink.eu/ontologies/llm-kg/agent"
    } ]
  } ],
  "@id" : "https://w3id.org/np/RApQFB3_XfMcKvx6FxeY0MufsIpv3ebHcOx4gni4tqfxA/pubinfo"
} ]