Tootfinder

{testthat} is great for automatic testing. Here are some tricks for the heavy user: #rstats

Agentic Property-Based Testing: Finding Bugs Across the Python Ecosystem
Muhammad Maaz, Liam DeVoe, Zac Hatfield-Dodds, Nicholas Carlini
https://arxiv.org/abs/2510.09907 https:/…

Agentic Property-Based Testing: Finding Bugs Across the Python Ecosystem
Property-based testing (PBT) is a lightweight formal method, typically implemented as a randomized testing framework. Users specify the input domain for their test using combinators supplied by the PBT framework, and the expected properties or invariants as a unit-test function. The framework then searches for a counterexample, e.g. by generating inputs and calling the test function. In this work, we demonstrate an LLM-based agent which analyzes Python modules, infers function-specific and cros…

Hypothesis testing for the dimension of random geometric graph
Mingao Yuan, Feng Yu
https://arxiv.org/abs/2510.11844 https://arxiv.org/pdf/2510.11844

Hypothesis testing for the dimension of random geometric graph
Random geometric graphs (RGGs) offer a powerful tool for analyzing the geometric and dependence structures in real-world networks. For example, it has been observed that RGGs are a good model for protein-protein interaction networks. In RGGs, nodes are randomly distributed over an $m$-dimensional metric space, and edges connect the nodes if and only if their distance is less than some threshold. When fitting RGGs to real-world networks, the first step is probably to input or estimate the dimens…

PrediQL: Automated Testing of GraphQL APIs with LLMs
Shaolun Liu, Sina Marefat, Omar Tsai, Yu Chen, Zecheng Deng, Jia Wang, Mohammad A. Tayebi
https://arxiv.org/abs/2510.10407 h…

PrediQL: Automated Testing of GraphQL APIs with LLMs
GraphQL's flexible query model and nested data dependencies expose APIs to complex, context-dependent vulnerabilities that are difficult to uncover using conventional testing tools. Existing fuzzers either rely on random payload generation or rigid mutation heuristics, failing to adapt to the dynamic structures of GraphQL schemas and responses. We present PrediQL, the first retrieval-augmented, LLM-guided fuzzer for GraphQL APIs. PrediQL combines large language model reasoning with adaptive fee…

📌 Pinned Post
I'm an anarcho-syndicalist non-binary person who uses they/them pronouns, is bisexual, from Bergen, Norway, and whose posts automatically delete after seven days regardless of likes or boosts, because I have autism and say random shit sometimes.
I talk allot about free software, and I use Secureblue, GrapheneOS and Debian as part of my software setup. I also spend a lot of time experimenting with Linux, especially Debian Testing/Sid, GNOME, and KDE.
As an …

Rethinking Knowledge Distillation: A Data Dependent Regulariser With a Negative Asymmetric Payoff
Israel Mason-Williams, Gabryel Mason-Williams, Helen Yannakoudakis
https://arxiv.org/abs/2510.12615

Rethinking Knowledge Distillation: A Data Dependent Regulariser With a Negative Asymmetric Payoff
Knowledge distillation is often considered a compression mechanism when judged on the resulting student's accuracy and loss, yet its functional impact is poorly understood. In this work, we quantify the compression capacity of knowledge distillation and the resulting knowledge transfer from a functional perspective, decoupling compression from architectural reduction, which provides an improved understanding of knowledge distillation. We employ hypothesis testing, controls, and random control d…

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
Nicolas El Maalouly, Kostas Lakis
https://arxiv.org/abs/2510.12552 https://…

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
The Exact Matching (EM) problem asks whether there exists a perfect matching which uses a prescribed number of red edges in a red/blue edge-colored graph. While there exists a randomized polynomial-time algorithm for the problem, only some special cases admit a deterministic one so far, making it a natural candidate for testing the P=RP hypothesis. A polynomial-time equivalent problem, Top-k Perfect Matching (TkPM), asks for a perfect matching maximizing the weight of the $k$ heaviest edges. …

🇺🇦 #NowPlaying on BBCRadio3's #RoundMidnight
The Stan Tracey Quartet:
🎵 Jinks
#TheStanTraceyQuartet
https://open.spotify.com/track/52ABZTKa4XnxMFpeDvqnvI

Mutual Information-Driven Visualization and Clustering for Core KPI Selection in O-RAN Testing
Anish Pradhan, Lingjia Liu, Harpreet S. Dhillon
https://arxiv.org/abs/2510.02696 h…

Mutual Information-Driven Visualization and Clustering for Core KPI Selection in O-RAN Testing
O-RAN testing is becoming increasingly difficult with the exponentially growing number of performance measurements as the system grows more complex, with additional units, interfaces, applications, and possible implementations and configurations. To simplify the testing procedure and improve system design for O-RAN systems, it is important to identify the dependencies among various performance measurements, which are inherently time-series and can be modeled as realizations of random processes.…

Extension of Wald-Wolfowitz Runs Test for Regression Validity Testing with Repeated Measures of Independent Variable
Bo-Yao Lian, Nelson G. Chen
https://arxiv.org/abs/2510.05861

Extension of Wald-Wolfowitz Runs Test for Regression Validity Testing with Repeated Measures of Independent Variable
The Wald-Wolfowitz runs test can assess the correctness of a regression curve fitted to a data set with one independent parameter. The assessment is performed through examination of the residuals, where the signs of the residuals would appear randomly if the regression curve were correct. We propose extending the test to the case where multiple data points were measured for specific independent parameter values. By randomly permutating the data points corresponding to each independent parameter…