@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     = {{<jats:title>ABSTRACT</jats:title>
                  <jats:p>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.</jats:p>}},
  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}},
}

@inbook{65550,
  abstract     = {{<p>
                    We explain how to construct a uniformly random cubic integral domain
                    <inline-formula content-type="math/mathml">
                      <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S">
                        <mml:semantics>
                          <mml:mi>S</mml:mi>
                          <mml:annotation encoding="application/x-tex">S</mml:annotation>
                        </mml:semantics>
                      </mml:math>
                    </inline-formula>
                    of given signature with
                    <inline-formula content-type="math/mathml">
                      <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartAbsoluteValue d i s c left-parenthesis upper S right-parenthesis EndAbsoluteValue less-than-or-equal-to upper T">
                        <mml:semantics>
                          <mml:mrow>
                            <mml:mo fence="false" stretchy="false">
                              |
                              
                            </mml:mo>
                            <mml:mi>d</mml:mi>
                            <mml:mi>i</mml:mi>
                            <mml:mi>s</mml:mi>
                            <mml:mi>c</mml:mi>
                            <mml:mo stretchy="false">(</mml:mo>
                            <mml:mi>S</mml:mi>
                            <mml:mo stretchy="false">)</mml:mo>
                            <mml:mo fence="false" stretchy="false">
                              |
                              
                            </mml:mo>
                            <mml:mo>
                              ≤
                              
                            </mml:mo>
                            <mml:mi>T</mml:mi>
                          </mml:mrow>
                          <mml:annotation encoding="application/x-tex">\lvert disc(S)\rvert \leq T</mml:annotation>
                        </mml:semantics>
                      </mml:math>
                    </inline-formula>
                    in expected time
                    <inline-formula content-type="math/tex">
                      <tex-math>\widetilde \mathcal {O}(\log T)</tex-math>
                    </inline-formula>
                    .
                  </p>}},
  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{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{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}},
}

@book{55650,
  editor       = {{Eke, Norbert Otto and Ludwig , Janine   and  Vaßen, Florian  }},
  pages        = {{172}},
  title        = {{{1.	Heiner-Müller-Jahrbuch 1: Heiner Müllers Natur.}}},
  year         = {{2025}},
}

@article{32099,
  author       = {{Weich, Tobias and Budde, Julia}},
  journal      = {{Journal of Functional Analysis}},
  number       = {{1}},
  title        = {{{Wave Front Sets of Nilpotent Lie Group Representations}}},
  doi          = {{ https://doi.org/10.1016/j.jfa.2024.110684}},
  volume       = {{288}},
  year         = {{2025}},
}

@inbook{56638,
  author       = {{Silvestri, Marco}},
  booktitle    = {{Art, Travel, and Exchange between Iberia and Global Geographies, c. 1400–1550}},
  editor       = {{Beltrami, Costanza  and Alvares-Correa, Sylvia}},
  pages        = {{108--142}},
  title        = {{{Travelling Stonemasons and the Architectural Cultural Exchange between Spain, Mexico, and Peru in the 16th Century: Connections and Paths of the Toribio de Alcaraz Family}}},
  doi          = {{https://doi.org/10.1163/9789004707474}},
  volume       = {{24}},
  year         = {{2025}},
}

@inbook{56854,
  author       = {{Schuster, Britt-Marie and Bubenhofer, Noah}},
  booktitle    = {{Germanistische Linguistik. Genese, Zustand und Zukunft eines Faches im Spiegel der RGL}},
  editor       = {{Schuster, Britt-Marie and Bubenhofer, Noah and Habermann, Mechthild and Hausendorf, Heiko}},
  pages        = {{1--18}},
  publisher    = {{de Gruyter}},
  title        = {{{Facetten der Germanistischen Linguistik: Bestandsaufnahme und Perspektiven}}},
  year         = {{2025}},
}

@book{56851,
  editor       = {{Schuster, Britt-Marie and Bubenhofer, Noah and Habermann, Mechthild and Hausendorf, Heiko}},
  title        = {{{Germanistische Linguistik. Genese, Zustand und Zukunft eines Faches im Spiegel der RGL}}},
  volume       = {{336}},
  year         = {{2025}},
}

