Skip to main content

Reviewed by the event organisers

CONTINUUM Proceedings

Permanent, citable homes for conference papers.

Open-access proceedings for conferences, workshops and symposia. Organisers deposit their accepted papers; every paper and every volume receives a DOI.

  • ✓ DOI for every paper and volume
  • ✓ ISBN for each volume
  • ✓ Organisers keep control of their review process
Volumes
3
Papers
16
Downloads
3,944

Papers

7 resultsSearch & filters ↓

Full paperBest paper

Reproducibility Checklists in Practice: A Three-Year Audit

Ingrid Novak, Carlos Medina

OPENAIR 2026 · pp. 1–12 · 9 November 2026 · 10.xxxx/ctm.pr.2026.0011

We audit 2,400 checklist responses submitted over three years and compare them against the papers they accompany. Checks for compute reporting and variance were answered affirmatively in 78% of cases but supported by the paper in only 41%, suggesting that checklists work best when responses must point to a location in the text.

Abstract PDF 610 2300 cited
Full paperBest paper

Mixed-Precision Distillation for 4-bit Phone-Class Models

Yuki Saito, Daniel Okafor

SEODML 2026 · pp. 1–10 · 1 October 2026 · 10.xxxx/ctm.pr.2026.0006

Four-bit quantisation of small language models often hurts instruction following. We distil from a full-precision teacher while letting the student's layers use different bit widths chosen by a sensitivity analysis. The resulting 1.1B-parameter model fits in 700 MB and retains 96% of teacher accuracy on our instruction-following suite.

Abstract PDF 980 3601 cited
Full paper

KV-Cache Compression Under Strict Memory Budgets

Rahul Desai, Anders Holm

SEODML 2026 · pp. 11–20 · 1 October 2026 · 10.xxxx/ctm.pr.2026.0007

Long conversations on a phone are limited by the size of the key-value cache. We compare eviction, quantisation and merging strategies under hard memory budgets and find that a hybrid of merging and 8-bit storage keeps perplexity within 3% at one quarter of the memory.

Abstract PDF 760 2800 cited
Full paperBest paper

Retry Budgets for Tool-Using Agents: When Is Trying Again Worth It?

Aisha Rahman, Lena Hartwell

RTUA 2026 · pp. 1–9 · 3 July 2026 · 10.xxxx/ctm.pr.2026.0001

Agents that retry failed tool calls recover from transient errors but can also compound mistakes and waste resources. We analyse 18,000 recorded agent runs and show that retries help for network and rate-limit errors but hurt for malformed arguments. We propose a retry budget that depends on the error class and show that it improves success by 6 points at equal cost.

Abstract PDF 1,420 5602 cited
Full paper

Sandboxing Agent Tool Calls with Capability Tokens

Marcus Tan, Jonas Berg

RTUA 2026 · pp. 10–18 · 3 July 2026 · 10.xxxx/ctm.pr.2026.0002

Tool-using agents are typically granted broad credentials, so a single injected instruction can cause large harm. We describe a capability-token scheme in which every tool call carries a narrowly scoped, short-lived token issued by a policy layer outside the model. A prototype blocks all 41 attack scripts in our test suite with under 4 ms of added latency.

Abstract PDF 1,190 4301 cited