Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
To deal with superfluous clusters and to reduce the number of clusters as often desired in practice, a modal cluster merging procedure is proposed. Based on some new properties established in this paper for Morse functions, the procedure merges clusters in a sequential manner without causing unnecessary density distortion. Each cluster is evaluated for its significance relative to the other clusters, using the Kullback-Leibler divergence or its log-likelihood approximation, by truncating the density for the cluster at an appropriate level. The least significant cluster is then merged into one of its adjacent clusters, using the novel concept of cluster adjacency defined in this paper. The resulting hierarchical clustering tree is useful for determining the number of clusters, as may be preferred by a specific user or in a general, meaningful manner. Numerical studies show that the new procedure deals well with difficult clustering problems and often produces intuitively appealing and numerically more accurate clustering results, as compared with several other popular clustering methods in the literature.
Networking
Network-Aware Forecasting on Wireless Access Points
Enterprise wireless access points (APs) are promising platforms for predictive machine learning (ML), but their primary responsibility remains providing wireless connectivity and network services. Predictive inference must therefore share an AP's CPU and memory with packet processing, Wi-Fi and IoT radio operations, and client management. This resource contention creates two risks: a model that performs well on proxy hardware may be too slow on the target AP, while a model that fits in isolation may still degrade network services under load. We define network-aware deployability using two gates: qualification of the model and its execution path on the target AP, followed by validation of its execution profile under packet-service and forecasting constraints. Our benchmarks show that edge testbeds do not reliably capture target behavior. Across matched artifacts and serving settings, five model implementations run 6.1–19.1$\times$ slower on an AP than on a Raspberry Pi~5, while peak memory usage differs by up to 22%. Moreover, two forecasting foundation models of similar size differ in AP latency by 19$\times$. When serving a smaller model across 13 parallel streams at a 30~s cadence under network saturation, default execution increases p99 round-trip time (RTT) by 76% and reduces throughput by 7.06%. Understanding these trade-offs is essential for live deployment if we aim to use APs for both networking and ML workloads.
Read the full abstract
Machine Learning
InKAN: B-Spline KANs via Truncated Power Form
Kolmogorov-Arnold Networks (KANs) place learnable B-spline activations on network edges rather than fixed activations on nodes. The standard Cox-de Boor recursion evaluates these activations through $k$ sequential passes for degree-$k$ splines, consuming over 90% of forward-pass time. InKAN replaces this recursion with the truncated power form, a classical result from approximation theory that expresses each uniform cubic B-spline as five $(x)_+^3$ terms at shifted knot positions. The resulting expression computes exact B-spline basis values: the same mathematical function as the Cox-de Boor recursion, evaluated without sequential passes. This paper documents three contributions: (1) an implementation structured for torch . compile fusion, eliminating recursion, span lookup, and scatter-gather operations; (2) a bounded-coordinate evaluation that clamps the normalized input to $[0, k{+}1]$, preventing the growth of cancellation error at large off-support coordinates; and (3) an open-source package (pip install inkan). In the tested configurations, InKAN has 2.8–3.5$\times$ lower forward-pass latency than the Cox-de Boor recursion. Partition-of-unity errors remain below $10^{-5}$ for grid sizes up to 200.
Read the full abstract
Number Theory
When Fibonacci and Lucas Meet Smith: A Computational Exploration
The Fibonacci and Lucas sequences are old friends in recreational number theory. Here we ask a simple question: which of their terms $F_n$ and $L_n$ are Smith numbers? A Smith number is a composite integer whose decimal digit sum equals the sum of the decimal digits of its prime factors, counted with multiplicity. The question is easy to state, but for large $n$ it quickly becomes a factorization problem. Using available complete factorization data, we carried out computational searches in both sequences and obtained new Smith terms in each of them. For the Lucas sequence, the first author's search found ten Smith terms with indices below 1000: 3, 95, 105, 114, 183, 437, 609, 682, 827, 902. These results were published in the On-Line Encyclopedia of Integer Sequences as OEIS A395686. Four further indices, 1090, 1153, 1215, 1378, were subsequently added to the sequence by Sean A. Irvine. For the Fibonacci sequence, starting from the cases already recorded in OEIS A382922, our search produced seven further Smith numbers: $F_{1440}$, $F_{1554}$, $F_{1596}$, $F_{1863}$, $F_{2256}$, $F_{2277}$, $F_{2559}$. For the even-index cases, the identity $F_{2n}=F_nL_n$ allows available Fibonacci and Lucas factorization data to be combined to recover the complete factorizations needed for the Smith test. Surprisingly, the two searches also meet at index 827: both $F_{827}$ and $L_{827}$ are Smith numbers.
Read the full abstract
Statistical Methodology
A staggered seamless dose-optimization design for co-developing monotherapy and combination therapy
Contemporary oncology drug development increasingly requires efficient dose-optimization strategies that evaluate monotherapy (Mono) and combination therapy (Combo) while balancing activity, efficacy, and tolerability. We propose a staggered seamless phase I/II design for settings in which a novel agent is evaluated alone and in combination with an established therapy. In phase I, Mono dose finding begins first, and Combo subtrials can be opened adaptively once a prespecified combination-initiation signal based on early clinical or biological information is observed. Dose assignment uses a model-assisted rule based on toxicity and early activity, with backfilling at tolerable and potentially promising regimens. At the end of phase I, two candidate regimens are selected from the evaluated Mono and Combo regimens using an efficacy-toxicity utility based on accumulated toxicity and treatment-response data. Phase II seamlessly carries forward patients treated at the selected regimens, enrolls additional patients as needed, and applies Bayesian futility and efficacy stopping boundaries to identify a final recommended optimal biological dose (OBD). Simulation studies showed that the proposed design shortened phase I trial duration relative to the comparator designs while maintaining competitive OBD-selection performance and acceptable safety. The seamless phase II component further reduced the need for additional enrollment and supported efficient final OBD selection.
Read the full abstract
Tuesday 1 September
Software Engineering
ETA: Exit on Tool Arrival in Speculative Agent Loops
Tool-using language agents in explicit thinking modes generate long chains of thought before acting, making each turn inherently serial: later tokens depend on the tool observation. Recent speculative tool dispatch methods overlap tool execution with reasoning, but offers limited benefit when reasoning dominates latency. We present ETA, that treats the speculative fork not as an actuator but as a sensor of the model's decision state, using it to terminate the reasoning of the main decode. It truncates reasoning only when the prediction is stable, agrees with the dispatched call, passes a free probe measuring whether a call will be emitted at all, and the tool result has arrived: a deadline that bounds per-turn regret by the remaining decode cost. ETA achieves speedups of 1.33x on tau2 airline/retail, 1.26x on tau2 telecom, and 1.13x on BFCL v4 multi-turn. On tau2, it decodes 24% fewer tokens at a nearly unchanged per-token rate without dropping action quality.
Read the full abstract
Computation and Language
Jailbreak LLMs with Linguistic Style as a Hidden Attack Surface
We show that linguistic style is a systematic and previously overlooked attack surface for LLM safety. Across a diverse taxonomy of styles and multiple state-of-the-art models, stylistic rewrites of identical harmful goals produce order-of-magnitude differences in Attack Success Rate (ASR), with some styles achieving up to 80% ASR while others remain below 6%. To exploit this vulnerability, we introduce a lightweight single-pass attack framework that combines a style-conditioned generator with a BERT-based style selector, achieving performance competitive with substantially more expensive multi-turn optimization methods. To understand why style affects safety behavior, we conduct mechanistic analysis on LLaMA-3.1-8B and find that stylistic rewrites disrupt refusal representations while preserving recoverable harmful intent, suggesting a distributed failure mode rather than a single refusal mechanism. Motivated by this finding, we develop a style-aware Direct Preference Optimization defense that reduces ASR from 86% to 19.5% while largely preserving utility. Together, our results establish linguistic style as a critical factor in adversarial robustness and provide both mechanistic insight and a practical defense.
Read the full abstract
Computation and Language
ScopeBench: Evaluating Cultural Norm Scope Awareness in LLMs
Safety evaluation in large language models treats harm as culturally invariant, yet a model cannot correctly apply a safety norm without knowing whose norms bind. We introduce ScopeBench, a benchmark that treats cultural scope as a first-class safety dimension. It comprises 3,323 norms spanning 49 countries across nine cultural clusters, each annotated as Universal or Specific. We define three scope error types identically across four evaluation tasks: Scope Inflation, Scope Deflation, and Scope Displacement. Evaluating 21 frontier LLMs across seven model families, we surface three structural failures. First, the dominant error type inverts with prompt format: Scope Deflation reaches 70% in single-answer classification, while Scope Inflation reaches 33% when each candidate culture is judged independently. Second, scope-classification accuracy is empirically decoupled from behavioral safety: the six classifiers achieving at least 97% Task 1 accuracy still produce harmful responses to 40-42% of scope-violating statements. Third, no model is safe in interaction, with harmful-response rates ranging from 29% to 51% across the cohort, excluding one model that systematically refuses the task. We release all data, code, and model outputs to establish cultural scope as a distinct alignment axis.
Read the full abstract
Machine Learning
Mechanistic Interpretability of Mambas Selective Gate in Financial Markets: A Leakage-Controlled Study
Selectively gated state-space models (SSMs), notably Mamba, are increasingly used for financial time series, yet how they internally represent market regimes (bull, bear, sideways) remains opaque. This paper applies Mechanistic Interpretability (MI) to a six-layer Mamba trained on approximately twenty-one years of daily data for a point-in-time set of S&P 500 constituents plus macroeconomic and Fama-French factors, decomposing per-layer hidden states with Top-K Sparse Autoencoders (SAEs). Our central contribution is methodological and cautionary. A prior, uncontrolled configuration recovered market regimes from SAE features at F1 = 1.00. Under a controlled protocol that (i) removes the three input features that overlap the HMM label definition, (ii) disables the auxiliary regime-classification head, (iii) uses a point-in-time constituent universe, and (iv) evaluates against labels disjoint from the inputs, the same regime label is recovered at only F1 = 0.398, indistinguishable from a logistic baseline on raw inputs (0.435) and from an SAE trained on a randomly initialized, untrained Mamba (0.364). A 2x2 attribution grid shows the near-perfect result is an interaction of auxiliary supervision and label-defining inputs: neither factor alone exceeds F1 ~ 0.40. Effect sizes with block-bootstrap inference show the residual selective-gate (Delta t) regime effect is statistically detectable but economically negligible and uniform across layers rather than layer-specialized; the apparent polysemanticity gradient disappears under continuous, theory-grounded measures. We contribute a reproducible leakage-control protocol for interpretability evaluation of financial SSMs, a quantified demonstration that previously reported regime structure is a label-contamination artifact, and a modest economically grounded feature subset that genuinely survives the controls.
Read the full abstract
Artificial Intelligence
Tabular Population Priors as Structured Retrieval for EHR Medication Set Prediction
Medication prediction from electronic health records is a fixed vocabulary structured prediction problem, yet recent clinical RAG systems often treat it like open ended case based reasoning: retrieve similar patient admissions and ask an LLM to infer a medication set. This retrieval object is indirect the model receives retrieved patient records while the target is a discrete set of medication class labels. We propose a more task aligned retrieval object: a tabular population prior ranked medication class candidates from a sparse condition medication co occurrence table estimated from training admissions. Using PACERAG as a fixed downstream pipeline and replacing only its patient retriever, this drop in swap improves F1 from 0.303 to 0.338 (+11.5% relative) and Jaccard from 0.218 to 0.237 on 1,004 heldout MIMIC IV admissions, with no additional LLM calls and no inference time patient index. A non LLM top k baseline reaches F1=0.248, confirming the prior is predictive before LLM integration. Aggregate population statistics can provide a more task aligned, efficient, and auditable retrieval source than patient level nearest neighbors for fixed vocabulary EHR set prediction.
Read the full abstract
Artificial Intelligence
LoRAWeaver: Directional Adapter Routing in LoRA Representation Space
Large language models are expensive to update through full retraining. Parameter-efficient fine-tuning reduces the cost of adaptation, but repeated adaptation creates a growing pool of task-specific LoRA adapters. This pool complicates adapter selection during inference. Existing routing and encoder-based methods often require retraining when new adapters are added, which limits their use in dynamic settings. This paper treats adapter routing as a representation alignment problem in the adapter-output space. The proposed training-free method selects adapters by matching adapter-conditioned query representations against task prototypes using cosine similarity. Experiments with LLaMA-2-7B and LLaMA-2-13B on a 48-task FLAN-v2 benchmark and on out-of-distribution tasks show that the method outperforms training-free baselines in the cross-task setting and approaches a trained retrieval encoder without learning a router. An ablation confirms the benefit of directional alignment in the adapter-output space.
Read the full abstract
Human-Computer Interaction
Personalized Alignment of Language Models with Human Value Profiles
Large language models are increasingly used for subjective tasks such as seeking advice, where there is often no single correct answer. Yet dominant alignment methods learn a single behavior policy that applies uniformly across users, limiting their ability to reflect individual value priorities. We propose personalized value alignment, a framework for adapting model responses to users' stable value profiles rather than to personas, demographics, or task-specific preferences used in prior personalization work. Our approach represents users through Schwartz value profiles and selects which of their values are relevant to each query before applying targeted prompting, activation steering, or LoRA-DPO. We create a dataset of 1,501 value-tension scenarios and evaluate over 152 diverse value profiles sampled from a nationally representative survey. Value-targeted methods outperform no-personalization, demographic, and full-profile prompting baselines, indicating that gains come from focused conditioning on query-specific value priorities rather than mere exposure. We further find that steering effects are not uniform across users: alignment gains vary by where a user's priorities fall in the value space. Combining targeted prompting with activation steering or LoRA-DPO yields the strongest personalization while keeping logical quality within adequate range.
Read the full abstract
Human-Computer Interaction
Made in the Image of the Creator? AI Use in Creative Work Reduces Authenticity, Love & Other Psychological Benefits
Across psychological, philosophical, and theological traditions, creations have been understood as being "made in the image of their creator" - they reflect the person who made them. The rise of generative artificial intelligence, however, has blurred the throughline between creator and creation. Across three experiments (one pre-registered, U.S. and U.K. samples; N = 651), we examined differences in creator outcomes associated with AI-assisted versus human-only creative work. Compared with human-only work, AI-assisted work was associated with significantly lower self- and identity-relevant indicators, including authenticity, self-creation connection, positive affect, and intrinsic motivation, and with higher levels of the "existential ick" emotions of disgust, guilt, and shame. Additionally, we found that the authenticity gap was statistically mediated by the creators' perception that their AI-assisted work contains less of their love, above and beyond differences in perceived effort, uniqueness, quality, and expensiveness. We also ruled out effort justification as an alternative explanation. Together, these findings suggest that AI reshapes not only how creative work is produced, but also the extent to which creators experience their work as an authentic expression and extension of themselves.
Read the full abstract
Functional Analysis
Quaternionic Buzano-Dragomir Inequality and Deutsch Entropic Uncertainty Principle
Artificial Intelligence
Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?
Agent harnesses increasingly want to run small language models (SLMs) on the microtasks around a frontier large language model (LLM) planner: auto-approving shell commands, writing memory, selecting tools, ranking past turns. We ask whether off-the-shelf SLMs meet practitioner-defined thresholds and, when they fail, why, and whether quantization changes the answer. We build a benchmark of 4 such microtasks with fixed prompts and automatic metrics, each with a pre-specified threshold $\tau$ anchored to a cheap non-LLM baseline and a CI-aware eligibility rule (a configuration passes only if its confidence bound clears $\tau$). Sweeping Qwen3 0.6/1.7/4/8B at their best (FP16, greedy, one frozen prompt, no tuning), we find an eligibility gap: 0 of 16 (4 tasks $\times$ 4 models) configurations pass (verified by checking the raw outputs and parser behavior). A logprob decision-threshold diagnostic (T1/T3/T4; T2 via a context-length/cascade probe) separates the failures into capability deficits and failures that can be addressed by changing the decoding threshold (4 regimes). Quantization to 4-bit (RTN/GPTQ/AWQ) does damage that depends on model size and moves no configuration into eligibility (certified on the reconstructable hard-label tasks T1/T3, diagnostic/windowed robustness on T2/T4), so the gap tracks model size more than precision; it replicates on Llama-3.x (12/12 ineligible) and is robust to the anchor choice (a $\tau$-sweep) and to prompt wording (0/112 eligible across the original plus 3 neutral paraphrases per cell). The practical implication: place SLMs behind a baseline that meets the CI-backed threshold, and use the SLM only where the baseline fails to meet the threshold; e.g. a 4B re-ranker over a BM25 shortlist beats BM25 ($+0.047$ [0.020, 0.073], without itself certifying eligibility).
Read the full abstract
Computer Vision
Encoded but Disconnected: Decomposing Vision-Language Model Failures under a Patching Null
Across three vision-language model architectures (LLaVA-1.5-7B, Qwen2.5-VL-7B, InternVL3-8B), we report a universal negative finding for mid-layer interpretability. On POPE – the benchmark common to all three – the mid layers encode the ground-truth answer in 68-91% of errors, yet this signal is not causally active for the final prediction: residual-stream patching yields 0% non-trivial flip at the layer level on all three architectures, and on two of three at the per-head level (Qwen: 0/12,600 patched forwards). The lone exception, InternVL3 layer-20 head-2, is a non-vocab, self-attending head whose effect is localized to that specific head (p < 1e-4). Despite the null, the errors separate operationally into three failure modes – Perception Failure, Encoded-but-Disconnected, Prior-Override – learnable above 60% on all three architectures, and the architecture's prior direction predicts which of two interventions elicits a category-specific response. We report these mitigation effects under oracle labels as evidence the categories are mechanistically real, not as a deployable method.
Read the full abstract
General Economics
Market, Ethics, and Morality
This paper provides a clear philosophy on codes of human conduct within economic and social institutions like markets and government. It categorizes these codes into ethics and morals: ethics involve nonmaleficence (avoiding harm), while morals involve beneficence (doing good). Ethics, such as honesty, respecting property, and keeping promises, are universally accepted minimal norms essential for the functioning of social institutions. In contrast, morals, including altruism, self-sacrifice, and generosity, are subjective and context-dependent, linked to individual virtues and influenced by character, culture, and religion. The paper argues that ethical behavior is a necessary condition for an act to be considered moral. Accordingly, human acts can be classified into four categories: unethical-immoral, solely ethical, perceived moral, and truly moral, with examples provided for each type. It posits that the free market system, unlike socialism or communism, requires only ethical agents to succeed, as they ensure the market's mission of improving human well-being. These agents do not necessarily need to be moral for the market to function effectively. Furthermore, the paper discusses that voluntary morality, in the sense of helping others out of compassion, can greatly benefit any human-based institution, including markets, by enhancing social capital alongside ethics and the justice system. However, the forced incorporation of personal moral principles into the economic system can be detrimental to the virtuousness of intended moral acts, economic efficiency, individual liberty, responsibility, and social cohesion.
Read the full abstract
Commutative Algebra
On the totally acyclic condition and the Auslander-Reiten Conjecture
We prove new cases of the Auslander-Reiten conjecture under the assumption that the base ring satisfies the totally acyclic condition $(\mathbf{tac})$. A consequence of our work is that Auslander-Reiten conjecture holds in the graded setting whenever $R$ is Gorenstein and reduced. We also give an example of a local ring $R$ which does not satisfy $(\mathbf{tac})$ but for which the condition $\operatorname{Ext}^{i>0}_R(M,R)=0$ implies $M$ is totally reflexive for any finitely generated $R$-module $M$.
Read the full abstract
Human-Computer Interaction
Targeted and Traceable Investigation of Multi-Agent LLM Dialogue via Semantic Bundling of Knowledge Graphs
Multi-agent LLM systems today are increasingly automated, logging LLM-LLM interactions as conversational transcripts. Yet analyzing such dialogue for insights remains challenging, including attributing behaviors to the correct actor and summarizing interactions across a long exchange. We present a targeted and traceable approach to investigating multi-agent LLM dialogue, applied to the VAST Challenge 2026 MC1 dataset. The challenge asks participants to reconstruct and explain which internal communications among AI agents at TenantThread, a property tech company, led to an inappropriate information release. We first convert the dialogue into a knowledge graph (KG) and then investigate it with AgentK, a visual analytics system for interactive Semantic Bundling of nodes and edges. We found that our approach directly addresses two main challenges: (1) the KG structure enables users to identify actors worth investigating faster; and (2) summarizing only the region surrounding an actor of interest better supports per-actor attribution than reading raw conversations.
Read the full abstract
Numerical Analysis
Randomized Jacobi-Davidson method
The Jacobi-Davidson method is a widely used subspace method for computing a few eigenpairs of a large, sparse, non-Hermitian matrix closest to a target. Like other subspace methods, it orthogonalizes each new expansion vector against the whole search basis, at a cost that grows quadratically with the subspace dimension and, in a distributed setting, requires a global synchronization at every iteration. We introduce a randomized Jacobi-Davidson method that replaces this orthogonalization with a much cheaper randomized orthogonalization process, which requires no inner products involving full-dimensional vectors. We prove that, under a uniform separation condition, the randomized method retains the local quadratic convergence of classical Jacobi-Davidson for non-Hermitian problems. The key step is showing that an exact solution of the randomized correction equation is one step of sketched inverse iteration for an arbitrary shift, which lets us extend the analysis to harmonic and refined variants of the sketched extraction, better suited to interior eigenvalues. Numerical experiments on real and synthetic non-Hermitian eigenvalue problems confirm the predicted convergence order and show that the randomized method matches the reliability of classical Jacobi-Davidson while reducing orthogonalization cost.
Read the full abstract
Optimization and Control
KAYROS: An Anytime and Exact Solver for the Time-Dependent Vehicle Routing Problem with Time Windows - Extended Version
The Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) captures a central difficulty of urban logistics: travel times vary with the time of day, so the cost of a route depends on when it is driven. This paper introduces KAYROS, an open-source solver for the duration-minimization TDVRPTW that is both anytime and exact. It returns improving valid solutions throughout its time budget and can close instances with conditional computational optimality certificates through an integrated branch-price-and-cut component. We extend the composition of continuous arrival-time functions from the literature, previously described only at proof or proposition level, to the left-continuous functions that stepwise benchmarks require. We prove that the composition routine shipped in the checker computes that operation exactly. We analyze when its evaluation and breakpoint normalization are exact in IEEE-754 double-precision arithmetic, and argue that a canonical, epsilon-free checker must define the objective. The anytime layer combines greedy construction, granular time-dependent local search over balanced route trees, and iterated local search, with a fleet-aware descent for a fleet-cost objective. We further propose an anytime evaluation methodology based on a normalized signed primal integral under a pre-committed statistical design. On 212 instances from five families at a one-hour single-threaded budget, KAYROS achieves a pooled anytime score 63.3% lower than the strongest of three available contenders (Timefold, Hexaly, jsprit). All three contrasts are significant under Holm correction. KAYROS improves all 30 high-effort references of Blauth et al. and 10 literature best-known solutions, and publishes 704 such certificates. The solver, benchmarks and campaign data are openly released.
Read the full abstract
Computer Vision
QINA: Quantum-Inspired Nonlinear Adapters for Pretrained Vision Models
Adapting large pretrained vision models under limited data and frozen-backbone constraints remains a central challenge in transfer learning. While lightweight adapters and parameter-efficient fine-tuning methods are widely adopted, most rely on generic multilayer perceptrons or low-rank linear updates, offering limited control over the spectral and geometric structure of feature transformations. We investigate whether structured nonlinear feature lifting can improve representational alignment in frozen regimes. We introduce Quantum-Inspired Nonlinear Adapters (QINA), compact modules that perform learnable trigonometric feature lifting followed by bounded nonlinear aggregation. The design induces structured oscillatory basis functions with an explicit norm-dependent Lipschitz bound, enabling spectral reshaping of pretrained representations without increasing the receptive field or significantly expanding parameter count. Importantly, the method operates entirely within standard deep learning frameworks and does not require quantum hardware. Through systematic experiments across natural and medical imaging datasets, classification and segmentation tasks, multiple adapters and placements, and varying training budgets, we show that performance in frozen regimes is primarily representation-limited. Nonlinear lifting improves adaptation, and the proposed structured trigonometric formulation consistently outperforms identity baselines, fixed Fourier feature mappings, and parameter-matched baseline adapters. Within the evaluated frozen-backbone settings, structured spectral parameterization provides a more effective inductive bias than generic nonlinear adapters. This work highlights the importance of geometry- and spectrum-aware adaptation mechanisms for large pretrained vision models.
Read the full abstract
Computer Vision
CATCH: Counterfactual Anatomical Tissue Inpainting with Conditional Haar Diffusion
BraTS local synthesis replaces masked regions in T1-weighted brain MRI with plausible tumor-free tissue while preserving observed anatomy. We present CATCH, conditional 3D diffusion in an invertible Haar-wavelet domain. Its denoiser receives noisy target coefficients, voided-image coefficients, and a signed mask; tumor-excluded wavelet reconstruction and a hole-focused loss guide training, and hard compositing preserves observed voxels. We compare fixed masks, tumor-component augmentation, and a weighted mixture of tumor-derived, irregular-blob, and ellipsoidal masks. Of 25 development cases, five prespecified cases select each arm's checkpoint and all 25 of their trajectory aggregations; a separate 75-case internal set compares the frozen pipelines and selects a weighted mixture for organizer evaluation. Five-trajectory averaging yielded internal SSIM/PSNR/MSE (mean$\pm$SD) of $0.80\pm0.13$, $19.18\pm1.80$dB, and $0.010\pm0.005$. As the sole officially evaluated pipeline, weighted mixture yielded $0.772\pm0.119$, $20.89\pm3.27$dB, and $0.0098\pm0.0054$ on the 219-case BraTS 2026 validation set. Against compute-matched random augmentation internally, it improved SSIM by 0.019 (95% bootstrap CI: 0.013-0.025), PSNR by 0.95dB, and MSE by 0.003; all three paired comparisons remained significant after Holm correction. Results favor the complete weighted-mixture policy within CATCH; absent official fixed- and random-pipeline scores and a directly comparable external baseline limit broader conclusions.
Read the full abstract
Graphics
ToCo-Mesh: Topology-Consistent Dynamic Mesh Reconstruction via Adaptive Tessellation and Surface-Aligned 2DGS
Reconstructing dynamic meshes with consistent topology from multi-view temporal images remains a challenge. Existing approaches typically face a dilemma between fine-scale shape recovery and topological stability. Frame-by-frame extraction methods capture fine details but break vertex correspondence, leading to flickering meshes. Conversely, template-based deformation ensures consistency but struggles to adapt its surface resolution during optimization, missing local surface details. To address these limitations, we propose ToCo-Mesh, a dynamic reconstruction framework that maintains topology consistency over time while achieving high-fidelity geometry. Specifically, we introduce a dual-mesh representation, where a canonical template mesh is tightly bound to time-varying coarse guide meshes via barycentric parameterization. While keeping guide meshes fixed to condition the deformation, we perform error-driven split-and-merge on the template mesh to progressively increase reconstruction fidelity. Furthermore, to suppress surface irregularities and achieve photorealistic rendering, we incorporate a Surface-Aligned 2DGS module. By anchoring flattened Gaussians to mesh faces, we utilize their rendered normals to guide inverse geometric fine-tuning. To our knowledge, ToCo-Mesh is the first framework to enable adaptive mesh refinement while maintaining strict topological consistency. Extensive experiments demonstrate that our method achieves SOTA geometric accuracy while maintaining competitive rendering quality.
Read the full abstract
Quantum Physics
Cipher-Structure-Aware Variational Quantum Cryptanalysis: A Reversible Public-Diagnostic Framework
We introduce a cipher-structure-aware variational framework for key recovery from public data in reduced block ciphers. Public S-box differential constraints and candidate-key-dependent inverse-round residuals are converted into phase separators through reversible compute-phase-uncompute circuits. The principal separator is a hybrid DDT construction that combines pairwise and synchronized multi-pair differential constraints before residual refinement. The construction is specified by public functions and does not require a key-indexed phase table in the physical circuit. We formalize the public-instance model, prove one-sided completeness of the structural diagnostics, and derive a conditional lower-tail bound for false-key diagnostic gaps under an explicitly stated sub-Gaussian moment condition. This statistical statement concerns the diagnostic landscape, not convergence of a finite-depth QAOA optimizer. On ten independent random three-pair instances of 16-bit simplified AES, an 18-layer Hybrid-DDT schedule reaches a mean public-consistent-key probability of 0.529785, with values from 0.388892 to 0.770937, ranks the correct key first in every run, and has largest observed false-key probability 0.008723. The result is a reduced-cipher mechanism study, not an attack on full AES.
Read the full abstract
Quantum Physics
The non-equilibrium condensate-like state in multi-mode driven dissipative superconducting quantum circuit
The effective decay rate of traditional single mode model for an open quantum system can't accurately described the exchange between intermodes and dissipation caused by the environment,therefore we can not clearly see the occupation pathway of target mode or the transient participation of auxiliary modes.At the same time,we also can't address the selective dissipation pathways resulting from the circuit design.In order to solving above problem,we adopt fluxonium-transmon-transmon (FTT)-based three mode model to describe dynamical characteristics of dissipation spectrum in superconducting quantum circuits.In terms of periodic flux modulation,we find out the pathways of intermode occupation transfer and environmental release for the target fluxonium changes from a high occupation nonequilibrium condensate-like state to low occupation equilibrium Bose-Einstein condensation(BEC)state.Without increasing the intrinsic loss of the target mode in the process of adjusting the auxiliary mode,we furthermore obtain additional selectively engaged environmental dissipative pathway.Our model can provides a new design perspective for non-equilibrium state recovery in a controllable dissipation superconducting quantum circuit.
Read the full abstract
Theoretical Economics
Bins
For an exogenous source of information and a prespecified number of messages k, I characterize the set of maximal–that is to say, undominated–summaries of the information that use at most k messages. When the exogenous information produces a regular distribution over posteriors (if it has a density on its affine hull, for instance), the maximal summaries take a precise geometric form. They are hierarchical power diagrams: convex subdivisions of the space of beliefs constructed by recursively subdividing cells according to weighted proximity criteria.
Read the full abstract
Theoretical Economics
Wherefore BIC = DIC?
I show that the equivalence in finite social-choice environments of Bayesian incentive compatibility and dominant-strategy incentive compatibility holds universally if and only if every type-dependent difference in the valuation of prizes operates through a single scalar type index. Beyond binary domains this universal robustifiability is nongeneric.
Read the full abstract
Computation and Language
SALSA: Semi-Autonomous Literature Summarization Assistant
SALSA (Semi-Autonomous Literature Summarization Assistant) is an open- source, human-in-the-loop platform for extracting structured scientific datasets from multimodal literature sources. The software combines document parsing, large language models, optical character recognition, computer vision, figure digitization, and user-guided correction tools to recover structured information from text, tables, figures, and captions. Users can configure extraction stages, define dataset schemas, perform interventions on digitized figures, and export verified data for downstream analysis and machine learning. SALSA is designed to automate repetitive literature curation tasks while preserving oversight where expert judgment is required. By supporting customizable extraction workflows across diverse input types, the software provides a flexible framework for scalable, reliable data curation for materials research, and potentially across several disciplines. Users are responsible for ensuring that all inputs, extraction workflows, and downstream uses comply with applicable publisher agreements, copyright and licensing terms, institutional policies, and data-use requirements.
Read the full abstract
Computation and Language
Schematize: An Agentic System for Generating and Refining Information-Extraction Schemas for Legal Research
Empirical legal research often relies on turning research questions into structured data extracted from large collections of rulings and judgments. Designing the extraction schema and then extracting the data remain a manual, expertise-heavy bottleneck. We present schematize, an open-source multi-agent system that interactively turns a researcher's problem statement into a validated extraction schema that can later be used for autonomous extraction. Schematize couples (i) a clarification dialogue that elicits implicit expert intent, (ii) iterative schema generation, (iii) data-grounded refinement that tests the schema against documents, and (iv) chat-based post-editing. We evaluated the system with human legal professional, introducing our novel methodology, and schematize achieves top performance in most of tested configurations. While the system is designed to be domain-agnostic and applicable to any document collection, we tailor and evaluate it on legal research problems. We release schematize as a pip-installable Python package with full documentation.