@article{65146,
  abstract     = {{<jats:title>Abstract</jats:title>
                  <jats:p>We consider Brownian motion with partial resetting, which has recently attracted a lot of attention in physics as well as the mathematics literature. We analyze the speed of convergence of this process towards stationarity as well as its quasistationary behavior. In particular, we prove the existence of a Yaglom limit and hence of a minimal quasistationary distribution. We use these results to study our main topic, namely the process conditioned on staying positive using methods which are well adapted to this specific process. It turns out that this process can be described explicitly as a three‐dimensional Bessel process with partial resetting with the same parameter but a modified resetting rate. This can be interpreted as an effect due to entropic repulsion.</jats:p>}},
  author       = {{Kolb, Martin and Wübker, Achim}},
  issn         = {{0024-6093}},
  journal      = {{Bulletin of the London Mathematical Society}},
  number       = {{3}},
  publisher    = {{Wiley}},
  title        = {{{Brownian Motion With Partial Resetting Conditioned to Stay Positive}}},
  doi          = {{10.1112/blms.70314}},
  volume       = {{58}},
  year         = {{2026}},
}

@article{65139,
  author       = {{Jabr, Wael and Gutt, Dominik and Neumann, Jürgen and Kundisch, Dennis}},
  journal      = {{Information Systems and e-Business Management}},
  title        = {{{Updating at the Expense of Demand? The Case of Platform Apps}}},
  year         = {{2026}},
}

@article{65153,
  author       = {{Butzhammer, Lorenz}},
  issn         = {{0141-6359}},
  journal      = {{Precision Engineering}},
  pages        = {{377--400}},
  publisher    = {{Elsevier BV}},
  title        = {{{Conversion between detector- and rotary-table-related misalignment parameterisations for unified projection-matrix-based geometry calibration in dimensional X-ray computed tomography}}},
  doi          = {{10.1016/j.precisioneng.2026.03.015}},
  volume       = {{100}},
  year         = {{2026}},
}

@article{63721,
  abstract     = {{<jats:p>Defect engineering offers an effective route to tailor the local coordination environment, gas transport and excited-state processes in metal-organic frameworks (MOFs). We establish a quantitative structure-property relationship linking defect-modulated porosity...</jats:p>}},
  author       = {{Zhao, Zhenyu and Tiemann, Michael}},
  issn         = {{2050-7526}},
  journal      = {{Journal of Materials Chemistry C}},
  pages        = {{4743--4752}},
  publisher    = {{Royal Society of Chemistry (RSC)}},
  title        = {{{Defect Structure-Performance Correlation in Eu³⁺@UiO-66: Design of Coordination Sites for Rapid Optical O₂ Sensing}}},
  doi          = {{10.1039/d5tc04319k}},
  volume       = {{14}},
  year         = {{2026}},
}

@article{65105,
  author       = {{zur Heiden, Philipp and Halimeh, Haya and Hansmeier, Philipp and Vorbohle, Christian and Althaus, Maike and Beverungen, Daniel and Kundisch, Dennis and Müller, Oliver}},
  journal      = {{Communications of the Association for Information Systems}},
  title        = {{{Data Spaces for Heterogeneous Data Ecosystems – Findings from a Design Study in the Cultural Sector}}},
  year         = {{2026}},
}

@inproceedings{65178,
  abstract     = {{Large intermediate results can cause join queries to run unexpectedly long. This problem is particularly common for analytical queries, which aggregate data over many tables to produce a comparatively small final output, and queries on graph data, where intermediate results blow up quickly. Recent work inspired by Yannakakis’ algorithm approaches this by modifying the query engine to avoid materializing unnecessary tuples. However, this requires significant changes to the core of the system, which is not feasible in many situations such as cloud environments or proprietary systems.
In this work, we propose a flexible approach for optimizing long-running join queries from the outside of the DBMS. Rewriting-based realizations of Yannakakis’ algorithm suffer from inherent overhead due to the creation of intermediate tables. Thus, we present an approach for detecting and targeting queries which would benefit from a Yannakakis-style optimization. We introduce a new benchmark combining 5 standard benchmarks and augmenting them with additional instances, which provides a sufficient size and diversity for a machine learning based solution. On PostgreSQL, DuckDB and SparkSQL, slowdowns on queries where the rewriting is counterproductive are mostly avoided, as opposed to a naïve application of the rewriting, and we observe significant improvements in end-to-end runtimes over standard query execution and unconditional rewriting.}},
  author       = {{Böhm, Daniela and Gottlob, Georg and Lanzinger, Matthias and Longo, Davide Mario and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander}},
  booktitle    = {{Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)}},
  keywords     = {{Join Queries, Acyclic Queries, Query Processing}},
  title        = {{{Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains}}},
  year         = {{2026}},
}

@article{65179,
  author       = {{Fuchs, Christian}},
  journal      = {{tripleC: Communication, Capitalism & Critique}},
  number       = {{1}},
  pages        = {{54--72}},
  title        = {{{Reason and Communication: Jürgen Habermas’s Legacy for Media and Communication Studies}}},
  doi          = {{10.31269/7112an90}},
  volume       = {{24}},
  year         = {{2026}},
}

@techreport{65180,
  author       = {{Terfloth, Lutz and Buhl, Heike M. and Lohmer, Vivien and Schaffer, Michael and Kern, Frederike and Schulte, Carsten}},
  title        = {{{Bridging the Dual Nature: How Integrated Explanations Enhance Understanding of Technical Artifacts}}},
  year         = {{2026}},
}

@unpublished{61151,
  abstract     = {{In this paper, we discuss the application of retrospective video recall for the assessment of cognitive processes in explanatory interactions, such as understanding and mental models. Our purpose is to reflect on the benefits and limitations of video recall compared to another self-report method, ‘thinking-aloud’. To do so, we reveal empirical results from the application of video recall in three interdisciplinary research projects that applied the method for the qualitative and quantitative assessment of cognitive and behavioral phenomena in everyday explanations. In all three projects, video recall was applied as a post-hoc procedure following the recording of dyadic face-to-face explanations of board games. The design of the video recall procedure differed between individual projects because they pursued different research objectives – that is the investigation of (1) an interlocutor's multimodal signals of understanding, (2) the change in assumptions about an interlocutor's dispositional and situational knowledge, and (3) the differentiated assessment of an interlocutor's developing understanding of domain knowledge aspects by distinguishing between mechanistic and functional explanatory stances. By discussing the benefits and the limitations of each procedure, this article provides critical reflections on video recall as a versatile research method applied for the analysis of human multimodal behavior in interaction and cognitive processing.}},
  author       = {{Lazarov, Stefan Teodorov and Schaffer, Michael and Gladow, Viviane and Buschmeier, Hendrik and Buhl, Heike M. and Grimminger, Angela}},
  pages        = {{29}},
  title        = {{{Retrospective video recall for analyzing cognitive processes in naturalistic explanations}}},
  year         = {{2026}},
}

@article{65182,
  abstract     = {{<jats:p>The aggregation of rating metrics in reputation systems is crucial for mitigating information overload by condensing customer rating distributions into singular valence scores. While platforms typically employ technical aggregation functions, such as the arithmetic mean to capture product quality, it remains unclear whether these functions align with customers' innate aggregation patterns. To address this knowledge gap, we designed a controlled economic decision experiment to elicit customers' aggregation principles by analyzing their product ranking decisions and contrasting these with various reference functions. Our findings indicate that, on average, customers aggregate rating information in accordance with the arithmetic mean. However, a granular analysis at the individual level reveals significant heterogeneity in aggregation behavior, with a substantial cluster exhibiting binary patterns that focus equally on negative (1-2 star) and positive (4-5 star) ratings. Additional clusters concentrate on negative feedback, particularly 1-star ratings or 1-2 star ratings collectively. Notably, these inherent aggregation patterns exhibit stability across variations in numerical information presentation and are not significantly influenced by individual characteristics, such as online shopping experience, risk attitudes, or demographics. These findings suggest that while the arithmetic mean captures average consumer behavior, platforms could benefit from offering customizable aggregation options to better cater to diverse user preferences for processing rating distributions. By doing so, platforms can enhance the effectiveness of their reputation systems and improve the overall quality of decision-making for consumers.</jats:p>}},
  author       = {{van Straaten, Dirk and Mir Djawadi, Behnud and Melnikov, Vitalik and Hüllermeier, Eyke and Fahr, René}},
  journal      = {{SSRN Electronic Journal}},
  publisher    = {{Elsevier BV}},
  title        = {{{Aggregation Processes in Customer Rating Systems - Insights from an Economic Decision Experiment}}},
  doi          = {{http://dx.doi.org/10.2139/ssrn.6201258}},
  year         = {{2026}},
}

@article{65181,
  abstract     = {{<jats:p>In many Western societies, mass immigration has been one of the most divisive policy issues in recent years. Seemingly moderate inflows of migrants can have substantial demographic consequences in the long run, due to (1) higher fertility of the migrant population, (2) its younger age distribution, and (3) the possibility of family reunification. Yet, demography hardly appears in the policy debate, even in media outlets that are critical of mass immigration. This may indicate that the mechanics of population dynamics are not widely understood. We design a laboratory experiment in which we confront subjects with 30 different migration scenarios. Subjects have to decide when to stop a given inflow of migrants to achieve a target share of migrants after 60 years. In line with all our pre-registered hypotheses, in scenarios that contain elements of usual mass immigration the growth of the migrant population is systematically underestimated. This bias is even stronger in scenarios that closely resemble the German situation since the opening of the borders during the 2015 refugee crisis.</jats:p>}},
  author       = {{Abbink, Klaus and Mir Djawadi, Behnud}},
  journal      = {{SSRN Electronic Journal}},
  publisher    = {{Elsevier BV}},
  title        = {{{Migration and Long-Term Demographic Change: Can We Control the Numbers?}}},
  doi          = {{http://dx.doi.org/10.2139/ssrn.6343618}},
  year         = {{2026}},
}

@article{63910,
  author       = {{Mir Djawadi, Behnud}},
  journal      = {{SSRN Electronic Journal}},
  publisher    = {{Elsevier BV}},
  title        = {{{Dishonesty of Parents and Children – Evidence from a Field Experiment}}},
  doi          = {{http://dx.doi.org/10.2139/ssrn.6121987}},
  year         = {{2026}},
}

@article{64863,
  abstract     = {{Traditional dyadic customer-provider interactions are being shifted to polyadic interactions involving diverse participants in digital service ecosystems. Especially, artificial intelligence (AI) is increasingly integrated into these ecosystems, so that they comprise non-human participants (e.g., AI-based chatbots)—fundamentally altering the nature of value (co-)creation. While existing literature examines human-to-human interactions, knowledge of service interactions between human actors and AI-based systems is still underexplored. To address this research gap, we develop a taxonomy, comprising six iterations, that explores the peculiarities of AI as either a resource or a (non-human) agent in digital service ecosystems. We evaluate our taxonomy using a multiple case study and derive the four archetypes of AI in digital service ecosystems: (1) discriminative experience enhancer, (2) protective ecosystem orchestrator, (3) ecosystem innovation companion, and (4) personalized service composer. Our results extend the knowledge on service science by showing how AI-based systems—discriminative or generative, and focusing on the interaction in the ecosystem or the individual service encounter—assume the role of resources and non-human agents. Researchers and practitioners can utilize our results to augment their ecosystems with AI.</jats:p>}},
  author       = {{Hansmeier, Philipp and Schäfer, Jannika Marie and zur Heiden, Philipp}},
  issn         = {{1019-6781}},
  journal      = {{Electronic Markets}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Artificial intelligence in digital service ecosystems—Towards a taxonomy and archetypes}}},
  doi          = {{10.1007/s12525-026-00879-y}},
  volume       = {{36}},
  year         = {{2026}},
}

@article{65120,
  abstract     = {{The governance of emerging technologies with increased autonomy in the military has become a topical issue in recent years, especially considering the rapid advances in artificial intelligence and related innovations in computer science. Despite this hype, the postcolonial subject’s position has been seen as secondary, often associated with victimhood or obscurity. By shifting the narrative to highlight the postcolonial subject’s agency—not only in providing real-world examples of artificial intelligence use in the military but also in knowledge creation and shaping the discourse on governance within the international, this paper contributes to an area of research that is often overlooked. The paper unpacks the norm-making efforts of postcolonial subjects regarding emerging military technologies. In doing this, the paper aims to advance postcolonial theory by showing how the dynamics of governing emerging military technologies intertwine with postcolonial subjectivity and to broaden the academic discussion on the governance of emerging military technologies and algorithmic violence, which has so far been dominated by Western or universalistic discourse.}},
  author       = {{Bhila, Ishmael}},
  issn         = {{2730-5953}},
  journal      = {{AI and Ethics}},
  number       = {{2}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Decentring the governance of AI in the military: a focus on the postcolonial subject}}},
  doi          = {{10.1007/s43681-026-01090-7}},
  volume       = {{6}},
  year         = {{2026}},
}

@inproceedings{65206,
  author       = {{Homt, Martina}},
  location     = {{München}},
  title        = {{{Praxisschock oder Kohärenz? – Retrospektive Einschätzungen von Berufseinsteiger*innen zu den Phasen der Lehrkräftebildung}}},
  year         = {{2026}},
}

@inproceedings{65225,
  author       = {{Tölle, Laura and Rose, Robert and Trier, Matthias}},
  location     = {{Montreal, Canada}},
  title        = {{{Behind the Mask: Investigating the Influence of Pseudonymity on Polarization Dynamics in Social Virtual Reality}}},
  year         = {{2026}},
}

@inproceedings{65226,
  author       = {{Tölle, Laura and Trier, Matthias}},
  location     = {{Montreal, Canada}},
  title        = {{{Social Support and Emotional Expression – Exploring Online Community Polarization Dynamics: The Case of Borussia Dortmund}}},
  year         = {{2026}},
}

@inproceedings{65228,
  author       = {{Tölle, Laura and Rehmer, Torben and Ruppel, Fynn and Müller, Johann and Trier, Matthias}},
  location     = {{Gothenburg, Sweden}},
  title        = {{{Content Themes and Self-Presentation of Virtual Influencers}}},
  year         = {{2026}},
}

@article{57580,
  abstract     = {{We investigate dispersive and Strichartz estimates for the Schrödinger equation involving the fractional Laplacian in real hyperbolic spaces and their discrete analogues, homogeneous trees. Due to the Knapp phenomenon, the Strichartz estimates on Euclidean spaces for the fractional Laplacian exhibit loss of derivatives. A similar phenomenon appears on real hyperbolic spaces. However, such a loss disappears on homogeneous trees, due to the triviality of the estimates for small times.}},
  author       = {{Palmirotta, Guendalina and Sire, Yannick and Anker, Jean-Philippe}},
  journal      = {{Journal of Differential Equations}},
  keywords     = {{Schrödinger equation, Fractional Laplacian, Dispersive estimates, Strichartz estimates, Real hyperbolic spaces, Homogeneous trees}},
  publisher    = {{Elsevier}},
  title        = {{{The Schrödinger equation with fractional Laplacian on hyperbolic spaces and homogeneous trees}}},
  doi          = {{10.1016/j.jde.2025.114065}},
  year         = {{2026}},
}

@unpublished{65232,
  abstract     = {{On finite regular graphs, we construct Patterson-Sullivan distributions associated with eigenfunctions of the discrete Laplace operator via their boundary values on the phase space. These distributions are closely related to Wigner distributions defined via a pseudo-differential calculus on graphs, which appear naturally in the study of quantum chaos. Using a pairing formula, we prove that Patterson-Sullivan distributions are also related to invariant Ruelle distributions arising from the transfer operator of the geodesic flow on the shift space. Both relationships provide discrete analogues of results for compact hyperbolic surfaces obtained by Anantharaman-Zelditch and by Guillarmou-Hilgert-Weich.}},
  author       = {{Arends, Christian and Palmirotta, Guendalina}},
  booktitle    = {{arXiv:2603.09779}},
  pages        = {{38}},
  title        = {{{Patterson-Sullivan distributions of finite regular graphs}}},
  year         = {{2026}},
}

