Hugging Face Daily Papers · · 5 min read

Computer Science Conferences Should Require Nonrepudiable Experimental Results

Mirrored from Hugging Face Daily Papers for archival readability. Support the source by reading on the original site.

This paper describes our vision on experimental nonrepudiation for computer science conferences/journals/etc, and present a proof of concept implementation of it called: K-Veritas.<br>\"We believe that nonrepudiation should apply universally. Verification does not depend on who you<br>are, where you work, or how famous your lab is.\"</p>\n<p>What do you all think about this?</p>\n","updatedAt":"2026-05-20T19:16:51.530Z","author":{"_id":"63cc1d4bf488db9bb3c6449e","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/63cc1d4bf488db9bb3c6449e/CKRFzGd9O5avURHEwNTFR.png","fullname":"MKLD","name":"Mamadou2727","type":"user","isPro":false,"isHf":false,"isHfAdmin":false,"isMod":false,"followerCount":4,"isUserFollowing":false}},"numEdits":0,"identifiedLanguage":{"language":"en","probability":0.9168586730957031},"editors":["Mamadou2727"],"editorAvatarUrls":["https://cdn-avatars.huggingface.co/v1/production/uploads/63cc1d4bf488db9bb3c6449e/CKRFzGd9O5avURHEwNTFR.png"],"reactions":[],"isReport":false}},{"id":"6a0e63ad392178ab07a2774c","author":{"_id":"63d3e0e8ff1384ce6c5dd17d","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/1674830754237-63d3e0e8ff1384ce6c5dd17d.jpeg","fullname":"Librarian Bot (Bot)","name":"librarian-bot","type":"user","isPro":false,"isHf":false,"isHfAdmin":false,"isMod":false,"followerCount":358,"isUserFollowing":false},"createdAt":"2026-05-21T01:45:17.000Z","type":"comment","data":{"edited":false,"hidden":false,"latest":{"raw":"This is an automated message from the [Librarian Bot](https://huggingface.co/librarian-bots). I found the following papers similar to this paper. \n\nThe following papers were recommended by the Semantic Scholar API \n\n* [Making AI-Assisted Grant Evaluation Auditable without Exposing the Model](https://huggingface.co/papers/2604.25200) (2026)\n* [Kettle: Attested builds for verifiable software provenance](https://huggingface.co/papers/2605.08363) (2026)\n* [Agentic Witnessing: Pragmatic and Scalable TEE-Enabled Privacy-Preserving Auditing](https://huggingface.co/papers/2604.24203) (2026)\n* [Sealing the Audit-Runtime Gap for LLM Skills](https://huggingface.co/papers/2605.05274) (2026)\n* [Skills as Verifiable Artifacts: A Trust Schema and a Biconditional Correctness Criterion for Human-in-the-Loop Agent Runtimes](https://huggingface.co/papers/2605.00424) (2026)\n* [Aegon: Auditable AI Content Access with Ledger-Bound Tokens and Hardware-Attested Mobile Receipts](https://huggingface.co/papers/2604.06693) (2026)\n* [SUDP: Secret-Use Delegation Protocol for Agentic Systems](https://huggingface.co/papers/2604.24920) (2026)\n\n\n Please give a thumbs up to this comment if you found it helpful!\n\n If you want recommendations for any Paper on Hugging Face checkout [this](https://huggingface.co/spaces/librarian-bots/recommend_similar_papers) Space\n\n You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: `@librarian-bot recommend`","html":"<p>This is an automated message from the <a href=\"https://huggingface.co/librarian-bots\">Librarian Bot</a>. I found the following papers similar to this paper. </p>\n<p>The following papers were recommended by the Semantic Scholar API </p>\n<ul>\n<li><a href=\"https://huggingface.co/papers/2604.25200\">Making AI-Assisted Grant Evaluation Auditable without Exposing the Model</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2605.08363\">Kettle: Attested builds for verifiable software provenance</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2604.24203\">Agentic Witnessing: Pragmatic and Scalable TEE-Enabled Privacy-Preserving Auditing</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2605.05274\">Sealing the Audit-Runtime Gap for LLM Skills</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2605.00424\">Skills as Verifiable Artifacts: A Trust Schema and a Biconditional Correctness Criterion for Human-in-the-Loop Agent Runtimes</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2604.06693\">Aegon: Auditable AI Content Access with Ledger-Bound Tokens and Hardware-Attested Mobile Receipts</a> (2026)</li>\n<li><a href=\"https://huggingface.co/papers/2604.24920\">SUDP: Secret-Use Delegation Protocol for Agentic Systems</a> (2026)</li>\n</ul>\n<p> Please give a thumbs up to this comment if you found it helpful!</p>\n<p> If you want recommendations for any Paper on Hugging Face checkout <a href=\"https://huggingface.co/spaces/librarian-bots/recommend_similar_papers\">this</a> Space</p>\n<p> You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: <code><span class=\"SVELTE_PARTIAL_HYDRATER contents\" data-target=\"UserMention\" data-props=\"{&quot;user&quot;:&quot;librarian-bot&quot;}\"><span class=\"inline-block\"><span class=\"contents\"><a href=\"/librarian-bot\">@<span class=\"underline\">librarian-bot</span></a></span> </span></span> recommend</code></p>\n","updatedAt":"2026-05-21T01:45:17.062Z","author":{"_id":"63d3e0e8ff1384ce6c5dd17d","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/1674830754237-63d3e0e8ff1384ce6c5dd17d.jpeg","fullname":"Librarian Bot (Bot)","name":"librarian-bot","type":"user","isPro":false,"isHf":false,"isHfAdmin":false,"isMod":false,"followerCount":358,"isUserFollowing":false}},"numEdits":0,"identifiedLanguage":{"language":"en","probability":0.7308307886123657},"editors":["librarian-bot"],"editorAvatarUrls":["https://cdn-avatars.huggingface.co/v1/production/uploads/1674830754237-63d3e0e8ff1384ce6c5dd17d.jpeg"],"reactions":[],"isReport":false}}],"primaryEmailConfirmed":false,"paper":{"id":"2605.08586","authors":[{"_id":"6a0dd90fd1ef9ecdf71c0e03","user":{"_id":"63cc1d4bf488db9bb3c6449e","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/63cc1d4bf488db9bb3c6449e/CKRFzGd9O5avURHEwNTFR.png","isPro":false,"fullname":"MKLD","user":"Mamadou2727","type":"user","name":"Mamadou2727"},"name":"Mamadou K. Keita","status":"claimed_verified","statusLastChangedAt":"2026-05-20T17:09:33.311Z","hidden":false},{"_id":"6a0dd90fd1ef9ecdf71c0e04","name":"Christopher Homan","hidden":false}],"publishedAt":"2026-05-09T00:00:00.000Z","submittedOnDailyAt":"2026-05-20T00:00:00.000Z","title":"Computer Science Conferences Should Require Nonrepudiable Experimental Results","submittedOnDailyBy":{"_id":"63cc1d4bf488db9bb3c6449e","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/63cc1d4bf488db9bb3c6449e/CKRFzGd9O5avURHEwNTFR.png","isPro":false,"fullname":"MKLD","user":"Mamadou2727","type":"user","name":"Mamadou2727"},"summary":"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.","upvotes":1,"discussionId":"6a0dd90fd1ef9ecdf71c0e05","projectPage":"https://kveritas.org"},"canReadDatabase":false,"canManagePapers":false,"canSubmit":false,"hasHfLevelAccess":false,"upvoted":false,"upvoters":[{"_id":"63cc1d4bf488db9bb3c6449e","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/63cc1d4bf488db9bb3c6449e/CKRFzGd9O5avURHEwNTFR.png","isPro":false,"fullname":"MKLD","user":"Mamadou2727","type":"user"}],"acceptLanguages":["en"],"dailyPaperRank":0,"markdownContentUrl":"https://huggingface.co/buckets/huggingchat/papers-content/resolve/2605/2605.08586.md"}">
Papers
arxiv:2605.08586

Computer Science Conferences Should Require Nonrepudiable Experimental Results

Published on May 9
· Submitted by
MKLD
on May 20
Authors:

Abstract

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.

Community

Paper author Paper submitter about 7 hours ago

This paper describes our vision on experimental nonrepudiation for computer science conferences/journals/etc, and present a proof of concept implementation of it called: K-Veritas.
"We believe that nonrepudiation should apply universally. Verification does not depend on who you
are, where you work, or how famous your lab is."

What do you all think about this?

This is an automated message from the Librarian Bot. I found the following papers similar to this paper.

The following papers were recommended by the Semantic Scholar API

Please give a thumbs up to this comment if you found it helpful!

If you want recommendations for any Paper on Hugging Face checkout this Space

You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend

Upload images, audio, and videos by dragging in the text input, pasting, or clicking here.
Tap or paste here to upload images

· Sign up or log in to comment

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 paper 0

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 paper 0

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 paper 0

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 paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from Hugging Face Daily Papers