Research works

The research papers we track — the newest first. Works with a plain-language summary link to it.

138318 work(s)

  • Society & EconomicsOpen access

    Non-take-up of unemployment benefit II in Germany: a longitudinal perspective using administrative data

    Many households eligible for means-tested benefits do not claim them. While most empirical models of benefit non-take-up use only contemporaneous covariates, this paper links the German Panel Study Labour Market and Social Security to administrative records, which provide househo...

    Journal for Labour Market Research2026-10-060 citationsDOI
  • Physics & SpaceOpen access

    Coherent terahertz control of metastable magnetization in FePS3

    Abstract Driving specific lattice modes with ultrafast stimuli offers a dynamic route for tailoring material properties out of equilibrium. However, achieving dynamic coherent control of the nonequilibrium phases via resonant excitation of lattice coherences remains largely unexp...

    Nature Communications2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Antichains for Concurrent Parameterized Games

    Concurrent parameterized games involve a fixed yet arbitrary number of players. They are described by finite arenas in which the edges are labeled with languages that describe the possible move combinations leading from one vertex to another (n players yield a word of length n)....

    Electronic Proceedings in Theoretical Computer Science2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Rigidity of complete Kähler–Einstein metrics under cscK perturbations

    In this paper, we study constant scalar curvature Kähler (cscK) metrics on complete non-compact Kähler–Einstein manifolds. We give sufficient conditions under which a cscK perturbation of a Kähler–Einstein metric must remain Kähler–Einstein. As a model case, we prove that the Ber...

    Differential Geometry and its Applications2026-10-060 citationsDOI
  • AI & ComputingOpen access

    A Transfer Learning Framework for Multilayer Networks via Model Averaging

    Link prediction in multilayer networks is a key challenge in applications such as recommendation systems and protein-protein interaction prediction. While many techniques have been developed, most rely on assumptions about shared structures and require access to raw auxiliary dat...

    Journal of the American Statistical Association2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Plug-and-Play Dramaturge: A Divide-and-Conquer Approach for Iterative Narrative Script Refinement via Collaborative LLM Agents

    Although LLMs have been widely adopted for creative content generation, a single-pass process often struggles to produce high-quality long narratives. How to effectively revise and improve long narrative scripts like scriptwriters remains a significant challenge, as it demands a...

    ACM Transactions on Intelligent Systems and Technology2026-10-060 citationsDOI
  • Engineering & TechnologyOpen access

    Overlapping Schwarz Scheme for Linear-Quadratic Programs in Continuous Time

    We present an optimize-then-discretize framework for solving linear-quadratic optimal control problems (OCPs) governed by time-inhomogeneous ordinary differential equations. Our method employs a modified overlapping Schwarz decomposition based on the Pontryagin Minimum Principle,...

    Mathematics of Operations Research2026-10-060 citationsDOI
  • Physics & SpaceOpen access

    Resonance density range governs two-plasmon decay saturation and enables hot-electron prediction in inertial confinement fusion

    The saturation level of parametric instabilities is critical in determining their impact on fusion plasmas. We identify the resonance density range of two-plasmon decay as the critical parameter governing nonlinear saturation of ion density fluctuations and Langmuir waves, which...

    Matter and Radiation at Extremes2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Limits to black-box amplification in QMA

    We study the limitations of black-box amplification in the quantum complexity class Q M A . Amplification is known to boost any inverse-polynomial gap between completeness and soundness to exponentially small error, and a recent result (Jeffery and Witteveen, 2025) shows that com...

    Quantum2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Faithful Universal Graphs for Minor-Closed Classes

    Abstract. It was proved by Huynh et al. [ Universality in Minor-Closed Graph Classes, preprint, arXiv:2109.00327, 2021] that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We prove a finite, quantitative version of this res...

    SIAM Journal on Discrete Mathematics2026-10-060 citationsDOI
  • AI & ComputingOpen access

    A note on toric ideals of graphs and Knutson-Miller-Yong Decompositions

    We use a Gröbner basis technique first introduced by Knutson, Miller and Yong to study the interplay between properties of a graph [Formula: see text] and algebraic properties of the toric ideal that it defines. We first recover a well-known height formula for the toric ideal of...

    Journal of Algebra and Its Applications2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Fair distributed machine learning with imbalanced data as a Stackelberg evolutionary game

    Abstract Decentralised machine learning systems trained on heterogeneous and imbalanced data face a fundamental tension between predictive performance and equitable contribution across participating nodes. Here, we introduce two contribution-weighting mechanisms inspired by the p...

    Scientific Reports2026-10-060 citationsDOI
  • AI & ComputingOpen access

    A variable smoothing for weakly convex composite minimization with manifold constraint via parametrization

    Abstract In this paper, we address a manifold constrained nonsmooth optimization problem involving the composition of a weakly convex function and a smooth mapping under the availability of a parametrization of the manifold. To find a stationary point of the target problem, we pr...

    Computational Optimization and Applications2026-10-060 citationsDOI
  • Society & EconomicsOpen access

    Advancing object-centric process mining with multi-dimensional data operations

    Abstract Analyzing process data at varying levels of granularity is important to derive actionable insights and support informed decision-making. Object-Centric Event Data (OCED) enhance process mining by capturing interactions among events and multiple objects, leading to the di...

    Knowledge and Information Systems2026-10-060 citationsDOI
  • AI & ComputingOpen access

    New quantitative unique continuation result for elliptic equations

    We prove a new quantitative unique continuation result for elliptic equations from Cauchy data. We provide a simple and direct proof based only on a Carleman inequality. Similar result for the Stokes equation is also shown.

    Partial Differential Equations and Applications2026-10-060 citationsDOI
  • AI & ComputingOpen access

    On Fourier asymptotics and effective equidistribution

    Abstract We prove effective equidistribution of expanding horocycles in the space SL 2 ⁢ ( Z ) \ SL 2 ⁢ ( R ) \mathrm{SL}_{2}(\mathbb{Z})\backslash\mathrm{SL}_{2}(\mathbb{R}) with respect to various classes of Borel probability measures on ℝ having certain Fourier asymptotics. Ou...

    Journal für die reine und angewandte Mathematik (Crelles Journal)2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Bernoulli amputation

    A novel, stochastic approach to amputation, the process of introducing missing values to a complete dataset, is presented. It allows one to construct a wide variety of missingness patterns by only having to specify distributions of missingness indicators as opposed to specifying...

    The American Statistician2026-10-060 citationsDOI
  • AI & ComputingOpen access

    A note on test elements for monomorphisms of free groups

    A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the Whitehead graph and the action of the free...

    journal of Groups complexity cryptology2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Construction of signed distance functions through an elliptic equation

    Motivated by recent advances in structural optimization, we propose a novel method for constructing the distance function to the boundary of a given domain. Building on and extending the celebrated Varadhan asymptotic theory, our approach reformulates the governing equation into...

    Journal of the Mathematical Society of Japan2026-10-060 citationsDOI
  • AI & ComputingOpen access

    Learning Quantum Hamiltonians at Any Temperature in Polynomial Time

    Abstract. We study the problem of learning a local quantum Hamiltonian [Formula: see text] given copies of its Gibbs state [Formula: see text] at a known inverse temperature [Formula: see text]. Anshu et al. [2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pp....

    SIAM Journal on Computing2026-10-060 citationsDOI