Tootfinder

While trying out simple #macrophotography gear on my balcony in Bochum, Germany, I caught a tiny (only a millimeter or so) #spider constructing a little web, no more than 5 cm in diameter - and catching a tiny fly almost immediately. Nature's drama at home ... ;-) Panasonic #Lumix DMC-FZ300 with DMW LC-55 close-up lens, either at maximum optical zoom or somewhat into digital. Bright sunlight in the afternoon. All the macro pictures, also of aphids, in https://www.facebook.com/media/set/?vanity=dan.fischer.393&set=a.10230385624319362

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

Topological Contextuality and Quantum Representations
Tzu-Miao Chou
https://arxiv.org/abs/2506.14537 https://arxiv.org/pdf/2506.14537…

Topological Contextuality and Quantum Representations
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid group representations induced by modular categories, particularly those associated with SU(2) at level k and Fibonacci anyon models, exhibit state-dependent contextuality characterized by violations of noncontextuality inequalities. By explicitly constructing …

TTSOps: A Closed-Loop Corpus Optimization Framework for Training Multi-Speaker TTS Models from Dark Data
Kentaro Seki, Shinnosuke Takamichi, Takaaki Saeki, Hiroshi Saruwatari
https://arxiv.org/abs/2506.15614

TTSOps: A Closed-Loop Corpus Optimization Framework for Training Multi-Speaker TTS Models from Dark Data
This paper presents TTSOps, a fully automated closed-loop framework for constructing multi-speaker text-to-speech (TTS) systems from noisy, uncurated web-scale speech data, often referred to as ``dark data,'' such as online videos. Conventional TTS training pipelines require well-curated corpora with high acoustic quality and accurate text-speech alignment, which severely limits scalability, speaker diversity, and real-world applicability. While recent studies have proposed acoustic-quality-bas…

A new Lagrange multiplier approach for constructing structure preserving schemes, III. Bound preserving and energy dissipating
Qing Cheng, Tingfeng Wang, Xiaofei Zhao
https://arxiv.org/abs/2506.12402

A new Lagrange multiplier approach for constructing structure preserving schemes, III. Bound preserving and energy dissipating
In the third part of this series, we continue to explore the idea of the Lagrange multiplier introduced in the first part [2020, Comput. Methods Appl. Mech. Engr., 391, 114585] and refined in the second part [2022, SIAM J. Numer. Anal., 60, 970-998] to further develop efficient and accurate numerical schemes that preserve the maximum bound principle (MBP) and energy dissipation for solving gradient flows. The proposed framework allows us to begin with any conventional scheme as a predictor step…

Multi-dimensional evaluation on a rural integrated energy system including solar, wind, biomass and geothermal energy
Ruonan Lia, Chang Wena, Mingyu Yan, Congcong Wu, Ahmed Lotfy Elrefai, Xiaotong Zhang, Sahban Wael Saeed Alnaser
https://arxiv.org/abs/2506.15398

Multi-dimensional evaluation on a rural integrated energy system including solar, wind, biomass and geothermal energy
This study focuses on the novel municipal-scale rural integrated energy system (RIES), which encompasses energy supply and application. By constructing a seven-dimensional evaluation system including energy efficiency, energy supply, low-carbon sustainability, environmental impact, energy economy, social benefits, and integrated energy system development, this research combines the improved analytic hierarchy process (IAHP) and entropy weight method (EWM) by sum of squares of deviations to bala…

Feature Complementation Architecture for Visual Place Recognition
Weiwei Wang, Meijia Wang, Haoyi Wang, Wenqiang Guo, Jiapan Guo, Changming Sun, Lingkun Ma, Weichuan Zhang
https://arxiv.org/abs/2506.12401

Feature Complementation Architecture for Visual Place Recognition
Visual place recognition (VPR) plays a crucial role in robotic localization and navigation. The key challenge lies in constructing feature representations that are robust to environmental changes. Existing methods typically adopt convolutional neural networks (CNNs) or vision Transformers (ViTs) as feature extractors. However, these architectures excel in different aspects -- CNNs are effective at capturing local details. At the same time, ViTs are better suited for modeling global context, mak…

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Zhiyao Zhong, Cyrus Omar
https://arxiv.org/abs/2506.10781 https://

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Students in programming languages and formal logic courses often struggle with constructing rule-based derivation trees due to the complexity of applying inference rules, the lack of immediate feedback, and the manual effort required for handwritten proofs. We present Hazel Deriver, a live, web-based editor designed to scaffold derivation construction through multiple layers of support. Built on the Hazel live programming environment, it provides a structured, interactive experience that encour…

CLEAN-MI: A Scalable and Efficient Pipeline for Constructing High-Quality Neurodata in Motor Imagery Paradigm
Dingkun Liu, Zhu Chen, Dongrui Wu
https://arxiv.org/abs/2506.11830

CLEAN-MI: A Scalable and Efficient Pipeline for Constructing High-Quality Neurodata in Motor Imagery Paradigm
The construction of large-scale, high-quality datasets is a fundamental prerequisite for developing robust and generalizable foundation models in motor imagery (MI)-based brain-computer interfaces (BCIs). However, EEG signals collected from different subjects and devices are often plagued by low signal-to-noise ratio, heterogeneity in electrode configurations, and substantial inter-subject variability, posing significant challenges for effective model training. In this paper, we propose CLEAN-M…

Numerical Modeling of n-Hexane Pyrolysis with an Optimized Kinetic Mechanism in a Hydrogen Plasma Reactor
Subin Choi, Chanmi Jung, Dae Hoon Lee, Jeongan Choi, Jaekwang Kim
https://arxiv.org/abs/2506.13789

Numerical Modeling of n-Hexane Pyrolysis with an Optimized Kinetic Mechanism in a Hydrogen Plasma Reactor
The physicochemical mechanisms underlying the pyrolysis of n-hexane in a high temperature Ar-H2 environment were investigated for plasma pyrolysis process. An optimal chemical kinetics model was developed using the Reaction Mechanism Generator (RMG), an automated tool for constructing reaction mechanisms. This model was validated through 0-D analyses, where simulation result were compared with existing kinetic models (LLNL,JetSurf) and experimental data from conventional n-hexane pyrolysis. Sub…

Unique support from identity-based groups: Professional networks of women and LGBTQ physicists analyzed and compared by career sector
Chase Hatcher, Adrienne Traxler, Lily Donis, Madison Swirtz, Camila Manni, Justin Gutzwa, Charles Henderson, Ram\'on Barthelemy
https://arxiv.org/abs/2506.14752…

Unique support from identity-based groups: Professional networks of women and LGBTQ+ physicists analyzed and compared by career sector
This paper presents a social network analysis of the professional support networks of 100 LGBTQ+ and/or women PhD physicists, comparing the networks based on the career sectors of academia, industry, and government/nonprofit. The methods for constructing and analyzing the ego networks, which are novel in many ways, are explained in greater detail in an earlier publication (Hatcher et. al., 2025). We use statistical tests of independence to explore differences between sectors in terms of whole n…

Calamus 34 I dreamed in a dream
On the surface this short poem is a sort of City on a Hill vision. But I'm going to go with a more radical reading.
This poem reads to me as a fantasy of a gay society. A city of men, lovers, set apart from the rest of the world.
a city invincible to the attacks of the whole of the rest of the earth ...
the quality of robust love ...
the actions of the men of that city
And in all their looks and words.
I can't plausibly argue Whitman conceived of a city set apart in the way I imagine. Although all of Calamus is him constructing the idea of a society of lovers, comrades, brothers, robust love. That to me is very gay.
Intriguingly, in the unpublished Live Oak draft of this poem it is even more explicitly gay:
I saw them tenderly love each other ...
Nothing was greater there than manly love
It seems to me he dreamed a very gay city.

M3SD: Multi-modal, Multi-scenario and Multi-language Speaker Diarization Dataset
Shilong Wu, Hang Chen, Jun Du
https://arxiv.org/abs/2506.14427 https://

M3SD: Multi-modal, Multi-scenario and Multi-language Speaker Diarization Dataset
In the field of speaker diarization, the development of technology is constrained by two problems: insufficient data resources and poor generalization ability of deep learning models. To address these two problems, firstly, we propose an automated method for constructing speaker diarization datasets, which generates more accurate pseudo-labels for massive data through the combination of audio and video. Relying on this method, we have released Multi-modal, Multi-scenario and Multi-language Spea…

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
Chao Yang, Zhujun Zhang
https://arxiv.org/abs/2506.12726 https://

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on translational tiling problems where the tilings are subject to the geometric shapes of the tiles only. However, all these results are proved by constructing tiles with extremely concave shapes. It is natural to ask: can we obtain undecidability results of tr…

An Extended Variational Barzilai-Borwein Method
Xin Xu
https://arxiv.org/abs/2506.12731 https://arxiv.org/pdf/2506.12731

An Extended Variational Barzilai-Borwein Method
The Barzilai-Borwein (BB) method is an effective gradient descent algorithm for solving unconstrained optimization problems. Based on the observation of two classical BB step sizes, by constructing a variational least squares model, we propose a novel class of BB step sizes, each of which still retains the quasi-Newton property, with the original two BB step sizes being their two extreme cases.

A Hybrid Neural Network -- Polynomial Series Scheme for Learning Invariant Manifolds of Discrete Dynamical Systems
Dimitrios G. Patsatzis, Nikolaos Kazantzis, Ioannis G. Kevrekidis, Constantinos Siettos
https://arxiv.org/abs/2506.13950

A Hybrid Neural Network -- Polynomial Series Scheme for Learning Invariant Manifolds of Discrete Dynamical Systems
We propose a hybrid machine learning scheme to learn -- in physics-informed and numerical analysis-informed fashion -- invariant manifolds (IM) of discrete maps for constructing reduced-order models (ROMs) for dynamical systems. The proposed scheme combines polynomial series with shallow neural networks, exploiting the complementary strengths of both approaches. Polynomials enable an efficient and accurate modeling of ROMs with guaranteed local exponential convergence rate around the fixed poin…

Constructing and Evaluating Declarative RAG Pipelines in PyTerrier
Craig Macdonald, Jinyuan Fang, Andrew Parry, Zaiqiao Meng
https://arxiv.org/abs/2506.10802

Constructing and Evaluating Declarative RAG Pipelines in PyTerrier
Search engines often follow a pipeline architecture, where complex but effective reranking components are used to refine the results of an initial retrieval. Retrieval augmented generation (RAG) is an exciting application of the pipeline architecture, where the final component generates a coherent answer for the users from the retrieved documents. In this demo paper, we describe how such RAG pipelines can be formulated in the declarative PyTerrier architecture, and the advantages of doing so. O…

On exterior-algebraic quaternions with application to Maxwell equations
Ivano Colombaro
https://arxiv.org/abs/2506.13927 https://arxi…

On exterior-algebraic quaternions with application to Maxwell equations
Within the framework of exterior algebra, the concept of time-like quaternions has been previously established. This paper advances beyond the existing structure by elucidating the procedure for constructing time-like quaternions with the feature of complex scalar terms. We delineate on the crucial role of these extended definition of quaternions in formulating Maxwell equations, having properly defined a pure quaternion containing the components of the classical electric and magnetic fields. T…

Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models
Tim Whittaker, Alejandro Di Luca
https://arxiv.org/abs/2506.10660

Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models
Understanding the plausible upper bounds of extreme weather events is essential for risk assessment in a warming climate. Existing methods, based on large ensembles of physics-based models, are often computationally expensive or lack the fidelity needed to simulate rare, high-impact extremes. Here, we present a novel framework that leverages a differentiable hybrid climate model, NeuralGCM, to optimize initial conditions and generate physically consistent worst-case heatwave trajectories. Appli…

Constructing Quantum Many-Body Scars from Hilbert Space Fragmentation
Fan Yang, Matteo Magoni, Hannes Pichler
https://arxiv.org/abs/2506.10806 https://

Constructing Quantum Many-Body Scars from Hilbert Space Fragmentation
Quantum many-body scars (QMBS) are exotic many-body states that exhibit anomalous non-thermal behavior in an otherwise ergodic system. In this work, we demonstrate a simple, scalable and intuitive construction of QMBS in a kinetically constrained quantum model exhibiting weak Hilbert space fragmentation. We show that towers of exact QMBS can be constructed by injecting a quasiparticle excitation that partially activates the frozen regions in the lattice. Meanwhile, the inelastic collision betwe…

Inference post region selection
Dominique Bontemps (IMT), Fran\c{c}ois Bachoc (IMT, ANITI), Pierre Neuvial (IMT)
https://arxiv.org/abs/2506.11564 https://

Inference post region selection
Post-selection inference consists in providing statistical guarantees, based on a data set, that are robust to a prior model selection step on the same data set. In this paper, we address an instance of the post-selection-inference problem, where the model selection step consists in selecting a rectangular region in a spatial domain. The inference step then consists in constructing confidence intervals on the average signal of this region. This is motivated by applications such as genetics or b…

EmbodiedGen: Towards a Generative 3D World Engine for Embodied Intelligence
Wang Xinjie, Liu Liu, Cao Yu, Wu Ruiqi, Qin Wenkang, Wang Dehui, Sui Wei, Su Zhizhong
https://arxiv.org/abs/2506.10600

EmbodiedGen: Towards a Generative 3D World Engine for Embodied Intelligence
Constructing a physically realistic and accurately scaled simulated 3D world is crucial for the training and evaluation of embodied intelligence tasks. The diversity, realism, low cost accessibility and affordability of 3D data assets are critical for achieving generalization and scalability in embodied AI. However, most current embodied intelligence tasks still rely heavily on traditional 3D computer graphics assets manually created and annotated, which suffer from high production costs and li…

G-Sim: Generative Simulations with Large Language Models and Gradient-Free Calibration
Samuel Holt, Max Ruiz Luyten, Antonin Berthon, Mihaela van der Schaar
https://arxiv.org/abs/2506.09272

G-Sim: Generative Simulations with Large Language Models and Gradient-Free Calibration
Constructing robust simulators is essential for asking "what if?" questions and guiding policy in critical domains like healthcare and logistics. However, existing methods often struggle, either failing to generalize beyond historical data or, when using Large Language Models (LLMs), suffering from inaccuracies and poor empirical alignment. We introduce G-Sim, a hybrid framework that automates simulator construction by synergizing LLM-driven structural design with rigorous empirical calibration…

SWE-Factory: Your Automated Factory for Issue Resolution Training Data and Evaluation Benchmarks
Lianghong Guo, Yanlin Wang, Caihua Li, Pengyu Yang, Jiachi Chen, Wei Tao, Yingtian Zou, Duyu Tang, Zibin Zheng
https://arxiv.org/abs/2506.10954

SWE-Factory: Your Automated Factory for Issue Resolution Training Data and Evaluation Benchmarks
Constructing large-scale datasets for the GitHub issue resolution task is crucial for both training and evaluating the software engineering capabilities of Large Language Models (LLMs). However, the traditional process for creating such benchmarks is notoriously challenging and labor-intensive, particularly in the stages of setting up evaluation environments, grading test outcomes, and validating task instances. In this paper, we propose SWE-Factory, an automated pipeline designed to address th…

US political contradictions; knowledge systems
As Trump at least partially succeeds in constructing an alternate reality for his most ardent followers, it's tempting to think of his dogma as false, in contrast to some imagined "truth" which his non-followers are smart enough to believe in. But a more nuanced view of knowledge would admit that different groups of people have different shared truths, constituting different knowledge systems which each deviate from what's objectively measurable in different ways, and in fact they each accept different standards of what is objective, so there's not really a single "ground truth" we can even compare to to determine which of these knowledge systems is "more correct" (similar problems arise even if we only care about "more useful").
To make this more concrete, we can see that e.g., competing quantum physics theories, or likewise competing religious beliefs, have no reasonable basis on which to judge between them, either in terms of "truth" or "utility." So the Trump-dogma knowledge system, although bad, morally repugnant, etc., can't so easily be dismissed as "false" in my view. "Distorted" or "malignant" or "evil" or "contradictory" are better monikers, in my opinion.
But what I'm even more interested in thinking about is: in what ways does the current American liberal "common sense" knowledge system already bear the scars of past fascist lies & contradictions? I can think of a few:
"Columbus was an explorer."
This is "factually accurate" in the same way some of Trump's propaganda is, but it's also a cruel distortion of "Columbus was a child murderer," and it's a misrepresentation that serves an evil purpose, yet which is widely taught in elementary schools today.
Another: "dropping atomic bombs on civilians in Japan was necessary to end WWII."
Perhaps in the future we'll have "family separation & the 2025 ICE crackdowns were necessary to end the immigration crisis," although I dearly hope not.
"Reparations for slavery aren't reasonable," is yet another...
I'll close this rambling with a question: what other fascist lies have you noticed that are normalized in America right now from past Trump-like leaders (or even from less overtly fascist institutions)?

Differential Space of Feynman Integrals: Annihilators and $\mathcal{D}$-module
Vsevolod Chestnov, Wojciech Flieger, Pierpaolo Mastrolia, Saiei-Jaeyeong Matsubara-Heo, Nobuki Takayama, William J. Torres Bobadilla
https://arxiv.org/abs/2506.10456

Differential Space of Feynman Integrals: Annihilators and $\mathcal{D}$-module
We present a novel algorithm for constructing differential operators with respect to external variables that annihilate Feynman-like integrals and give rise to the associated $\mathcal{D}$-modules, based on Griffiths-Dwork reduction. By leveraging the Macaulay matrix method, we derive corresponding relations among partial differential operators, including systems of Pfaffian equations and Picard-Fuchs operators. Our computational approach is applicable to twisted period integrals in projective …

The Bisognano-Wichmann property for non-unitary Wightman conformal field theories
James E. Tener
https://arxiv.org/abs/2506.10625 https://

The Bisognano-Wichmann property for non-unitary Wightman conformal field theories
The Bisognano-Wichmann and Haag duality properties for algebraic quantum field theories are often studied using the powerful tools of Tomita-Takesaki modular theory for nets of operator algebras. In this article, we study analogous properties of nets of algebras generated by smeared Wightman fields, for potentially non-unitary theories. In light of recent work constructing Wightman field theories for (non-unitary) Möbius vertex algebras, we obtain a broadly applicable non-unitary version of th…

Studies on the $\pi^ p$ elastic scattering via the von Neumann entropy
Seung-il Nam
https://arxiv.org/abs/2506.10672 https://arxiv.o…

Studies on the $π^+ p$ elastic scattering via the von Neumann entropy
We study the $π^+ p$ elastic scattering process using an effective Lagrangian approach that incorporates the $s$-, $u$-, and $t$-channel amplitudes, including $Δ^{++,0}(1232)$, neutron, and $ρ^0$ contributions. By constructing the spin-density matrices (SDMs) from helicity amplitudes, we derive the von Neumann (entanglement) entropy associated with the spin degrees of freedom of the initial and final state particles. We compute the entropy by performing a partial trace over the spin subsyste…

Constructing Evidence-Based Tailoring Variables for Adaptive Interventions
John J. Dziak, Inbal Nahum-Shani
https://arxiv.org/abs/2506.03054 https://

Constructing Evidence-Based Tailoring Variables for Adaptive Interventions
Background: An adaptive intervention (ADI) uses individual information in order to select treatment, to improve effectiveness while reducing cost and burden. ADIs require tailoring variables: person- and potentially time-specific information used to decide whether and how to deliver treatment. Specifying a tailoring variable for an intervention requires specifying what to measure, when to measure it, when to make the resulting decisions, and what cutoffs should be used in making those decisions…

Constructing strong starters of orders $3p$: triplication with SAT solver
Oleg Ogandzhanyants, Sergey Sadov, Margo Kondratieva
https://arxiv.org/abs/2506.06461

Constructing strong starters of orders $3p$: triplication with SAT solver
A novel approach to building strong starters in cyclic groups of orders $n$ divisible by 3 from starters of smaller orders is presented. A strong starter in $Z_n$ ($n$ odd) is a partition of the set $\{1,2,\dots,n-1\}$ into pairs $\{a_i,b_i\}$ such that all pair sums $a_i+b_i$ are distinct and nonzero modulo $n$ and all differences $\pm(a_i-b_i)$ are distinct and nonzero modulo $n$. A special interest to strong starters of odd orders divisible by 3 is motivated by Horton's conjecture which clai…

Constructing Two Metrics for Spencer Cohomology: Hodge Decomposition of Constrained Bundles
Dongzhe Zheng
https://arxiv.org/abs/2506.00752 https://

Constructing Two Metrics for Spencer Cohomology: Hodge Decomposition of Constrained Bundles
This paper establishes a metric framework for Spencer complexes based on the geometric theory of compatible pairs $(D,λ)$ in principal bundle constraint systems, solving fundamental technical problems in computing Spencer cohomology of constraint systems. We develop two complementary and geometrically natural metric schemes: a tensor metric based on constraint strength weighting and an induced metric arising from principal bundle curvature geometry, both maintaining deep compatibility with the…

New class of time-periodic solutions to the 1D cubic wave equation
Filip Ficek, Maciej Maliborski
https://arxiv.org/abs/2506.10839 https://

New class of time-periodic solutions to the 1D cubic wave equation
In recent papers (arXiv:2407.16507, arXiv:2408.05158) we presented results suggesting the existence of a new class of time-periodic solutions to the defocusing cubic wave equation on a one-dimensional interval with Dirichlet boundary conditions. Here we confirm these findings by rigorously constructing solutions from this class. The proof uses rational arithmetic computations to verify essential operator bounds.

Constructing a bridge between functioning of oscillatory neuronal networks and quantum-like cognition along with quantum-inspired computation and AI
Andrei Khrennikov, Atsushi Iriki, Irina Basieva
https://arxiv.org/abs/2506.00040

Constructing a bridge between functioning of oscillatory neuronal networks and quantum-like cognition along with quantum-inspired computation and AI
Quantum-like (QL) modeling, one of the outcomes of the quantum information revolution, extends quantum theory methods beyond physics to decision theory and cognitive psychology. While effective in explaining paradoxes in decision making and effects in cognitive psychology, such as conjunction, disjunction, order, and response replicability, it lacks a direct link to neural information processing in the brain. This study bridges neurophysiology, neuropsychology, and cognitive psychology, explori…

KramaBench: A Benchmark for AI Systems on Data-to-Insight Pipelines over Data Lakes
Eugenie Lai, Gerardo Vitagliano, Ziyu Zhang, Sivaprasad Sudhir, Om Chabra, Anna Zeng, Anton A. Zabreyko, Chenning Li, Ferdi Kossmann, Jialin Ding, Jun Chen, Markos Markakis, Matthew Russo, Weiyang Wang, Ziniu Wu, Michael J. Cafarella, Lei Cao, Samuel Madden, Tim Kraska

KramaBench: A Benchmark for AI Systems on Data-to-Insight Pipelines over Data Lakes
Constructing real-world data-to-insight pipelines often involves data extraction from data lakes, data integration across heterogeneous data sources, and diverse operations from data cleaning to analysis. The design and implementation of data science pipelines require domain knowledge, technical expertise, and even project-specific insights. AI systems have shown remarkable reasoning, coding, and understanding capabilities. However, it remains unclear to what extent these capabilities translate…

A General Coupling for Ising Models and Beyond
Ulrik Thinggaard Hansen, Jianping Jiang, Frederik Ravn Klausen
https://arxiv.org/abs/2506.10765 https://

A General Coupling for Ising Models and Beyond
The couplings between the Ising model and its graphical representations, the random-cluster, random current and loop $\mathrm{O}(1)$ models, are put on common footing through a generalization of the Swendsen-Wang-Edwards-Sokal coupling. A new special case is that the single random current with parameter $2J$ on edges of agreement of XOR-Ising spins has the law of the double random current. The coupling also yields a general mechanism for constructing conditional Bernoulli percolation measures v…

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
Yubo Sun, Gennian Ge
https://arxiv.org/abs/2506.07607 https://

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
This paper addresses fundamental challenges in two-dimensional error correction by constructing optimal codes for \emph{criss-cross deletions}. We consider an $ n \times n $ array over a $ q $-ary alphabet $Σ_q := \{0, 1, \ldots, q-1\}$ that is subject to a \emph{$(t_r, t_c)$-criss-cross deletion}, which involves the simultaneous removal of $ t_r $ rows and $ t_c $ columns. A code $\mathcal{C} \subseteq Σ_q^{n \times n}$ is defined as a \emph{$(t_r,t_c)$-criss-cross deletion correcting code} …

This https://arxiv.org/abs/2505.21477 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Variétés réelles connexes non stablement rationnelles
Let $R$ be the field of real Puiseux series. It is a real closed field. We construct the first examples of smooth intersections of two quadrics in $\mathbb{P}_R^5$ and smooth cubic hypersurfaces in $\mathbb{P}_R^4$ which are not stably rational but for which the space $X(R)$ of $R$-points is semi-algebraically connected. The question of constructing such examples over the field of real numbers $\mathbb{R}$ remains open.

Interacting Electronic Topology of Nonlocal Crystals
Shu Hamanaka, Martina O. Soldini, Tsuneya Yoshida, Titus Neupert
https://arxiv.org/abs/2506.10071 http…

Interacting Electronic Topology of Nonlocal Crystals
Nonlocal crystals are systems with translational symmetry but arbitrary range couplings or interactions between degrees of freedom. We argue that the notion of topology in such systems does not collapse to that in zero dimensions, as one may naively expect in view of the infinite interaction range. At the same time, we show that the range of available topological phases can be enriched in comparison to the case with local interactions. This is demonstrated by constructing an example of a fermio…

Self-learning signal classifier for decameter coherent scatter radars
Oleg Berngardt, Ivan Lavygin
https://arxiv.org/abs/2506.10305 https://

Self-learning signal classifier for decameter coherent scatter radars
The paper presents a method for automatic constructing a classifier for processed data obtained by decameter coherent scatter radars. Method is based only on the radar data obtained, the results of automatic modeling of radio wave propagation in the ionosphere, and mathematical criteria for estimating the quality of the models. The final classifier is the model trained at data obtained by 12 radars of the SuperDARN and SECIRA networks over two years for each radar. The number of the model coeff…

This https://arxiv.org/abs/2407.15325 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

Odyssey: Empowering Minecraft Agents with Open-World Skills
Recent studies have delved into constructing generalist agents for open-world environments like Minecraft. Despite the encouraging results, existing efforts mainly focus on solving basic programmatic tasks, e.g., material collection and tool-crafting following the Minecraft tech-tree, treating the ObtainDiamond task as the ultimate goal. This limitation stems from the narrowly defined set of actions available to agents, requiring them to learn effective long-horizon strategies from scratch. Con…

The discontinuous planar piecewise linear system with two nodes has at most two limit cycles
Lu Chen, Changjian Liu
https://arxiv.org/abs/2506.07716 https:…

The discontinuous planar piecewise linear system with two nodes has at most two limit cycles
This paper investigates the multiplicity and the number of limit cycles for planar piecewise linear system divided into two regions by a straight line and each linear subsystem has a node. Through constructing Poincare half maps and a successor function, and analyzing the properties of the successor function, we can derive that this system has at most two limit cycles, counting the multiplicities of limit cycles.

Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
Aayush Gupta, Gopal Pandurangan
https://arxiv.org/abs/2506.04368 https:…

Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
We address a fundamental problem in Peer-to-Peer (P2P) networks, namely, constructing and maintaining dynamic P2P overlay network topologies with essential properties such as connectivity, low diameter, and high expansion, that are resilient to continuous high churn and the presence of a large number of malicious (Byzantine) nodes. Our main goal is to construct and maintain a sparse (bounded degree) expander topology despite high churn and a large number of Byzantine nodes. Such an expander top…

ASTAGEN: Empirical Evaluation of Automated SATD Taxonomy Generation with LLMs
Sota Nakashima, Yuta Ishimoto, Masanari Kondo, Tao Xiao, Yasutaka Kamei
https://arxiv.org/abs/2506.09601

ASTAGEN: Empirical Evaluation of Automated SATD Taxonomy Generation with LLMs
Technical debt refers to suboptimal code that degrades software quality. When developers intentionally introduce such debt, it is called self-admitted technical debt (SATD). Since SATD hinders maintenance, identifying its categories is key to uncovering quality issues. Traditionally, constructing such taxonomies requires manually inspecting SATD comments and surrounding code, which is time-consuming, labor-intensive, and often inconsistent due to annotator subjectivity. This study presents ASTA…

Coherent states of finite-level systems
A. I. Breev, D. M. Gitman
https://arxiv.org/abs/2506.10668 https://arxiv.org/pdf/2506.10668…

Coherent states of finite-level systems
A method for constructing coherent states (CS) of finite-level systems with a given angular momentum is proposed. To this end we generalize the known spin equation (SE) to an infinite-dimensional Fock space. The equation describes a special quadratic system in the latter space. Its projections on $d$-dimensional subspaces, represent analogs of SE for $d$-dimensional systems in an external electromagnetic field which describe $d$-dimensional systems with a given angular moment. Using a modificat…

This https://arxiv.org/abs/2503.08720 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCY_…

AI for Just Work: Constructing Diverse Imaginations of AI beyond "Replacing Humans"
"why" we develop AI. Lacking critical reflections on the general visions and purposes of AI may make the community vulnerable to manipulation. In this position paper, we explore the "why" question of AI. We denote answers to the "why" question the imaginations of AI, which depict our general visions, frames, and mindsets for the prospects of AI. We identify that the prevailing vision in the AI community is largely a monoculture that emphasizes objectives such as replacing humans and improving p…

This https://arxiv.org/abs/2410.00023 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Self-Tuning Spectral Clustering for Speaker Diarization
Spectral clustering has proven effective in grouping speech representations for speaker diarization tasks, although post-processing the affinity matrix remains difficult due to the need for careful tuning before constructing the Laplacian. In this study, we present a novel pruning algorithm to create a sparse affinity matrix called spectral clustering on p-neighborhood retained affinity matrix (SC-pNA). Our method improves on node-specific fixed neighbor selection by allowing a variable number …

Superconformal Weight Shifting Operators
Tobias Hansen, Paul Heslop, Hector Puerta Ramisa
https://arxiv.org/abs/2506.08682 https://ar…

Superconformal Weight Shifting Operators
We develop a framework for constructing superconformal blocks for correlators of general supermultiplets in theories with $SU(m,m|2n)$ symmetry, such as four-dimensional $\mathcal{N}\!=\!2$ and $\mathcal{N} \!=\! 4$ conformal theories. We use analytic superspace, viewed as the super-Grassmannian $\mathrm{Gr}(m|n,2m|2n)$, which includes 4D Minkowski space ($m=2,n=0$). In this formalism, superblocks for non-half-BPS correlators are analogous to non-supersymmetric conformal blocks f…

This https://arxiv.org/abs/2409.18122 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

RT-GuIDE: Real-Time Gaussian splatting for Information-Driven Exploration
We propose a framework for active mapping and exploration that leverages Gaussian splatting for constructing dense maps. Further, we develop a GPU-accelerated motion planning algorithm that can exploit the Gaussian map for real-time navigation. The Gaussian map constructed onboard the robot is optimized for both photometric and geometric quality while enabling real-time situational awareness for autonomy. We show through simulation experiments that our method yields comparable Peak Signal-to-No…

This https://arxiv.org/abs/2505.17648 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

Simulating Macroeconomic Expectations using LLM Agents
We introduce a novel framework for simulating macroeconomic expectation formation using Large Language Model-Empowered Agents (LLM Agents). By constructing thousands of LLM Agents equipped with modules for personal characteristics, prior expectations, and knowledge, we replicate a survey experiment involving households and experts on inflation and unemployment. Our results show that although the expectations and thoughts generated by LLM Agents are more homogeneous than those of human participa…

This https://arxiv.org/abs/2505.13168 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Knots that share four surgeries
Distinct knots K, K' can sometimes share a common p/q-framed Dehn surgery. A folk conjecture held that for a fixed pair of knots, this can occur for at most one value of p/q. We disprove this conjecture by constructing pairs of distinct knots K,K' that have common Dehn surgeries for four distinct slopes. We also construct non-isotopic Legendrian knots K,K' that have contactomorphic contact (+1)-and (-1)-surgeries, disproving an analogous conjecture in contact geometry.

MOSS: Multi-Objective Optimization for Stable Rule Sets
Brian Liu, Rahul Mazumder
https://arxiv.org/abs/2506.08030 https://arxiv.org/…

MOSS: Multi-Objective Optimization for Stable Rule Sets
We present MOSS, a multi-objective optimization framework for constructing stable sets of decision rules. MOSS incorporates three important criteria for interpretability: sparsity, accuracy, and stability, into a single multi-objective optimization framework. Importantly, MOSS allows a practitioner to rapidly evaluate the trade-off between accuracy and stability in sparse rule sets in order to select an appropriate model. We develop a specialized cutting plane algorithm in our framework to rapi…

This https://arxiv.org/abs/2505.23993 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Cellular Sheaves on Higher-Dimensional Structures
Defining cellular sheaves beyond graph structures, such as on simplicial complexes containing higher-dimensional simplices, is an essential and intriguing topic in topological data analysis (TDA) and the development of sheaf neural networks. In this paper, we explore methods for constructing non-trivial cellular sheaves on spaces that include structures of dimension greater than one. This extends the focus from 0- or 1-dimensional components, such as vertices and edges, to elements like triangl…

Stabilization of Linear Switched Systems with Long Input Delay via Average or Averaging Predictor Feedbacks
Andreas Katsanikakis, Nikolaos Bekiaris-Liberis
https://arxiv.org/abs/2506.03908

Stabilization of Linear Switched Systems with Long Input Delay via Average or Averaging Predictor Feedbacks
We develop delay-compensating feedback laws for linear switched systems with time-dependent switching. Because the future values of the switching signal, which are needed for constructing an exact predictor-feedback law, may be unavailable at current time, the key design challenge is how to construct a proper predictor state. We resolve this challenge constructing two alternative, average predictor-based feedback laws. The first is viewed as a predictor-feedback law for a particular average sys…

AI-powered virtual eye: perspective, challenges and opportunities
Yue Wu, Yibo Guo, Yulong Yan, Jiancheng Yang, Xin Zhou, Ching-Yu Cheng, Danli Shi, Mingguang He
https://arxiv.org/abs/2505.05516

AI-powered virtual eye: perspective, challenges and opportunities
We envision the "virtual eye" as a next-generation, AI-powered platform that uses interconnected foundation models to simulate the eye's intricate structure and biological function across all scales. Advances in AI, imaging, and multiomics provide a fertile ground for constructing a universal, high-fidelity digital replica of the human eye. This perspective traces the evolution from early mechanistic and rule-based models to contemporary AI-driven approaches, integrating in a unified model with…

Axial quasi-normal modes of slowly rotating black holes in dynamical Chern-Simons gravity to second-order in spin and coupling
Tharaka Alapati (IIT Bombay), S. Shankaranarayanan (IIT Bombay)
https://arxiv.org/abs/2506.03600

Axial quasi-normal modes of slowly rotating black holes in dynamical Chern-Simons gravity to second-order in spin and coupling
We compute the quasi-normal mode (QNM) frequencies of slowly rotating black holes in dynamical Chern-Simons (dCS) gravity, including corrections up to second order in the black hole's dimensionless spin parameter ($χ$) and second order in the dCS coupling parameter ($α$). Due to the complexities of constructing a Newman-Penrose tetrad at this order, we employ a metric perturbation approach. We derive a system of coupled ordinary differential equations for the primary axial $l$-mode and the po…

Be star He star binary as an indicator of binary mass transfer phase
Yuchen Bao, Zhenwei Li, Hongwei Ge, Xuefei Chen, Zhanwen Han
https://arxiv.org/abs/2506.02662

Be star + He star binary as an indicator of binary mass transfer phase
The rapid rotation of Be stars is supposed to mainly originate from binary evolution. In recent years, more and more Be stars with helium (He) star companions have been discovered, which provides a significant opportunity to study binary interaction physics. In this work, we perform binary population synthesis with an updated binary mass transfer stability criterion and try to understand the details of mass transfer processes by constructing a series of Be star + He star (BeHe) binary populatio…

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
Sergey Kurapov, Maxim Davidovsky
https://arxiv.org/abs/2506.10936 h…

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph based on the selection of a basis for the cycle subspace C(G) using the Monte Carlo method. A steepest descent method for constructing a topological drawing of a flat subgraph is described in the manuscript. The topological drawing of a graph is constructed u…

Stereographic Projections on Some Quadric Surfaces
W. F. C. Barboza, T. F. Cruz, R. B. Leal
https://arxiv.org/abs/2506.08289 https://…

Stereographic Projections on Some Quadric Surfaces
In this work, we present an adaptation of the classical stereographic projection, originally formulated for the sphere, now considering the context of the ellipsoid and the elliptic paraboloid. We begin by constructing the stereographic projections for both quadric surfaces separately, analyzing the geometric particularities of each surface and the challenges arising from their variable curvatures and, in the case of the paraboloid, its non-compactness. In the final part of the work, we establi…

On $\theta$-extension of continuous mapping
Andrew Ryabikov
https://arxiv.org/abs/2506.02228 https://arxiv.org/pdf/2506.02228

On $θ$-extension of continuous mapping
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an extension are proved. The axioms of separation and compactness of spaces are not assumed.

This https://arxiv.org/abs/2505.22086 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAR_…

iDSE: Navigating Design Space Exploration in High-Level Synthesis Using LLMs
High-Level Synthesis (HLS) serves as an agile hardware development tool that streamlines the circuit design by abstracting the register transfer level into behavioral descriptions, while allowing designers to customize the generated microarchitectures through optimization directives. However, the combinatorial explosion of possible directive configurations yields an intractable design space. Traditional design space exploration (DSE) methods, despite adopting heuristics or constructing predicti…

This https://arxiv.org/abs/2407.06390 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

JANET: Joint Adaptive predictioN-region Estimation for Time-series
Conformal prediction provides machine learning models with prediction sets that offer theoretical guarantees, but the underlying assumption of exchangeability limits its applicability to time series data. Furthermore, existing approaches struggle to handle multi-step ahead prediction tasks, where uncertainty estimates across multiple future time points are crucial. We propose JANET (Joint Adaptive predictioN-region Estimation for Time-series), a novel framework for constructing conformal predic…

Cartesian Prime Graphs and Cospectral Families
Abhinav Bitragunta, Hareshkumar Jadav, Ranveer Singh
https://arxiv.org/abs/2505.24358 https://

Cartesian Prime Graphs and Cospectral Families
We introduce a method for constructing larger families of connected cospectral graphs from two given cospectral families of sizes $p$ and $q$. The resulting family size depends on the Cartesian primality of the input graphs and can be one of $pq$, $p + q - 1$, or $\max(p, q)$, based on the strictness of the applied conditions. Under the strictest condition, our method generates $O(p^3q^3)$ new cospectral triplets, while the more relaxed conditions yield $\varOmega(pq^3 + qp^3)$ such triplets. W…

Rapid cardiac activation prediction for cardiac resynchronization therapy planning using geometric deep learning
Ehsan Naghavi, Haifeng Wang, Vahid Ziaei Rad, Julius Guccione, Ghassan Kassab, Vishnu Boddeti, Seungik Baek, Lik-Chuan Lee
https://arxiv.org/abs/2506.08987

Rapid cardiac activation prediction for cardiac resynchronization therapy planning using geometric deep learning
Cardiac resynchronization therapy (CRT) is a common intervention for patients with dyssynchronous heart failure, yet approximately one-third of recipients fail to respond due to suboptimal lead placement. Identifying optimal pacing sites remains challenging, largely due to patient-specific anatomical variability and the limitations of current individualized planning strategies. In a step towards constructing an in-silico approach to help address this issue, we develop two geometric deep learnin…

This https://arxiv.org/abs/2505.08052 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

NAZM: Network Analysis of Zonal Metrics in Persian Poetic Tradition
This study formalizes a computational model to simulate classical Persian poets' dynamics of influence through constructing a multi-dimensional similarity network. Using a rigorously curated dataset based on Ganjoor's corpus, we draw upon semantic, lexical, stylistic, thematic, and metrical features to demarcate each poet's corpus. Each is contained within weighted similarity matrices, which are then appended to generate an aggregate graph showing poet-to-poet influence. Further network investi…

This https://arxiv.org/abs/2505.14547 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
Game-theoretic algorithms are commonly benchmarked on recreational games, classical constructs from economic theory such as congestion and dispersion games, or entirely random game instances. While the past two decades have seen the rise of security games -- grounded in real-world scenarios like patrolling and infrastructure protection -- their practical evaluation has been hindered by limited access to the datasets used to generate them. In particular, although the structural components of the…

This https://arxiv.org/abs/2405.07671 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csFL_…

Constructing a BPE Tokenization DFA
Many natural language processing systems operate over tokenizations of text to address the open-vocabulary problem. In this paper, we give and analyze an algorithm for the efficient construction of deterministic finite automata (DFA) designed to operate directly on tokenizations produced by the popular byte pair encoding (BPE) technique. This makes it possible to apply many existing techniques and algorithms to the tokenized case, such as pattern matching, equivalence checking of tokenization d…

This https://arxiv.org/abs/2505.05702 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Hypergraph Neural Sheaf Diffusion: A Symmetric Simplicial Set Framework for Higher-Order Learning
The absence of intrinsic adjacency relations and orientation systems in hypergraphs creates fundamental challenges for constructing sheaf Laplacians of arbitrary degrees. We resolve these limitations through symmetric simplicial sets derived directly from hypergraphs, which encode all possible oriented subrelations within each hyperedge as ordered tuples. This construction canonically defines adjacency via facet maps while inherently preserving hyperedge provenance. We establish that the normal…

More entropy from shorter experiments using polytope approximations to the quantum set
Hyejung H. Jee, Florian Curchod, Mafalda Almeida
https://arxiv.org/abs/2506.09555

More entropy from shorter experiments using polytope approximations to the quantum set
We introduce a systematic method for constructing polytope approximations to the quantum set in a variety of device-independent quantum random number generation (DI-QRNG) protocols. Our approach relies on two general-purpose algorithms that iteratively refine an initial outer-polytope approximation, guided by typical device behaviour and cryptographic intuition. These refinements strike a balance between computational tractability and approximation effectiveness. By integrating these approximat…

This https://arxiv.org/abs/2505.09487 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_nli…

The N-species integrable Volterra system as a maximally superintegrable Hamiltonian system
The results presented in this paper are a natural development of those described in the paper {\it The Volterra Integrable case. Novel analytical and numerical results} (OCNMP Vol.4 (2024) pp 188-211), where the authors reconsidered the integrable case of the Hamiltonian $N$-species Lotka-Volterra system, introduced by Vito Volterra in 1937. There, an alternative approach for constructing the integrals of motion has been proposed, and compared with the old Volterra approach. Here we go beyond, …

Representing Equations of State With Strong First-Order Phase Transitions
Lee Lindblom, Steve M. Lewis, Fridolin Weber
https://arxiv.org/abs/2506.06201 htt…

Representing Equations of State With Strong First-Order Phase Transitions
Parametric representations of the high-density nuclear equation of state are used in constructing models for interpreting the astrophysical observations of neutron stars. This study explores how accurately equations of state with strong first-order phase transitions can be represented using spectral or piecewise analytic methods that assume no {\it{a priori}} knowledge of the location or the strength of the phase transition. The model equations of state used in this study have phase transitions…

This https://arxiv.org/abs/2502.18744 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

ZEBRA: Leveraging Model-Behavioral Knowledge for Zero-Annotation Preference Dataset Construction
Recent efforts in LLM alignment have focused on constructing large-scale preference datasets via human or Artificial Intelligence (AI) annotators. However, such approaches rely on instance-wise supervision, incurring substantial annotation cost and limited interpretability. In this paper, we propose ZEBRA - a model behavior-wise zero-annotation framework that constructs preference data by leveraging model behavior knowledge derived from benchmark performances. ZEBRA binarizes response pairs by …

Reconstructing Laurent expansion of rational functions using p-adic numbers
Tianya Xia, Li Lin Yang
https://arxiv.org/abs/2506.08452 https://

Reconstructing Laurent expansion of rational functions using p-adic numbers
We propose a novel method for reconstructing Laurent expansion of rational functions using $p$-adic numbers. By evaluating the rational functions in $p$-adic fields rather than finite fields, it is possible to probe the expansion coefficients simultaneously, enabling their reconstruction from a single set of evaluations. Compared with the reconstruction of the full expression, constructing the Laurent expansion to the first few orders significantly reduces the required computational resources. …

Study of $p^{k}$-Eulerian polynomials and $p^{k}$-Fibonacci numbers for every odd prime $p$ and $k\geq0$
M. Parvathi, A. Tamilselvi, D. Hepsi
https://arxiv.org/abs/2506.09941

Study of $p^{k}$-Eulerian polynomials and $p^{k}$-Fibonacci numbers for every odd prime $p$ and $k\geq0$
In this paper, we define the notion of descent for the paths in the $p$-Bratteli diagram. This leads to the definition of $p^{k}$-Eulerian polynomials, whose coefficients count the number of paths with a given number of descents. We provide a method for constructing the $p^{k}$-Eulerian polynomials at each vertex. Furthermore, we compute the total number of descents of all paths ending at a given vertex as the corresponding $p^{k}$-Fibonacci numbers. We show that the derivative of the $p^{k}$-E…

Wild Betti sheaves
Peter Scholze
https://arxiv.org/abs/2505.24599 https://arxiv.org/pdf/2505.24599

Wild Betti sheaves
In this note, we consider the problem of constructing an enlargement of the category of Betti sheaves that supports an ``exponential local system'' on $\mathbb R$, and a Fourier equivalence defined on all sheaves. We show that there is a universal solution, recovering a construction of Tamarkin known also as ``enhanced sheaves''. The universality property implies that the category of coefficients of this theory is, in a suitable sense, a nontrivial $\mathbb R_{>0}$-torsor over $\mathrm{Spec}(\m…

This https://arxiv.org/abs/2212.02658 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pooling information in likelihood-free inference
Likelihood-free inference (LFI) methods, such as approximate Bayesian computation, have become commonplace for conducting inference in complex models. Many approaches are based on summary statistics or discrepancies derived from synthetic data. However, determining which summary statistics or discrepancies to use for constructing the posterior remains a challenging question, both practically and theoretically. Instead of relying on a single vector of summaries for inference, we propose a new po…

This https://arxiv.org/abs/2502.08072 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

Coupled-channel study of $4S$-$3D$ mixing dynamics in $ψ(4220)$ and $ψ(4380)$
Among charmoniumlike $XYZ$ states, the $ψ(4220)$ and $ψ(4380)$ states have emerged as key candidates for exploring the charmonium spectrum. In this work, we propose a $4S$-$3D$ charmonium mixing scheme for the $ψ(4220)$ and $ψ(4380)$, induced by coupled-channel effects. By constructing a coupled-channel model, we identify the dynamical mechanism responsible for the large mixing angle observed in previous studies, which cannot be explained by conventional potential models alone. Our analysis…

This https://arxiv.org/abs/2505.07155 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

Reassessing Large Language Model Boolean Query Generation for Systematic Reviews
Systematic reviews are comprehensive literature reviews that address highly focused research questions and represent the highest form of evidence in medicine. A critical step in this process is the development of complex Boolean queries to retrieve relevant literature. Given the difficulty of manually constructing these queries, recent efforts have explored Large Language Models (LLMs) to assist in their formulation. One of the first studies,Wang et al., investigated ChatGPT for this task, foll…

This https://arxiv.org/abs/2505.24226 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

E^2GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness
Graph-based RAG methods like GraphRAG have shown promising global understanding of the knowledge base by constructing hierarchical entity graphs. However, they often suffer from inefficiency and rely on manually pre-defined query modes, limiting practical use. In this paper, we propose E^2GraphRAG, a streamlined graph-based RAG framework that improves both Efficiency and Effectiveness. During the indexing stage, E^2GraphRAG constructs a summary tree with large language models and an entity grap…

Cellular Sheaves on Higher-Dimensional Structures
Chuan-Shen Hu
https://arxiv.org/abs/2505.23993 https://arxiv.org/pdf/2505.23993

Cellular Sheaves on Higher-Dimensional Structures
Defining cellular sheaves beyond graph structures, such as on simplicial complexes containing higher-dimensional simplices, is an essential and intriguing topic in topological data analysis (TDA) and the development of sheaf neural networks. In this paper, we explore methods for constructing non-trivial cellular sheaves on spaces that include structures of dimension greater than one. This extends the focus from 0- or 1-dimensional components, such as vertices and edges, to elements like triangl…

NepTrain and NepTrainKit: Automated Active Learning and Visualization Toolkit for Neuroevolution Potentials
Chengbing Chen, Yutong Li, Rui Zhao, Zhoulin Liu, Zheyong Fan, Gang Tang, Zhiyong Wang
https://arxiv.org/abs/2506.01868

NepTrain and NepTrainKit: Automated Active Learning and Visualization Toolkit for Neuroevolution Potentials
As a machine-learned potential, the neuroevolution potential (NEP) method features exceptional computational efficiency and has been successfully applied in materials science. Constructing high-quality training datasets is crucial for developing accurate NEP models. However, the preparation and screening of NEP training datasets remain a bottleneck for broader applications due to their time-consuming, labor-intensive, and resource-intensive nature. In this work, we have developed NepTrain and N…

This https://arxiv.org/abs/2505.08880 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Properties of general stationary axisymmetric spacetimes: circularity and beyond
We analyse properties of general stationary and axisymmetric spacetimes, with a particular focus on circularity -- an accidental symmetry enjoyed by the Kerr metric, and therefore widely assumed when searching for rotating black hole solutions in alternative theories of gravity as well as when constructing models of Kerr mimickers. Within a gauge specified by seven (or six) free functions, the local existence of which we prove, we solve the differential circularity conditions and translate them…

This https://arxiv.org/abs/2406.15119 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSD_…

Breaking Resource Barriers in Speech Emotion Recognition via Data Distillation
Speech emotion recognition (SER) plays a crucial role in human-computer interaction. The emergence of edge devices in the Internet of Things (IoT) presents challenges in constructing intricate deep learning models due to constraints in memory and computational resources. Moreover, emotional speech data often contains private information, raising concerns about privacy leakage during the deployment of SER models. To address these challenges, we propose a data distillation framework to facilitate…

Automatic Multi-level Feature Tree Construction for Domain-Specific Reusable Artifacts Management
Dongming Jin, Zhi Jin, Nianyu Li, Kai Yang, Linyu Li, Suijing Guan
https://arxiv.org/abs/2506.03946

Automatic Multi-level Feature Tree Construction for Domain-Specific Reusable Artifacts Management
With the rapid growth of open-source ecosystems (e.g., Linux) and domain-specific software projects (e.g., aerospace), efficient management of reusable artifacts is becoming increasingly crucial for software reuse. The multi-level feature tree enables semantic management based on functionality and supports requirements-driven artifact selection. However, constructing such a tree heavily relies on domain expertise, which is time-consuming and labor-intensive. To address this issue, this paper pr…

A Brain Graph Foundation Model: Pre-Training and Prompt-Tuning for Any Atlas and Disorder
Xinxu Wei, Kanhao Zhao, Yong Jiao, Lifang He, Yu Zhang
https://arxiv.org/abs/2506.02044

A Brain Graph Foundation Model: Pre-Training and Prompt-Tuning for Any Atlas and Disorder
As large language models (LLMs) continue to revolutionize AI research, there is a growing interest in building large-scale brain foundation models to advance neuroscience. While most existing brain foundation models are pre-trained on time-series signals or region-of-interest (ROI) features, we propose a novel graph-based pre-training paradigm for constructing a brain graph foundation model. In this paper, we introduce the Brain Graph Foundation Model, termed BrainGFM, a unified framework that …

Extending near-axis equilibria in DESC
Dario Panici, Eduardo Rodriguez, Rory Conlin, Daniel Dudt, Egemen Kolemen
https://arxiv.org/abs/2506.05170 https://

Extending near-axis equilibria in DESC
The near-axis description of optimised stellarator fields has proven to be a powerful tool both for design and understanding of this magnetic confinement concept. The description consists of an asymptotic model of the equilibrium in the distance from its centermost axis, and is thus only approximate. Any practical application therefore requires the eventual construction of a global equilibrium. This paper presents a novel way of constructing global equilibria using the \texttt{DESC} code that g…

This https://arxiv.org/abs/2503.13965 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
In this paper, we propose a systematic approach for constructing first-order projected algorithms for optimization problems with general set constraints, building upon their unconstrained counterparts. We show that these projected algorithms retain the same linear convergence rate bounds, when the latter are obtained for the unconstrained algorithms via quadratic Lyapunov functions arising from integral quadratic constraint (IQC) characterizations. The projected algorithms are constructed by ap…

This https://arxiv.org/abs/2505.06681 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Local well-posedness for a system of quadratic derivative nonlinear Schrödinger equations
We consider the Cauchy problem for a system of quadratic derivative nonlinear Schrödinger equations introduced by M. Colin and T. Colin (2004) as a model of laser-plasma interaction. Under the condition that the flow map fails to be twice differentiable, Hirayama, Kinoshita, and Okamoto (2022) proved the well-posedness by constructing a modified energy and applying the energy method. In the present paper, we improve the well-posedness result under the above condition by using the short-time Fo…

Morse theory and moduli spaces of self-avoiding polygonal linkages
Te Ba, Ze Zhou
https://arxiv.org/abs/2506.06781 https://arxiv.org/…

Morse theory and moduli spaces of self-avoiding polygonal linkages
We show that a smooth manifold is diffeomorphic to a Euclidean space if it admits a Lyapunov-Reeb function. Here a Lyapunov-Reeb function means a smooth function that is proper, bounded from below and possesses only one critical point. As applications, we determine the topology of moduli spaces of self-avoiding polygonal linkages by constructing Lyapunov-Reeb functions, and we prove a conjecture of González and Sedano-Mendoza on moduli spaces of simple polygons. We further describe foliation s…

This https://arxiv.org/abs/2504.20305 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Fast LDL factorization for dense and sparse symmetric matrices over an arbitrary field
While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The LDL factorization is a common tool for factorization of symmetric matrices, and, unlike orthogonal counterparts, generalizes to an arbitrary field. We provide algorithms for dense and sparse LDL nd LU factorization that aim to minimize complexity for factorizat…

This https://arxiv.org/abs/2501.01817 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Distributed Framework Construction for Affine Formation Control
In affine formation control problems, the construction of the framework with universal rigidity and affine localizability is a critical prerequisite, but it has not yet been well addressed, especially when additional agents join the formation or link/agent failures emerge. Motivated by this observation, we investigate the problem of constructing affine frameworks in three scenarios, including vertex addition, edge deletion and vertex deletion. Our approach starts from the original affine format…

This https://arxiv.org/abs/2406.13945 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

CityBench: Evaluating the Capabilities of Large Language Models for Urban Tasks
As large language models (LLMs) continue to advance and gain widespread use, establishing systematic and reliable evaluation methodologies for LLMs and vision-language models (VLMs) has become essential to ensure their real-world effectiveness and reliability. There have been some early explorations about the usability of LLMs for limited urban tasks, but a systematic and scalable evaluation benchmark is still lacking. The challenge in constructing a systematic evaluation benchmark for urban re…

RSK correspondence for King tableaux with Berele insertion
Masato Kobayashi, Tomoo Matsumura
https://arxiv.org/abs/2506.06951 https://

RSK correspondence for King tableaux with Berele insertion
We establish a bijective RSK correspondence of type C for King tableaux with Berele insertion as a reformulation of Sundaram's correspondence (1986). For its $Q$-symbol, we make use of semistandard oscillating tableaux (SSOT), a new object which Lee (2025) introduced. Further, we show hidden duality of Cauchy identity through RSK correspondences of type A and C. Finally, we prove that the generating function of SSOT is symmetric by constructing a new sort of Bender-Knuth involution.

This https://arxiv.org/abs/2505.04316 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

On local fields invariant under the action of topological defects
In the context of rational conformal field theories (RCFT) we look into the problem of constructing and classifying pairs consisting of a local operator and a topological defect which commutes or anticommutes with it. We discuss the bulk and boundary versions of the problem. In the latter one considers a conformal boundary condition, a boundary operator on it and a junction with a topological defect. In the case of the charge conjugation modular invariant commuting configurations in each proble…

Revisiting Bourgain's probabilistic construction of solutions to the 2-$d$ cubic NLS
Tadahiro Oh, Yuzhao Wang
https://arxiv.org/abs/2505.24271 https://…

Revisiting Bourgain's probabilistic construction of solutions to the 2-$d$ cubic NLS
In a seminal paper (1996), Bourgain proved invariance of the Gibbs measure for the defocusing cubic nonlinear Schrödinger equation on the two-dimensional torus by constructing local-in-time solutions in a probabilistic manner. In this note, we revisit and streamline his argument, using the random tensor estimate developed by Deng, Nahmod, and Yue (2022).

This https://arxiv.org/abs/2506.01222 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Learning collective variables that preserve transition rates
Collective variables (CVs) play a crucial role in capturing rare events in high-dimensional systems, motivating the continual search for principled approaches to their design. In this work, we revisit the framework of quantitative coarse graining and identify the orthogonality condition from Legoll and Lelievre (2010) as a key criterion for constructing CVs that accurately preserve the statistical properties of the original process. We establish that satisfaction of the orthogonality condition …

This https://arxiv.org/abs/2409.15683 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quantum DeepONet: Neural operators accelerated by quantum computing
In the realm of computational science and engineering, constructing models that reflect real-world phenomena requires solving partial differential equations (PDEs) with different conditions. Recent advancements in neural operators, such as deep operator network (DeepONet), which learn mappings between infinite-dimensional function spaces, promise efficient computation of PDE solutions for a new condition in a single forward pass. However, classical DeepONet entails quadratic complexity concerni…

hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications
Rong Chen, Quan-Xin Mei, Wen-Ding Zhao, Lin Yao, Hao-Xiang Yang, Shun-Yao Zhang, Jiao Chen, Hong-Lin Li
https://arxiv.org/abs/2506.01559

hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications
AlphaFold has achieved groundbreaking advancements in protein structure prediction, exerting profound influence across biology, medicine, and drug discovery. However, its reliance on multiple sequence alignment (MSA) is inherently time-consuming due to the NP-hard nature of constructing MSAs. Quantum computing emerges as a promising alternative, compared to classical computers, offering the potentials for exponential speedup and improved accuracy on such complex optimization challenges. This wo…

This https://arxiv.org/abs/2501.16472 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Revisiting color superconductors in bottom-up holography
We revisit the problem of constructing a color superconducting phase in bottom-up holography. We introduce a model that describes the five-dimensional dynamics of a scalar field dual to a chiral symmetry breaking condensate, which is coupled to the RR 4-form. The coupling is given by a topological WZ term, which is elegantly responsible both for scalar condensation at high density, and color Higgsing in the condensed phase. This construction realizes both properties at finite density and Higgsi…

Learning collective variables that preserve transition rates
Shashank Sule, Arnav Mehta, Maria K. Cameron
https://arxiv.org/abs/2506.01222 https://

Learning collective variables that preserve transition rates
Collective variables (CVs) play a crucial role in capturing rare events in high-dimensional systems, motivating the continual search for principled approaches to their design. In this work, we revisit the framework of quantitative coarse graining and identify the orthogonality condition from Legoll and Lelievre (2010) as a key criterion for constructing CVs that accurately preserve the statistical properties of the original process. We establish that satisfaction of the orthogonality condition …

This https://arxiv.org/abs/2501.11437 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

More on the corner-vector construction for spherical designs
This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree of designs obtained from the proposed method. Our proof is a hybrid argument that employs techniques in analysis and combinatorics, especially a famous result by Xu(1998) on the interrelation between spherical designs and simplical designs, and the cross-ratio…