Tootfinder

Die ePetition 179732 an den Bundestag aus dem Bereich Gesetzliche Krankenversicherung - Beiträge mit dem Titel
Gleichstellung geringfügiger, selbständiger Tätigkeiten von Rentnern anlog zu Minijobbern
kann bis zum Mittwoch 16. Juli 2025 01:00 UTC mitgezeichnet werden und lautet
Mit der Petition wird gefordert, geringfügige, selbständige Tätigkeiten von Rentnerinnen und Rentnern mit Tätigkeiten im Rahmen sogenannter Minijobs beitragsrechtlich gleichzustellen.
und wird …

MultiCoSim: A Python-based Multi-Fidelity Co-Simulation Framework
Quinn Thibeault, Giulia Pedrielli
https://arxiv.org/abs/2506.10869 https://

MultiCoSim: A Python-based Multi-Fidelity Co-Simulation Framework
Simulation is a foundational tool for the analysis and testing of cyber-physical systems (CPS), underpinning activities such as algorithm development, runtime monitoring, and system verification. As CPS grow in complexity and scale, particularly in safety-critical and learning-enabled settings, accurate analysis and synthesis increasingly rely on the rapid use of simulation experiments. Because CPS inherently integrate hardware, software, and physical processes, simulation platforms must suppor…

Graph-theoretic Inference for Random Effects in High-dimensional Studies
Lynna Chu, Yichuan Bai
https://arxiv.org/abs/2506.07946 https://

Graph-theoretic Inference for Random Effects in High-dimensional Studies
We study the problem of testing for the presence of random effects in mixed models with high-dimensional fixed effects. To this end, we propose a rank-based graph-theoretic approach to test whether a collection of random effects is zero. Our approach is non-parametric and model-free in the sense that we not require correct specification of the mixed model nor estimation of unknown parameters. Instead, the test statistic evaluates whether incorporating group-level correlation meaningfully improv…

Testing Suffixient Sets
Davide Cenzato, Francisco Olivares, Nicola Prezza
https://arxiv.org/abs/2506.08225 https://arxiv.org/pdf/2506…

Testing Suffixient Sets
Suffixient sets are a novel prefix array (PA) compression technique based on subsampling PA (rather than compressing the entire array like previous techniques used to do): by storing very few entries of PA (in fact, a compressed number of entries), one can prove that pattern matching via binary search is still possible provided that random access is available on the text. In this paper, we tackle the problems of determining whether a given subset of text positions is (1) a suffixient set or (2)…

Improving Deep Learning Framework Testing with Model-Level Metamorphic Testing
Yanzhou Mu, Juan Zhai, Chunrong Fang, Xiang Chen, Zhixiang Cao, Peiran Yang, Kexin Zhao, An Guo, Zhenyu Chen
https://arxiv.org/abs/2507.04354

Improving Deep Learning Framework Testing with Model-Level Metamorphic Testing
Deep learning (DL) frameworks are essential to DL-based software systems, and framework bugs may lead to substantial disasters, thus requiring effective testing. Researchers adopt DL models or single interfaces as test inputs and analyze their execution results to detect bugs. However, floating-point errors, inherent randomness, and the complexity of test inputs make it challenging to analyze execution results effectively, leading to existing methods suffering from a lack of suitable test oracl…

This https://arxiv.org/abs/2504.09567 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Conditional Independence Test Based on Transport Maps
Testing conditional independence between two random vectors given a third is a fundamental and challenging problem in statistics, particularly in multivariate nonparametric settings due to the complexity of conditional structures. We propose a innovative framework for testing conditional independence using transport maps. At the population level, we show that two well-defined transport maps can transform the conditional independence test into an unconditional independence test, this substantial…

Randomization Inference with Sample Attrition
Xinran Li, Peizan Sheng, Zeyang Yu
https://arxiv.org/abs/2507.00795 https://arxiv.org/p…

Randomization Inference with Sample Attrition
Although appealing, randomization inference for treatment effects can suffer from severe size distortion due to sample attrition. We propose new, computationally efficient methods for randomization inference that remain valid under a range of potentially informative missingness mechanisms. We begin by constructing valid p-values for testing sharp null hypotheses, using the worst-case p-value from the Fisher randomization test over all possible imputations of missing outcomes. Leveraging distrib…

Solsmith: Solidity Random Program Generator for Compiler Testing
Lantian Li, Zhihao Liu, Zhongxing Yu
https://arxiv.org/abs/2506.03909 https://

Solsmith: Solidity Random Program Generator for Compiler Testing
Smart contracts are computer programs that run on blockchain platforms, with Solidity being the most widely used language for their development. As blockchain technology advances, smart contracts have become increasingly important across various fields. In order for smart contracts to operate correctly, the correctness of the compiler is particularly crucial. Although some research efforts have been devoted to testing Solidity compilers, they primarily focus on testing methods and do not addres…

This https://arxiv.org/abs/2506.02943 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

A Multi-agent LLM-based JUit Test Generation with Strong Oracles
Unit testing plays a critical role in ensuring software correctness. However, writing unit tests manually is laborious, especially for strong typed languages like Java, motivating the need for automated approaches. Traditional methods primarily rely on search-based or randomized algorithms to generate tests that achieve high code coverage and produce regression oracles, which are derived from the program's current behavior rather than its intended functionality. Recent advances in large languag…

On the Feasibility of Deduplicating Compiler Bugs with Bisection
Xintong Zhou, Zhenyang Xu, Chengnian Sun
https://arxiv.org/abs/2506.23281 https://

On the Feasibility of Deduplicating Compiler Bugs with Bisection
Random testing has proven to be an effective technique for compiler validation. However, the debugging of bugs identified through random testing presents a significant challenge due to the frequent occurrence of duplicate test programs that expose identical compiler bugs. The process to identify duplicates is a practical research problem known as bug deduplication. Prior methodologies for compiler bug deduplication primarily rely on program analysis to extract bug-related features for duplicate…