@unpublished{58852,
  abstract     = {{We study the asymptotic distribution of wildly ramified extensions of
function fields in characteristic $p > 2$, focusing on (certain) $p$-groups of
nilpotency class at most $2$. Rather than the discriminant, we count extensions
according to an invariant describing the last jump in the ramification
filtration at each place. We prove a local-global principle relating the
distribution of extensions over global function fields to their distribution
over local fields, leading to an asymptotic formula for the number of
extensions with a given global last-jump invariant. A key ingredient is
Abrashkin's nilpotent Artin-Schreier theory, which lets us parametrize
extensions and obtain bounds on the ramification of local extensions by
estimating the number of solutions to certain polynomial equations over finite
fields.}},
  author       = {{Gundlach, Fabian and Seguin, Beranger Fabrice}},
  booktitle    = {{arXiv:2502.18207}},
  title        = {{{Counting two-step nilpotent wildly ramified extensions of function  fields}}},
  year         = {{2025}},
}

@article{58885,
  abstract     = {{There have been several attempts to conceptualize and operationalize pedagogical content knowledge (PCK) in the context of teachers' professional competencies. A recent and popular model is the Refined Consensus Model (RCM), which proposes a framework of dispositional competencies (personal PCK—pPCK) that influence more action-related competencies (enacted PCK—ePCK) and vice versa. However, descriptions of the internal structure of pPCK and possible knowledge domains that might develop independently are still limited, being either primarily theoretically motivated or strictly hierarchical and therefore of limited use, for example, for formative feedback and further development of the RCM. Meanwhile, a non-hierarchical differentiation for the ePCK regarding the plan-teach-reflect cycle has emerged. In this study, we present an exploratory computational approach to investigate pre-service teachers' pPCK for a similar non-hierarchical structure using a large dataset of responses to a pPCK questionnaire (N=846). We drew on theoretical foundations and previous empirical findings to achieve interpretability by integrating this external knowledge into our analyses using the Computational Grounded Theory (CGT) framework. The results of a cluster analysis of the pPCK scores indicate the emergence of prototypical groups, which we refer to as competency profiles: (1) a group with low performance, (2) a group with relatively advanced competency in using pPCK to create instructional elements, (3) a group with relatively advanced competency in using pPCK to assess and analyze described instructional elements, and (4) a group with high performance. These groups show tendencies for certain language usage, which we analyze using a structural topic model in a CGT-inspired pattern refinement step. We verify these patterns by demonstrating the ability of a machine learning model to predict the competency profile assignments. Finally, we discuss some implications of the results for the further development of the RCM and their potential usability for an automated formative assessment.}},
  author       = {{Zeller, Jannis and Riese, Josef}},
  issn         = {{1098-2736}},
  journal      = {{Journal of Research in Science Teaching}},
  keywords     = {{computational grounded theory, language analysis, machine learning, pedagogical content knowledge, unsupervised learning}},
  title        = {{{Competency Profiles of PCK Using Unsupervised Learning: What Implications for the Structures of pPCK Emerge From Non-Hierarchical Analyses?}}},
  doi          = {{10.1002/tea.70001}},
  year         = {{2025}},
}

@inproceedings{58924,
  author       = {{Peeters, Hendrik and Habig, Sebastian and Fechner, Sabine}},
  booktitle    = {{Actes des XIIIe Rencontres scientifiques de l’ARDIST}},
  editor       = {{Munier, Valérie and Bächtold, Manuel}},
  location     = {{Montpellier}},
  pages        = {{48--55}},
  title        = {{{Influence de l'utilisation de la réalité augmentée lors des expériences chimiques sur la connexion des niveaux de représentation dans les explications des élèves}}},
  year         = {{2025}},
}

@article{58925,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>Random fluctuations in somatosensory signals affect the ability of effectively coordinating multimodal information pertaining to the postural state during movement. Therefore, this study aimed to investigate the impact of a compliant surface on cortico-cortical causal information flow during multi-joint compound movements. Fifteen healthy adults (7 female / 8 male, 25.9 ± 4.0 years) performed 5 × 20 repetitions of bodyweight squats on firm and compliant surface. Motor behavior was quantified by center of pressure (CoP) displacements, hip movement and the root mean square of the rectus femoris activity. Using source space analysis, renormalized partial directed coherence (rPDC) computed subject-level multivariate effective brain connectivity of sensorimotor nodes. Bootstrap statistics revealed significantly decreased medio-lateral CoP displacement (<jats:italic>p</jats:italic> &lt; 0.001), significantly increased velocity of medio-lateral hip motion (<jats:italic>p</jats:italic> &lt; 0.001) as well as significantly lower rectus femoris activity (<jats:italic>p</jats:italic> &lt; 0.01) in the compliant surface condition. On the cortical level, rPDC showed significantly modulated information flow in theta and beta frequencies for fronto-parietal edges (<jats:italic>p</jats:italic> &lt; 0.01) only during the concentric phase of the movement. The compliant surface led to increased difficulties controlling hip but not center of pressure motion in the medio-lateral plane. Moreover, a decreased activation of the prime movers accompanied by modulations of effective brain connectivity among fronto-central nodes may point to altered demands on sensorimotor information processing in presence of sensory noise when performing bodyweight squats on compliant surface. Further studies are needed to evaluate a potential benefit for athletic and clinical populations.</jats:p>}},
  author       = {{Lehmann, Tim and Visser, Anton Samuel and Havers, Tim and Büchel, Daniel and Baumeister, Jochen}},
  issn         = {{0014-4819}},
  journal      = {{Experimental Brain Research}},
  number       = {{4}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Dynamic modulations of effective brain connectivity associated with postural instability during multi-joint compound movement on compliant surface}}},
  doi          = {{10.1007/s00221-025-07039-2}},
  volume       = {{243}},
  year         = {{2025}},
}

@inbook{58691,
  author       = {{Albus, Vanessa}},
  booktitle    = {{Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen und praktische Lösungsansätze}},
  editor       = {{Kokoschka, Vanessa and Kosak, Stefan and Paganini, Claudia and Rademacher, Lars}},
  isbn         = {{ISBN 978-3-7560-1814-7}},
  pages        = {{171--184}},
  publisher    = {{Nomos}},
  title        = {{{Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit?}}},
  volume       = {{23}},
  year         = {{2025}},
}

@unpublished{58953,
  abstract     = {{In this article, we investigate symmetry properties of distributed systems of mobile robots. We consider a swarm of n robots in the OBLOT model and analyze their collective Fsync dynamics using of equivariant dynamical systems theory. To this end, we show that the corresponding evolution function commutes with rotational and reflective transformations of R^2. These form a group that is isomorphic to O(2) x S_n, the product group of the orthogonal group and the permutation on n elements. The theory of equivariant dynamical systems is used to deduce a hierarchy along which symmetries of a robot swarm can potentially increase following an arbitrary protocol. By decoupling the Look phase from the Compute and Move phases in the mathematical description of an LCM cycle, this hierarchy can be characterized in terms of automorphisms of connectivity graphs. In particular, we find all possible types of symmetry increase, if the decoupled Compute and Move phase is invertible. Finally, we apply our results to protocols which induce state-dependent linear dynamics, where the reduced system consisting of only the Compute and Move phase is linear.}},
  author       = {{Gerlach, Raphael and von der Gracht, Sören}},
  booktitle    = {{arXiv:2503.07576}},
  keywords     = {{dynamical systems, coupled systems, distributed computing, robot swarms, autonomous mobile robots, symmetry, equivariant dynamics}},
  pages        = {{23}},
  title        = {{{Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems}}},
  year         = {{2025}},
}

@article{59069,
  abstract     = {{<jats:p>Stable and bright single photon sources are key components for future quantum applications. A simple fabrication method is an important requirement for such sources. Here, we present a single photon source based on diced ridge waveguides in titanium indiffused LiNbO<jats:sub>3</jats:sub>. These waveguides can be easily fabricated by combining planar titanium in-diffusion without lithographic patterning and easy-to-handle precision dicing. Such devices have the potential to generate high single photon rates because ridge structures are typically less prone to the photorefractive effect. We achieve waveguide propagation losses &lt;0.4dBcm and a SHG conversion efficiency of about 81%Wcm<jats:sup>2</jats:sup>. Harnessing a type-0 SPDC process to generate 1550 nm photons, we obtain a SPDC brightness of 3⋅10<jats:sup>5</jats:sup>1s⋅mW⋅nm, with a heralding efficiency of <jats:italic>η</jats:italic><jats:sub>h</jats:sub>=45% (<jats:italic>η</jats:italic><jats:sub>h,wg</jats:sub>=77.5% for the waveguide itself excluded setup losses) and a heralded second-order correlation function of <jats:italic>g</jats:italic><jats:sub>h</jats:sub><jats:sup>2</jats:sup>(0)&lt;0.003 at low pump powers.</jats:p>}},
  author       = {{Kießler, Christian and Kirsch, Michelle and Lengeling, Sebastian and Herrmann, Harald and Silberhorn, Christine}},
  issn         = {{2770-0208}},
  journal      = {{Optics Continuum}},
  number       = {{3}},
  publisher    = {{Optica Publishing Group}},
  title        = {{{SPDC single-photon source in Ti-indiffused diced ridge LiNbO<sub>3</sub> waveguides}}},
  doi          = {{10.1364/optcon.557439}},
  volume       = {{4}},
  year         = {{2025}},
}

@inbook{59087,
  author       = {{Ströhmer, Michael}},
  booktitle    = {{KOmmunale Wasserregime - Wasser und Macht in der europäischen Stadt, 1300-1900}},
  isbn         = {{978-3-8376-7161-2}},
  pages        = {{141--164}},
  title        = {{{Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten Nichts - Naturphilosophische Experimente des 17. Jahrhunderts im europäischen Jesuitennetzwerk}}},
  volume       = {{4}},
  year         = {{2025}},
}

@book{59086,
  editor       = {{Ströhmer, Michael and Fäßler, Peter}},
  pages        = {{296}},
  title        = {{{Kommunale Wasserregime - Wasser und Macht in der europäischen Stadt 1300-1900}}},
  volume       = {{4}},
  year         = {{2025}},
}

@article{59169,
  abstract     = {{An r-regular graph is an r-graph, if every odd set of vertices is connected to its complement by at least r edges. Let G and H be r-graphs. An H-coloring of G is a mapping such that each r adjacent edges of G are mapped to r adjacent edges of H. For every , let be an inclusion-wise minimal set of connected r-graphs, such that for every connected r-graph G there is an which colors G. The Petersen Coloring Conjecture states that consists of the Petersen graph P. We show that if true, then this is a very exclusive situation. Our main result is that either or is an infinite set and if , then is an infinite set. In particular, for all , is unique. We first characterize and then prove that if contains more than one element, then it is an infinite set. To obtain our main result we show that contains the smallest r-graphs of class 2 and the smallest poorly matchable r-graphs, and we determine the smallest r-graphs of class 2.}},
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak H.}},
  issn         = {{0209-9683}},
  journal      = {{Combinatorica}},
  number       = {{2}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Sets of r-Graphs that Color All r-Graphs}}},
  doi          = {{10.1007/s00493-025-00144-4}},
  volume       = {{45}},
  year         = {{2025}},
}

@phdthesis{59263,
  abstract     = {{In dieser Arbeit betrachten wir algorithmische Lösungen für fundamentale Probleme in modernen Kommunikationsnetzen. Im ersten Teil dieser Arbeit zeigen wir, wie man ein Overlay-Netzwerk mit Grades und Durchmesser O(log n) in O(log n) Runden ausgehend von einem beliebigen, schwach verbundenen Graphen konstruiert. Wir gehen von einem synchronen Kommunikationsnetz aus, in dem Knoten Nachrichten an alle Knoten senden können, deren Adresse sie kennen, und neue Verbindungen durch das Versenden dieser Adressen hergestellt werden können. Wenn der Ausgangsgraph des Netzwerks schwach zusammenhängend ist und einen konstanten Grad hat, dann konstruiert unser Algorithmus die gewünschte Topologie mit hoher Wahrscheinlichkeit in O(log n) Runden, wobei in jeder Runde nur O(log n) Nachrichten sendet und empfängt. Da das Problem nicht schneller gelöst werden kann als durch sogenanntes Pointer Doubling für O(log n) Runden (was sogar erfordern würde, dass jeder Knoten Ω(n) Bits kommuniziert), ist unser Algorithmus asymptotisch optimal. Außerdem zeigen wir, wie unser Algorithmus zur effizienten Lösung von Graphenproblemen im HYBRID modelverwendet werden kann. Motiviert durch die Idee, dass Knoten zwei verschiedene Arten der Kommunikation besitzen, nehmen wir an, dass die Kommunikation der Kanten unbeschränkt ist, während nur polylogarithmisch viele Nachrichten über Kanten gesendet werden können, die während der Ausführung eines Algorithmus etabliert wurden. Für einen (ungerichteten) Graphen G mit beliebigem Grad zeigen wir, wie man zusammenhängende Komponenten und einen Spannwald mit hoher Wahrscheinlichkeit in O(log n) Zeitberechnen kann. Außerdem zeigen wir, wie man ein MIS mit hoher Wahrscheinlichkeit in O(log ∆ + log log n), berechnet, wobei ∆ der Grad von G ist. Im zweiten Teil der Arbeit betrachten wir das Problem der Berechnung von kompakten Routing-Tabellen und Dekompositionen mit geringem Durchmesser für einen (gewichteten) Graphen G := (V, E, ℓ), der durch k kürzeste Wege separiert werden kann. Zu dieser Klasse von Graphen gehören planare Graphen, Graphen mit beschränkter Treewidth und Graphen, die einen festen Minor Kr ausschließen. Wir präsentieren Algorithmen im CONGEST- und im neuartigen HYBRID-Kommunikationsmodell, die in allen relevanten Parametern konkurrenzfähig sind:• Für einen gegebenen Parameter ϵ &gt; 0 berechnen wir ein Routing-Schema mit Stretch 1 + ϵ. Unser Schema berechnet Label der Größe Oe(kϵ−2) und wird in Oe(kϵ−3) Zeit im HYBRID-Modell, und Oe(kϵ−3· HD) Zeit in CONGEST. Dabei bezeichnet HD den Hopdurchmesser des Graphen.• Für einem Parameter D &gt; 0 unterteilt unser Algorithmus zur Dekomposition den Graphen in zusammenhängende Subgraphen mit starkem Durchmesser D. Eine Kante e ∈ E der Länge ℓe hat ihre Endpunkte in zwei verschieden Subgraphen mit der Wahrscheinlichkeit O(ℓe·log(k log n)/D). Die Dekomposition kann in Oe(k) Zeit im HYBRID-Modell und O˜(kHD) Zeit in CONGEST berechnet werden. Wir stellen verteilte und parallele Implementierungen von sequenziellen Divide-and-Conquer-Algorithmen vor, bei denen wir exakte kürzeste Pfade durch approximative kürzeste Pfade ersetzen. Im Gegensatz zu exakten Pfaden können diese in der verteilten und parallelen Umgebung effizient berechnet werden. Außerdem, zeigen wir, dass es ausreicht, anstelle der expliziten Berechnung von Vertex-Separatoren, einige zufällige Pfade begrenzter Länge zu wählen und die Separatoren um diese herum zu konstruieren. Schließlich stellen wir einen SetCover-Algorithmus für das Beeping-Modell vor. Unser Algorithmus läuft in O(k3) Zeit und hat eine erwartete Approximationsgüte von O(∆3/k log2 ∆). Der Wert k ∈ [3, log ∆] ist ein Parameter, mit dem wir Laufzeit gegen Approximationsgüte eintauschen können, ähnlich wie bei dem Algorithmus von Kuhn und Wattenhofer [PODC ’03]. Dieser Algorithmus kann erweitert werden, um das DominatingSet-Problem in der D-Nachbarschaft eines Graphen mittles eines verteiltes Algorithmus effizient zu lösen.}},
  author       = {{Götte, Thorsten}},
  publisher    = {{LibreCat University}},
  title        = {{{Distributed Algorithms for Modern Communication Networks}}},
  doi          = {{10.17619/UNIPB/1-2217}},
  year         = {{2025}},
}

@book{59287,
  editor       = {{Beverungen, Daniel and Lehrer, Christiane and Trier, Matthias}},
  isbn         = {{9783031801211}},
  issn         = {{2195-4968}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Solutions and Technologies for Responsible Digitalization}}},
  doi          = {{10.1007/978-3-031-80122-8}},
  year         = {{2025}},
}

@article{60186,
  author       = {{Lang, A and Schaefer, E and Kupriyanova, Y and Goletzke, J and Weber, KS and Buyken, Anette and Kahl, S and Zaharia, OP and Herder, C and Schrauwen-Hinderling, VB and Kuss, O and Wagner, R and Roden, M and Schlesinger, S and Diabetes Study Group, German}},
  issn         = {{1475-2891}},
  journal      = {{Nutr J}},
  number       = {{1}},
  pages        = {{74}},
  title        = {{{Cross-sectional association between the isocaloric replacement of carbohydrates with protein and fat in relation to fat compartments distribution and hepatic lipid content in recent-onset type 1 and type 2 diabetes.}}},
  volume       = {{24}},
  year         = {{2025}},
}

@article{60184,
  author       = {{Della Corte, KA and Bosler, T and McClure, C and Buyken, Anette and LeCheminant, JD and Schwingshackl, L and Della Corte, D}},
  issn         = {{2161-8313}},
  journal      = {{Adv Nutr}},
  number       = {{5}},
  pages        = {{100413}},
  title        = {{{Dietary Sugar Intake and Incident Type 2 Diabetes Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective Cohort Studies.}}},
  volume       = {{16}},
  year         = {{2025}},
}

@article{60419,
  author       = {{Bartlitz, David}},
  journal      = {{Europäische Zeitschrift für Wirtschaftsrecht (EuZW)}},
  number       = {{10}},
  pages        = {{483--484}},
  title        = {{{Weigerung der Gewährleistung der Interoperabilität einer Plattform mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025 - C-233/23}}},
  year         = {{2025}},
}

@article{60507,
  abstract     = {{<jats:p>DNA origami nanostructures are powerful molecular tools for the controlled arrangement of functional molecules and thus have important applications in biomedicine, sensing, and materials science. The fabrication of DNA origami...</jats:p>}},
  author       = {{Tomm, Emilia and Grundmeier, Guido and Keller, Adrian}},
  issn         = {{2040-3364}},
  journal      = {{Nanoscale}},
  publisher    = {{Royal Society of Chemistry (RSC)}},
  title        = {{{Cost-efficient folding of functionalized DNA origami nanostructures via staple recycling}}},
  doi          = {{10.1039/d5nr01435b}},
  year         = {{2025}},
}

@article{60530,
  author       = {{Grimminger-Seidensticker, Elke and ComeNet 5, Autorengruppe }},
  journal      = {{sportunterricht}},
  number       = {{6}},
  pages        = {{250 -- 253}},
  title        = {{{Körperbilder und Social Media im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte}}},
  doi          = {{10.30426/SU-2025-06-2}},
  volume       = {{74}},
  year         = {{2025}},
}

@article{60602,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>It has been established that, in Bayesian tasks, performance and typical errors in <jats:italic>reading</jats:italic> information from filled visualizations depend both on the type of the provided visualization and information format. However, apart from reading visualizations, students should also be able to create visualizations on their own and successfully use them as heuristic tools in modeling tasks. In this paper, we first want to broaden the view on Bayesian reasoning to probabilistic tasks with two binary events in general and embed the whole process of solving these tasks using probabilistic visualizations in a modified modeling framework. Thereby, it becomes apparent that most of the steps remained untouched by existing research. Second, in the present empirical study, we focused on one part of the largely unexplored creation process and examined <jats:italic>entering</jats:italic> statistical information into empty visualizations as heuristic tools. <jats:italic>N</jats:italic> = 172 participants had to enter conditional and joint probabilities or the corresponding frequencies into empty visualizations in a paper-and-pencil test. We analyze (a) students’ performance when entering information in visualizations and (b) typical errors, both dependent on the <jats:italic>information format</jats:italic> (probabilities vs. natural frequencies), which <jats:italic>empty visualization structure</jats:italic> (2⨯2 table, double tree, net diagram) was provided, and <jats:italic>type of information</jats:italic> (conditional vs. joint information). The well-known positive effect of natural frequencies on participants’ performance was evident when entering conditional information into 2⨯2 tables and net diagrams. However, with respect to joint information, no superior effect of frequencies was observed. Furthermore, the theoretical implementation of our research in a modeling cycle allows us to identify desiderata for future research.</jats:p>}},
  author       = {{Rößner, Michael and Binder, Karin and Geier, Corbinian and Krauss, Stefan}},
  issn         = {{0013-1954}},
  journal      = {{Educational Studies in Mathematics}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Students’ performance and typical errors in filling empty probabilistic visualizations with probabilities or frequencies}}},
  doi          = {{10.1007/s10649-024-10372-y}},
  year         = {{2025}},
}

@article{60606,
  abstract     = {{<jats:p>Streptavidin binding to DNA origami-supported high-density biotin arrays is investigated for selected experimental parameters. While bidentate binding and steric hindrance can be minimized, molecular crowding limits the binding yields in 2D arrays.</jats:p>}},
  author       = {{Rabbe, Lukas and Tomm, Emilia and Grundmeier, Guido and Keller, Adrian}},
  issn         = {{2046-2069}},
  journal      = {{RSC Advances}},
  number       = {{30}},
  pages        = {{24536--24543}},
  publisher    = {{Royal Society of Chemistry (RSC)}},
  title        = {{{Toward high-density streptavidin arrays on DNA origami nanostructures}}},
  doi          = {{10.1039/d5ra03393d}},
  volume       = {{15}},
  year         = {{2025}},
}

@article{55037,
  abstract     = {{Estimating ground state energies of many-body Hamiltonians is a central task
in many areas of quantum physics. In this work, we give quantum algorithms
which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground
state energy and prepare a quantum state achieving said energy, respectively.
Specifically, for any $\varepsilon>0$, our algorithms return, with high
probability, an estimate of the ground state energy of $H$ within additive
error $\varepsilon M$, or a quantum state with the corresponding energy. Here,
$M$ is the total strength of all interaction terms, which in general is
extensive in the system size. Our approach makes no assumptions about the
geometry or spatial locality of interaction terms of the input Hamiltonian and
thus handles even long-range or all-to-all interactions, such as in quantum
chemistry, where lattice-based techniques break down. In this fully general
setting, the runtime of our algorithms scales as $2^{cn/2}$ for $c<1$, yielding
the first quantum algorithms for low-energy estimation breaking the natural
bound based on Grover search. The core of our approach is remarkably simple,
and relies on showing that any $k$-body Hamiltonian has a low-energy subspace
of exponential dimension.}},
  author       = {{Buhrman, Harry and Gharibian, Sevag and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru}},
  journal      = {{Physical Review Letters}},
  pages        = {{030601}},
  title        = {{{Beating Grover search for low-energy estimation and state preparation}}},
  doi          = {{10.1103/29qw-bssx}},
  volume       = {{135}},
  year         = {{2025}},
}