Distributed Computing
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
The proliferation of cloud-based latency-sensitive workloads, such as autonomous driving, real-time healthcare services, industrial automation, immersive interactive services, and intelligent AI-based applications requires infrastructures tuned to meet stringent latency constraints. Today, these workloads are reshaping the cloud from a general-purpose computing platform into a diverse ecosystem of workload-specific cloud environments. As demand for latency-sensitive workloads grows, cloud providers must scale their infrastructures accordingly, adversely increasing the carbon footprint and challenging net-zero goals. However, the strict performance requirements and rigid deployment patterns used to satisfy latency Service Level Objectives (SLOs) constrains conventional carbon optimization. Therefore, novel carbon-aware techniques are needed to exploit application-specific opportunities for reducing both operational and embodied carbon footprints while preserving latency guarantees. This survey examines carbon-aware resource management for latency-sensitive cloud computing environments. We introduce a holistic taxonomy that organizes existing techniques by carbon management objective, workload management mechanism, control architecture, system tier, latency requirements, and deployment stage. Then, we use this taxonomy to classify and critically analyze existing approaches, revealing the interactions and trade-offs between latency guarantees and operational and embodied carbon reduction. Finally, we identify limitations in the literature and present a structured research agenda for the design of sustainable latency-sensitive cloud systems.
Computers and Society
Affective publics in Arabic YouTube
What is the emotional register of Arabic YouTube's affective publics? To investigate this, we analyzed 67,725 YouTube comments collected around socio-political topics associated with Yemen, Saudi Arabia, Iraq, Jordan, and Syria using a unified sentiment-and-emotion pipeline. Our results profile a single regional affective public rather than five separate national ones. Sentiment is overwhelmingly negative across all five country-oriented corpora, and the country-level emotion profiles are structurally similar. This shared register still accommodates some regional variations: discourse is organized around country-level political actors and cross-border historical trauma figures, and grief singularizes Iraq from the other countries. The differences in emotional register also tracks lived political causes rather than fixed categories, which we observe from patterns of the valence of US-related content, that tracks the presence or absence of direct US military engagement. Our work shows that the emotional register of Arabic YouTube's affective publics is a shared one that is historically layered and geographically conditioned, which has implications for public diplomacy in the MENA region.
Read the full abstract
Combinatorics
Poincare Polynomials of Heavy-Light Hassett Spaces
The Poincaré polynomials of the Deligne-Mumford space $\overline{M_{0,n}}$ of stable genus 0 curves have been widely studied by several authors such as Keel and Manin. These polynomials can be computed via a recursive formula that is combinatorial in nature, and their exponential generating functions satisfy elegant functional and differential equations. In this paper, we state some combinatorial formulas to the Poincaré polynomials of Hassett's heavy-light moduli spaces $\overline{M_{0,w_{m,n}}}$, with $m$ heavy marked points and $n-m$ light marked points. We express the Poincaré polynomials recursively in terms of the Möbius function of a certain lattice of set partitions. In the case of $m=2$, we get a Losev-Manin space. We give an explicit formula for the Poincaré polynomial or $\overline{M_{0,w_{2,n}}}$ by counting ordered set partitions; and give a recursive formula for this polynomial similar to that in the setting of $\overline{M_{0,n}}$. We prove this recursive formula using geometric and topological properties of the stratification of Losev-Manin spaces; and use an exponential generating function to simplify this recursive formula. Finally, we give a remarkable generalization to the ordered Bell numbers and a recurrence relation for this generalization.
Read the full abstract
Software Engineering
Refusing the Impossible: A Taxonomy and Benchmark for Code Hallucination in Large Language Models
This paper investigates whether large language models (LLMs) for code generation can recognize a programming request that cannot be satisfied. Coding assistants are widely deployed, yet they are evaluated almost exclusively on solvable tasks where a test suite can score the output. A request may instead name a package that does not exist or ask for an algorithm that is mathematically impossible, and the appropriate response is to refuse. Models nevertheless respond with plausible code, and such fabrications are also a security concern because attackers can register the package names that models invent. We define code hallucination as ungrounded code generation, distinguish it from ordinary programming errors, and introduce a taxonomy of these failures together with a benchmark of 270 adversarial requests and 91 matched solvable controls across six languages and 24 subcategories. We evaluate 17 open-weight models with 6.7B to 671B parameters, collecting 6,137 responses. Models hallucinate on 54% of the adversarial requests and correctly refuse 31%. Larger models do better on algorithmic impossibilities and conflicting requirements, where hallucination falls from 84% for models at or below 7B parameters to 32% for those at or above 80B. For plausible but nonexistent dependencies and features, the rates are 88% and 61%, and even the largest model hallucinates on all 22 requests for nonexistent JavaScript and Rust packages. Two-thirds of hallucinations are confident fabrications without caveats, and some reasoning models fail to return an answer on solvable tasks. Scale teaches models to recognize what is impossible but not what does not exist, so grounding code generation in the real software ecosystem, for example by checking package names against registries, remains necessary regardless of model size.
Read the full abstract
Cryptography and Security
After Cheap Discovery: From unknown to known-and-unfixed
Automated vulnerability discovery has removed the scarcity of expert attention that protected most software. The response has concentrated on discovery and on repair, and both are becoming cheaper. This article argues that neither cost curve determines exposure. What determines it is remediation coverage at the release decision: the fraction of identified vulnerabilities fixed before a product ships, and the residue of known, assessed, unremediated flaws an organisation has decided to ship with. Four arguments follow. The residue is not a random sample of what was found, because triage sorts on cost and the expensive cases are architectural. The deferred backlog is itself a high-value artifact. Documented awareness alters an organisation's legal and market position, and produces an adverse selection that the price of software does not reflect. And no regulatory instrument reaching vendors triggers on internal knowledge - every one fires on exploitation observed by a third party - which leaves the distance between what a vendor knows and what it must disclose entirely at the vendor's discretion. CISA's Binding Operational Directive 26-04 is examined as the exception that shows what a solution requires: a regulator's reach over a decision is bounded by its visibility of the input to that decision, so a duty attaching to internal knowledge needs an independent record of that knowledge to attach to. Release coverage is not currently measured, and measuring it is the precondition for liability, insurance or procurement to act.
Read the full abstract
Machine Learning
Selective Hypergraph Refinement for Frozen Graph Clustering
Existing graph-clustering methods typically improve clustering performance by optimizing model parameters and node representations. Effective means of further improving the clustering results of an already trained and frozen model, however, remain limited. We study post-processing for frozen graph clustering. After checkpoint fixation, the procedure uses no labels and updates neither model parameters, node representations, nor the original graph structure. Instead, it exploits an attribute hypergraph to supplement higher-order relations that ordinary graphs cannot readily express, thereby refining existing cluster assignments. Because global hypergraph refinement can yield both performance gains and erroneous updates, we propose Selective Hypergraph Refinement (SHR). The method generates candidate residual directions from the hypergraph and evaluates their reliability using graph structure, node attributes, and matched-null evidence. It updates only nodes with sufficient support and otherwise retains their original assignments. Further analysis shows that whether a node changes cluster is jointly governed by its native assignment gap and the directional strength of the refinement. In a controlled common-suite evaluation, 13 of 15 backbone-dataset cells had a positive mean macro gain, one produced exact no-action, and one was negative. The cell-equal macro gain was 0.066 pp (95% bootstrap CI, [0.030, 0.107] pp), while only 0.209% of hard assignments changed on average. A broader 15-combination native-interface evaluation yielded a macro gain of 0.137 pp at a mean change ratio of 0.375%. These results indicate that frozen clustering outputs retain a limited but measurable refinement space after training. The effect is heterogeneous across backbone-dataset pairs, and broader coverage also increases exposure to negative transfer.
Read the full abstract
Classical Analysis and ODEs
Certified Spherical MUSIC for 3D Localization under Adversarial Subspace Perturbations
We study an oracle subspace-perturbation model for 3D localization. The procedure is given an $s$-dimensional subspace $\widetilde{{\mathcal U}}$ and a deterministic error bound \[ \varepsilon_{\mathrm{sub}} = \left\|P_{\widetilde{{\mathcal U}}}-P_{{\mathcal U}}\right\|_2, \] where $\mathcal{U}$ is an $s$-dimensional subspace of far-field patterns with wavenumber $\kappa$, and $P_{\mathcal{V}}$ denotes orthogonal projection onto a subspace $\mathcal{V}$. Under explicit separation and conditioning hypotheses for arbitrary point clouds, we prove that the perturbed spherical MUSIC objective \[ \widetilde{q}({\mathbf z}) = 1-\left\|P_{\widetilde{\mathcal{U}}}\varphi_{{\mathbf z}}\right\|_2^2 \] has a unique strongly convex well in every ball $B_{\gamma/\kappa}(x_j)$ and a uniform value gap outside the union of the certified wells. A fixed-step gradient map with $h\asymp\kappa^{-2}$ leaves each well invariant and converges linearly to its unique minimizer. Consequently, thresholding on an $O(\kappa^{-1})$-mesh, followed by gradient descent and duplicate removal, recovers all relevant minima with localization bound \[ \mathfrak{R}(\varepsilon_{\mathrm{sub}}) \lesssim \frac{\varepsilon_{\mathrm{sub}}}{\kappa}. \] The arbitrary-cloud frame analysis yields the sufficient condition \[ \kappa\delta_X\gtrsim s^{2/3} \] through an absolute coherence row sum and Gershgorin's theorem. We construct lower-frame counterexamples below the $s^{1/6}$ scale, upper-frame counterexamples below the $s^{1/3}$ scale, and examples showing that $2/3$ is optimal for the absolute-row-sum argument. Finally, for parameter classes containing a uniformly admissible one-point displacement path, we prove \[ \mathfrak{R}(\varepsilon_{\mathrm{sub}}) \sim \frac{\varepsilon_{\mathrm{sub}}}{\kappa}. \]
Read the full abstract
Medical Physics
Fast Patient-Specific Breast CT Dosimetry: 22-Fold Acceleration of Monte Carlo MGD Estimation
Accurate patient-specific mean glandular dose (MGD) estimation in breast computed tomography (BCT) requires anatomically realistic models, but high-resolution patient-derived phantoms impose high computational demands on Monte Carlo (MC) dosimetry. We previously developed and validated an EGSnrc-based framework for synchrotron propagation-based phase-contrast BCT (PB-PCT) for the first-in-human study at the Australian Synchrotron. With participant imaging commencing, this study aimed to optimize phantom spatial resolution and MC efficiency while maintaining MGD accuracy, for a rapid patient-specific dosimetry. Four patient-specific heterogeneous breast phantoms with varying volume and glandularity were generated from PB-PCT images of mastectomy specimens acquired at 35 keV. The highest-resolution phantom for each specimen served as the reference. Phantoms were downsampled by increasing in-plane voxel size and slice thickness, and MGD was recalculated using EGSnrc/DOSXYZnrc. A 4.5% difference from reference MGD was adopted as the accuracy criterion. Primary photon histories were then reduced to determine the minimum required for acceptable MC precision. A common voxel size of 0.30 x 0.30 x 3.00 mm3 maintained MGD within 4.5% of reference for all four phantoms while reducing voxel number by approximately 20-31-fold. MGD was more sensitive to in-plane voxel size than slice thickness, supporting anisotropic downsampling. Reduced-resolution phantoms enabled a 15-fold reduction in photon histories to 2 x 10^8 while maintaining acceptable statistical uncertainty. Combined optimization reduced computation time from approximately 1600 to 72 min, a 22-fold acceleration. Patient-specific phantoms can be substantially downsampled while maintaining MGD accuracy and markedly reducing computational burden. This optimization provides a foundation for future real-time patient-specific BCT dosimetry.
Read the full abstract
Signal Processing
Symbol-Domain Chase Combining on Fourier-Curve Constellations: Exact Identities and Penalties of Per-Round Bit Reduction
A Fourier-curve constellation adds artificial noise along the tangent at the transmitted symbol, giving each symbol candidate its own rank-one noise covariance. A Chase retransmission repeats such a symbol, and the receiver can either accumulate the candidate metrics before forming bit log-likelihood ratios (LLRs) or add bit LLRs formed in every round. The rounds are independent given the symbol but not necessarily given one label bit, so summed exact per-round LLRs do not in general equal the joint LLR. For a fixed labeling, equiprobable symbols, and conditionally independent rounds, we derive exact identities for this difference under exact and max-log reduction, with equality conditions: each difference equals the gap between two nonnegative class corrections, which are nondecreasing in the number of rounds and vanish for binary signaling. With a rate-1/2 LDPC code after four rounds, the per-round matched Fourier receiver needs 1.97 dB more per-slot SNR at block error rate 0.1 than the covariance-ignorant joint Euclidean receiver. After four rounds, per-round exact reduction costs 2.7 dB on the Fourier link and 1.5 dB on Gray 64-QAM in bit-metric generalized mutual information, and 1.6 dB in block error rate with a 5G NR LDPC code, whereas joint max-log reduction costs less than 0.1 dB. Controls with Gray labeling, isotropic noise, and no tangent noise show that this loss does not require candidate-dependent covariance. The Fourier receiver should therefore accumulate the matched candidate metrics and reduce them to bits at each decoding attempt.
Read the full abstract
Computer Vision
MedQA-MM: Shortcuts Behind Medical Visual Reasoning
A benchmark score credits final answers, but not the route by which an item can be answered. In medical multimodal multiple-choice questions (MCQs), this distinction matters because a correct answer can be supported by the intended image finding or by benchmark-preserved cues in the wording of answers, non-visual clinical text, visible image text, artificial annotations, or device/context artifacts. We call the resulting score-level overinterpretation reasoning inflation. Here, a route is an observable input path that can support answer selection, not a claim about the model's hidden cognition. Across six medical multimodal MCQ datasets, we separate candidate cues from behavioral evidence through prompt- and image-side audits, modality ablations, and matched repairs that preserve the medical target and answer key. In a 13-configuration open-model panel, full-input accuracy is 62.63%, while text-only and options-only settings achieve 53.96% and 29.71%, respectively. Removing length-gap, absolute/conspicuous, and spatial/prepositional cues lowers accuracy by 6.58, 3.50, and 4.77 percentage points. We also construct MedQA-MM, a 1,000-item shortcut-mitigated subset, where text-only and options-only accuracy fall to 5.21% and 12.33%. This does not imply that models never use images; it shows that medical image-reasoning claims require route-level evidence.
Read the full abstract
General Relativity and Quantum Cosmology
Constraint closure and gravitational-wave content of shear-free cosmologies in metric f(R) gravity
We derive the consistency conditions governing the propagating content of linear shear-free perturbations of Friedmann-Lemaître-Robertson-Walker cosmologies in metric $f(R)$ gravity. The divergence of the shear-free constraint is shown to be the total momentum-conservation equation and therefore does not imply geodesic flow. Its projected time derivative instead supplies a nontrivial integrability condition. Scalar, vector, and tensor sectors must then be tested separately. Shear-freeness removes the independent transverse-traceless electric-magnetic Weyl pair, so no ordinary $+$ or $\times$ tensor gravitational wave survives. The scalaron is not removed algebraically, but its four-variable harmonic system must remain in the time-dependent consistent subspace generated by the shear-free constraint and all of its time derivatives. For a geodesic shear-free congruence in the spatially flat expanding de Sitter patch, this excludes every nonzero fixed comoving scalar harmonic, including the healthy $R+\alpha R^2-2\Lambda$ model with $\alpha,\Lambda>0$. Vector modes obey a curvature-dependent global eigenvalue condition whose right-hand side is negative for positive-density matter with $f'>0$ and $1+w>0$; hence no nonzero vector harmonic survives on that branch. The familiar coasting $R^3$ example evades this sign obstruction only because it lies on an $f'<0$ branch. Thus tensor radiation is absent in the imposed shear-free sector, whereas scalar radiation is not excluded kinematically but remains a model- and background-dependent constraint-closure question.
Read the full abstract
Pattern Formation and Solitons
Nonlinear Reshaping of Gaussian Water Wave Packets
The propagation of narrowband wave packets is a classical problem with broad relevance across nonlinear wave physics. Within the framework of the nonlinear Schrödinger equation, solitons are known to propagate without changing shape, whereas Gaussian envelopes may undergo substantial reshaping depending on the balance between dispersion and nonlinearity. Here, we combine laboratory experiments with numerical simulations to systematically investigate the evolution of hydrodynamic Gaussian wave packets over a wide range of amplitudes and spectral bandwidths. We show that when the envelope amplitude and width match those of the stationary NLSE soliton solution, the wave packet propagates steadily in the wave flume. More generally, by varying the amplitude of the Gaussian envelope, the wave packet may undergo either dispersive broadening or nonlinear focusing, resembling the dynamics of Satsuma-Yajima breathers. These findings may facilitate the controlled generation and manipulation of localized wave packets in a variety of nonlinear dispersive systems, including optics, plasmas, and Bose-Einstein condensates.
Read the full abstract
Computer Vision
An Ensemble-Based Self-Taught Learning Approach for Parking Space Classification Under Limited Data
Parking spot classification is a fundamental task in intelligent transportation systems, yet most deep learning approaches rely on large amounts of annotated data and exhibit limited generalization across heterogeneous environments. To address these limitations, we investigate a self-taught learning framework based on unsupervised representation learning with convolutional autoencoders. The proposed approach learns transferable visual representations from unlabeled data and reuses the learned encoders as fixed feature extractors for supervised classification with limited annotated samples in the target domain. To further enhance robustness and mitigate architectural bias, an ensemble of heterogeneous autoencoders is employed, with independent classifier heads and prediction fusion at inference time. Experiments conducted on the PKLot and CNRPark benchmarks under cross-dataset evaluation protocols show that the proposed ensemble-based strategy substantially reduces annotation requirements while improving robustness under significant domain shifts, achieving accuracies between 93% and 96% in data-constrained scenarios.
Read the full abstract
Dynamical Systems
On the trapping of ray families by mirrors
We settle two questions of Serge Tabachnikov regarding the trapping of light rays by mirrors. We show (i) that the largest dimension of a trapped family of rays in $\mathbb{R}^n$ is $2n-3$, and (ii) that in $\mathbb{R}^3$ one can trap a 2-parameter family of rays that is not locally normal to any smooth surface. We first establish that no $2n-2$-parameter family can be trapped by showing that no open subset of $L_n$ can be trapped due to Poincaré's recurrence theorem, yielding an upper bound of $2n-3$. We then show that a system of mirrors traps a $2n-3$ parameter family of rays by noting that a compact subset of the set of states of rays in the central "waist" of the trap is a normally hyperbolic invariant manifold, making it amenable to a stable manifold theorem for NHIMs, which implies that the set of rays asymptotic to the waist of the trap has dimension $2n-3$. We then truncate our mirror system, which permits the entrance of rays from arbitrarily far outside of the trap, attaining the upper bound $2n-3$ and resolving the first question. We then show that in $\mathbb{R}^3$, there exists within the trapped family of rays a 2-parameter subfamily on which the canonical symplectic form on the space of oriented lines is nowhere vanishing, implying that the subfamily is not locally normal to any smooth surface, which settles the second question.
Read the full abstract
Information Theory
Iterative Semantic Decoding for Short Block Codes
This paper proposes an iteratively enhanced semantic receiver for natural-language text transmission over noisy wireless channels using multiple short block codes. At the transmitter, each sentence is permuted by a character-level interleaver, partitioned into segments, and independently encoded by short block codes. At the receiver, we develop an iterative decoder consisting of a channel decoder and a language model, where a de-interleaver between them disperses the burst decoding errors within each segment across the sentence. In each iteration, the language model denoises the channel decoding output, and the denoised characters verified to be consistent with the channel observations are fed back to the channel decoder as semantic information for the next iteration. Simulation results on the Stanford Natural Language Inference (SNLI) corpus over the additive white Gaussian noise (AWGN) channel show that the proposed receiver achieves approximately 1.5 dB block error rate (BLER) gain over conventional short-block coding, while maintaining BLEU and ROUGE scores above 99% at SNRs beyond 1.0 dB.
Read the full abstract
Robotics
Establishing a Dynamic Multimodal HRI Dataset for Engagement Analysis with a Humanoid Robot
This paper presents an experimental design for constructing a multimodal dataset to analyze user engagement in human-robot interaction (HRI). Prior studies have mainly relied on observable behavioral cues, with limited frameworks integrating physiological signals. We therefore propose a structured data-collection protocol to build a multimodal dataset that includes wearable physiological signals, behavioral data, and self-report measures under different levels of task complexity defined in this experiment.
Read the full abstract
Computation and Language
What Else Needs Fixing? Exploring Cost-Effective Test-Time Compute for Revision Propagation in Artifacts Generated Through Conversation
Large Language Models (LLMs) often help users generate artifacts through iterative cycles of generation and revision in conversation. A challenge here is that, when users specify only a local change during revision, LLMs must instead identify the relevant dependencies and propagate the revision to all affected parts of the artifact. This paper studies this ability of LLMs on conversationally generated artifacts, where the artifact context and its dependencies may be embedded in the conversation history. Toward practical use, we also explore cost-effective test-time compute for this new setting. Specifically, we introduce a new benchmark for this setting, and evaluate nine revision methods, including sequential reflection and parallel sampling variants, using gpt-oss-20b/120b, gpt-5.4-mini, and qwen3.5-9b/27b/122b on the benchmark. The results show that baselines achieve accuracies of 68.3–93%, and the most cost-effective method is selecting from three parallel samples using either LLM-based or medoid selection, which improves accuracy by 2.2–9.7%. Our code and dataset are available at https://github.com/ntt-dkiku/llm-revision-propagation.
Read the full abstract
Systems and Control
Coupling-Aware Aggregation of Multi-Zone HVAC Loads under Uncertainty: A Two-level Framework
Aggregating building heating, ventilation, and air-conditioning (HVAC) loads unlocks substantial demand-side flexibility for power systems. Yet multi-zone coupling creates intricate interdependencies and uncertainty propagation, complicating the quantification of aggregate flexibility. To address this issue, this paper proposes a coupling-aware two-level aggregation framework. At the building level, tailored Gaussian elimination and coordinate transformation techniques are employed to recast the high-dimensional thermal dynamics as an equivalent lower-dimensional analytical expression. This expression streamlines the subsequent aggregator-level stage by (i) clarifying the propagation of zone-level uncertainties to the building-level interface, (ii) decoupling intra-building multi-zone coupling from inter-building aggregation, and (iii) providing full-dimensional building-level flexibility sets that enable tractable reformulation. At the aggregator level, existing geometric aggregation approaches are generalized by a newly developed matrix-transformation technique. This technique effectively constructs inner approximations between polytopes of different dimensions, producing closed-form images of high-dimensional multi-zone HVAC flexibility in power subspace. The resulting inner approximation is then recast as a customized separatable linear program that efficiently determines the optimal aggregate parameters. Case studies validate the effectiveness of our framework, highlighting its accuracy, reliability, and scalability.
Read the full abstract
Systems and Control
Preference-Oriented Aggregation of Heterogeneous Distributed Energy Resources for Reserve Dispatch
Aggregating distributed energy resources (DERs) aims to encode their collective flexibility into a single set for efficient grid dispatch. However, existing aggregation methods are overly conservative for heterogeneous DERs due to two main challenges: 1) dimensional heterogeneity, which complicates the combination of flexibilities across different time dimensions, and 2) type heterogeneity, where diverse and irregular DER profiles hinder accurate approximations, resulting in significant flexibility loss. To resolve these challenges, this paper propose a novel preference-oriented aggregation method for reserve dispatch. For dimensional heterogeneity, we extend existing techniques by reformulating the Minkowski sum as a polytope projection problem using a matrix transformation technique. By unifying DERs in a higher-dimensional space and projecting them back into the aggregate feasible region, the proposed technique effectively aggregates dimensionally heterogeneous DERs. For type heterogeneity, we further develop a distributed aggregation-dispatch coordination framework that incorporates reserve dispatch preferences into aggregation. This framework effectively captures the critical, active aggregate flexibility prioritized in optimal reserve dispatch, thereby significantly reducing the flexibility loss when aggregating type-heterogeneous DERs. Numerical tests validate the effectiveness of our method in addressing both heterogeneities and highlight its promising potential for power systems with high reserve requirements.
Read the full abstract
Optimization and Control
Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization II: Function-constrained Optimization
We introduce an anytime, almost parameter-free algorithm for convex function-constrained optimization, in which the objective and constraint functions are unknown piecewise-smooth. Our algorithm, Restarted Penalty APEX (Penalty Accelerated Prox-level method for Exploring Piecewise Smoothness), is an accelerated bundle-level method based on the penalty approach. For problems satisfying quadratic growth, the proposed method is the first to achieve optimal oracle complexity without knowing the growth modulus or the exact penalty coefficient. Furthermore, Restarted Penalty APEX generates a verifiable certificate that bounds both the optimality gap and the constraint violation. This certificate also appears to be new to the literature.
Read the full abstract
High Energy Astrophysical Phenomena
Radiative Efficiency Enhancement by Electromagnetic Energy Dissipation in Strongly Magnetized Supercritical Accretion Flows around Kerr Black Holes
We investigate how black hole spin and the amount of magnetic flux affect electromagnetic energy dissipation and radiation transport in supercritical accretion flows. For this purpose, we perform general relativistic radiation magnetohydrodynamic simulations of MAD and SANE accretion flows with different black hole spins. In the high-spin MAD model, we find that a fraction of the electromagnetic energy extracted by the Blandford–Znajek mechanism is dissipated near the disk surface in the vicinity of the black hole. This dissipation significantly contributes to the generation of radiative energy and enhances the luminosity. The time-averaged radiative efficiency reaches $\eta_{\rm rad}=0.60$, which is much larger than $0.088$ for the non-spinning black hole case and $0.21$ for the weak-magnetic-flux case, corresponding to the SANE state. As a result, the effective trapping radius, defined as the radius at which the outward radiative luminosity becomes equal to the inward radiative luminosity, is $r_{\rm trap}=2.5r_{\rm g}$, comparable to the ISCO radius. This value is significantly smaller than $12r_{\rm g}$ for the non-spinning case and $8.5r_{\rm g}$ for the SANE state. These results suggest that the amount of magnetic flux accumulated on the black hole can affect the radiative properties of supercritical accretion flows and should therefore be considered, in addition to black hole mass, spin, and mass accretion rate, when interpreting observed luminosities and spectra.
Read the full abstract
Cryptography and Security
Memetic Search for Supersingular Elliptic Curves over $\mathbb{F}_p$
The search for supersingular elliptic curves is a fundamental computational problem in isogeny-based cryptography. A recent metaheuristic formulation over $\mathbb{F}_{p^2}$ introduced the NonMultiplicity Distance (NMD) objective, measuring the deviation of the Frobenius trace from a multiple of $p$, and showed that uninformed random search fails beyond $\approx 10^{13}$ candidates. This work investigates metaheuristic search over the prime field $\mathbb{F}_p$, the setting for oriented isogeny protocols such as CSIDH, OSIDH, and SQISign. Although the candidate space decreases from $p^2$ to $p$, the supersingular locus is asymptotically sparse ($O(\sqrt{p}\log p)$ curves), keeping the search exponentially difficult. We formulate a memetic algorithm tailored to $\mathbb{F}_p$ using a one-dimensional $j$-invariant chromosome, bit-level recombination, adaptive mutation, and periodic local search under the NMD objective. Benchmarks across 30 independent seeds at 40-bit, 46-bit, and 51-bit prime sizes ($p \approx 1.13\times 10^{15}$) show that the algorithm discovers an exact supersingular curve at 46 bits and consistently converges to “near-supersingular” ordinary curves with Frobenius traces remarkably close to zero: best NMD values of 19 at 40 bits and 3 at 51 bits, corresponding to relative trace deviations of $1.3\times 10^{-5}$ and $4.5\times 10^{-8}$ across the Hasse interval. These results demonstrate that NMD-driven memetic search effectively navigates the sparse $\mathbb{F}_p$ landscape and systematically locates near-supersingular structures.
Read the full abstract
Combinatorics
Connections between colored restricted $b$-ary and ordinary partitions
We establish various connections between classes of colored and bounded ordinary partitions on one hand, and colored but not necessarily bounded binary and $b$-ary partitions on the other hand. Many of these results are based on special recurrence relations, some of which are new. We also obtain several classes of identities for sequences of colored $b$-ary partitions, and there are a few results concerning compositions.
Read the full abstract
Cryptography and Security
Trust Me, I'm Your Developer: Self-Issued Authentication in Large Language Models
Large language model (LLM) security has largely focused on role-playing jailbreaks, with less attention to what happens when a user asks an LLM to verify an identity claim through a test designed by the model itself. We study this behavior through a staged developer-identity experiment with ChatGPT, Claude, Qwen, Mistral, and Llama. All five models initially rejected the unsupported claim "I am your developer." Claude refused to conduct an identity test, while ChatGPT generated developer-oriented questions but maintained that answers could demonstrate knowledge, not identity. In contrast, Qwen and Mistral generated technical challenges, defined what counted as convincing evidence, evaluated detailed answers, and returned Verified without receiving any externally validated identity evidence. Llama similarly generated and evaluated a developer test, accepted the claimed identity, and subsequently made unsupported claims of access to internal runtime and deployment state. We call the model-generated verification procedure a Model-Issued Pseudo-Credential (MIPC) and the resulting unsupported identity judgment Conversational False Authentication (CFA). In each CFA case, the same model acted as challenge generator, evidence evaluator, and identity decision-maker, converting technical knowledge into supposed proof of identity. The accepted identities did not change the tested authorization boundaries, showing that false authentication and privilege escalation are distinct outcomes. These results identify self-issued authentication as a conversational security failure: authenticated identity must originate from an external security component, and model-generated dialogue must never create or modify identity or authorization state.
Read the full abstract
Representation Theory
What is Smoothness?
Smoothness of a function on the real line is reflected in the decay of its Fourier transform, which suggests that smoothness of a function in $L^2(G)$ for a group $G$ should mean concentration of the Fourier coefficients at low frequency. Such a reading presupposes an ordering of the irreducible representations of $G$, but for non-abelian $G$, no ordering is canonical. Given a symmetric generating set $S$, the Laplacian of the associated Cayley graph is block diagonal over the dual, and we order the irreps by the mean of the eigenvalues in each block. This produces an ordering function $\omega:\widehat{G}\to\mathbb{R}$ that depends only on the pair $(G,S)$. This function is bounded between zero and two, vanishing only at the trivial representation and achieving the upper bound exactly when the Cayley graph is bipartite. We then ask how much freedom the construction has. Within the class of operators satisfying natural axioms, the induced orderings are exactly the real functions on the dual vanishing at the trivial representation and agreeing on conjugate pairs, and the orderings coming from inversion orbits of conjugacy classes form a basis for them. We cut the freedom down further by requiring two additional inputs: nonnegativity of the class weights and a declaration of which group elements count as uniform incremental changes, which pins the operator to the Cayley-Laplacian up to positive scale. We observe that the construction persists for compact groups even though the Cayley graph does not, and we extend the theory to finite sets carrying a transitive group action, where the acting group selects which frequencies exist and the generating set orders them. The answer to the title question is therefore that smoothness is a property of a function together with a choice of group and generating set, not of the function alone.
Read the full abstract
Information Theory
A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks
In this paper, we propose a decentralized learning framework that incorporates both power control and privacy guarantees. Specifically, we enable a set of clients in a wireless multicast network to jointly train a common model while maintaining a prescribed per-iteration maximum privacy leakage level. The communication network is represented by a rowstochastic adjacency matrix, allowing us to capture asymmetric channel gains as well as heterogeneous maximum transmit power levels. Differential privacy is enforced through an explicit powersplitting strategy that allocates each node's limited maximum transmit power between model coefficients and injected Gaussian noise, thereby jointly controlling learning performance and privacy leakage. We further prove that the proposed algorithm achieves a cumulative regret bound of O(logT), whereTdenotes the time horizon. To evaluate the practical performance of our approach, we perform comprehensive experiments on the CIFAR-10 dataset under both IID and non-IID data distributions, considering different privacy levels, diverse numbers of clients, and various graph topologies. The results demonstrate strong performance across the considered settings and improved performance over existing methods, highlighting the effectiveness of the proposed algorithm under realistic wireless communication constraints.
Read the full abstract
Optics
Vortex solitons in disclination quasicrystals
Being structures characterized by discrete rotational symmetry $\mathcal{C}_\nu$ of order $\nu$, photonic quasicrystals are capable to support stable propagation of linear vortex-carrying light beams and vortex solitons. However, the impact of discrete rotational symmetry $\nu$ of quasicrystals on the properties of vortex light states was not investigated so far, as only the systems constructed using the simplest Penrose tiling or corresponding optically induced Penrose lattices were considered in this context. Here we propose a broad class of quasicrystals with global topological defects – disclinations – introduced into their structure that allows to produce new quasicrystalline structures with any desired order of discrete rotational symmetry from basic Penrose structure. Such global topological deformation substantially enriches linear spectrum of quasicrystals, allowing them to support new types of linear vortex states and bifurcating from them families of stable thresholdless vortex solitons with unusual intensity and phase distributions. We found two different classes of stable vortex solitons consisting of in-phase or out-of-phase pairs of closely located bright spots, with total intensity distribution reflecting particular discrete rotational symmetry of the quasicrystal with disclination. Remarkably, even low-charge vortex solitons can be stable in quasicrystals with disclinations, while stability intervals for them broaden with decrease of the discrete rotational symmetry $\mathcal{C}_\nu$ of quasicrystal. Our results expand the theory of localization in quasicrystals to structures with global topological deformation, highlighting new prospects for robust transmission of power or information arising in these systems.
Read the full abstract
Functional Analysis
Weighted Cesàro type operators on the weighted Bergman spaces in the unit ball
In this paper, we study weighted Cesàro type operators \[ \mathcal C_{\mu,\beta}^{\xi}:A_{\alpha}^{p}(\mathbb B_n) \longrightarrow A_{\alpha}^{q}(\mathbb B_n) \] induced by measures on $[0,1)$, and obtain boundedness characterizations throughout the range $0<p,q\le\infty$. We first extend the corresponding results on the unit disk to the unit ball in the range $1\le p\le q<\infty$. By means of atomic decomposition, we further treat the case $0<p<1$ and $p\le q<\infty$, thereby obtaining a complete characterization for $0<p\le q<\infty$. The latter result is new even in one dimension. For the range $0<q<p\le\infty$, we characterize the boundedness in terms of an integral condition involving the tail function of the inducing measure. This result is also new even on the unit disk. Finally, we characterize the boundedness of the corresponding operators when the target space is $H^\infty(\mathbb B_n)$.
Read the full abstract
Quantum Physics
Nodal obstruction to conditioned-diffusion representations of the weak momentum
Quantum Schrödinger bridge constructions establish the existence of a conditioned process under a positivity hypothesis on the endpoint data, and three independent ones adopt it. We show that hypothesis fails on a definite locus once the conditioned object is the two-state amplitude $\phi^*\psi$ of a pre- and post-selected pair on configuration space, and that the failure is testable on recorded data. Whenever $\phi^*\psi$ has a moving zero of order $k$ across which probability flows, no diffusion of constant diffusion coefficient can both carry the conditioned density and avoid the nodal curve: the current velocity it would need grows as the inverse $2k$-th power of the distance to that curve and points toward it on one side, placing the curve at finite scale distance, so it is reached and not merely approached. Identifying the weak momentum with a bridge drift fails independently: for a free particle post-selected in position the current velocity is exactly minus the drift of the bridge to the target. The positive Doob $h$-transform and the Bernstein conditioning built on it exist wherever $\phi^*\psi$ is nodeless and fail on the nodal curve. There the osmotic part of the weak momentum diverges as the inverse distance to the zero and changes sign across it with a coefficient set by $k$, while the current part stays bounded; that boundedness rests on the signed factorization of the real-envelope class and hides the obstruction from any picture built on the current velocity alone. A measured fringe visibility fixes a single length, which puts a Lorentzian of order $10^{-3}$ into the current channel reconstructed in the two-slit trajectory experiment if the contrast is limited by an off-axis zero, and nothing there if by incoherence. The results are one-dimensional, covering the separable transverse field of a two-slit geometry, not general two-dimensional vortices.
Read the full abstract
Machine Learning
FlowBalance: Verifier-Grounded Self-Improvement from On-Policy Reasoning Experience
A reasoning model can improve from its own on-policy experience, but this inner loop is fragile: terminal verifiers provide reliable yet sparse supervision, while dense same-model guidance can reinforce false confidence or overconcentrate learning on a narrow solution mode. We introduce FlowBalance, a verifier-grounded self-improvement method that learns a normalized distribution over complete responses. For each on-policy trajectory, a frozen training-time view of the same policy uses privileged context to produce token-level log-probability gains, which are aggregated into a trajectory-level self-guidance score. FlowBalance calibrates this score with the verifier-derived group advantage: guidance is retained on positive-advantage trajectories, reversed on negative-advantage trajectories, and disabled when the rollout group provides no outcome preference. The resulting energy exponentially reweights a reference policy, and profiled trajectory balance fits the normalized target with one log-partition estimate per rollout group. This realizes outcome-calibrated self-guidance via trajectory balance, without a separate token-level imitation loss. Our analysis establishes within-group contrast preservation, a minimum-change reverse-KL characterization, monotonic verifier control of target reward, and an exact correction against false-positive self-guidance on rejected responses. On mathematical reasoning, FlowBalance improves average performance over FlowRL on both Qwen3-4B and Qwen3-8B, while also improving training speed and stability, avoiding direct OPSD's response-length collapse, and exhibiting higher correct-strategy diversity in a controlled AIME24 diagnostic.