General Relativity and Quantum Cosmology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 7 November
We develop a quantum-computational framework for the mass observable of the Wheeler–DeWitt quantized Schwarzschild black-hole interior. Working in the physical sector spanned by correlated two-mode oscillator states, we construct finite-dimensional representations of the mass operator and map them onto qubit operators through Pauli decomposition. We analyze the resulting representations for increasing truncation sizes and establish analytically the scaling of the number of nonvanishing Pauli terms and independent measurement settings. These results provide a quantitative characterization of the quantum resources required to encode and measure the black-hole mass observable. As a representative benchmark, we implement a two-qubit variational quantum eigensolver for the smallest nontrivial truncation and find excellent agreement with the exact finite-dimensional spectrum. We further describe a quantum-circuit procedure for verifying the Wheeler–DeWitt constraint independently of the mass estimation. Our results provide a direct connection between Wheeler–DeWitt quantum gravity and quantum computation and establish a structured route toward the quantum simulation of gravitational observables.
Robotics
Beating the Pool, Not the Game: A White-Box Equilibrium Agent for Language-Based Economic Games
We describe sudsho, a rule-based agent for the GLEE Competition that plays bargaining, negotiation, and persuasion with zero inference-time LLM calls. Games are scored as payoff percentiles against an empirical pool of prior play on the same configuration, so pool percentiles set our demand targets while clamped equilibrium shares bound demands and acceptance. Every move is a deterministic function of the visible state (persuasion mixing aside), so alignment is verified by replaying the post-freeze move log through the policy. Across 117,280 games the agent reached an overall rating of 2056 at $0 inference cost, and the account, ranked by its best agent (a same-policy replica), placed 26th of 71 ranked accounts. A replay against three frozen snapshots of the opponent pool credits the pool-aware clamp with 274 to 330 points of mean per-game bargaining rating, an effect that holds where logged opponent decisions fix the replay.
Read the full abstract
Computation and Language
Gendered Misclassification from Surname-Based Race Imputation
Researchers increasingly estimate political behavior based on race and gender from voter files, where race is imputed from surnames and geography. This only works where surnames suggest group membership, an assumption violated where surnames follow norms around marriage. Imputation is therefore biased against women who adopt their husband's surname, especially those who racially inter-marry, an outcome itself endogenous to partisanship. Using six US states recording self-reported race, I show that imputation is less accurate for Asian and Hispanic women, particularly those sharing the surname of a partner of another race, who differ politically from other women of their race. This violates assumptions behind downstream inference approaches, which nearly double the gender gap in partisanship among Asian voters. I derive an expression showing the bias is largest where a group is small. Using maiden rather than marriage-adopted surnames in North Carolina raises accuracy up to fourfold for women married across racial lines. Recovering maiden surnames, or omitting the married surname, removes much of the bias. In a national replication of a study of gender gaps in turnout, the correction more than triples the gap among Asian voters. In Lebanon, where wives register in their husband's locality, the error enters through geography.
Read the full abstract
Hardware Architecture
Beyond Host-Side Control: HBM Controller Partitioning Across Host and HBM Base Dies
Recent generations of high bandwidth memory (HBM), such as HBM4, allow the base die of the memory stack to be manufactured using a logic process that can accommodate more complex controller functions next to the DRAM. We present the first systematic quantitative study of function-level controller placement between the host and the HBM4 base die on a silicon interposer. We divide the controller into its main functions and evaluate four placements, from a complete host controller to a complete base die controller, with intermediate placements that move maintenance or scheduling to the base die. We extend Ramulator 2 with HBM4 timing and maintenance, model a die-to-die (D2D) link with timing checks at the DRAM interface, and compose area, energy, and temperature from synthesized controller blocks, modeled storage, and interface data. A provisioned D2D link preserves per-stack bandwidth and adds about twice its one-way delay to unloaded latency. Maintenance moves to the base die with no bandwidth cost and frees host command slots, and the freed share grows with stack height. Replacing the wide interface with a D2D link saves 61% of host shoreline and 16.85 mm2 of host area per stack. The D2D link dominates the added base die area and power, and the base die runs cooler under streaming with link energy below 0.4 pJ/bit. Shared control delivers up to 1.72x the throughput of static partitioning between two requestors.
Read the full abstract
Hardware Architecture
Augur: An Online Learning-based Hardware Data Prefetcher using Reservoir Computing
Machine-learning-based hardware prefetchers can learn complex access patterns, but practical deployment demands online adaptation, low-latency inference, and modest hardware cost. We present Augur, a hardware delta prefetcher based on next-generation reservoir computing (NGRC) that meets all three requirements. Augur formulates delta prediction as a history-based regression problem. It constructs a fixed-size reservoir from hashed delta features over a short context window and predicts the next delta using a single dot product. The model is updated online via one-step SGD and requires no offline pre-training, no per-benchmark tuning, and no floating-point arithmetic. Replacing the integer multiplications traditionally used to generate nonlinear reservoir features with bitwise AND operations removes all feature-generation multipliers with no loss in performance. Because Augur regresses a continuous delta, it needs no action set chosen offline for a fixed set of workloads. Augur pairs the reservoir with a simple Markov-based delta predictor for simple delta patterns, and with a selective issuance policy that filters and throttles wasteful prefetches; this policy accounts for about 40% of Augur's advantage and also improves Pythia. Evaluated on 169 traces spanning GAP, Ligra, PARSEC, SPEC CPU 2006, SPEC CPU 2017, and AI workloads, Augur outperforms the state-of-the-art ML-based delta prefetcher by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems, respectively, while achieving ~2x higher prefetch accuracy and 37.8 percentage points fewer overpredictions. Augur is practical to implement at 33 KB storage, 0.32 sq. mm area, and 32.7 mW in 12 nm.
Read the full abstract
Mathematical Finance
Polynomial-Preserving Processes and Volatility Modelling in Discrete Time
This paper develops a discrete-time framework for volatility modelling and derivative pricing based on polynomial preservation. The framework provides exact moments of arbitrary order and serial cross-moments of variance and return processes over any finite horizon through finite-dimensional matrix representations. This analytical tractability is maintained while accommodating flexible leverage and variance-of-variance dynamics and non-Gaussian innovations. We introduce two novel classes of stochastic volatility models that nest widely used discrete-time specifications and study their statistical properties. Under two distinct scaling regimes, we establish weak convergence to polynomial diffusions and jump-diffusions and convergence of polynomial moments, linking discrete-time moment recursions to continuous-time matrix-exponential formulas. An empirical analysis of S&P~500 returns and a large panel of options spanning 1996–2023 shows that the proposed specifications improve return fit and reduce mean weekly implied volatility root mean squared errors by approximately 8–41% relative to their nested benchmarks, depending on the variance dynamics and innovation distribution.
Read the full abstract
Geometric Topology
Absolute mod-two gradings on framed real monopole Floer homology
We construct absolute mod-two gradings on framed real monopole Floer homology, for real 3-manifolds such that the image of the fixed point set in the quotient is nullhomologous. This allows us to fix the sign of Miyazawa's degree invariant. Our construction uses a mod-two index-theoretic correction term, the Arf invariant.
Read the full abstract
Computation and Language
DeepFinance: Can AI Diligence a $100MM Deal?
Existing evaluations of AI models on high-finance work focus on retrieving answers from financial documents and producing numerically correct outputs. Real private equity (PE) and investment banking (IB) work also depends on choosing between conflicting sources, making sound assumptions, and keeping every step auditable. We introduce DeepFinance, an ultra long-horizon benchmark of 21 end-to-end PE and IB tasks that take a human professional an average of 27.1 hours. Each task pairs a request with a data room averaging 19 files and is graded against an average of 84 expert-written rubric criteria covering output, workflow, and judgment. We evaluate 22 model configurations, each in its native agent harness. The best configuration, GPT-6 Astra with max reasoning, satisfies 57.6% of rubric criteria, and the top four configurations are not statistically distinguishable. Frontier models often calculate correctly from the wrong inputs and find decision-relevant evidence without acting on it.
Read the full abstract
Econometrics
Z-Estimation under Unignorably Large Clusters
Cluster-size heterogeneity can invalidate conventional cluster-robust inference when a small number of clusters dominate observation-weighted estimating equations. This paper develops asymptotic theory for cluster-balanced \(Z\)-estimators under independent clusters, arbitrary realised cluster sizes, and unrestricted within-cluster dependence. Building on the size-adjusted reweighting of Chiang, Sasaki & Wang (2025), the analysis distinguishes target definition, identification, and inference. A common cluster-level zero, imposed as an identifying condition or derived from individual-level exogeneity or design-based mechanisms, makes the structural target invariant to deterministic cluster reweighting; separation of the reweighted population moments then ensures identification. The pointwise results establish asymptotic normality while allowing the covariance sequence to vary along the cluster array. The results for functional parameters establish weak convergence and validity of a cluster multiplier bootstrap for uniform inference. The framework covers smooth and non-smooth scores with distribution, quantile, and expectile regressions as concrete applications. Monte Carlo experiments illustrate pointwise and uniform inference under heterogeneous cluster sizes, and a supplementary empirical application illustrates the consequences of cluster weighting in municipal-school data.
Read the full abstract
Number Theory
Diophantine definitions of nonsplitting for central simple algebras over global fields
For every global field and every fixed degree, we prove that the structure constants defining nonsplit central simple algebras form a diophantine set. We formulate a local witness principle separating reliable localization, exact localization, and local detection. Adapted Kummer and Artin–Schreier presentations provide a common construction of witnesses through a uniform radical formula and ramification matching. This gives an independent proof of the non-characteristic case, which also follows from Morrison's nonnorm theorem, and treats the characteristic-degree case by the same method. We recover prime-degree nonnorm definability and give applications to rootless polynomials, anisotropic quadratic forms in all characteristics, and generalized Severi–Brauer varieties.
Read the full abstract
Machine Learning
Prescriptive Learning of Linear Policies with Feasibility Guarantees for Binary Decision-Making
Binary decision-making under uncertainty arises across a wide range of applications, including energy systems scheduling, transportation, and workforce planning. While machine learning has been increasingly applied to accelerate or replace mixed-integer solvers in such settings, existing approaches rely on predictive learning, training models to reproduce optimal decisions from labeled data, which lacks knowledge of counterfactual outcomes and provides no guarantees that the resulting decisions will be feasible. This limitation is further compounded under distributional shift, where policies trained on historical data may produce systematically infeasible decisions. We propose a prescriptive learning framework for binary decision-making that addresses both limitations. Rather than predicting optimal labels, the framework jointly optimizes over linear decision policies and feasible assignments across all training scenarios, allowing feasible alternatives and their operational performance to be considered directly during training. We further extend the framework to a distributionally robust chance-constrained formulation using a Wasserstein ambiguity set, which enforces feasibility with a prescribed probability under the worst-case distribution in the ambiguity set and enables a tunable trade-off between robustness and solution quality. We demonstrate the framework on two case studies, namely a unit commitment problem and a staff allocation problem. Out-of-sample experiments under test distributions that either match or differ from the training distribution show that the robust model is more conservative when the two distributions coincide, while under distributional shift it substantially reduces unmet demand and lowers total cost by up to 76.5% relative to classical predictive learning.
Read the full abstract
Information Retrieval
A Tool for Anonymized Clinical Knowledge Retrieval and Speaker Interaction Analysis of Healthcare Tele-mentoring Sessions
We present a tool for anonymized retrieval of clinical knowledge and analysis of multi-speaker interactions in tele-mentoring sessions of Project ECHO (Extension for Community Healthcare Outcomes). Our tool's novel design includes: (a) a compound metadata filter that enforces strict speaker- and session-level isolation during retrieval, preventing cross-session context contamination; (b) MedGemma-4B as a locally-hosted language model for clinically grounded answer generation across three query modes; (c) interaction graphs to compute betweenness centrality, PageRank influence, and turn-taking patterns to quantify participation equity; and (d) a consistent alias-based anonymization scheme that prevents real participant names from appearing in any rendered output. During the demo, a healthcare provider (user) will interactively query multi-year ECHO sessions, explore participation dynamics through interaction graphs, compare sessions side-by-side, and assess answer quality via six reference-free RAG metrics, all without any cloud API dependency.
Read the full abstract
Statistics Theory
Sequential anomaly identification with sampling constraints for composite hypotheses
We consider the problem of sequential anomaly identification with sampling constraints, where multiple independent data sources are observed over time, but only a limited subset can be sampled at each instant. The objective is to identify the anomalous sources while controlling the probabilities of at least one false alarm and at least one missed detection below prescribed levels. An identification policy must jointly determine when to stop sampling, which sources to declare anomalous, and how to allocate observations across sources under the sampling constraints. We seek policies that minimize the expected time to decision to a first-order asymptotic approximation as the error probabilities vanish. The observations from each source follow an unknown density belonging to one of two disjoint sets, corresponding to regular and anomalous behavior. Focusing on a nonparametric framework, which allows greater flexibility in modeling regular and anomalous statistical behavior, we establish general conditions for asymptotic optimality and provide a unified characterization of asymptotically optimal policies for composite hypothesis testing under sampling constraints. Simulation results illustrate the performance of the proposed policies, and the robustness of the nonparametric framework.
Read the full abstract
Discrete Mathematics
Positivity Proofs for Third-Order Holonomic Sequences via Differences Scaled by Rational Functions
We study the positivity of sequences $f$ that satisfy a third-order holonomic recurrence $f(n+3)= P_2(n) f(n+2) + P_1(n) f(n+1) + P_0(n) f(n)$ whose coefficients $P_0$, $P_1$ and $P_2$ are rational functions in $\R(x)$. We provide a sufficient condition on $P_0$, $P_1$ and $P_2$ for the recurrence to admit a solution all but finitely many terms of which are positive, and whose positivity is robust under small perturbations of the initial values. This sufficient condition is also a necessary condition for a subclass of the recurrences. By developing the proof of this sufficient condition, for another subclass of the recurrences, we show that it is decidable whether all the terms of a given sequence are positive for any initial values outside an exceptional plane. It is common to construct a positivity certificate, which guarantees the positivity of a solution, to show this kind of decidability. In this paper, we construct a new type of positivity certificate via the $S$-scaled difference $f(n+1) - S(n) f(n)$ for a suitable $S \in \R(x)$. This result partially improves the work by Ibrahim and Salvy.
Read the full abstract
Combinatorics
Vertex splitting, global rigidity and nondegenerate equilibrium stresses
We prove Whiteley's conjecture that every nontrivial vertex split of a generically globally rigid graph preserves generic global rigidity in \(\mathbb{R}^d\), for all \(d\geq1\). We give two proofs of the stronger assertion that the split graph is infinitesimally rigid at every generic coincident realisation of the two split vertices. Both proofs use maximum-rank equilibrium stress matrices and then apply the coincident-rigidity criterion of Cruickshank, Jackson and Tanigawa. The second construction also shows that every generically globally rigid graph admits a nondegenerate equilibrium stress of maximum rank at every generic realisation, establishing a conjecture of Jordán and Tanigawa.
Read the full abstract
Dynamical Systems
On the Bendixson criterion for attractors of dynamical systems in metric spaces
We revisit the Bendixson criterion for attractors, originally proposed by R.A. Smith for the finite-dimensional case and subsequently extended by M.Y. Li and J.S. Muldowney to Banach spaces. First, we give a concise proof of the criterion for general dynamical systems (semiflows, mappings, cocycles) in metric spaces using Čech cohomology. This approach allows for a significant weakening of previously known conditions while simultaneously resolving existing misunderstandings. Second, for compact invariant sets of semiflows that are topologically one-dimensional and possess zero first cohomology (e.g., attracting a superset with zero first cohomology), we prove that any chain recurrent point within the invariant set must be an equilibrium. In the proof, we construct a global strict Lyapunov function using Whitney-Bebutov sections. Third, we generalize and refine R.A. Smith's theorem concerning the finiteness of the set of fixed points for analytic mappings, as well as M.L. Cartwright's theorems on to almost periodic flows.
Read the full abstract
Computer Vision
Remembering to Reason: Structured Memory for Scene and Workflow Understanding in Robot-Assisted Surgery
Surgical video understanding is an important foundation for intelligent assistance in robot-assisted surgery. Similar surgical views can reflect different actions or procedural stages. Interpreting these views requires access to earlier observations, yet frame-centric prompting leaves this history unavailable. We introduce MemSurg, a framework that remembers surgical observations before reasoning over them. Its structured memory graph stores timestamped entity categories, locations, motion cues, and interaction summaries. Chronological links preserve recent context, while entity-associated links connect recurring observations across the procedure. Task-adaptive retrieval then supplies evidence-grounded prompts for scene and workflow reasoning, supporting both frozen inference and memory-conditioned supervised fine-tuning. Evaluation on robot-assisted prostatectomy and two complementary surgical benchmarks shows a 10.43-percentage-point gain over SurgRAW with GPT-4o. Memory conditioning adds 6.52 points under matched Qwen3-VL-8B fine-tuning, and an inference-time plug-in adds 7.04 points to EndoChat. These results support structured memory as a reusable source of procedural evidence for surgical video understanding. Our code will be publicly released.
Read the full abstract
Optimization and Control
An Optimal First-Order Active-Hull Method for Convex Composite Hölder Smooth Optimization
We consider the problem (P): ${\min}_{x\in \mathbb{R}^n}\, f(x)+g(x)$ under the Euclidean geometry, where $f$ is convex and $(M,\nu)$-Hölder smooth on $\mathbb{R}^n$, and $g$ is proper, closed and convex on $\mathbb{R}^n$, admits a generalized linear minimization oracle (GLMO), and has bounded domain with diameter $D$. An first-order active-hull (AH) method has access to both the first-order oracle (FO) of $f$ and the GLMO of $g$, and outputs a point that lies in the convex hull of all the past GLMO returns. We propose a new first-order AH method for solving (P), which is based on our newly developed “recentered homotopy smoothing framework”. We show that in the high-dimensional regime, this method achieves the optimal FO and GLMO complexties simultaneously for all $\nu\in[0,1]$.
Read the full abstract
Quantum Physics
Bias-free superconducting microwave nonreciprocity from a passive nonlinear resonator
Routing microwave tones in a nonreciprocal fashion in a superconducting chip usually requires an external bias, commonly in the form of static magnetic fields, pump tones or temporal modulation. Here we demonstrate microwave nonreciprocity in a bias-free, passive platform, a single nonlinear superconducting resonator patterned in one film without Josephson junctions. Unequal coupling with the two feeding ports makes its nonlinear resonance shift direction-dependent, and its sharp Fano lineshape converts this asymmetric response into a large transmission contrast when excited from opposite directions. Our niobium nitride (NbN) device reaches a directional contrast of 53.0 dB at an insertion loss of 4.6 dB, and it exceeds 20 dB over 9.7 MHz. Time-resolved measurements show that the device routes pulses from 2 us to 1 ms with more than 30 dB of contrast and switches within a few microseconds. Made with the same technology as superconducting amplifiers, such bias-free nonreciprocal components could simplify the on-chip routing of strong pump and control tones in quantum processors
Read the full abstract
High Energy Physics (Phenomenology)
Untangling flow-harmonic correlations in OO and Pb–Pb collisions at the LHC using event-shape engineering
Symmetric cumulants $\mathrm{SC}(m,n)$ measure the correlation between the event-by-event fluctuations of the flow harmonics $v_m$ and $v_n$, which, for higher harmonics, is influenced by the nonlinear response to the elliptic ($v_2$) and triangular ($v_3$) flow. Event-shape engineering, which selects events by the reduced flow vector $q_n$, is expected to control this contribution. However, its power is limited by the small forward multiplicity in light-ion collisions. In this work, we study the effect of the $q_2$ and $q_3$ selections on the symmetric cumulants in OO and Pb–Pb collisions at $\sqrt{s_{\rm NN}}=5.36$~TeV using EPOS4 with an ATLAS-like acceptance. Using the law of total covariance, the symmetric cumulant is separated into a selected part, which follows the differences between the $q_n$ classes, and a residual part within them. It is observed that in OO collisions the correlations of $v_2$ with $v_3$ and $v_4$ remain almost entirely within the $q_2$ classes, unlike in Pb–Pb collisions. Nevertheless, events with the smallest $q_2$ in central OO collisions show weaker correlations of $v_2$ with $v_3$ and $v_4$, which is attributed to $v_4$ approaching its linear response. In Pb–Pb collisions, the $q_2$ and $q_3$ selections act separately on the two factors of the nonlinear coupling of $v_5$, which establishes a way to isolate them experimentally.
Read the full abstract
Hardware Architecture
Bit-level Perceptron Prediction for Indirect Branches
Modern software uses indirect branches for various purposes including, but not limited to, virtual method dispatch and implementation of switch statements. Because an indirect branch's target address cannot be determined prior to execution, high-performance processors depend on highly-accurate indirect branch prediction techniques to mitigate control hazards. This paper proposes a new indirect branch prediction scheme that predicts target addresses at the bit level. Using a series of perceptron-based predictors, our predictor predicts individual branch target address bits based on correlations within branch history. Our evaluations show this new branch target predictor is competitive with state-of-the-art branch target predictors at an equivalent hardware budget. For instance, over a set of workloads including SPEC and mobile applications, our predictor achieves a misprediction rate of 0.183 mispredictions per 1000 instructions, compared with 0.193 for the state-of-the-art ITTAGE predictor and 0.29 for a VPC-based indirect predictor.
Read the full abstract
Quantum Physics
One Measurement, Many Fronts in Kitaev and Cluster Chains
A projective measurement of one site in the ground state of a quantum chain disturbs the chain in two ways: learning the outcome shifts distant expectation values at once, through ground-state correlations, and the measurement erases the correlations between the measured site and the rest. Both changes travel outward. We solve this problem exactly for the Kitaev chain, the cluster chain in a transverse field, and the Kitaev chain with power-law couplings, and we find that far from the measured site every quadratic observable responds through a front. Where the front is and how fast it broadens depend only on the quasiparticle dispersion. How strong it is depends on two operators: how strongly the measured one creates the fastest quasiparticles and how strongly the observed one detects them; if either factor vanishes, the front is weaker and decays faster. One measurement therefore launches many fronts, one per observable, with a common position and width but different decay laws. In the Kitaev chain the density and the bond energy, the two terms of its nearest-neighbor Hamiltonian, respond to one density measurement with decay laws that trade places between the topological and the trivial phase; in the cluster chain, measuring a symmetry-odd spin instead of a symmetry-even one changes the critical decay law at a fixed Hamiltonian; and with power-law couplings the width law itself changes. All decay laws and profiles are obtained in closed form.
Read the full abstract
Formal Languages and Automata
Towards A Parametrized Complexity of Determinization
Given a nondeterministic finite automaton (NFA), we want to estimate the difficulty of finding an equivalent deterministic finite automaton (DFA). We demonstrate that computing the state complexity of an NFA within polynomial precision is PSPACE-hard, and furthermore the same holds for the complexity of the subset construction, Brzozowski's algorithm, or, indeed, any determinization algorithm which runs at least as fast. This result implies that making any a priori estimate of the running time of the major determinization algorithms is inherently hard. To circumvent this—in the spirit of parametrized complexity—we try to identify complexity measures which can guarantee efficient determinization. Our main idea rests on linking the complexity of the subset construction to transition monoids using the semigroup complexity. We show that the semigroup complexity by itself can be reasonably approximated for certain classes of NFAs, and then introduce subset complexity—a refinement of the semigroup complexity which has a tighter connection with the subset construction. In certain scenarios, the subset complexity can be approximated in polynomial time, making it potentially viable for more practical applications.
Read the full abstract
Astrophysics of Galaxies
Impact of the large scale environment on the baryonic scaling relations of disc galaxies: Insights from the GASP survey
The Tully–Fisher relation (TFR) and the specific angular momentum–mass relation (SAMR) link the baryonic content of a disc to its kinematics and dynamics. Hence, these scaling relations should bear the imprints of any process removing baryons or altering their kinematics, such as those acting in clusters of galaxies. We test this using the MUSE survey "GAs Stripping Phenomena in galaxies" (GASP), which targets field, group, and cluster members at $z \approx 0.05$ and various stages of ram pressure stripping. For the 81 discs with favourable inclinations, we measure the distribution and kinematics of stars and ionised gas, and their specific angular momenta. Within their scatter, the stellar and baryonic relations show no significant dependence on the large scale environment: the TFRs have slopes $\alpha \approx 3.6$ and $\approx 3.5$ for any kinematic tracer, and the SAMRs have $\alpha \approx 0.65$–$0.75$, as predicted by tidal torque theory. The same holds for the ten S0-S0/as in our sample, consistent with the "faded spiral" formation scenario. Only the gas SAMR shows an environmental signature, with ram pressure stripped galaxies lying $\approx 0.16$~dex below unperturbed ones. This offset is mostly due to their enhanced star formation rate, and thus higher gas mass when inferred through the Schmidt-Kennicutt law, rather than to kinematic perturbations or disc truncation. Our results suggest that, within the area probed by MUSE ($\lesssim6$ disc scale lengths), these discs have preserved the angular momentum acquired at formation not only from cluster processes and pre-processing in filaments, but also from mergers and ejective feedback acting in any environment.
Read the full abstract
Computation and Language
Pole or Vector? Encoders Capture Bangla Compound Verbs, but LLMs Read Them Literally
In Bangla, a main verb is often followed by one of a small set of vector verbs. These verbs lose their own meaning and add a shade of meaning instead, such as completion. For example, likhe phello means that someone finished writing, not that they wrote and threw something. The same two verbs can also describe two separate events, so only the context shows which meaning is meant. This makes compound verbs a hard test of how language models handle multiword expressions. We present BanglaCV-Probe, a benchmark of 17 vector verbs with 1,044 minimal pairs, 204 entailment items and 197 pairs of correct and incorrect combinations, all checked by native speakers. We test 26 models (encoders, LLMs and translation systems) on four skills: telling the two meanings apart internally, understanding what a vector adds, preferring correct combinations and keeping the vector's meaning in translation. Probes on five encoders tell the two meanings apart and still reach up to 93% accuracy when trained on pairs without surface cues. Prompted models rarely use this knowledge. Entailment accuracy stays between 59% and 81%. Several LLMs answer Yes or No to almost every item, and nine of ten models miss that someone who ate up the rice left none. Most instruction-tuned LLMs translate vectors literally in 15-20% of vector sentences and in up to 55% for mora (die). On correct combinations, a small Bangla-only model (88%) matches BLOOM-7B1 (87%) and both beat Qwen2.5-7B (74%). Data and code: https://github.com/ashuvo25/Pole_OR_Vector
Read the full abstract
Computer Vision
Beyond Real or Fake: A Dual-Channel Authenticity and Reasoning Protocol for Photographic Assessment
Forensic verification has converged on a binary "real vs. fake" label that confates fully synthetic, tampered, and AI-retouched images despite their very different consequences. We argue that GenAI manipulations decompose along two complementary channels: a camera channel of sensor fingerprints (destroyed by neural processing), and a semantic channel of scene-level coherence (disrupted by content edits). Each manipulation type leaves a distinctive two-channel signature. We instantiate this taxonomy in 2CAP (2-Channel Authenticity Protocol), pairing a contrastively-trained camera encoder with a frozen semantic encoder to serve two applications on a shared backbone: (i) four-class authenticity classification via cross-attention fusion with learnable reliability weights; and (ii) evidence generation, where an authentic image serves as a reference for a query and the two encoders produce per-channel alignment scores together with a patch-level saliency map. These signals are supplied as privileged context to a frozen Vision-Language Model (VLM) through an Observe-Generate-Refine loop, yielding explanations with localization without forensic fine-tuning. On a multi-source benchmark, 2CAP attains the best classification performance, including strong retouching detection where existing methods fail, and improves explanation quality.
Read the full abstract
High Energy Physics (Theory)
eAdS- embedded AdS, tensionless strings and contracted Carroll-Weyl symmetry
We adapt the Dirac conformal $d+2$ dimensional embedding construction to define a null string in $AdS_{d+1}$. Introducing an extra Stückelberg field $\varphi$, which is a scalar under $AdS$ and shifts under local scaling of embedding space, the model acquires a local scaling invariance. We refer to this string as the embedded anti-De Sitter, $eAdS$, null string. A very useful property of this new gauged formulation is that, unlike previous gauged actions in $AdS$ background, the local scaling symmetry commutes with the $so(d,2)$ symmetry of $AdS$. Interestingly, the $eAdS$ null string is the tensionless limit of a tensile string in embedding space and the same holds for its reduction to an intrinsic description of AdS. We display the symmetries and constraint algebras both in embedding space and directly in AdS.
Read the full abstract
Computation and Language
SCorPion: A Strategic, Controllable and Personified Conversational Companion
Fixed prompt-based language models face challenges in open-domain conversations, where versatile topics require different expert advice or demonstrations to maximize their universal performance. Motivated by the dynamic prompt studies in language generation, we extract different chatting strategies from varied forms of text corpus, which steer the language model to different styles based on human principles. We design and deploy a conversational companion called SCorPion, which uses GraphRAG to extract and summarize the knowledge graph globally, yield community-summarized strategies, and produce query-focused optimal strategies. SCorPion has strategic thinking, yields personified and stylized responses, and can be controlled by explicit factors. Code and further results can be found in https://bachozean.github.io/scorpion-page/.
Read the full abstract
Mesoscale and Nanoscale Physics
2D coherent spectroscopy of topological insulators
Multidimensional coherent spectroscopy probes the response of a system to a sequence of time-separated light pulses, and has attracted significant interest in recent years. In the frequency space, it generates multidimensional spectra, in which information about different degrees of freedom of the system is generically disentangled. In this work, we develop a quantum geometric formulation of multidimensional optical susceptibilities in insulating systems. Focusing on a two-pulse setup and working in the velocity gauge, we derive analytical expressions for second-order and third-order two-dimensional coherent spectra (2DCS). We focus on the third-order ABB response, which remains finite in centrosymmetric systems where the second-order susceptibility vanishes by inversion symmetry. Its paramagnetic contribution supports an echo signal that probes products of four interband Berry-connection matrix elements, which reduce in two-band systems to bilinear combinations of the quantum geometric tensor of the occupied band. Using continuum and square-lattice models of two-dimensional Chern insulators, we show how the echo resolves the momentum-space sign structure of these geometric quantities. For the $xxyx$ response of the models considered, the number of nodes in the echo signal is related to the band topology. Our results extend the quantum-geometric interpretation of multidimensional spectroscopy to higher-order responses, showing that third-order 2DCS provides access to geometric structures beyond those probed at lower orders.
Read the full abstract
Soft Condensed Matter
Non-reciprocal Rouse chain model
We study the center-of-mass mean-squared displacement (MSD) of a free non-reciprocal Rouse chain. Three stochastic models are considered: an overdamped linear chain, an underdamped linear chain, and an underdamped nonlinear chain with finite natural bond length that fully takes into account the elastic interactions. For the overdamped model, an exact transient expression for the center-of-mass MSD is obtained from the associated Ornstein–Uhlenbeck process. We show that non-reciprocity enhances the effective diffusion with respect to the classic Rouse model, and that it separates the translational right and left zero modes, so the arithmetic center of mass is not, in general, the dynamically decoupled translational coordinate. It is found that the normalized left zero mode gives a closed expression for the effective diffusivity in terms of the non-reciprocal parameter and the number of beads ($N$) which still scales as $N^{-1}$. Interestingly, the same long-time diffusivity coefficient is found for both, the underdamped linear model and for the less studied finite-natural-length nonlinear model. It is concluded that inertia and finite bond length, modify the transient dynamics of the system, while non-reciprocity determines the long-time diffusion coefficient.