@inproceedings{65524, author = {{Margraf, Linda and Krause, Daniel and Maurer, Lisa Katharina and Weigelt, Matthias}}, location = {{Kobe, Japan}}, pages = {{224--225}}, title = {{{Effects of feedback delay duration on neural processing of valence-dependent augmented feedback during motor practice}}}, year = {{2026}}, } @inbook{65543, author = {{Öhlschläger, Claudia}}, booktitle = {{Erzählen zwischen gestern und morgen: Nora Bossong. Paderborn, Wintersemester 2024/25}}, editor = {{Eke, Norbert Otto and Elit, Stefan}}, pages = {{209--223}}, publisher = {{Aisthesis}}, title = {{{"Die Geschmeidigen". Was wir aus Nora Bossongs politischem Essay über Timon Karl Kaleytas Roman "Die Geschichte eines einfachen Mannes" lernen können}}}, volume = {{43}}, year = {{2026}}, } @inproceedings{61777, abstract = {{Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements on logarithmically many copies of rho in the size of P. In this work, we initiate the study of verification of classical shadows, denoted classical shadow validity (CSV), from the perspective of computational complexity, which asks: Given a classical shadow S, how hard is it to verify that S predicts the measurement statistics of a quantum state? We show that even for the elegantly simple classical shadow protocol of [Huang, Kueng, Preskill, Nature Physics 2020] utilizing local Clifford measurements, CSV is QMA-complete. This hardness continues to hold for the high-dimensional extension of said protocol due to [Mao, Yi, and Zhu, PRL 2025]. Among other results, we also show that CSV for exponentially many observables is complete for a quantum generalization of the second level of the polynomial hierarchy, yielding the first natural complete problem for such a class.}}, author = {{Karaiskos, Georgios and Rudolph, Dorian and Meyer, Johannes Jakob and Eisert, Jens and Gharibian, Sevag}}, booktitle = {{International Colloquium on Automata, Languages, and Programming (ICALP)}}, title = {{{How hard is it to verify a classical shadow?}}}, year = {{2026}}, } @article{65542, author = {{Hartung, Olaf}}, issn = {{2196-8292}}, journal = {{Zeitschrift für Geschichtsdidaktik}}, publisher = {{Konferenz für Geschihctsdidaktik}}, title = {{{‚Die Zeichen der Zeiten deuten lernen‘ – Die Zeichengebundenheit historischer Bildung in und von Geschichtskultur(en)}}}, volume = {{25}}, year = {{2026}}, } @inbook{65539, author = {{Bröker, Christina}}, booktitle = {{Thirteenth Century England XIX Proceedings of the Heidelberg Conference, 2023}}, editor = {{Peltzer, Jörg and Vincent, Nicholas}}, title = {{{Writing the Anger of Emperor Frederick II in England: Matthew Paris’ Construction of the Emotions of a Foreign Ruler}}}, year = {{2026}}, } @article{65545, abstract = {{ABSTRACT Ligation of staple strands in DNA origami nanostructures (DONs) can yield enhanced structural stability in critical environments. This process can be viewed as performing hundreds of parallel reactions programmed on a self‐assembled nanoscale platform. While previous studies have focused on investigating the collective results of the chemical or enzymatic ligation reactions, herein, the global quantitative analysis of individual ligation reactions is achieved using quantitative PCR (qPCR). By mapping enzymatic ligation efficiency on a trapezoidal substructure representing one‐third of a triangular DON, ligation is shown to preferentially occur at the trapezoid edges rather than at inner sites. Excellent agreement between the experimental ligation yields and docking simulations suggests that this is a result of variations in the ligase docking probability. Ligation products involving more than two consecutive sequences can be generated with each enzyme‐catalyzed reaction as an independent event. Interestingly, the sharp contrast between the edges vs. the inner sites has been abolished by changing the reaction conditions and performing the ligation in a DMSO co‐solvent system. This analytic method provides unprecedented insight into the multiple ligation reactions occurring in parallel within complex DONs and will be an invaluable tool in the translation of DONs from the lab to real‐world applications.}}, author = {{Hacker, Konrad and Juricke, Emilia and Münch, Carolin and Suma, Antonio and Keller, Adrian Clemens and Zhang, Yixin}}, issn = {{1613-6810}}, journal = {{Small}}, publisher = {{Wiley}}, title = {{{Global Quantitative Analysis of Ligation Reactions in Self‐Assembled DNA Nanostructures at the Single‐Nick Level}}}, doi = {{10.1002/smll.202508136}}, year = {{2026}}, } @unpublished{65544, author = {{Knauff, Markus and Butz, Martin V. and Kaup, Barbara and Kunde, Wilfried and Scharlau, Ingrid}}, booktitle = {{psyarxiv}}, keywords = {{explainability, explanation, prediction}}, pages = {{18}}, publisher = {{OSF}}, title = {{{When prediction replaces explanation: A threat to psychological science }}}, year = {{2026}}, } @inproceedings{65547, abstract = {{Process mining proved to be valuable for enabling transparency in business processes and to help to manage the everyday process dynamics. But what about the dynamics of a process mining project itself. In this paper, we present insights of a process mining introduction project spanning two years. For that we analyze the logs of the process mining platform supported by interviews of the developers and participants as part of our case study research. Based on this, our findings indicate four actions that impact a successful process mining project and the underlying dynamics. (1) Two development phases in a test and productive environment can lead to data driven process improvements. (2) Maintenance and the associated technical debt can cause process drift. (3) Scope creep of the project is easily identifiable in such logs and hinders the complete process mining initiative and (4) a sufficient user base and constant interaction with allows for bottom up process change. These results provide quantitative insights into the development and adoption cycles of the software and the direct impact on the processes as well as the business process management initiative. From this initial analysis researchers can benefit from first insights into the quantitative side of a process mining project and our categorization of the findings. Practitioners can use the findings as a blueprint or source for improvements to their process mining projects.}}, author = {{Skolik, Alexander Marcus and Löhr, Bernd}}, booktitle = {{Business Process Management Workshops}}, editor = {{van de Weerd, Inge and Estrada Torres, Bedilia and van der Aa, Han}}, isbn = {{978-3-032-13426-4}}, pages = {{288–299}}, publisher = {{Springer Nature Switzerland}}, title = {{{Understanding the Dynamics of a Process Mining Project Analyzing Log Data of a Process Mining Platform}}}, year = {{2026}}, } @inproceedings{65548, abstract = {{Developing Robotic Process Automation bots involves a wide range of skill sets. Besides insights from business process management, software development knowledge like systems interaction and network knowledge is required. For a well functioning process automation these different skill sets must be combined. In a design science research study, concepts from business process management, software development, and best practices are combined to design an actionable development method for RPA. The resulting PM2RPA method structures the development process in four stages: pre-Development, design, development and operations. Within these four stages, 14 activities support product owners, developers, and process experts over the course of the development process. The PM2RPA Method is demonstrated in an environment characterized by frequently changing business processes and heavy resource restrictions due to a lack of skilled workers. The PM2RPA method allows process-driven development while focusing on systems integration and reporting, resulting in a structured and comprehensive method for developing RPA bots. Practitioners can use this method to manage their automation projects. At the same time, researchers benefit from a baseline method aiming to address methodological research challenges and early insights into wider operational strategies for RPA.}}, author = {{Skolik, Alexander Marcus}}, booktitle = {{Business Process Management Workshops}}, editor = {{van de Weerd, Inge and Estrada Torres, Bedilia and van der Aa, Han}}, isbn = {{978-3-032-13426-4}}, pages = {{171–186}}, publisher = {{Springer Nature Switzerland}}, title = {{{Towards an Actionable Development Method for Robotic Process Automation Using Process Mining}}}, year = {{2026}}, } @inbook{65549, author = {{Grimminger-Seidensticker, Elke and Ehrlenspiel, Felix and Hepperle, Lisa}}, booktitle = {{Schulsport. Transdisziplinäre Erkenntnisse und Implikationen für die Praxis}}, editor = {{Halberschmidt, Barbara and Leineweber, Helga}}, pages = {{212--227}}, publisher = {{Hogrefe}}, title = {{{Negative Emotionen im Sportunterricht}}}, year = {{2026}}, } @unpublished{65546, abstract = {{In this paper we study a variant of the uncentred Hardy--Littlewood maximal operator on Damek--Ricci spaces in which balls are replaced by suitable half balls. Perhaps surprisingly, such modified maximal operator has better boundedness properties than the classical one. In particular, it satisfies an $L\log L$ endpoint estimate and it is bounded on $L^p$ for every $p$ in $(1,\infty]$.}}, author = {{Chalmoukis, Nikolaos and Meda, Stefano and Papageorgiou, Effie and Santagati, Federico}}, booktitle = {{arXiv:2604.27839}}, title = {{{Uncentred maximal operators with respect to half balls on Damek--Ricci spaces}}}, year = {{2026}}, } @misc{64266, author = {{Papageorgiou, Effie and Trojan, Bartosz}}, booktitle = {{Mathematische Annalen}}, number = {{30}}, title = {{{Mass Functions and Asymptotic Behavior of Caloric Functions on Affine Buildings}}}, volume = {{395}}, year = {{2026}}, } @article{65555, abstract = {{ Motivation and Objectives. Computational Thinking (CT) has become a central theme in K–12 Computer Science education. Over the past twenty years, multiple conceptualizations of CT have emerged, many forming the basis for assessment instruments. One such conceptualization was developed for the large-scale International Computer and Information Literacy Study (ICILS), which assessed CT across 24 countries using representative sampling. The size and sampling quality of the ICILS data set allow for robust statistical analyses which in turn will be of interest to researchers and policy-makers alike. This study situates the ICILS 2023 conceptualization of CT within other established frameworks and conducts a secondary analysis of the ICILS 2023 CT data on non-cognitive antecedents and processes. Methods . Structured deductive content analyses compare the ICILS 2023 items with those from the Bebras Challenge on Informatics and Computational Thinking [13] ( Bebras ) and the Computational Thinking Test [55]) ( CTt ), mapped across three CT frameworks—ICILS [28], Shute et al. [65] and Weintrop et al. [71]—and aligned with Bloom's revised taxonomy [2]. Linear regression analyses on the data of the 20 educational contexts that provided not only CT performance data but also a complete coverage of student data relative to the predictors of CT performance studied in prior work examine the predictive effect of non-cognitive factors on CT performance. Results . The qualitative analyses showed that the ICILS 2023 CT items can be mapped to existing frameworks. Conversely, items from both Bebras and CTt can be mapped to the ICILS framework. The distinct, partially overlapping profiles of the instruments across the frameworks as well as Bloom's taxonomy indicate that they are complementary in assessing CT, confirming and expanding prior comparisons of Bebras and CTt . The regression analyses indicate no single dominant predictor of CT performance. The association of socio-economic status, gender, or the home language was consistent with prior findings, predictors related to learning processes, however, vary across educational contexts. Discussion . Our results demonstrate that ICILS 2023 items can be mapped onto multiple established CT frameworks, supporting their broader validity and utility for comparative research. The findings of the regression analysis underscore the complex interplay of non-cognitive factors affecting CT and illustrate the significance of contextual interpretation within educational systems. }}, author = {{Vahrenhold, Jan and Niemann, Jan and Drossel, Kerstin}}, issn = {{1946-6226}}, journal = {{ACM Transactions on Computing Education}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Computational Thinking in ICILS 2023: Analyzing the Construct and Its Antecedent- and Process-Level Predictors}}}, doi = {{10.1145/3813115}}, year = {{2026}}, } @article{65554, abstract = {{Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction, while supporting not only contractible but also incontractible loops on the boundaries of manifold objects of higher genus and arbitrary non‐trivial topology. We describe an implementation of this algorithm in the discrete setting, with triangle mesh cut surfaces embedded in tetrahedral mesh objects. Making use of this novel cutting algorithm, we describe a method for the reliable construction of bijective volumetric maps between solid objects, demonstrating the algorithm's utility. This mapping method overcomes restrictions of the state of the art to topological balls, extending coverage to objects of arbitrary genus, specifically so‐called 1 ‐handlebodies. }}, author = {{Hinderink, Steffen and Campen, Marcel}}, issn = {{0167-7055}}, journal = {{Computer Graphics Forum}}, publisher = {{Wiley}}, title = {{{DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping}}}, doi = {{10.1111/cgf.70379}}, year = {{2026}}, } @article{65553, author = {{Golebiowska, Sandra Alicja and Meinderink, Dennis and Ebbert, Christoph and Kollmann, Sabrina and Neßlinger, Vanessa and Grundmeier, Guido}}, issn = {{0143-7496}}, journal = {{International Journal of Adhesion and Adhesives}}, publisher = {{Elsevier BV}}, title = {{{Two-electrode electrochemical impedance spectroscopy at polymer/oxide interfaces}}}, doi = {{10.1016/j.ijadhadh.2026.104360}}, volume = {{149}}, year = {{2026}}, } @inbook{65550, abstract = {{

We explain how to construct a uniformly random cubic integral domain S S of given signature with | d i s c ( S ) | ≤ T \lvert disc(S)\rvert \leq T in expected time \widetilde \mathcal {O}(\log T) .

}}, author = {{Gundlach, Fabian}}, booktitle = {{Contemporary Mathematics}}, isbn = {{9781470485702}}, issn = {{0271-4132}}, publisher = {{American Mathematical Society}}, title = {{{Sampling cubic rings}}}, doi = {{10.1090/conm/840/16804}}, year = {{2026}}, } @article{65565, abstract = {{Abstract Gaze behavior, being continuously accessible to interlocutors in face-to-face interactions, serves as a cue for managing turn-taking, regulating the duration of topical sequences, and supporting cognitive processing in various everyday conversational contexts. The present study seeks to enhance the understanding of the relation between two forms of interactive gaze behavior – gaze aversions and mutual gaze – and the topical development in the explanatory discourse. To do so, we analyzed 24 dyadic board game explanations in which one explainer subsequently explained a board game to three different explainees while the board game was physically absent from the shared space. The main objective of the present study was to investigate the relation of gaze aversions and mutual gaze to the topical development of explanations. For this, based on previous research (Lazarov et al., 2024; Rossano, 2012) we hypothesized that (1) gaze aversions are more likely to be associated with topic changes than topic continuations, and that (2) mutual gaze is more likely to be associated with topic continuations than topic changes. In addition, we explored how the two forms of gaze behavior are related to the interlocutor who initiates a topic change or continuation. Our proportional analysis using a Generalized linear mixed effects model revealed that gaze aversions are related to topic changes initiated by both interlocutors. In contrast, the analysis did not reveal a significant relation between mutual gaze and topic continuations, which could be explained by the feedback elicitation function of mutual gaze at the end of speakers’ utterances (Bavelas et al., 2002; Brône et al., 2017; Kendon, 1967) while monitoring the addressees’ understanding (Clark & Krych, 2004) and the complexity of the analyzed fixed and random effects.}}, author = {{Lazarov, Stefan Teodorov and Grimminger, Angela}}, issn = {{0191-5886}}, journal = {{Journal of Nonverbal Behavior}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{How are Gaze Aversions and Mutual Gaze Related to the Topical Development of Dyadic Explanatory Interactions?}}}, doi = {{10.1007/s10919-026-00512-8}}, year = {{2026}}, } @inproceedings{65566, author = {{Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}}, editor = {{Haak, Anselm}}, location = {{Lisbon}}, title = {{{ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics}}}, year = {{2026}}, } @inproceedings{65567, abstract = {{We introduce the notion of contrastive ABox explanations to answer questions of the type “Why is a an instance of C, but b is not?”. While there are various approaches for explaining positive entailments (why is C(a) entailed by the knowledge base) as well as missing entailments (why is C(b) not entailed) in isolation, contrastive explanations consider both at the same time, which allows them to focus on the relevant commonalities and differences between a and b. We develop an appropriate notion of contrastive explanations for the special case of ABox reasoning with description logic ontologies, and analyze the computational complexity for different variants under different optimality criteria, considering lightweight as well as more expressive description logics. We implemented a first method for computing one variant of contrastive explanations, and evaluated it on generated problems for realistic knowledge bases.}}, author = {{Koopmann, Patrick and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille and Tiwari, Balram}}, booktitle = {{Proceedings of the AAAI Conference on Artificial Intelligence}}, issn = {{2374-3468}}, number = {{23}}, pages = {{19189--19197}}, publisher = {{Association for the Advancement of Artificial Intelligence (AAAI)}}, title = {{{Can You Tell the Difference? Contrastive Explanations for ABox Entailments}}}, doi = {{10.1609/aaai.v40i23.38993}}, volume = {{40}}, year = {{2026}}, } @inbook{44862, author = {{Peckhaus, Volker}}, booktitle = {{New Perspectives on Neo-Kantianism and the Sciences}}, editor = {{Pulte, Helmut and Baedke, Jan and Koenig, Daniel and Nickel, Gregor}}, pages = {{17--37}}, publisher = {{Routledge}}, title = {{{(Neo-)Kantian Foundation of Foundations: The Göttingen Case}}}, year = {{2025}}, }