Computer Science Conferences Should Require Nonrepudiable Experimental Results

Hugging Face Daily Papers Papers
computer-science reproducibility nonrepudiation experimental-results conference-policy k-veritas

Summary

This paper argues that computer science conferences should require nonrepudiable experimental results to prevent tampering and denial, and introduces K-Veritas, a reference implementation for signed reports without accessing training data.

This position paper argues that computer science conferences should require tamper-evident, nonrepudiable attestations of experimental results. We name the underlying problem experiment nonrepudiation: a compliant protocol must bind the numbers in a paper to an actual executed computation in a way the author cannot later alter or deny. The current system relies on self-reported checklists, optional code sharing, and author-controlled logging. None of these mechanisms answer the question a reviewer cannot check: did the code the paper describes produce the numbers the paper reports? We define the problem formally, state the security properties any compliant protocol must satisfy, and describe a threat model that includes attacks current approaches do not prevent. To show that the problem is solvable, we built K-Veritas, a reference implementation in Go that produces signed reports without accessing training data. K-Veritas is a testbed, not a finished answer. We call on conferences and the community to treat nonrepudiation as a first-class requirement and to help build an open, independent standard for it.
Original Article
View Cached Full Text

Cached at: 05/20/26, 10:40 PM

Paper page - Computer Science Conferences Should Require Nonrepudiable Experimental Results

Source: https://huggingface.co/papers/2605.08586 Published on May 9

·

Submitted byhttps://huggingface.co/Mamadou2727

MKLDon May 20

Abstract

Thispositionpaperarguesthatcomputerscienceconferencesshouldrequiretamper-evident,nonrepudiableattestationsofexperimentalresults.Wenametheunderlyingproblemexperimentnonrepudiation:acompliantprotocolmustbindthenumbersinapapertoanactualexecutedcomputationinawaytheauthorcannotlateralterordeny.Thecurrentsystemreliesonself-reportedchecklists,optionalcodesharing,andauthor-controlledlogging.Noneofthesemechanismsanswerthequestionareviewercannotcheck:didthecodethepaperdescribesproducethenumbersthepaperreports?Wedefinetheproblemformally,statethesecuritypropertiesanycompliantprotocolmustsatisfy,anddescribeathreatmodelthatincludesattackscurrentapproachesdonotprevent.Toshowthattheproblemissolvable,webuiltK-Veritas,areferenceimplementationinGothatproducessignedreportswithoutaccessingtrainingdata.K-Veritasisatestbed,notafinishedanswer.Wecallonconferencesandthecommunitytotreatnonrepudiationasafirst-classrequirementandtohelpbuildanopen,independentstandardforit.

View arXiv pageView PDFProject pageAdd to collection

Get this paper in your agent:

hf papers read 2605\.08586

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2605.08586 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2605.08586 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2605.08586 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

OpenComputer: Verifiable Software Worlds for Computer-Use Agents

Hugging Face Daily Papers

OpenComputer presents a framework for creating verifiable software environments for computer-use agents, integrating state verifiers, self-improving verification layers, task synthesis, and evaluation systems across 33 desktop applications. Experiments show its verifiers align better with human judgment than LLM-as-judge, and frontier agents struggle with end-to-end completion.

Publicly-Verifiable Certificates for Statistical Algorithms

arXiv cs.LG

This paper introduces the notion of publicly-verifiable certificates of statistical validity (pvCSVs) for statistical algorithms, enabling distributionally-robust certification of learning results without interaction. The authors construct pvCSVs for adaptive Statistical Query algorithms with sample complexity scaling logarithmically in the number of queries.

Kettle: Attested builds for verifiable software provenance

Lobsters Hottest

This paper introduces Kettle, an attested build system that generates cryptographically verifiable software provenance using Trusted Execution Environments (TEEs). It aims to eliminate the build infrastructure and operators from the trust surface by binding provenance documents directly to hardware-signed attestation reports.