@unpublished{64816, abstract = {{We study a block mean-field Ising model with $N$ spins split into $s_N$ blocks, with Curie-Weiss interaction within blocks and nearest-neighbor coupling between blocks. While previous models deal with the block magnetization for a fixed number of blocks, we study the the simultaneous limit $N\to\infty$ and $s_N\to\infty$. The model interpolates between Curie-Weiss model for $s_N=1$, multi-species mean field for fixed $s_N=s$, and the 1D Ising model for each spin in its own block at $s_N=N$. Under mild growth conditions on $s_N$, we prove a law of large numbers and a multivariate CLT with covariance given by the lattice Green's function. For instance, the high temperature CLT essentially covers the optimal range up to $s_N=o(N/(\log N)^c)$ and the low temperature regime is new even for fixed number of blocks $s > 2$. In addition to the standard competition between entropy and energy, a new obstacle in the proofs is a curse of dimensionality as $s_N \to \infty$.}}, author = {{Jalowy, Jonas and Lammers, Isabel and Löwe, Matthias}}, booktitle = {{arXiv:2603.01994}}, title = {{{The infinite block spin Ising model}}}, year = {{2026}}, } @inproceedings{64838, author = {{Jafarzadeh, Hanieh and Reimer, Jan Dennis and Amrouch, Hussam and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, booktitle = {{To appear in: 27th IEEE Latin American Test Symposium (LATS2026), March 2026}}, title = {{{Validating Statistical Delay Test Generation under Timing Variations via SAT-Based ATPG}}}, year = {{2026}}, } @misc{64839, author = {{Jafarzadeh, Hanieh and Reimer, Jan Dennis and Amrouch, Hussam and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, title = {{{SAT-Based Validation of Statistical Delay Test Generation under Timing Variations}}}, year = {{2026}}, } @unpublished{64865, abstract = {{We provide a method to systematically construct vector fields for which the dynamics display transitions corresponding to a desired hierarchical connection structure. This structure is given as a finite set of directed graphs $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ (the lower level), together with another digraph $\mathbfΓ$ on $N$ vertices (the top level). The dynamic realizations of $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ are heteroclinic networks and they can be thought of as individual connection patterns on a given set of states. Edges in $\mathbfΓ$ correspond to transitions between these different patterns. In our construction, the connections given through $\mathbfΓ$ are not heteroclinic, but excitable with zero threshold. This describes a dynamical transition between two invariant sets where every $δ$-neighborhood of the first set contains an initial condition with $ω$-limit in the second set. Thus, we prove a theorem that allows the systematic creation of hierarchical networks that are excitable on the top level, and heteroclinic on the lower level. Our results modify and extend the simplex realization method by Ashwin & Postlethwaite.}}, author = {{von der Gracht, Sören and Lohse, Alexander}}, booktitle = {{arXiv:2603.06157}}, title = {{{Design of Hierarchical Excitable Networks}}}, year = {{2026}}, } @article{60990, abstract = {{Large Language Models (LLMs) have demonstrated remarkable performance across a wide range of natural language processing tasks. However, their effectiveness in low-resource languages remains underexplored, particularly in complex tasks such as end-to-end Entity Linking (EL), which requires both mention detection and disambiguation against a knowledge base (KB). In earlier work, we introduced IndEL — the first end-to-end EL benchmark dataset for the Indonesian language — covering both a general domain (news) and a specific domain (religious text from the Indonesian translation of the Quran), and evaluated four traditional end-to-end EL systems on this dataset. In this study, we propose ELEVATE-ID, a comprehensive evaluation framework for assessing LLM performance on end-to-end EL in Indonesian. The framework evaluates LLMs under both zero-shot and fine-tuned conditions, using multilingual and Indonesian monolingual models, with Wikidata as the target KB. Our experiments include performance benchmarking, generalization analysis across domains, and systematic error analysis. Results show that GPT-4 and GPT-3.5 achieve the highest accuracy in zero-shot and fine-tuned settings, respectively. However, even fine-tuned GPT-3.5 underperforms compared to DBpedia Spotlight — the weakest of the traditional model baselines — in the general domain. Interestingly, GPT-3.5 outperforms Babelfy in the specific domain. Generalization analysis indicates that fine-tuned GPT-3.5 adapts more effectively to cross-domain and mixed-domain scenarios. Error analysis uncovers persistent challenges that hinder LLM performance: difficulties with non-complete mentions, acronym disambiguation, and full-name recognition in formal contexts. These issues point to limitations in mention boundary detection and contextual grounding. Indonesian-pretrained LLMs, Komodo and Merak, reveal core weaknesses: template leakage and entity hallucination, respectively—underscoring architectural and training limitations in low-resource end-to-end EL.11Code and dataset are available at https://github.com/dice-group/ELEVATE-ID.}}, author = {{Gusmita, Ria Hari and Firmansyah, Asep Fajar and Zahera, Hamada Mohamed Abdelsamee and Ngonga Ngomo, Axel-Cyrille}}, issn = {{0169-023X}}, journal = {{Data & Knowledge Engineering}}, keywords = {{LLMs, Evaluation, End-to-end EL, Indonesian}}, pages = {{102504}}, title = {{{ELEVATE-ID: Extending Large Language Models for End-to-End Entity Linking Evaluation in Indonesian}}}, doi = {{https://doi.org/10.1016/j.datak.2025.102504}}, volume = {{161}}, year = {{2026}}, } @unpublished{62723, abstract = {{Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small treewidth. Since these solvers are widely applied, research interests in compact encodings into (Q)SAT for solving and to understand encoding limitations. Even more general is the graph parameter clique-width, which unlike treewidth can be small for dense graphs. Although algorithms are available for clique-width, little is known about encodings. We initiate the quest to understand encoding capabilities with clique-width by considering abstract argumentation, which is a robust framework for reasoning with conflicting arguments. It is based on directed graphs and asks for computationally challenging properties, making it a natural candidate to study computational properties. We design novel reductions from argumentation problems to (Q)SAT. Our reductions linearly preserve the clique-width, resulting in directed decomposition-guided (DDG) reductions. We establish novel results for all argumentation semantics, including counting. Notably, the overhead caused by our DDG reductions cannot be significantly improved under reasonable assumptions.}}, author = {{Mahmood, Yasir and Hecher, Markus and Groven, Johanna and Fichte, Johannes K.}}, booktitle = {{Pre-print of paper accepted at AAAI 2026}}, title = {{{Structure-Aware Encodings of Argumentation Properties for Clique-width}}}, year = {{2026}}, } @unpublished{62721, 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 = {{Pre-print of paper accepted at AAAI 2026}}, title = {{{Can You Tell the Difference? Contrastive Explanations for ABox Entailments}}}, year = {{2026}}, } @article{63435, author = {{Claes, Leander and Winkler, Michael}}, issn = {{1468-1218}}, journal = {{Nonlinear Analysis: Real World Applications}}, pages = {{104580}}, publisher = {{Elsevier BV}}, title = {{{Describing smooth small-data solutions to a quasilinear hyperbolic-parabolic system by W 1,P energy analysis}}}, doi = {{10.1016/j.nonrwa.2025.104580}}, volume = {{91}}, year = {{2026}}, } @article{63532, abstract = {{Room-temperature lasing is a key milestone in the development of miniaturized optoelectronic and photonic devices. We present a simple approach to synthesize phase-pure quasi-2D layered tin perovskite nanowires with varying quantum well thicknesses (n = 1 to 4). By incorporating a new organic spacer capable of forming a hydrogen-bonded organic framework, this method promoted anisotropic crystal growth and enhanced lattice rigidity. Furthermore, introducing molecular intercalants enabled controlled crystallization into well-defined nanowires that function as Fabry–Pérot cavities. Cavities made from n = 2 to 4 perovskites support efficient and robust near-infrared, room-temperature optically pumped lasing with the threshold as low as 75.8 μJ/cm2, cavity quality factor over 3000, and negligible degradation over 106 pulses. A cleaved coupled nanolaser was fabricated as a proof-of-concept device for photonic applications.}}, author = {{Kim, Jeong Hui and Simon, Jeffrey and Shao, Wenhao and Nian, Zhichen and Yang, Hanjun and Chen, Peigang and Triplett, Brandon and Li, Zhixu and Wu, Pengfei and Chen, Yuheng and Farheen, Henna and Pagadala, Karthik and Choi, Kyu Ri and Fruhling, Colton B. and Förstner, Jens and Boltasseva, Alexandra and Savoie, Brett M. and Shalaev, Vladimir M. and Dou, Letian}}, issn = {{0002-7863}}, journal = {{Journal of the American Chemical Society}}, keywords = {{tet_topic_opticalantenna}}, pages = {{jacs.5c14431}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Hydrogen-Bonded Organic Framework Enables Phase-Pure Layered Tin Perovskite Nanowires for Room-Temperature Lasing}}}, doi = {{10.1021/jacs.5c14431}}, year = {{2026}}, } @article{63557, abstract = {{We discretise a recently proposed new Lagrangian approach to optimal control problems with dynamics described by force-controlled Euler-Lagrange equations (Konopik et al., in Nonlinearity 38:11, 2025). The resulting discretisations are in the form of discrete Lagrangians. We show that the discrete necessary conditions for optimality obtained provide variational integrators for the continuous problem, akin to Karush-Kuhn-Tucker (KKT) conditions for standard direct approaches. This approach paves the way for the use of variational error analysis to derive the order of convergence of the resulting numerical schemes for both state and costate variables and to apply discrete Noether’s theorem to compute conserved quantities, distinguishing itself from existing geometric approaches. We show for a family of low-order discretisations that the resulting numerical schemes are ‘doubly-symplectic’, meaning they yield forced symplectic integrators for the underlying controlled mechanical system and overall symplectic integrators in the state-adjoint space. Multi-body dynamics examples are solved numerically using the new approach. In addition, the new approach is compared to standard direct approaches in terms of computational performance and error convergence. The results highlight the advantages of the new approach, namely, better performance and convergence behaviour of state and costate variables consistent with variational error analysis and automatic preservation of certain first integrals.}}, author = {{Konopik, Michael and Leyendecker, Sigrid and Maslovskaya, Sofya and Ober-Blöbaum, Sina and Sato Martín de Almagro, Rodrigo T.}}, issn = {{1384-5640}}, journal = {{Multibody System Dynamics}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{On the variational discretisation of optimal control problems for unconstrained Lagrangian dynamics}}}, doi = {{10.1007/s11044-025-10138-1}}, year = {{2026}}, } @unpublished{64871, author = {{Rahangdale, Praful}}, title = {{{Drinfeld correspondence in infinite dimensions}}}, year = {{2026}}, } @article{64877, author = {{Taheri, Behnood and Kopylov, Denis and Hammer, Manfred and Meier, Torsten and Förstner, Jens and Sharapova, Polina R.}}, journal = {{arXiv}}, title = {{{Gain-induced spectral non-degeneracy in type-II parametric down-conversion}}}, doi = {{10.48550/ARXIV.2603.01656}}, year = {{2026}}, } @inproceedings{64823, abstract = {{Current legal frameworks enforce that Android developers accurately report the data their apps collect. However, large codebases can make this reporting challenging. This paper employs an empirical approach to understand developers' experience with Google Play Store's Data Safety Section (DSS) form. We first survey 41 Android developers to understand how they categorize privacy-related data into DSS categories and how confident they feel when completing the DSS form. To gain a broader and more detailed view of the challenges developers encounter during the process, we complement the survey with an analysis of 172 online developer discussions, capturing the perspectives of 642 additional developers. Together, these two data sources represent insights from 683 developers. Our findings reveal that developers often manually classify the privacy-related data their apps collect into the data categories defined by Google-or, in some cases, omit classification entirely-and rely heavily on existing online resources when completing the form. Moreover, developers are generally confident in recognizing the data their apps collect, yet they lack confidence in translating this knowledge into DSS-compliant disclosures. Key challenges include issues in identifying privacy-relevant data to complete the form, limited understanding of the form, and concerns about app rejection due to discrepancies with Google's privacy requirements. These results underscore the need for clearer guidance and more accessible tooling to support developers in meeting privacy-aware reporting obligations. }}, author = {{Khedkar, Mugdha and Schlichtig, Michael and Soliman, Mohamed Aboubakr Mohamed and Bodden, Eric}}, booktitle = {{Proceedings of the IEEE/ACM 13th International Conference on Mobile Software Engineering and Systems (MOBILESoft '26). Association for Computing Machinery, New York, NY, USA, 65–68.}}, keywords = {{static analysis, data collection, data protection, privacy-aware reporting}}, location = {{Rio de Janeiro, Brazil}}, title = {{{Challenges in Android Data Disclosure: An Empirical Study.}}}, year = {{2026}}, } @article{64821, author = {{Khedkar, Mugdha and Schlichtig, Michael and Atakishiyev, Nihad and Bodden, Eric}}, journal = {{Automated Software Engineering }}, number = {{2}}, publisher = {{Springer US}}, title = {{{Between Law and Code: Challenges and Opportunities for Automating Privacy Assessments}}}, doi = {{10.1007/s10515-026-00601-4}}, volume = {{33}}, year = {{2026}}, } @inproceedings{64909, author = {{Khedkar, Mugdha and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER 2026)}}, title = {{{Source Code-Driven GDPR Documentation: Supporting RoPA with Assessor View}}}, year = {{2026}}, } @article{64979, abstract = {{We investigate homogeneous coupled cell systems with high-dimensional internal dynamics. In many studies on network dynamics, the analysis is restricted to networks with one-dimensional internal dynamics. Here, we show how symmetry explains the relation between dynamical behavior of systems with one-dimensional internal dynamics and with higher dimensional internal dynamics, when the underlying network topology is the same. Fundamental networks of homogeneous coupled cell systems (B. Rink, J. Sanders. Coupled Cell Networks and Their Hidden Symmetries. SIAM J. Math. Anal. 46.2 (2014)) can be expressed in terms of monoid representations, which uniquely decompose into indecomposable subrepresentations. In the high-dimensional internal dynamics case, these subrepresentations are isomorphic to multiple copies of those one computes in the one-dimensional internal dynamics case. This has interesting implications for possible center subspaces in bifurcation analysis. We describe the effect on steady state and Hopf bifurcations in l-parameter families of network vector fields. The main results in that regard are that (1) generic one-parameter steady state bifurcations are qualitatively independent of the dimension of the internal dynamics and that, (2) in order to observe all generic l-parameter bifurcations that may occur for internal dynamics of any dimension, the internal dynamics has to be at least l-dimensional for steady state bifurcations and 2l-dimensional for Hopf bifurcations. Furthermore, we illustrate how additional structure in the network can be exploited to obtain even greater understanding of bifurcation scenarios in the high-dimensional case beyond qualitative statements about the collective dynamics. One-parameter steady state bifurcations in feedforward networks exhibit an unusual amplification in the asymptotic growth rates of individual cells, when these are one-dimensional (S. von der Gracht, E. Nijholt, B. Rink. Amplified steady state bifurcations in feedforward networks. Nonlinearity 35.4 (2022)). As another main result, we prove that (3) the same cells exhibit this amplifying effect with the same growth rates when the internal dynamics is high-dimensional.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, issn = {{0960-0779}}, journal = {{Chaos, Solitons & Fractals}}, keywords = {{Coupled cell systems, Network dynamics, Dimension reduction, Bifurcation theory, Symmetry, Monoid representation theory}}, publisher = {{Elsevier BV}}, title = {{{Homogeneous coupled cell systems with high-dimensional internal dynamics}}}, doi = {{10.1016/j.chaos.2026.118196}}, volume = {{208}}, year = {{2026}}, } @unpublished{65017, abstract = {{Static Application Security Testing (SAST) tools play a vital role in modern software development by automatically detecting potential vulnerabilities in source code. However, their effectiveness is often limited by a high rate of false positives, which wastes developer's effort and undermines trust in automated analysis. This work presents a Graph Convolutional Network (GCN) model designed to predict SAST reports as true and false positive. The model leverages Code Property Graphs (CPGs) constructed from static analysis results to capture both, structural and semantic relationships within code. Trained on the CamBenchCAP dataset, the model achieved an accuracy of 100% on the test set using an 80/20 train-test split. Evaluation on the CryptoAPI-Bench benchmark further demonstrated the model's practical applicability, reaching an overall accuracy of up to 96.6%. A detailed qualitative inspection revealed that many cases marked as misclassifications corresponded to genuine security weaknesses, indicating that the model effectively reflects conservative, security-aware reasoning. Identified limitations include incomplete control-flow representation due to missing interprocedural connections. Future work will focus on integrating call graphs, applying graph explainability techniques, and extending training data across multiple SAST tools to improve generalization and interpretability.}}, author = {{Ohlmer, Tom and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{arXiv:2603.10558}}, title = {{{FP-Predictor - False Positive Prediction for Static Analysis Reports}}}, year = {{2026}}, } @inproceedings{64797, author = {{Birk, Lisa and Loth, Gerrit and Jotzo, Luca and Binder, Karin and Frischemeier, Daniel}}, booktitle = {{Proceedings of the IASE 2025 Satellite Conference - Statistics and Data Science Education in STEAM}}, publisher = {{International Association for Statistics Education}}, title = {{{Editorial}}}, doi = {{10.52041/iase25.158}}, year = {{2026}}, } @article{64176, author = {{Deutschen, Katrin and Neufeld, Inga and Häsel-Weide, Uta}}, journal = {{Grundschule aktuell}}, number = {{173}}, pages = {{10--11}}, title = {{{Lernbegleitung produktiv gestalten. Mathematische Verstehensprozesse von Kindern anregen.}}}, year = {{2026}}, } @inbook{65026, author = {{Neufeld, Inga and Häsel-Weide, Uta}}, booktitle = {{Handlungsorientierung in der Ausbildung von Lehrkräften und pädagogischen Fachkräften. Konzeptionen und Forschungsperspektiven}}, editor = {{Vogelsang, C. and Grotegurt, L. and Bruns, J. and Riese, J. and Fechner, S.}}, pages = {{119--134}}, title = {{{ Lernbegleitung in der mathematischen Förderung. Praktiken von (angehenden) Lehrkräften bei der Förderung arithmetischer Basiskompetenzen}}}, doi = {{10.31244/9783818851057 }}, year = {{2026}}, }