Signal Processing
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 1 September
Group-embedding graph signal processing buys exact Fourier analysis either by enlarging the domain until a graph embeds isometrically into an abelian Cayley graph, or by perturbing the graph until it is one. We give a linear-time procedure that chooses between the two, and study the criterion governing the lossy branch. We prove that the perturbation of the Dirichlet form is exactly the signed sum of the edited-edge energies, and is bounded in modulus by their total, into which the combinatorial cost of the completion does not enter. We confirm experimentally that this energy predicts signal fidelity strongly though not strictly monotonically (Spearman rho = -0.79 on an instance where the completion, and hence the cost, is held fixed), while the cost itself carries no information about it. Selecting among completions of identical cost by this energy recovers 61 percent of the available performance gap on the exhaustive range, on a sample too small to establish that the effect persists beyond eight vertices. On real payment data the router takes the exact branch everywhere; on real anti-money-laundering data the completion invariant is a re-encoding of maximum degree and is not distinguishable from it, and the linear-time bound it rivals is shown to have a blind spot on near-complete graphs.
Instrumentation and Detectors
Fabrication and characterization of lithium-diffused inverted coaxial point-contact HPGe detectors
High-purity germanium (HPGe) detectors with low capacitance, low electronic noise, and stable high-voltage operation are important for high-resolution gamma-ray spectroscopy and rare-event searches. We report the fabrication and characterization of two compact p-type inverted coaxial point-contact (ICPC) HPGe detectors, AK01 and AK02, produced from crystals grown at the University of South Dakota. Both devices use lithium-diffused $n^{+}$ outer contacts together with amorphous-Ge/Al point-contact electrodes. The principal advance is the implementation of this hybrid contact process on two independently fabricated USD-grown ICPC prototypes and the demonstration of stable electrical and spectroscopic operation. Both detectors exhibited picoampere-level leakage currents, operational depletion-voltage ranges of approximately 200–250~V (AK01) and 240–260~V (AK02), and estimated effective plateau capacitances of approximately 0.84 and 0.87~pF, respectively. Measurements with a $^{137}$Cs source yielded archived full-energy-peak FWHM values of 1.71 and 1.62~keV near 662~keV for AK01 and AK02, while AK02 yielded 1.04~keV FWHM at 59.5~keV with $^{241}$Am. Electric-field calculations reproduce the expected ICPC field configuration for the measured detector geometry. A Geant4 model of AK02 is used as a qualitative response study; its 0.8-mm Li-diffused inactive layer is an illustrative model assumption rather than a measured thickness, and its Gaussian broadening is constrained by the experimental resolution. The work therefore establishes the fabrication and operation of compact lithium-diffused ICPC prototypes while identifying quantitative inactive-layer characterization as an important next step.
Read the full abstract
Algebraic Geometry
144 real circles tangent to three conics
We exhibit three conics with 144 tritangent circles, disproving the conjectured maximum of 136.
Probability
A stable limit theorem for SDEs driven by multiplicative $\alpha$-stable processes
We derive a stable limit theorem for stochastic differential equations driven by multiplicative $\alpha$-stable processes. A key ingredient is the $L^1$-exponential contractivity estimate for the SDEs. The limiting process is a non-degenerate symmetric $\alpha$-stable process with an averaged Lévy measure.
Read the full abstract
Artificial Intelligence
When Guardrails Look Effective: Construct Validity Failures in LLM Agent Commerce Evaluation
Interactive simulations increasingly evaluate policies in markets populated by language-model agents. Their outputs can look economic—prices, profits, consumer surplus, and welfare—without instantiating the behavior named in the claim. We audit this risk in a multi-turn buyer–seller testbed for configurable hotel transactions. An initial implementation reported welfare gains from two marketplace guardrails of +87.4, +35.0, and +28.8 across a Qwen2.5 1.5B–14B ladder. It also gave guarded and unguarded agents different offer schemas and choice procedures. Holding the schema and buyer chooser fixed changes the paired contrasts to +7.2, -13.9, and +23.8. The four largest 14B single-generation effects averaged +229; after three generations per profile-condition, they averaged +37.6 (95% bootstrap interval [-34.2, 109.3]), while generation residuals account for 49.9% of variation in this post-hoc probe. A seller-incentive check is non-monotone: increasing profit pressure produces less profit than the default seller prompt. Scripted positive controls show why this matters. A profit-maximizing seller already attains first-best welfare, so guardrails mostly redistribute and reduce welfare; they create welfare only when the seller is explicitly programmed to force inefficient bundles. We contribute a construct-validity contract separating incentive validity, protocol isolation, stochastic stability, and welfare accounting, and returning INVALID or INCONCLUSIVE before substantive policy claims. In our case, the original estimate is INVALID under protocol isolation, while the controlled study remains INCONCLUSIVE under incentive validity and stochastic stability. The case does not show that guardrails are ineffective; it shows their apparent value is unidentified until the simulated agents and protocol pass these checks.
Read the full abstract
Robotics
A System for Fast, Resilient, and Adaptable Loco-Manipulation Behaviors on Humanoid Robots
There is tremendous value in humanoid robots taking on physically demanding, hazardous, and repetitive work in spaces built for humans. However, a useful robot for these spaces must coordinate locomotion, whole-body motion, perception, contact, and operator supervision. We present a robot-local, runtime-editable behavior authoring and runtime system that addresses these challenges. We argue that behavior architecture can be a primary enabler of capability, speed, and reliability, and that runtime editability enables fast behavior creation, adaptation, extension, and combination. Our behavior architecture combines object-centric Affordance Templates, a tree structure that provides organization and logic, and runtime-editable perception through a behavior scene and primitive scene actions. Our operator interface remains continuously synchronized to the robot for runtime authoring, monitoring, and repair. Action primitives execute through a whole-body controller that supports concurrent body motions and walking. Demonstrations of our system cover six task variants on Unitree H1-2 and Alex. We execute a push door traversal in 34 seconds and sort six balls by color in 45 seconds under human disturbance. Timed authoring sessions show scratch creation of new loco-manipulation behaviors and adaptation of existing ones in hours. Comparison against the literature finds our approach to be competitive with recent learned systems.
Read the full abstract
High Energy Physics (Theory)
Non-symmetric triads and Baker-Akhiezer functions
The symmetric Macdonald polynomial at peculiar values of parameter $t=q^{-m}$, $m\in\mathbb{Z}_{\ge 0}$ is naturally split into non-symmetric parts, which are the (quasi)polynomial Baker-Akhiezer (BA) functions. One may think this is due to symmetricity, and one just picks up this way non-symmetric parts already containing all the information. However, we demonstrate that, in the case of non-symmetric Macdonald polynomials, it still works, though each single BA function splits into $N!$ distinct (quasi)polynomial BA functions. The sum of these functions gives rise to the universal solution of the eigenstate problem for the Cherednik Hamiltonians. Extending to arbitrary values of $t$ is also immediate giving rise to counterparts of the Noumi-Shiraishi power series. Altogether, this power series and its reductions to non-symmetric Macdonald polynomials and to BA functions form a non-symmetric triad. There are $N!$ different branches of the non-symmetric triad, each branch being split into $N!$ distinct triads, and of these $(N!)^2$ triads $N!(N-1)!$ are independent. We describe in detail the simplest $N=2$ case.
Read the full abstract
Computer Vision
DualDiff3D: Dual Structure-Appearance Diffusion Priors for Reliability-Enhanced 3D Gaussian Splatting
While 3D Gaussian Splatting (3DGS) has revolutionized 3D reconstruction and novel-view synthesis, scenarios with limited input views often lead to poor reconstruction quality and artifacts in rendered novel views. Recent efforts attempt to utilize powerful diffusion priors, yet they typically process rendered and reference views concatenated along an additional dimension in a single network. These methods overlook an inherent nature that different views should maintain appearance similarity but differ in structure due to view shifts, leading to blur caused by conflicts between the two properties. In this paper, we propose DualDiff, a novel pipeline that leverages dual diffusion priors with a Structure-Appearance Attention (SAA) module to introduce reference guidance for refining low-quality novel views rendered from flawed 3D representations. Specifically, we retain one diffusion branch to focus on extracting structural information from the low-quality novel views, while introducing another branch to ensure appearance consistency with reference views. Furthermore, we present a 3D reconstruction framework named DualDiff3D, which integrates a reliability-enhanced Render-Refine-Optimize (RRO) loop to progressively and robustly incorporate the refined novel views, yielding more accurate 3DGS. Extensive experiments demonstrate that our approach outperforms state-of-the-art methods even in the inference-only setting, with further performance gains achievable through training. Our code and pre-trained weights are available at https://github.com/Akaneqwq/DualDiff3D.
Read the full abstract
Computer Vision
TempCloze: Can Video-LLMs Identify the Missing Middle?
Temporal reasoning benchmarks for Video-LLMs are often mediated by language, leaving room for linguistic shortcuts from option wording, answer correlations, or language priors. To reduce such shortcuts, we introduce TempCloze, a video cloze benchmark for evaluating visual temporal reasoning in Video-LLMs. Given the beginning and ending clips of a video, models must identify the true missing middle from four candidates. TempCloze contains 1,521 carefully filtered videos from seven sources, mainly long-take and egocentric videos. We construct same-source distractors along three dimensions: Semantic asks what event should happen, Alignment probes when it should occur, and Progression tests how it should unfold, while shared scenes and objects reduce appearance cues. Our evaluation of 10 proprietary and 21 open-source Video-LLMs reveals Alignment as the primary bottleneck: models often recognize plausible semantic content and local event progression but struggle with temporal alignment. We further conduct error pattern and behavioral sensitivity analyses on TempCloze-Mixed and TempCloze-Hard with four representative models to examine where errors arise and how candidate order, context direction, visible span, frame density, and test-time scaling influence model choices.
Read the full abstract
Atmospheric and Oceanic Physics
A Sensor-Adaptive Incremental Learning Framework for Artifact Detection in Satellite Precipitation Data
Historically, retrieving rainfall data from satellite imagery has been the domain of space agencies. However, in recent years, the development of cheaper, more compact satellites (SmallSats) capable of detecting rainfall proxies has led to a significant increase in private-sector initiatives for satellite launch and surface precipitation products. This rapid growth has yet to be matched by data validation efforts. Consequently, the need for a robust tool to detect anomalies in near-real-time data before it is disseminated to the public has become critical. In this paper, we present the development of an anomaly-detection system to identify artifacts in global satellite-based rainfall products. The developed framework leverages pre-trained computer vision models and incorporates scarce human-labeled data to detect specific anomalies. Our proposed anomaly detection strategy is tested on data from the Special Sensor Microwave Imager (SSMI) and the Special Sensor Microwave Imager/Sounder (SSMIS). Results demonstrate the efficacy of our approach at separating regular orbits from artifact-containing orbits for each satellite, with performance comparable to state-of-the-art in-place methods. Additionally, the framework offers explainability and the capacity for iterative refinement following false-positive or false-negative classifications.
Read the full abstract
Combinatorics
Orthodox queen domination: finite constructions and an asymptotic density gap
An orthodox dominating set on an $n\times n$ chessboard occupies every row of one parity and every column of a possibly different parity. For $n\ge400001$, every such set contains more than $(1/2+1/80000)n-2$ queens, on odd and even boards and with attacking or boundary queens allowed. Second-moment estimates and an exact rational line-weight certificate give a stronger bound for $p$-covers; finite diagonal completion and board extension transfer it to orthodox covers. The cost of extending an arbitrary dominating set to an orthodox cover yields an inequality with an explicit defect term. The previously constructed independent, border-free Type-A $1$-cover of $Q_{221}$ with $111$ queens supplies a finite seed. Classical amplification gives ordinary and independent domination upper bounds with coefficients $112/221$ and $113/221$, respectively. Its order 221 is below the density threshold 400001. For admissible seeds whose orders tend to infinity, the lower limit of these coefficients is at least $1/2+1/16000$.
Read the full abstract
Materials Science
First-principles optical response of shock-compressed LiF: Quasiparticle, excitonic, and ionic-temperature effects
We investigate the refractive index $n$ of LiF using DFT+G$_0$W$_0$+BSE, with ionic-temperature effects included through QMD. We calculate photon-energy dispersions $n(\omega)$ and $k(\omega)$ at ambient pressure and $n(\rho,T)$ at 532 and 1550 nm under shock compression, where $\rho$ and $T$ vary together. Quasiparticle band structures at ambient and compressed conditions and the ambient-pressure orbital-projected density of states connect the optical response to the electronic structure. At ambient pressure, G$_0$W$_0$ yields a quasiparticle gap of 14.25 eV, close to the experimental 14.2 eV, while BSE reproduces the main excitonic feature at 12.5 eV, close to the observed 12.6 eV. Quasiparticle and excitonic effects are thus essential for accurate optical dispersion; the hybrid HSE functional does not reproduce the optical spectra. Along the principal Hugoniot up to 140 GPa, $n(\rho)$ agrees closely with shock data at 1550 nm and acceptably at 532 nm, and agrees better overall than earlier first-principles calculations. Above approximately 110-120 GPa, QMD produces a downturn relative to cold $n(\rho)$ curves, suggesting that ionic dynamics may contribute to deviations from the linear $n$-$\rho$ Gladstone-Dale relation. QMD-sampling and finite-k-grid uncertainties are estimated, and transition-peak broadening is assessed using a recently proposed criterion. The gap increases under pressure, with a transition to a $\Gamma\to\mathrm L$ indirect gap near 50 GPa. An exploratory calculation at approximately 1400 GPa finds a gap of about 24 eV, disfavoring gap-closure metallization. Structural and elastic benchmarks of the underlying models are also provided.
Read the full abstract
Computer Vision
Benchmarking Spatial, Spectral, and Self-Supervised Cues for Face Forgery Detection under Realistic Degradation
Face forgery detectors often achieve strong results on controlled benchmarks, but their reliability under realistic image degradations remains limited. This paper presents a standardized benchmark for face forgery detection using the Multi-Dimensional Face Forgery Image (MFFI) dataset and evaluates performance on both clean and degraded test partitions. We compare six model families, including convolutional networks, transformer-based models, and a frozen self-supervised DINOv3 backbone, across spatial, spectral, and hybrid input representations. The results show that clean-set performance is not a reliable indicator of robustness under compression, resizing, and blurring. Xception with RGB obtains the best clean performance, reaching 0.884 mean ROC-AUC, but degrades substantially on the harder partition. In contrast, frozen DINOv3 achieves the strongest degraded-set result, with 0.726 mean ROC-AUC, while training only a linear classification head. The representation analysis indicates that Fourier-domain cues are most useful when combined with RGB information, whereas purely spectral inputs consistently underperform spatial representations. Qualitative attribution maps further suggest that convolutional detectors focus on localized artifacts, while DINOv3 relies on broader facial structure. These findings reinforce the need for degraded evaluation protocols and highlight self-supervised visual representations as a promising direction for robust face forgery detection. Our source code is publicly available at https://github.com/lucasdocunha/FaceForgery-Benchmark/.
Read the full abstract
Networking
Data-Driven Case Study of gNB Placement Optimization in a Private Indoor 5G Testbed
Accurate radio planning is a fundamental requirement for the deployment of wireless networks in indoor environments, where signal propagation is strongly affected by walls, partitions, and other structural obstacles. Despite the availability of standardized propagation models, their ability to represent the characteristics of specific deployment scenarios is often limited, motivating the use of measurement-driven approaches. In this context, this paper presents a data-driven case study of next generation NodeB (gNB) placement optimization in an office using measurements collected from an experimental fifth generation (5G) testbed. A propagation model is trained from reference signal received power (RSRP) measurements using distance and wall count as input features and integrated with a combinatorial search framework. The proposed workflow is used to evaluate alternative deployment strategies under different optimization criteria. Results indicate that satisfactory indoor coverage and improved cell-edge conditions can be achieved with a small number of gNBs.
Read the full abstract
Dynamical Systems
Characterizing High-dimensional Dynamics by Combinatorial-Topological Methods on a Latent Space
Combinatorial-topological methods for characterizing dynamics are rigorous, generalizable, computable, and they only require approximations, but the dimension of the phase space is a computational bottleneck to their wider application. Motivated by the growing number of machine learning techniques for obtaining lower-dimensional latent representations of dynamics, we present an initial study of combinatorial-topological techniques in the dimensionality reduction setting. We establish bounds under which an algebraic structure that organizes dynamics can be lifted from the latent space to the original system. As a corollary, one can conclude the existence of attractors within certain regions of the original phase space. The hypothesis of these results is expressed in terms of an approximate semiconjugacy between the original and latent dynamics. To demonstrate the ideas, we combine autoencoder-based models with Conley-Morse graph computations for Leslie population models, a thirteen-dimensional Mediterranean red coral population model, and the Chafee–Infante equation. While the lift of the Conley index is still an open question, the examples recover the expected algebraic topological invariants in several settings.
Read the full abstract
Chaotic Dynamics
Fifth-Harmonic Feedback Controls the Existence of a Third-Harmonic Zero
An exact zero of a generated harmonic needs two real cancellations; a damped oscillator's leading fundamental-source balance supplies one. Absorber loss leaves a phase deficit of fixed sign, amplitude independent at leading order, closed instead by the orbit's own $5\Omega$ motion returning to $3\Omega$ at weight $|\Delta_1|^4$. Closure is therefore unreachable at weak amplitude: the channel supplying it ranks at $O(F^7)$, not at the leading $O(F^3)$. The fifth harmonic is $1.8\times10^{-3}$ of the relative-coordinate fundamental, yet a balance homotopy weighting it below $0.48$ annihilates the tracked pair in a saddle-node.
Read the full abstract
Machine Learning
LatentPress: Context Compression Beyond Text and Vision
Compressed context is usually carried as human-readable text or as rendered images that must be decoded, even when its consumer is a language model. We introduce LatentPress, which writes conversational histories and long documents into a third representation: continuous memory tokens that a frozen decoder reads directly through its input-embedding interface, with no text reconstruction at inference. A small reader-matched writer compresses $4$-$16\times$ while training only an adapter (4.2M-26.2M parameters, $\sim\!0.1\%$ of the decoder). On LongMemEval, LatentPress reaches $0.504$ accuracy at $7.70\times$ compression versus $0.490$ for uncompressed evidence, outperforming text summaries (0.184) and OCR-based compression (0.426 to 0.312). On LongBench-QA, in-domain writers match or exceed raw-context reading at $4$-$8\times$ compression, while $16\times$ trails raw. Writing takes 43ms per conversation, roughly an order of magnitude faster than text summarization or OCR reconstruction, and reading is $5$-$9\times$ faster than raw context or cached OCR. We validate the interface under two transfer settings, zero-shot from UltraChat to LongMemEval memory QA and from LongMemEval-derived QA to unseen LongBench document domains, establishing direct soft tokens as a practical machine-facing context interface beyond text and vision. The implementation of the experiments could be found at: https://github.com/HJSang/LatentPress.
Read the full abstract
Geometric Topology
The $\mathrm{FK}_3$ knot polynomial
We present the knot polynomial associated to the 12-dimensional sporadic Nichols algebra $\mathrm{FK}_3$ with automorphism, compute it for all knots with $\leq$ 16 crossings and discuss the found patterns. This knot polynomial is not a Vassiliev power series. We ponder how it compares to the knot polynomials that come from Lie algebras and their representations and what the other knot polynomials associated with the higher dimensional sporadic Nichols algebras are.
Read the full abstract
Algebraic Topology
Higher smooth surgery structure sets of complex projective spaces, part II
We determine the torsion part of the higher smooth surgery structure sets of complex projective spaces (up to some extension problems) and complete the description of the forgetful map to their topological versions in low dimensions. In addition, an application to mapping class groups of complex projective spaces in low dimensions is presented.
Read the full abstract
High Energy Physics (Phenomenology)
Higgsino Above the Sea of Fog
Higgsino dark matter is a classic, but still viable, weakly-interacting massive particle (WIMP) scenario that could point to supersymmetry, a new spacetime symmetry of nature. It is a simple realization of the "inelastic dark matter" mechanism, where its scattering off a nucleus occurs between two nearly degenerate states. Intriguingly, very recently the LZ collaboration reported a single nuclear recoil event at a high recoil energy. Assuming that this event is a dark matter candidate, it could be explained by higgsino dark matter, e.g., a 1.1 TeV thermal higgsino with a mass splitting of order hundreds of keV. The mass splitting required is very sensitive to the extreme high speed tail of the local dark matter velocity distribution, and thus susceptible to astrophysical uncertainties: the standard halo model prefers ~350 keV, while a model incorporating Large Magellanic Cloud effects prefers ~500 keV (a rough estimate based on partial information about a particular simulation). A much better understanding of the high speed tail is needed to evaluate whether the parameter space is consistent with an IceCube constraint on the annihilation of dark matter captured by the Sun. In any case, the mass splitting of several hundred keV implies that the electroweak gauginos and heavy Higgs scalars in supersymmetry have to be at a much higher scale ~10^{3-4} TeV. We discuss possible UV completions to generate a SUSY spectrum in which all superpartners are at a common scale, except for a much lighter higgsino mass $\mu$. Besides the thermal benchmark, we comment on possible non-thermal cosmological scenarios of higgsino dark matter with gravitino and modulus decays. The higgsino dark matter scenario could also be searched for at other complementary probes such as indirect detection and future colliders. One striking LZ event may herald an exciting future of further experimental developments.
Read the full abstract
Software Engineering
The Data Problem in Software Vulnerability Analysis: Artifacts, Quality, and Consumption
Learning- and LLM-based software vulnerability analysis is only as trustworthy as the data it is trained and evaluated on, yet that data is rarely examined as a first-class object. We investigate the data behind vulnerability analysis through a dataset-centric taxonomy that separates what an artifact is (code, metadata, patches, tests/PoCs, reasoning, traces), how good it is (realism, label evidence, scale, diversity, leakage, availability), and what it is used for. From a systematically assembled corpus of 1522 papers covering 2016-2026 plus foundational earlier work we deep-code a tiered set of 111 anchor papers, backing every affirmative rubric-graded value with a verbatim span, and we report, per attribute, both how much it has been studied and how well datasets achieve it. The results trace an evidence ladder: executable artifacts are the only major type where 15 of the 24 datasets are both graded real-world and carry labels that received an independent check, while code-sample datasets-the largest category in both the auto-tagged corpus and the anchor set-are the least realistic: 20 of the 41 draw their vulnerabilities from authentic projects or CVEs, but only 3 keep the sample at the unit the code is deployed in, and only 2 do both-though these are coarse component tests, and just one code-sample dataset meets the codebook's stricter full-context real-world grade. Among these, leakage goes unaddressed by 49 of the 90 datasets where it applies, more than a quarter say nothing about availability, reasoning data has arrived only recently and is mostly model-generated, and primary trace corpora remain limited to three datasets, the total after a corpus-wide screen and a full-text check of every candidate it surfaced, with further datasets releasing traces secondarily behind benchmarks and harnesses.
Read the full abstract
Programming Languages
Support Local Variables
Ruby is a dynamically typed and object-oriented programming language. Its primary implementation, CRuby, contains a bytecode virtual machine and a mature lazy basic block versioning (LBBV) just-in-time (JIT) compiler called YJIT. In order to both implement more advanced optimizations than YJIT supports and also encourage more outside contributions, we present a new method-based JIT called ZJIT. Like YJIT, ZJIT compiles from bytecode to machine code. Unlike YJIT, ZJIT has multiple global and local optimization passes. ZJIT's high-level intermediate representation is in static single assignment (SSA) form. In order to optimize Ruby's local variables, ZJIT lifts local variables into SSA values. This is a departure from how other Ruby compilers handle locals: other JIT compilers either leave local variables as memory loads and stores or do advanced partial evaluation to recover SSA values from memory. While implementing locals, we (re-)discovered what features make local variables in Ruby especially challenging to compile correctly and efficiently. We demonstrate these features and illustrate how we solved these problems in ZJIT.
Read the full abstract
Algebraic Geometry
Singularities of star cluster algebras
Materials Science
A relational fabrication-to-modeling database for memristor devices
Resistive random access memory (RRAM) devices, also known as memristors, are highly dependent on fabrication, location on the wafer, and measurement protocols. However, openly available large-scale memristor datasets remain scarce, particularly those that combine experimental metadata with electrical measurements and preserve explicit links across the experimental workflow. Here, we present a comprehensive relational database of automated electrical characterization data from oxide-based memristors. The database links 6,190 memristor devices across TiN/HfOx/TiN, Pt/TiOx/AlOy/Pt, and Pt/TiOx/Pt stacks to 161,006 validated experiments and over 169 million electrical point records. It integrates fabrication, wafer mapping, electrical characterization, and modeling to describe electroforming, current-voltage non-linearity, memory windows (R_off/R_on), switching dynamics, and short-term volatility. Released as a normalized and indexed SQLite database with schema documentation, graphical user interfaces, and examples of empirical modeling, this resource supports provenance-aware querying, statistical analysis, and data-driven applications for the development of future memristor technologies.
Read the full abstract
Probability
On the rigidity of sloped height functions in $d\ge 3$ and non-crossing surfaces
We consider integer-valued $\nabla\phi$ height functions, with general convex interactions, placed on a slope. Sheffield (2003) conjectured that for all slopes, such height functions are localized in dimensions $d\ge3$, in the sense of having tight fluctuations in finite volume, and admitting infinite-volume limits. We establish this conjecture when there are two coordinates on which the slope vector is zero and on which the interactions are even and low temperature. In this setting, we also prove the uniqueness, in the appropriate sense, of the infinite-volume limit and classify its extremal components. We further study the structural properties of the infinite-volume limit. We establish the entropic repulsion between macroscopic domain walls (boundaries of level sets), showing that they are maximally separated in a precise sense described by a rotation-of-the-circle dynamical system. Lastly, we show exponential decay of correlations in the extremal components. Our setup includes, as a special case, infinitely many zero-slope integer-valued surfaces (of dimension two or higher) conditioned not to cross. We deduce the existence and structural properties of the bulk Gibbs measure over such non-crossing surfaces with any given average spacing.
Read the full abstract
Combinatorics
A Tight Erdős-Stone Bound for All Graph Densities
The Erdős–Stone Theorem asserts that if a graph has edge density $1-1/r+\delta$ then it contains a complete $(r+1)$-partite graph with $b$ vertices in each part, where $b=b_n(r,\delta) \gg 1$. The celebrated Chvátal–Szemerédi theorem determined the exact order of $b_n(r,\delta)$ for every $\delta < 1/r^3$. Their bound, however, is not tight when $\delta=1/r-\epsilon$, that is, when the graph has edge density $1-\epsilon$ for small $\epsilon$. Our main result in this paper determines the correct order in this remaining regime, thereby enabling us to give a tight bound for the Erdős–Stone problem for all edge densities. More precisely, we prove that for every integer $r\geq 2$ and $0< \delta < 1/r$ we have $$ b_n(r,\delta)=\Theta\left(\frac{\log n}{(1/r-\delta)r\log(1/\delta)}\right)\;. $$ The lower bound is obtained using a Kövari-Sós-Turán-type argument combined with a variant of Nikiforov's method of constructing large blow-ups, while the upper bound is proved using a correlated random graph construction, related to tensor powers.
Read the full abstract
Physics and Society
Parliamentary mention networks reflect the organisation and dynamics of Finnish political discourse
The primary purpose of the parliamentary discussion is to present and debate legislative drafts. Mentions of other Members of the Parliament (MPs) and interruptions of them represent the structure of the political discourse. Name mentions can be automatically recognised in speech transcripts and linked to the relevant MPs. We construct networks of MPs based on name mentions in 96753 speeches delivered during the electoral terms 2015-2018 and 2019-2022 in the Finnish Parliament to study the structures of interaction within parliamentary discussion. The results show that the networks are not polarized, although there is slight bias towards mentioning one's own party members. Activity on the parliamentary floor, political seniority and minister status have a positive correlation with higher centrality scores of MPs. Our analysis is generalizable to different political arenas and is an interesting basis for comparison across regional assemblies or countries.
Read the full abstract
Functional Analysis
Modular properties of affine \(\SLA{sl}{2}\) torus \(n\)-point functions
Krauel, Shafiq and Wood (\KSW{}) realized torus \(1\)-point functions for the simple affine \voa{}s \(L(k,0)\) built from \(\alg{sl}(2)\) as vector-valued modular forms attached to a cyclic \(R\)-module structure and to the modular tensor category \(\rep{L(k,0)}\). We extend this to torus \(n\)-point functions, defined as traces of chains of \(n\) intertwining operators winding once around the \(\tau\)-cycle. Every coefficient of their local (Laurent, or Puiseux) expansion about a diagonal stratum is again a \vvmf{}, lying, whenever a mild lowest weight hypothesis holds, in the very \(R\)-modules of \cite{KSW}. Giving a torus-primarity hypothesis verified below for \(\alg{sl}(2)\), the operator product expansion then reduces leading short-distance behaviour to the classified \(1\)-point theory. For \(\alg{sl}(2)\) we classify the fusion-chain conformal block spaces, identify torus \(n\)-point primary vectors, and treat \(n=2\) in detail, obtaining a \((k+1)\)-dimensional family of vector-valued Jacobi-type forms generalizing the level-\(k\) forms \(\eta^{3k/2}\) of \cite{KSW}. We also extend \KSW{} categorical picture, representations of \(\Bthree=\PMod(\surf{1}{1})\) built from a modular tensor category, to representations, on fusion-chain block spaces, of a mapping-class subgroup of the \(n\)-punctured torus generated by \(S\), \(T\), and adjacent braidings, with a Verlinde-type dimension formula and categorical \(S\)-, \(T\)-operators. The \(\alg{sl}(2)\) matrix form of \(S\) beyond this abstract construction remains open.
Read the full abstract
Machine Learning
Optimizing Byzantine Node Placement in Decentralized Federated Learning
Security evaluations of decentralized federated learning (DFL) typically focus on how Byzantine participants behave, while largely overlooking which participants are compromised. Yet, because aggregation is distributed over a communication graph, the placement of Byzantine nodes determines how malicious influence propagates through the network. We therefore treat Byzantine placement as an explicit adversarial decision and formulate the attacker's objective as selecting, under a fixed compromise budget, the set of participants that maximizes its finite-time impact on honest nodes. To approximate this objective without executing the learning process for every candidate placement, we introduce Byzantine Placement Influence (BPI), a set-level measure derived from the actual gossip dynamics that quantifies the cumulative exposure of honest nodes to Byzantine sources over the training horizon. Unlike placement criteria based on node centrality heuristics, BPI directly accounts for weighted multi-hop propagation and interactions among compromised nodes. We develop efficient algorithms for optimizing BPI and evaluate them across six heterogeneous graph families, untargeted model poisoning, and backdoor attacks. BPI-guided placements consistently identify highly damaging configurations across different network structures and remain effective when the linear gossip assumption is relaxed through Byzantine-robust aggregation. Our results show that Byzantine placement is a critical but under-modeled dimension of DFL threat models and robustness evaluations.
Read the full abstract
Plasma Physics
Polarized quantum effects in countable signals from intense laser - electron beam interactions
We investigate the feasibility of precision counting experiments in laser-electron-beam collisions for testing strong-field quantum electrodynamics (QED), with particular emphasis on spin-dependent effects. To resolve such rare signals, we develop a high-precision Monte Carlo model combining spin- and polarization-resolved QED rates with weighted photon packets, hierarchical-mesh sampling, and adaptive time stepping. The model is quantitatively benchmarked against the high-energy edge of the photon spectrum and the positron yield in the SLAC E-144 experiment. The high-energy photon spectrum and total positron yield are only weakly affected by spin-dependent corrections, even at higher laser intensities. In contrast, we find that spin asymmetry in photon emission significantly affects the polarization of photons in the high-energy tail, while spin asymmetry in pair production manifests itself as a spin-dependent imbalance in the large-angle positron population. These microscopic spin asymmetries give rise to experimentally countable signals through their correlations with the oscillating laser field. Our predictions could be tested using moderate-energy electron beams and optical lasers with intensities of approximately 10^22 W/cm2, as envisaged in future ELI-NP experiments.