@inproceedings{sneiderman-2026-evidence,
title = "Evidence-Carrying Claims: Fail-Closed Verification Gates for Language-Model-Assisted Research as Knowledge Base Construction",
author = "Sneiderman, Robert",
editor = "Kalo, Jan-Christoph and
Nakashole, Ndapa and
Razniewski, Simon and
Suchanek, Fabian M. and
Vlachos, Andreas and
McCallum, Andrew",
booktitle = "Proceedings of the 11th Workshop on Automated Knowledge Base Construction ({AKBC} 2026)",
month = oct,
year = "2026",
address = "Budapest, Hungary",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2026.akbc-1.14/",
pages = "178--184",
ISBN = "979-8-89176-464-4",
abstract = "Language-model-assisted pipelines emit theorems, experiment reports, and literature claims faster than any reviewer pool can check them. This paper argues that the knowledge base such pipelines demand is not a store of extracted facts but a claim ledger: a knowledge base whose entries pair each claim with the artifact that verifies it (a machine-checked proof, a rerunnable receipt, or a resolved forecast) and whose gates fail closed, blocking an unverified claim from entering the record rather than scoring it after the fact. We ground the argument in three mechanisms already running in one research operation: a twenty-two-gate manuscript-admission stack, a Lean 4 library in which the claim is the artifact, and a sealed-prediction registry with forced resolution. We then state what a community-scale claim ledger would require of its schema, its adjudication protocol, and its incentives. The evidence is a single operation and does not establish generalization; the contribution is the knowledge-base-construction framing and the fail-closed gate architecture."
}<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="sneiderman-2026-evidence">
<titleInfo>
<title>Evidence-Carrying Claims: Fail-Closed Verification Gates for Language-Model-Assisted Research as Knowledge Base Construction</title>
</titleInfo>
<name type="personal">
<namePart type="given">Robert</namePart>
<namePart type="family">Sneiderman</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2026-10</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jan-Christoph</namePart>
<namePart type="family">Kalo</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Ndapa</namePart>
<namePart type="family">Nakashole</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Simon</namePart>
<namePart type="family">Razniewski</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Fabian</namePart>
<namePart type="given">M</namePart>
<namePart type="family">Suchanek</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Andreas</namePart>
<namePart type="family">Vlachos</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Andrew</namePart>
<namePart type="family">McCallum</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Budapest, Hungary</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
<identifier type="isbn">979-8-89176-464-4</identifier>
</relatedItem>
<abstract>Language-model-assisted pipelines emit theorems, experiment reports, and literature claims faster than any reviewer pool can check them. This paper argues that the knowledge base such pipelines demand is not a store of extracted facts but a claim ledger: a knowledge base whose entries pair each claim with the artifact that verifies it (a machine-checked proof, a rerunnable receipt, or a resolved forecast) and whose gates fail closed, blocking an unverified claim from entering the record rather than scoring it after the fact. We ground the argument in three mechanisms already running in one research operation: a twenty-two-gate manuscript-admission stack, a Lean 4 library in which the claim is the artifact, and a sealed-prediction registry with forced resolution. We then state what a community-scale claim ledger would require of its schema, its adjudication protocol, and its incentives. The evidence is a single operation and does not establish generalization; the contribution is the knowledge-base-construction framing and the fail-closed gate architecture.</abstract>
<identifier type="citekey">sneiderman-2026-evidence</identifier>
<location>
<url>https://aclanthology.org/2026.akbc-1.14/</url>
</location>
<part>
<date>2026-10</date>
<extent unit="page">
<start>178</start>
<end>184</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Evidence-Carrying Claims: Fail-Closed Verification Gates for Language-Model-Assisted Research as Knowledge Base Construction
%A Sneiderman, Robert
%Y Kalo, Jan-Christoph
%Y Nakashole, Ndapa
%Y Razniewski, Simon
%Y Suchanek, Fabian M.
%Y Vlachos, Andreas
%Y McCallum, Andrew
%S Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-464-4
%F sneiderman-2026-evidence
%X Language-model-assisted pipelines emit theorems, experiment reports, and literature claims faster than any reviewer pool can check them. This paper argues that the knowledge base such pipelines demand is not a store of extracted facts but a claim ledger: a knowledge base whose entries pair each claim with the artifact that verifies it (a machine-checked proof, a rerunnable receipt, or a resolved forecast) and whose gates fail closed, blocking an unverified claim from entering the record rather than scoring it after the fact. We ground the argument in three mechanisms already running in one research operation: a twenty-two-gate manuscript-admission stack, a Lean 4 library in which the claim is the artifact, and a sealed-prediction registry with forced resolution. We then state what a community-scale claim ledger would require of its schema, its adjudication protocol, and its incentives. The evidence is a single operation and does not establish generalization; the contribution is the knowledge-base-construction framing and the fail-closed gate architecture.
%U https://aclanthology.org/2026.akbc-1.14/
%P 178-184
Markdown (Informal)
[Evidence-Carrying Claims: Fail-Closed Verification Gates for Language-Model-Assisted Research as Knowledge Base Construction](https://aclanthology.org/2026.akbc-1.14/) (Sneiderman, AKBC 2026)
ACL