Oct 2026· Zenodo (CERN European Organization for Nuclear Research)
Authorship Attribution and Profiling
Abstract
We present The Detect Law, a zero-shot detector of machine-generated text that combines three per-token signals from two small open language models with an exact 32-bit integer sequential decision rule. A base model (Llama-3.2-1B) and its instruction-tuned twin supply a surprise signal (how much more predictable each token is than the base model expects), a contrast signal (how much more the instruction-tuned model prefers the chosen token), and a repetition signal (whether tokens are reused less often than the base model predicts). Each signal is centred and scaled by constants measured on human-written text only; no detector is trained on machine-generated text. The null model gives every human text its own persistent stylistic bias, which keeps a human text's statistic bounded as the text grows, and the decision rule combines a fixed-length end-of-text test with anytime-valid early stopping derived from Ville's inequality, under a design false-positive budget of 1%. The ranking score is the one-sided chi-bar-squared statistic. On the official RAID test set (672,000 texts: 11 generators, 8 domains, 4 decoding settings, 11 adversarial attacks), RAID's evaluation service reports that The Detect Law detects 92.33% of machine-generated text at a 5% false-positive rate without attacks (86.54% at 1%) and 88.99% when attacks are included (AUROC 96.48). This is the highest score among the zero-shot detectors evaluated on RAID; Binoculars, the strongest previous one, scores 78.98% and 69.54%. The detector needs one forward pass of each of two 1.24B-parameter models per token, and it scored the full RAID test set in 5.6 hours on a single NVIDIA A30 GPU.
Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...
O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al.· Zenodo (CERN European Organi...· 465 citations
The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.
Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al.· IEEE Transactions on Softwar...· 178 citations· ⚡14
Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.
M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al.· e-Informatica Software Engin...· 157 citations· ⚡17
This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.
Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al.· Empirical Software Engineeri...· 127 citations· ⚡15
The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.
Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al.· Journal of Systems and Softw...· 111 citations· ⚡8
This study investigates how Lean internal startup facilitates software product innovation in large companies and identifies its enablers and inhibitors, and shows the potential of the method-in-action framework to investigate the Lean startup approach in non-startup context.
Henry Edison, Nina M. Smørsgård, Xiaofeng Wang et al.· Journal of Systems and Softw...· 78 citations· ⚡6
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.