Jul 2026· Annual International ACM SIGIR Conference on Research and Development in Information Retrieval· pp. 2721-2733· 0 citations· 108 references
Computer Science
TL;DR
This paper introduces Forgetting-by-Design (FBD), a mechanism-agnostic audit that runs probes across paired system states before and after revocation, and separates compliance into two observable channels---retrieval/citation exposure and answer-level disclosure or abstention ---and reports the cost of compliance using matched lawful controls and substitution-aware utility signals.
Abstract
For information access systems, it is not enough for outputs or answers to be relevant or correct; they must also be permitted. This paper highlights a research gap: non-disclosure obligations often concern propositions that must not be stated, while deployed Retrieval-Augmented Generation (RAG) systems enforce restrictions through record-level handling such as document removal or access-control lists. Such systems can appear compliant while still disclosing revoked facts in generated answers. Most RAG evaluations fail to assess this important aspect of compliance. We explore the nature of this gap and introduce Forgetting-by-Design (FBD), a mechanism-agnostic audit that runs probes across paired system states before and after revocation. FBD separates compliance into two observable channels---retrieval/citation exposure and answer-level disclosure or abstention ---and reports the cost of compliance using matched lawful controls and substitution-aware utility signals. We instantiate FBD in a reproducible RAG setting and show how the resulting report card reveals failures that single metrics miss: retrieval exposure can be suppressed while answer-level leakage persists, and interventions that reduce disclosure can still degrade lawful utility or collapse citation coverage.
A generative search answer can cite a supported passage yet omit a source relationship that changes its interpretation. We specify a claim-gated audit of the query-source-answer tuple. An omission is resolved only when relationship evidence, answer adoption, materiality, and disclosure are all observed; incomplete evid...
Kai-Nan Zhou, Chu-Hong Xu, Gang-Zhen Qian et al.· 0 citations
Family-level and seed-stability analyses show that example-level accuracy overstates counterfactual consistency: complete four-way family success is rare, and an exploratory follow-up that elicits decomposed semantic evidence fails to improve routing for the cleanly evaluated endpoint.
Yi-Hang Chen, Pinyan Qian, Su Wang et al.· 0 citations
Coding agents can return plausible patches that omit required behavior. These failures are hard to review because long traces and confident summaries often hide what was missed. We ask when a nominally weaker reviewer can reliably decide whether a patch solves its issue. We study 411 execution-labeled traces from three...
Jun-Yu Guo, Shangding Gu, Ming Jin et al.· 1 citation
Large language models are often asked which input factors influenced their outputs. For structured inputs, such reports can be checked by counterfactual perturbation, but each factor must be queried multiple times to estimate its effect, so verification is usually budget-limited. We study how this limited-budget settin...
Tao-Lin Zhang, Han-Yu Wang, Jiu-Heng Wan et al.· 0 citations
Probity, a benchmark of 60 tasks and 470 items from real venture-financing filings, is built and a defect any excerpt-built benchmark can carry is found: items whose evidence is missing from the window of text the model is shown.
Findings show that self-assessment can support explicit, tunable answer-or-abstain decisions when an unsupported commitment is more costly than referral or review.
Ali Şenol· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.