@article{61123,
  abstract     = {{<jats:p>Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.</jats:p>}},
  author       = {{Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  issn         = {{0360-0300}},
  journal      = {{ACM Computing Surveys}},
  keywords     = {{fact checking, knowledge graphs, fact-checkers, check worthiness, evidence retrieval, trust, veracity.}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Fact Checking Knowledge Graphs -- A Survey}}},
  doi          = {{10.1145/3749838}},
  volume       = {{58}},
  year         = {{2025}},
}

@article{59912,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity and satisfiability of our logics.</jats:p>}},
  author       = {{Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}},
  issn         = {{0955-792X}},
  journal      = {{Journal of Logic and Computation}},
  number       = {{3}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Logics with probabilistic team semantics and the Boolean negation}}},
  doi          = {{10.1093/logcom/exaf021}},
  volume       = {{35}},
  year         = {{2025}},
}

@inproceedings{59054,
  author       = {{Firmansyah, Asep Fajar and Zahera, Hamada Mohamed Abdelsamee and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{ESWC2025}},
  isbn         = {{978-3-031-94575-5}},
  keywords     = {{firmansyah mousallem ngonga sherif zahera}},
  pages        = {{133----151}},
  publisher    = {{pringer Nature Switzerland}},
  title        = {{{ANTS: Abstractive Entity Summarization in Knowledge Graphs}}},
  doi          = {{10.1007/978-3-031-94575-5_8}},
  year         = {{2025}},
}

@unpublished{61066,
  abstract     = {{Argumentation is a central subarea of Artificial Intelligence (AI) for
modeling and reasoning about arguments. The semantics of abstract argumentation
frameworks (AFs) is given by sets of arguments (extensions) and conditions on
the relationship between them, such as stable or admissible. Today's solvers
implement tasks such as finding extensions, deciding credulous or skeptical
acceptance, counting, or enumerating extensions. While these tasks are well
charted, the area between decision, counting/enumeration and fine-grained
reasoning requires expensive reasoning so far. We introduce a novel concept
(facets) for reasoning between decision and enumeration. Facets are arguments
that belong to some extensions (credulous) but not to all extensions
(skeptical). They are most natural when a user aims to navigate, filter, or
comprehend the significance of specific arguments, according to their needs. We
study the complexity and show that tasks involving facets are much easier than
counting extensions. Finally, we provide an implementation, and conduct
experiments to demonstrate feasibility.}},
  author       = {{Fichte, Johannes and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan}},
  booktitle    = {{arXiv:2505.10982}},
  title        = {{{Facets in Argumentation: A Formal Approach to Argument Significance}}},
  year         = {{2025}},
}

@article{54970,
  author       = {{Quack, Carolin and Bruns, Julia}},
  journal      = {{Frühe Bildung}},
  number       = {{2}},
  pages        = {{72--78}},
  title        = {{{Mathematikbezogenes Wissen, Einstellungen und Lerngelegenheiten als Einflussfaktoren der situativen Beobachtung und Wahrnehmung angehender frühpädagogischer Fachkräfte}}},
  doi          = {{https://doi.org/10.1026/2191-9186/a000712}},
  volume       = {{14}},
  year         = {{2025}},
}

@unpublished{65018,
  abstract     = {{Android applications collecting data from users must protect it according to the current legal frameworks. Such data protection has become even more important since in 2018 the European Union rolled out the General Data Protection Regulation (GDPR). Since app developers are not legal experts, they find it difficult to integrate privacy-aware practices into source code development. Despite these legal obligations, developers have limited tool support to reason about data protection throughout their app development process.
  This paper explores the use of static program slicing and software visualization to analyze privacy-relevant data flows in Android apps. We introduce SliceViz, a web tool that analyzes an Android app by slicing all privacy-relevant data sources detected in the source code on the back-end. It then helps developers by visualizing these privacy-relevant program slices.
  We conducted a user study with 12 participants demonstrating that SliceViz effectively aids developers in identifying privacy-relevant properties in Android apps.
  Our findings indicate that program slicing can be employed to identify and reason about privacy-relevant data flows in Android applications. With further usability improvements, developers can be better equipped to handle privacy-sensitive information.}},
  author       = {{Khedkar, Mugdha and Schlichtig, Michael and Mohan, Santhosh and Bodden, Eric}},
  booktitle    = {{arXiv:2503.16640}},
  title        = {{{Visualizing Privacy-Relevant Data Flows in Android Applications}}},
  year         = {{2025}},
}

@inproceedings{65038,
  abstract     = {{The rapid advancements in digital transformation have led to the emergence of dataspaces as a pivotal element for industry-wide and cross-industry data integration and interoperability across various businesses. Despite their potential, the adoption and effective utilization of dataspaces by business stakeholders remain challenging. This paper aims to address this gap by developing a comprehensive learning environment tailored for business stakeholders. Through an interview study and an analysis of the current state of research, we identify problem fields and derive key requirements for the development of the learning environment. The proposed environment includes a demonstrator and a training concept designed to enhance stakeholders' understanding and capabilities in managing and leveraging dataspaces. Our findings contribute to the body of knowledge by providing practical guidance through learning environments for the deployment of dataspaces in business contexts and highlighting areas for future research.}},
  author       = {{Lick, Jonas and Lamarz, Jessica and Dohmann, Friederike and Kulkarni, Pranav Jayant and Zerbin, Julian and Koldewey, Christian}},
  booktitle    = {{2024 6th International Conference on Control and Robotics (ICCR)}},
  location     = {{Yokohama, Japan }},
  publisher    = {{IEEE}},
  title        = {{{Guidance on Dataspaces: Development of a Learning Environment for Industrial SMEs}}},
  doi          = {{10.1109/iccr64365.2024.10927580}},
  year         = {{2025}},
}

@article{62291,
  abstract     = {{In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this note, we aim to apply it to a vast range of examples of polynomials providing a unifying source for limiting empirical zero distributions.
 We cover Touchard, Fubini, Eulerian, Narayana and little $q$-Laguerre polynomials as well as hypergeometric polynomials including the classical Hermite, Laguerre and Jacobi polynomials. We construct polynomials whose empirical zero distributions converge to the free multiplicative normal and Poisson distributions. Furthermore, we study polynomials generated by some differential operators. As one inverse result, we derive coefficient asymptotics of the characteristic polynomial of random covariance matrices.}},
  title        = {{{Zeros and exponential profiles of polynomials II: Examples}}},
  doi          = {{10.48550/ARXIV.2509.11248}},
  year         = {{2025}},
}

@inproceedings{62302,
  abstract     = {{The degree of crosslinking in unidirectional prepreg materials was investigated using differential scanning calorimetry to assess their curing behavior and thermal characteristics. To complement these measurements with a non-destructive, in-situ method, the propagation properties of guided acoustic waves in cured carbon fibre-reinforced epoxy plates were analysed. Correlations between the degree of crosslinking and acoustically determined mechanical properties were drawn to enable a future non-destructive evaluation approach.}},
  author       = {{Irmak, Hayrettin and Claes, Leander and Wu, Shuang and Marten, Thorsten and Tröster, Thomas}},
  booktitle    = {{2025 International Congress on Ultrasonics}},
  isbn         = {{978-3-910600-08-9}},
  keywords     = {{fibre-reinforced polymers, differential scanning calorimetry, degree of crosslinking, guided waves, ultrasound}},
  location     = {{Paderborn, Germany}},
  pages        = {{235–238}},
  publisher    = {{AMA Service GmbH}},
  title        = {{{Assessment of the influence of curing parameters on fibre reinforced epoxy composite properties using guided ultrasonic waves}}},
  doi          = {{10.5162/ultrasonic2025/c13-b3}},
  year         = {{2025}},
}

@inproceedings{65097,
  author       = {{Weber, Daniel and Lange, Jarren and Wallscheid, Oliver}},
  booktitle    = {{2025 IEEE Kiel PowerTech}},
  publisher    = {{IEEE}},
  title        = {{{Safe Reinforcement Learning-based Control for a Voltage Source Inverter Operating in an Unbalanced Grid}}},
  doi          = {{10.1109/powertech59965.2025.11180230}},
  year         = {{2025}},
}

@inproceedings{65102,
  abstract     = {{Efficient graph processing is essential for a wide range of applications. Scalability and memory access patterns are still a challenge, especially with the Breadth-First Search algorithm. This work focuses on leveraging HPC systems with multiple GPUs available in a single node with peer-to-peer functionality of the Intel oneAPI implementation of SYCL. We propose three GPU-based load-balancing methods: work-group localisation for efficient data access, even workload distribution for higher GPU occupancy, and a hybrid strided-access approach for heuristic balancing. These methods ensure performance, portability, and productivity with a unified codebase. Our proposed methodologies outperform state-of-the-art single-GPU implementations based on CUDA on synthetic RMAT graphs. We analysed BFS performance across NVIDIA A100, Intel Max 1550, and AMD MI300X GPUs, achieving a peak performance of 153.27 GTEPS on an RMAT25-64 graph using 8 GPUs on the NVIDIA A100. Furthermore, our work demonstrates the capability to handle RMAT graphs up to scale 29, achieving superior performance on synthetic graphs and competitive results on real-world datasets.}},
  author       = {{Olgu, Kaan and Kenter, Tobias and Nunez-Yanez, Jose and McIntosh-Smith, Simon and Deakin, Tom}},
  booktitle    = {{Proceedings of the SC '25 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis}},
  publisher    = {{ACM}},
  title        = {{{Towards Efficient Load Balancing BFS on GPUs: One Code for AMD, Intel & Nvidia}}},
  doi          = {{10.1145/3731599.3767570}},
  year         = {{2025}},
}

@techreport{62981,
  abstract     = {{Otus is a high-performance computing cluster that was launched in 2025 and is operated by the Paderborn Center for Parallel Computing (PC2) at Paderborn University in Germany. The system is part of the National High Performance Computing (NHR) initiative. Otus complements the previous supercomputer Noctua 2, offering approximately twice the computing power while retaining the three node types that were characteristic of Noctua 2: 1) CPU compute nodes with different memory capacities, 2) high-end GPU nodes, and 3) HPC-grade FPGA nodes. On the Top500 list, which ranks the 500 most powerful supercomputers in the world, Otus is in position 164 with the CPU partition and in position 255 with the GPU partition (June 2025). On the Green500 list, ranking the 500 most energy-efficient supercomputers in the world, Otus is in position 5 with the GPU partition (June 2025).


This article provides a comprehensive overview of the system in terms of its hardware, software, system integration, and its overall integration into the data center building to ensure energy-efficient operation. The article aims to provide unique insights for scientists using the system and for other centers operating HPC clusters. The article will be continuously updated to reflect the latest system setup and measurements. }},
  author       = {{Ehtesabi, Sadaf and Hossain, Manoar and Kenter, Tobias and Krawinkel, Andreas and Ostermann, Lukas and Plessl, Christian and Riebler, Heinrich and Rohde, Stefan and Schade, Robert and Schwarz, Michael and Simon, Jens and Winnwa, Nils and Wiens, Alex and Wu, Xin}},
  keywords     = {{Otus, Supercomputer, FPGA, PC2, Paderborn Center for Parallel Computing, Noctua 2, HPC}},
  pages        = {{33}},
  publisher    = {{Paderborn Center for Parallel Computing (PC2)}},
  title        = {{{Otus Supercomputer}}},
  doi          = {{10.48550/ARXIV.2512.07401}},
  volume       = {{1}},
  year         = {{2025}},
}

@article{56131,
  abstract     = {{This article provides a comprehensive mathematical-didactic analysis of how the highly relevant topic symmetry can be prepared for the university education of PSTs. Methodologically, the analysis is embedded in a design research cycle and serves as preparation for the actual design of learning activities. The procedure of "specifying and structuring" learning objects is used and adapted in such a way that, in addition to mathematical aspects, profession-oriented references to school mathematics are also considered. An essential result of the analysis is the formulation of so-called interface aspects to symmetry, which prove to be helpful in establishing such references. }},
  author       = {{Hoffmann, Max}},
  journal      = {{Recherches en Didactique des Mathématiques}},
  number       = {{2}},
  pages        = {{85--120}},
  title        = {{{Symmetry as a Topic for the University Education of Pre-Service Teachers}}},
  doi          = {{10.46298/rdm.14256}},
  volume       = {{45}},
  year         = {{2025}},
}

@inproceedings{65246,
  author       = {{Hoffmann, Max}},
  booktitle    = {{Proceedings of the Fourteenth Congress of the European Society for Research in Mathematics Education (CERME14)}},
  editor       = {{Bosch, Marianna and Bolondi, Giorgio and Carreira, Susana and Gaidoschik, Michael and Spagnolo, Camilla}},
  pages        = {{2245--2252}},
  publisher    = {{Free University of Bozen-Bolzano and ERME}},
  title        = {{{Using scriptwriting as a response format for interface tasks: Exemplary analyses in the context of symmetry}}},
  year         = {{2025}},
}

@inproceedings{63441,
  author       = {{Moritzer, Elmar and Brandes, Philipp and Wittler, Maurice and Claes, Leander and Wippermann, Mareen and Henning, Bernd}},
  booktitle    = {{40th International Conference of the Polymer Processing Society}},
  keywords     = {{Faser-Kunststoff-Verbunde (FKV), Faserverstärkte Kunststoffe (FVK), Organobleche, Ultraschall}},
  title        = {{{Non-destructive fiber-matrix adhesion measurement of glass fiber reinforced thermoplastic composite laminates using ultrasound}}},
  year         = {{2025}},
}

@inproceedings{59896,
  abstract     = {{We present an electronic-photonic co-designed Mach-Zehnder modulator with linear segment drivers in a photonic SOI-CMOS technology with an EO 3-dB bandwidth of ≥ 27 GHz and data transmission up to 64 Gbit/s without pre-emphasis.}},
  author       = {{Kress, Christian and Schwabe, Tobias and Mihaylov, Martin Miroslavov and Scheytt, J. Christoph}},
  location     = {{Long Beach, CA, USA}},
  title        = {{{High-Speed Mach-Zehnder Modulator with Linear Segmented On-Chip Drivers in Photonic 45nm SOI-CMOS Technology }}},
  year         = {{2025}},
}

@article{53413,
  abstract     = {{For negatively curved symmetric spaces it is known that the poles of the
scattering matrices defined via the standard intertwining operators for the
spherical principal representations of the isometry group are either given as
poles of the intertwining operators or as quantum resonances, i.e. poles of the
meromorphically continued resolvents of the Laplace-Beltrami operator. We
extend this result to classical locally symmetric spaces of negative curvature
with convex-cocompact fundamental group using results of Bunke and Olbrich. The
method of proof forces us to exclude the spectral parameters corresponding to
singular Poisson transforms.}},
  author       = {{Delarue, Benjamin and Hilgert, Joachim}},
  issn         = {{0949-5932}},
  journal      = {{Journal of Lie Theory}},
  number       = {{(4)}},
  pages        = {{787----804}},
  title        = {{{Quantum resonances and scattering poles of classical rank one locally  symmetric spaces}}},
  volume       = {{35}},
  year         = {{2025}},
}

@inproceedings{60504,
  author       = {{Nellius, Tom and Henne, Kevin and Hartinger, Maximilian and Meihost, Lars and Hetkämper, Tim and Zeipert, Henning and Claes, Leander and Henning, Bernd}},
  location     = {{Nürnberg}},
  title        = {{{Ultrasonic phased array interface using programmable I/O and microprocessor clock synchronisation}}},
  doi          = {{ 10.5162/SMSI2025/A5.4}},
  year         = {{2025}},
}

@misc{64902,
  abstract     = {{Diese Dissertation behandelt die Entwicklung, Erprobung und Evaluation einer mobilen Augmented Reality Anwendung (mAR-App) namens PEARL (Paderborner Elektrotechnik AR Laborpraktikum), die als Vorbereitungsmaßnahme für elektrotechnische Laborpraktika konzipiert wird. Ziel ist es, Studierenden eine zeitlich und örtlich flexible Möglichkeit zu bieten, den realitätsnahen Umgang mit Laborgeräten - primär dem Oszilloskop - zu erlernen. Die methodische Grundlage bilden der Makrozyklus von Design-Based Research (DBR) als strukturierender Rahmen und das heuristische Modell des Research Pentagons, das die Durchführung auf Mikroebene bestimmt. In insgesamt vier Research Pentagons werden didaktische, technologische, motivationale und evaluative Komponenten systematisch untersucht und weiterentwickelt. Das erste Pentagon fokussiert die Entwicklung eines didaktisch fundierten Konzepts nach dem Prinzip des Constructive Alignment, das Lernziele, Lernaktivitäten und Prüfungsformen in fünf abgestufte Lernlevel überführt. Diese reichen von der initialen Orientierung bis zur eigenständigen Problemlösung in einem freien Experimentiermodus. Im zweiten Research Pentagon wird die technische Machbarkeit von Augmented - und Virtual Reality (VR) im Laborumfeld anhand mehrerer funktionaler Prototypen evaluiert. Während sich VR aufgrund technischer Einschränkungen als ungeeignet erweist, zeigt AR - insbesondere in der markerlosen Ausführung mittels der Software Development Kits (SDKs) ARCore und ARKit - ein hohes Potenzial für den praktischen Einsatz. Im dritten Pentagon entsteht ein Onboarding-Modul, das auf die erste Version der mobilen App (V0.17.01) aufsetzt und grundlegende Funktionen eines realen Oszilloskops digital abbildet. Dabei werden Nutzer:innen schrittweise an das virtuelle Oszilloskop herangeführt und lernen zugleich die zentralen Funktionen der mAR-App kennen. Die Ergebnisse zeigen eine insgesamt neutrale bis leicht positive Nutzungserfahrung, wobei technische Schwächen (z.B. Reaktionszeit oder Objektverankerung) die Effizienz und Steuerbarkeit beeinträchtigen. Im Exkurs-Kapitel erfolgt eine Eye-Tracking-Studie zur Untersuchung visueller Aufmerksamkeit und individueller Lösungsstrategien von Expert:innen und Noviz:innen bei der Arbeit am realen Oszilloskop. Heatmaps und Zeitverläufe in definierten Areas of Interest (AOI) liefern erste Hinweise auf Unterschiede im Blickverhalten zwischen den Gruppen. Die algorithmischen Scanpfadanalysen der Blickverläufe hingegen zeigen eine geringe Trennschärfe. Das Potenzial von Eye-Tracking als Evaluationsmethode wird daher kritisch reflektiert, aber angesichts technologischer Entwicklungen und verfügbarer Eye-Tracker in Mixed Reality (MR) Brillen weiterhin als zukunftsrelevant eingeordnet. Die abschließende summative Evaluation nutzt ein Prä‑Post-Test-Design mit Kontrollgruppenvergleich mit 70 Teilnehmenden, um die Lernwirksamkeit der überarbeiteten mAR-App mit klassischen Materialien wie Videos und Handbüchern zu vergleichen. In der Interventionsgruppe (IG) zeigen sich auf kognitiver und affektiver Ebene signifikant positive Veränderungen: Die Leistungen steigen deutlich, insbesondere in den Taxonomiestufen Anwendung, Verständnis und Analyse; zugleich nehmen experimentelles Selbstkonzept und experimentelles Sachinteresse zu, während Überforderung und Ängstlichkeit im Hinblick auf die Laborpraktika abnehmen. Als Einschränkung zeigt sich, dass die mAR-App keinen klaren Vorsprung gegenüber der Kontrollgruppe (KG) erreicht, was sowohl auf die sehr gut ausgearbeiteten Materialien und Videos der KG als auch auf technische Begrenzungen der mobilen Umsetzung zurückzuführen ist: Kleine Displays, 2D-Oberflächen für 3D-Geräte und unpräzise Touch-Interaktionen erschweren komplexe, feinmotorische Aufgaben. In den begleitenden User Interface (UI) und User Experience (UX) Fragebögen spiegeln sich diese Limitationen in gemischten Bewertungen der App wider. Die Arbeit verdeutlicht, dass die mobile AR-Anwendung trotz technischer Einschränkungen wertvolle Möglichkeiten für die Vorbereitung auf Laborpraktika und das Kennenlernen von Laborgeräten bieten kann. Der Fokus bei der Entwicklung liegt von Beginn an auf einer modularen und flexiblen App-Architektur, um sie mit neuen Geräten und Aufgaben zu erweitern. Der Hauptnutzen liegt perspektivisch nicht in der mobilen Anwendung selbst, sondern in der strategischen Ausrichtung auf zukunftsfähige, skalierbare Lösungen für MR-Brillen. Diese erlauben eine authentische Gestensteuerung und realitätsnahe Interaktionen.}},
  author       = {{Alptekin, Mesut}},
  publisher    = {{LibreCat University}},
  title        = {{{Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik}}},
  doi          = {{10.17619/UNIPB/1-2483}},
  year         = {{2025}},
}

@inproceedings{65466,
  author       = {{Bäumer, Fabian and Brinkmann, Marcus and Radoy, Maximilian and Schwenk, Jörg and Somorovsky, Juraj}},
  booktitle    = {{Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security}},
  publisher    = {{ACM}},
  title        = {{{On the Security of SSH Client Signatures}}},
  doi          = {{10.1145/3719027.3765079}},
  year         = {{2025}},
}