Tootfinder

Generalized Covariance Estimator under Misspecification and Constraints
Aryan Manafi Neyazi
https://arxiv.org/abs/2509.13492 https://arxiv.org/pdf/2509.134…

Generalized Covariance Estimator under Misspecification and Constraints
This paper investigates the properties of the Generalized Covariance (GCov) estimator under misspecification and constraints with application to processes with local explosive patterns, such as causal-noncausal and double autoregressive (DAR) processes. We show that GCov is consistent and has an asymptotically Normal distribution under misspecification. Then, we construct GCov-based Wald-type and score-type tests to test one specification against the other, all of which follow a $χ^2$ distribu…

Nu är min text ute i Dagens Arena.

»När Ebba Busch ska be om ursäkt för det felaktiga citat hon basunerade ut i sitt Almedalen-tal i år så blir det både dråpligt och direkt skrämmande. Vår vice statsminister avslöjar mellan raderna att hon inte alls förstår hur “AI” fungerar. Genom sina godtrogna uttryck underblåser hon en oerhört missvisande bild till hela svenska folket. Det är tanklöst och ansvarslöst.«

Combinatorial Control Barrier Functions: Nested Boolean and p-choose-r Compositions of Safety Constraints
Pio Ong, Haejoon Lee, Tamas G. Molnar, Dimitra Panagou, Aaron D. Ames
https://arxiv.org/abs/2509.10716

Combinatorial Control Barrier Functions: Nested Boolean and p-choose-r Compositions of Safety Constraints
This paper investigates the problem of composing multiple control barrier functions (CBFs) -- and matrix control barrier functions (MCBFs) -- through logical and combinatorial operations. Standard CBF formulations naturally enable conjunctive (AND) combinations, but disjunctive (OR) and more general logical structures introduce nonsmoothness and possibly a combinatorial blow-up in the number of logical combinations. We introduce the framework of combinatorial CBFs that addresses p-choose-r safe…

Sources: Reflection AI, which is building AI coding tools, nears a deal to raise ~$1B at a valuation of $4.5B to $5.5B; Nvidia's VC arm would invest $250M (Financial Times)

It has been years since I bought a Windows machine, but the first thing I did was remove crapware like that.
https://www.pcworld.com/article/2881134/dont-fall-for-mcafees-deceptive-antivirus-warnings-on-your-laptop.html

Likelihood confidence intervals for misspecified Cox models
Yongwu Shao, Xu Guo
https://arxiv.org/abs/2508.11851 https://arxiv.org/pdf/2508.11851

Likelihood confidence intervals for misspecified Cox models
The robust Wald confidence interval (CI) for the Cox model is commonly used when the model may be misspecified or when weights are applied. However it can perform poorly when there are few events in one or both treatment groups, as may occur when the event of interest is rare or when the experimental arm is highly efficacious. For instance, if we artificially remove events (assuming more events are unfavorable) from the experimental group, the resulting upper CI may increase. This is clearly co…

The Influence of Uniform Magnetic Fields on Strong Field Gravitational Lensing by Kerr Black Holes
Amnish Vachher, Arun Kumar, Sushant G. Ghosh
https://arxiv.org/abs/2508.21100 …

The Influence of Uniform Magnetic Fields on Strong Field Gravitational Lensing by Kerr Black Holes
We investigate strong gravitational lensing using magnetized Kerr black holes (MKBHs), which are accurate Kerr-Bertotti-Robinson solutions for Kerr black holes in a uniform magnetic field with additional magnetic field strength $B$ apart from mass $M$ and spin $a$. Unlike previous magnetized spacetimes, the MKBH geometry is Petrov type D, devoid of conical singularities, allowing photons to reach asymptotic infinity and making the concept astrophysically feasible. We use the strong deflection l…

LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation
Boqi Chen, Aren A. Babikian, Shuzhao Feng, D\'aniel Varr\'o, Gunter Mussbacher
https://arxiv.org/abs/2506.16639

LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation
Requirements over strings, commonly represented using natural language (NL), are particularly relevant for software systems due to their heavy reliance on string data manipulation. While individual requirements can usually be analyzed manually, verifying properties (e.g., satisfiability) over sets of NL requirements is particularly challenging. Formal approaches (e.g., SMT solvers) may efficiently verify such properties, but are known to have theoretical limitations. Additionally, the translati…