相关论文: Corrigendum to "Counting Database Repairs that Sat…
The resilience of a Boolean query is the minimum number of tuples that need to be deleted from the input tables in order to make the query false. A solution to this problem immediately translates into a solution for the more widely known…
We investigate the notion of sufficient explanation, and a sufficiency-degree as attribution score for database tuples in relation to query answering. We also investigate and exploit connections with database repairs as used for dealing…
We fill in a gap in the proof of the main theorem in our earlier paper [Ol]. At the same time, we prove a slightly stronger version of the theorem needed for another paper.
In this paper, we show that the stability analysis in the paper A note on stability of fractional logistic maps, Appl. Math. Lett. 125 (2022) 107787 is incorrect and repeat a proof of a theorem on the convergence of a convolution of the…
Our published paper contains an incorrect statement of a result due to Artin and Zhang. This corrigendum gives the correct statement of their result and includes a new result that allows us to use their result to prove our main theorem.…
LLMs reliably correct false claims when presented in isolation, yet when the same claims are embedded in task-oriented requests, they often comply rather than correct. We term this failure mode \emph{correction suppression} and construct a…
New version of my 1998 article. The method of proof of the main results follows the original, but there are many simplifications/streamlining of arguments, especially Lemma 3.6 (new Lemma 3.7). Fixed small error in proof of lower bound for…
This note corrects a minor misstatement in section 2 of the paper in the title (arXiv:0808.3426). It also addresses some related issues. The error does not affect the main results of that paper, but nevertheless this corrigendum seems…
There is an irreparable error in the proof of Theorem 3.26 in our "Model Theory of Fields with Virtually Free Group Actions" paper and we withdraw the claim of having proved that theorem. In fact, that theorem is false in a very strong…
In Noor (2007)[Muhammad Aslam Noor, New iterative schemes for nonlinear equations, Appl. Math. Comput. 187 (2007) 937-943], proposed an algorithm namely \textbf{Algorithm 2.4} and established a proof to show cubic convergence. The presented…
LLMs can generate factually incorrect statements even when provided access to reference documents. Such errors can be dangerous in high-stakes applications (e.g., document-grounded QA for healthcare or finance). We present GenAudit -- a…
In this brief note, we first give a counterexample to a theorem in Chernikov and Towsner, arXiv:2510.02420(1). In arXiv:2510.02420(2), the theorem has changed but as we explain the proof has a mistake. The change in the statement, due to…
In the note an error in Low and Lapsley's article ("Optimization Flow Control, I: Basic Algorithm and Convergence", IEEE/ACM Transactions on Networking, 7(6), pp. 861-874, 1999) is pointed out. Because of this error the proof of the Theorem…
The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…
The proof of the Independence Theorem for Kim-independence in positive thick NSOP$_1$ theories from (Dobrowolski and Kamsma, 2022) contains a gap. The theorem is still true, and in this corrigendum we give a different proof.
Large language models fail at counting repeated tokens despite strong performance on broader reasoning benchmarks. These failures are commonly attributed to limitations in internal count tracking. We show this attribution is wrong. Linear…
We correct an inaccuracy in the original proof
Paper withdrawn - lemma 4.1 was false. Quite a lot of changes need to be made!
We show that Nederlof's algorithm [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity is flawed because: 1) its consistence is not…
Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect enumeration complexity,…