Deep-Tech Digest // 2026-08-13 · IST

Thursday, 13 August 2026

342 new items across 8 fields — pulled from arXiv & Hacker News, deduped against everything served before. Each card gives you the problem, how it works, and what’s new in plain words — read that first; open Go deeper only when a card earns it.

49AI & Machine Learning
50Robotics
36Semiconductors & Devices
50Physics
45Biology
50Chemistry & Materials
2Quanta — Explained
60What's Trending
AI

AI & Machine Learning

49 new
arXiv · cs.CVBuildable★ flagship

AdvFD: Boosting Visual Generation via Adversarial Fr'echet Distance Loss

Teaching an image generator by scoring how close its whole output distribution sits to reality.

Modern image and video generators are often given a final polish by pushing the *distribution* of their outputs — the overall statistical spread of everything they make — to match the distribution of real images, rather than fixing one picture at a time. A popular yardstick for that gap is the Fréchet distance, which compares real and fake images inside a fixed 'feature space' (a pretrained network's compressed summary of what an image looks like). The problem is 'Fréchet hacking': the model learns to please that one fixed yardstick while actual visual quality stalls or gets worse, because a static viewpoint only sees part of the difference between real and fake. This paper's fix, AdvFD, adds a second yardstick that *learns and adapts* — an adversarial component that keeps hunting for whichever differences the fixed view is missing. By combining a stable static target with a moving, calibrated one, it closes the loopholes and pushes genuine quality up.

Technical view

AdvFD augments the standard FD-Loss (Fréchet distance computed in a static pretrained feature space) with an adversarially learned representation, turning the fixed distribution-matching objective into one with an adaptive, calibrated component that resists Fréchet hacking. The static features provide a stable target while the learnable adversarial branch continually surfaces distributional discrepancies the frozen space cannot capture, preventing the degenerate 'metric-improves-quality-stagnates' regime. Practitioners doing generator post-training on diffusion or flow-matching models could swap in AdvFD as a drop-in distribution-level loss term, calibrating the adversarial head so it complements rather than destabilizes the static FD objective. The claimed payoff is improved cross-feature-space Fréchet alignment and visual fidelity over static-only FD losses.

arXiv · cs.CVBuildable★ flagship

Capturing Uncertainty in Human Motion for Representation Learning in Soccer

Teaching a machine to read soccer players' bodies by predicting their many possible next moves.

This work learns to understand how soccer players move by studying their 3D 'skeletons' — stick-figure representations of body joints tracked over time. The training trick is self-supervised: instead of hand-labeling anything, the system learns by trying to predict a player's future motion from their current pose, so it teaches itself what natural movement looks like. Crucially, the future isn't fixed — a player might cut left, sprint straight, or plant to shoot — so the model is built to output a *spread* of plausible futures rather than one guess, learning this multimodality directly from real trajectories. Getting good at anticipating those branching possibilities forces it to internalize the real dynamics of how bodies move in the game. The payoff: the internal representations it builds transfer well to other soccer analytics tasks, even ones it wasn't trained for.

Technical view

The framework does self-supervised 3D skeleton representation learning with future motion prediction as the pretext task, and adds a conditioning module that models a probabilistic distribution over discretized future motions in 3D Euclidean space, supervised explicitly by observed future trajectories to capture multimodality. Modeling multiple plausible futures — rather than regressing a single deterministic path — is what yields both stronger prediction accuracy and more transferable embeddings on large-scale player-tracking data. The learned representations transfer across multiple downstream soccer applications, evidencing cross-task generalization. A practitioner could adopt the discretized-future distributional head as a drop-in objective for skeleton encoders in other tracking-rich sports domains, using trajectory supervision to learn the multimodal prior.

arXiv · cs.CVBuildable

VidForensics-M1: Meta-Detection Reinforcement Learning with Verifiable Temporal Grounding for AI-Generated Video Forensics

Teaching an AI to catch deepfake videos by making it show its evidence, not just guess.

AI-generated videos are now realistic enough to fool people, which fuels misinformation. Current detector AIs are trained mostly to spit out a yes/no 'fake or real' label, so they don't generalize well to new, unseen video generators. This paper trains a detector using 'meta-detection': the AI is rewarded not just for the right answer but for pointing to specific evidence (like a description of a visual glitch) and for pinpointing exactly when in the video the fake artifact happens, verified automatically. The idea is that forcing the AI to justify its answer with checkable evidence makes it more reliable and better at spotting brand-new kinds of fakes.

Technical view

The method applies reinforcement learning to multimodal LLM-based forgery detectors, jointly optimizing the predicted label and supporting evidence (textual rationale plus temporal grounding) rather than relying on label-only supervised fine-tuning or label-level RL. It introduces mechanisms to generate and verify temporal grounding signals so that rationales are checked against actual artifact locations in the video, giving a verifiable reward signal beyond coarse binary supervision. This is claimed to be the first application of meta-detection to AI-generated video forensics, targeting improved generalization to unseen generative models. Practitioners could adopt the verifiable-evidence RL reward scheme to harden existing MLLM detectors against distribution shift from new generators.

arXiv · cs.CLBuildable

ConVAWG: A Retrieval-Grounded Framework for Controlled Synthetic Dialogue Generation in Violence Against Women and Girls

A system builds realistic but fake chat logs of abuse to help study it without exposing real victims.

Studying violence against women and girls (VAWG) is hard because real chat logs of abuse are sensitive, legally protected, and difficult to collect or share. This project builds ConVAWG, a tool that generates synthetic, multi-turn chat conversations depicting these abuse dynamics — like coercion, stalking, or isolation — grounded in real case-work guidelines (CPS-aligned, meaning consistent with child/social protective services standards) and retrieved reference material rather than made up from nothing. Unlike past work that just labels individual toxic messages, this approach models abuse as something that unfolds relationally over time across a whole conversation. The goal is to give researchers safe, realistic data to build better detection or support tools without ever touching real victims' private information.

Technical view

ConVAWG is a retrieval-grounded generation framework producing synthetic multi-turn dialogues that model VAWG as a temporally unfolding relational phenomenon rather than isolated toxic utterances, addressing a gap where prior work focused on sentence-level online toxicity. Generation is grounded via retrieval against reference material aligned to CPS (child/protective services) case standards, presumably to keep scenarios realistic and typologically valid across online and offline abuse behaviors (threats, surveillance, isolation, stalking, physical violence). This provides a privacy-safe substitute dataset for training or evaluating models on abuse-pattern recognition across a dialogue's arc. Researchers could use the framework to construct benchmarks or fine-tuning data for conversational risk-detection systems in sensitive domains where real data release is legally constrained.

arXiv · cs.LGConceptual

Beyond a Bag of Features: Set-Level Instability in Sparse Autoencoders

Do an AI's internal 'concept' features actually match human categories? Turns out, not really.

Large language models build internal representations of words and ideas, and past research showed these representations roughly match how humans group things into categories (like 'birds' vs 'furniture'), though not the finer details of what's a 'typical' example. This paper looks at a specific tool called sparse autoencoders (SAEs), which try to break a model's internal activity into individual, human-interpretable 'concept' features, and asks whether comparing which features turn on for different words is a better way to measure similarity than the usual method (comparing raw number vectors). They test this on toy examples and real text, and then repeat the original human-category experiment using this new SAE-based similarity measure. The finding is a bit deflating: this supposedly more interpretable measure doesn't line up with human categories any better than the old methods — it mostly just reflects the model's own internal quirks rather than human-like understanding.

Technical view

The authors substitute cosine similarity over dense embeddings with overlap of active SAE latent sets as the similarity metric in the Shani et al. (2026) human-category-boundary analysis, first validating that SAE set-overlap meaningfully captures union-like compositional structure in controlled toy models and yields coherent neighborhoods on natural text. When applied to the human-concept task, SAE activation-set similarity fails to recover human category boundaries or typicality gradients any more faithfully than dense embeddings or residual-stream states, instead tracking model-internal (not human-aligned) similarity structure. This is evidence against a common assumption that SAE features, being sparser and more 'interpretable' individually, compose into better set-level semantic similarity measures. Practitioners evaluating SAEs for interpretability or alignment work should be cautious about assuming feature-set overlap is a proxy for human-meaningful similarity without separately validating it, as this paper does.

arXiv · cs.AIConceptual

Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration

An AI helped mathematicians squeeze a decades-old unsolved constant closer to its true value.

The Grothendieck constant is a famous unsolved number in math that measures the gap between an easy-to-compute version of certain optimization problems and their harder, 'real' version — its exact value is still unknown after decades of research. In this paper, researchers describe how they used an AI research system as a genuine collaborator to push the best-known upper and lower bounds on this constant closer together, with the AI producing insights that expert mathematicians judged to be genuinely novel. Rather than just reporting the improved bounds, the paper is really a detailed reflection on how to work with AI on hard math: what it's good at, where it struggles, and what conditions (like how you set up the problem or guide its exploration) helped it produce real breakthroughs instead of noise. It's meant as a practical guide for other researchers trying to use AI as a serious research partner rather than just a calculator.

Technical view

The paper reports tightening the known bounds on the Grothendieck constant to 6π/11 ≤ K_G ≤ π/(2·log(1+√2)) − 10⁻⁴, achieved with substantial contribution from an AI research system whose insights were independently judged novel by domain mathematicians. Rather than presenting a self-contained proof paper, it's structured as a case study documenting the workflow, prompting/scaffolding choices, and problem framing ('ideal conditions') that enabled the AI to surface non-trivial mathematical ideas, alongside a candid account of its failure modes and limitations. This is useful primarily as a methodological reference for researchers designing human-AI collaboration workflows on open problems in extremal combinatorics/functional analysis rather than as a standalone theorem. Readers wanting to replicate the mathematical result would need to consult the referenced technical bound derivation; this paper focuses on the collaboration process itself.

arXiv · cs.CVBuildable

Test-Time Self-Evolving GUI Visual Grounding via Reflection-Guided On-Policy Self-Distillation

A GUI-clicking AI teaches itself to point at the right buttons on apps it's never seen before.

GUI agents are AIs that operate computer interfaces by looking at a screen and figuring out where to click for a given instruction — a skill called visual grounding. The problem is that once deployed, these models are frozen and can't adapt when they hit an unfamiliar app layout. This paper builds a system that keeps learning after deployment: the agent tries clicking on new interfaces, a separate AI 'reflector' judges whether the click made sense and explains why it succeeded or failed, and that feedback is then baked back into the model's own weights so it genuinely gets better over time — all without needing a human to label the correct answers. It's essentially teaching the AI to learn from its own mistakes on the fly, the way a person figures out an unfamiliar app through trial, error, and reflection.

Technical view

The framework runs a closed loop of Exploration (predict grounding coordinates on unseen GUIs), Evaluation/Reflection (an MLLM-based Reflector critiques the predictions and generates reasoning-based feedback), and Internalization (distilling that reflection signal back into model parameters via on-policy self-distillation), enabling test-time adaptation without human-annotated ground truth. This extends prior test-time RL approaches for GUI grounding, which lack any mechanism to learn from failed exploration trajectories — here failures generate reflective training signal rather than being discarded. The self-distillation step suggests the model is trained on its own reflection-corrected outputs in an on-policy manner, avoiding a separate frozen teacher. Practitioners building GUI agents facing novel or long-tail interfaces could adopt this reflect-then-distill loop to get continual post-deployment improvement without a labeling pipeline.

arXiv · cs.CCConceptual

How to Verify Consistency of Probabilistic Claims

A math proof-checking trick lets you verify an AI's probability estimates are self-consistent, fast.

Imagine an AI that can answer tons of 'what's the probability of X given Y' questions — for AI safety, we'd want to know its answers are at least internally consistent (not contradicting each other) even if we can't check they're 'true'. This paper asks whether that consistency can be checked quickly, and shows yes: using ideas from theoretical computer science (specifically, interactive proof systems, where a prover convinces a fast checker without revealing everything), a lightweight verifier can spot-check just a few outputs of the AI's probability-predicting circuit, aided by a special 'proof' supplied alongside, and be convinced the huge number of implied probability claims are approximately consistent. The real point is a safety idea: if we can efficiently verify an AI is being honest and coherent about probabilities of bad outcomes, that's a building block for trusting its self-reported risk assessments.

Technical view

The authors model a probabilistic predictor as a pair of circuits (P for predictions, Q for confidence) that implicitly define exponentially many conditional-probability claims, and construct an interactive proof (interactive PCP-style) protocol in which a polynomial-time verifier, given (P,Q) and access to a proof oracle encoding an alleged consistent witnessing distribution, can verify approximate consistency by querying only a small number of points. This gives a tractable soundness/completeness guarantee for consistency-checking exponentially large claim sets without exhaustive enumeration, framed explicitly as infrastructure for AI safety (verifying an AI's stated probabilities of unwanted outcomes are self-coherent). It builds on PCP/interactive-proof theory applied to ML circuits rather than classical arithmetic circuits. Researchers in AI safety or formal verification could use this protocol as a template for building efficient consistency audits of black-box probabilistic model outputs.

arXiv · quant-phConceptual

A Quantum Roadmap for Softmax Attention: Exact Born-Rule Analogs for Softmax Attention on the Probability Simplex

Turns out the math behind AI attention mechanisms lines up exactly with quantum measurement rules.

Transformers, the architecture behind most modern AI, rely on 'attention,' a mechanism that decides how much each piece of input should influence the output, often producing probabilities that must sum to one. This paper shows that in that probability-summing case, the attention math has an exact mirror in quantum physics: the same equations that describe measuring a quantum particle's state (the 'Born rule') can reproduce softmax attention's scoring, its temperature setting (how sharp or spread-out the focus is), and even the sparse, all-or-nothing version of attention, term for term. It's less an engineering advance and more a discovery of a deep mathematical correspondence — that a core piece of AI can, in principle, be run as an actual quantum computation using quantum measurement circuits instead of classical arithmetic. This matters for people exploring whether quantum computers could someday run AI models natively rather than just simulating them.

Technical view

The paper establishes an exact bijection between softmax attention (restricted to the probability-simplex-constrained setting) and Born-rule quantum measurement: attention scores emerge as Hadamard-test statistics on block-encoded projections of amplitude-encoded inputs, softmax itself is the interior of a cosine-squared distribution family from Born-rule measurement, and its boundary (exact zeros) recovers sparse attention. Temperature is realized as a repetition/post-selection count implementing discretized inverse temperature, and value aggregation is shown to be a deterministic column-loading channel dilating the column-stochastic value matrix. This gives a component-by-component quantum circuit construction for a nontrivial subclass of attention, providing a concrete target for quantum hardware/simulator implementations of transformer sub-modules. Quantum ML researchers could use this as a blueprint for native (non-simulated) quantum attention layers, particularly in simplex-constrained output settings.

arXiv · cs.CLConceptual

From Interpretability to Control: Insights from Six Years of the TrustNLP Workshop

Six years of AI-safety research papers reveal the field pivoting from explaining models to controlling them.

TrustNLP is a workshop where researchers publish work on making language models trustworthy — safe, honest, unbiased, and so on — and it's been running since 2021, growing from just 8 papers to 41 per year. This paper reads through all 144 papers ever published there and sorts them into six categories of 'trust' (like truthfulness, safety, fairness), tracking how the field's priorities shifted over time. They find that the field's whole focus changed after the release of the first popular chatbot-style models: attention on trustworthiness spiked across every category at once, and afterward, later models pushed the emphasis specifically toward 'is this AI telling the truth' and safety-alignment concerns, with truthfulness ballooning from essentially nothing in 2021-2022 to 37% of papers by 2025-2026. It's essentially a field-level retrospective showing how AI safety research has moved from just explaining what a model is doing after the fact toward actively controlling how it behaves.

Technical view

The authors perform a systematic literature review of all 144 papers from six years of the TrustNLP workshop (2021–2026), classifying them along six trust dimensions derived from established taxonomies (TrustLLM, DecodingTrust), and correlate publication trends with capability-emergence events. Key finding: release of the first high-impact chat models produced simultaneous activation across all six trust dimensions, after which subsequent model generations progressively concentrated research on truthfulness and safety alignment specifically, with truthfulness growing from absent (2021-2022) to 37% of papers (2025-2026). The paper frames this as documenting a field-wide methodological shift from post-hoc interpretability of static models to mechanistic understanding and proactive control of generative systems. This serves as a citable trend map/taxonomy for researchers positioning new trustworthy-NLP work or writing related-work sections, and as an early-warning signal for which trust dimensions are under- vs over-studied.

arXiv · cs.CVBuildable

MultiModal Code-Switching: Interleaving Visual Objects into Language for Explicit Object-Level Alignment

Teaching AI to point at objects, not just describe whole pictures.

Multimodal AI models (ones that handle both images and text) usually learn by matching a whole picture to a whole caption, which makes it hard for the model to know exactly which word refers to which object in the scene. This paper borrows the idea of 'code-switching' — how bilingual speakers swap words from one language into a sentence in another — and applies it visually, literally swapping in a cutout of an object wherever its name would appear in a sentence. This forces the model to link specific objects to specific words instead of vaguely matching the whole image to the whole caption. The team also built a large automated pipeline to generate this kind of training data at scale, aiming to make models learn faster and understand scenes more precisely.

Technical view

MMCS reframes vision-language pretraining as object-level grounding by interleaving image-text sequences: textual entity mentions are replaced inline with cropped visual object tokens, creating explicit token-level correspondence rather than relying on global CLIP-style image-caption alignment. This directly targets referential ambiguity — the failure mode where a model can't disambiguate which of several objects in an image a given noun phrase refers to. They pair this with a scalable synthetic data pipeline (773K+ examples implied by the truncated abstract) to generate interleaved object-text sequences automatically. A practitioner could apply this as a pretraining objective augmentation for MLLMs, especially for tasks needing fine-grained grounding like referring expression comprehension or dense captioning.

arXiv · cs.LGBuildable

Hierarchical Empirical-Bayes Naive Bayes: Minimax Smoothing and Calibration with AODE Extension

A smarter way to guess probabilities from sparse data, without a one-size-fits-all fudge factor.

Naive Bayes is a simple, popular way to classify data (like spam vs. not-spam) by estimating probabilities for each feature. The catch is that when some categories are rare in your data, you need to 'smooth' those probability estimates so the model doesn't overreact to small samples — but the standard smoothing tricks use a fixed amount of smoothing no matter how much data you actually have or how many categories there are, which can leave built-in bias on modern datasets with many possible categories. This paper proposes a method that learns the right amount of smoothing directly from the data itself, adapting to each situation instead of using a fixed rule, and extends it to a related, more powerful classifier. The payoff is more accurate probability estimates with the same simplicity and speed Naive Bayes is known for.

Technical view

HEB-NB replaces fixed-strength smoothing rules (Laplace, Lidstone, Krichevsky-Trofimov, m-estimate) with a Dirichlet prior per class-feature conditional whose concentration parameter is estimated via Type-II maximum likelihood (empirical Bayes), allowing the smoothing strength to adapt to feature cardinality, sample size, and class imbalance while preserving closed-form posterior inference. The method extends to Average One-Dependence Estimators (AODE), showing the adaptive smoothing generalizes beyond the naive conditional-independence structure. The authors provide a non-asymptotic ℓ1 error bound, giving theoretical grounding (likely minimax-type guarantees) for why this smoothing improves calibration over fixed-rule baselines on high-cardinality tabular data — useful as a drop-in replacement wherever NB/AODE is deployed on categorical features.

arXiv · stat.MLConceptual

Conditional Independence Tests for Constraint-Based Causal Discovery: A Survey

A guided tour of the statistical tests that let algorithms discover cause-and-effect from data.

When scientists want to figure out cause-and-effect relationships from observational data (not controlled experiments), one common family of methods works by repeatedly asking 'are these two variables independent once I account for these other variables?' — these are called conditional independence tests, and they're the engine behind popular causal-discovery algorithms. This survey rounds up the many flavors of such tests — ones based on correlation, tables of counts, regression, nearest-neighbor comparisons, kernel methods, and machine learning — and explains the assumptions each relies on and where they break down, especially with messy real-world data like the mixed numeric-and-categorical variables common in medicine. It's essentially a map for researchers trying to pick the right statistical tool for uncovering causal structure without being misled by an unreliable one.

Technical view

The survey systematizes CI testing for constraint-based causal discovery (PC, FCI algorithms) into six methodological families — partial-correlation, contingency-table, regression-based, nearest-neighbor, kernel, and ML-based — and evaluates each against assumptions about the data-generating distribution, robustness to violations, and scalability to high-dimensional, mixed-type (continuous/categorical) data typical in biomedical applications. Key practical concerns highlighted include power decay as conditioning-set size grows (a well-known bottleneck for PC/FCI at higher graph connectivity) and asymmetric error behavior between false conclusions of dependence vs. independence, which propagate differently through skeleton pruning and edge orientation. This is a reference for practitioners choosing or building CI tests for causal discovery pipelines in high-dimensional, real-world (non-Gaussian, mixed-type) settings.

arXiv · cs.LGRunnable

DACRI: Decision-Aware Causal Intervention Ranking for Critical Supply Chains

Not just spotting a supply-chain crisis, but picking the fix that actually saves the most money.

When a supply chain breaks — say a key chip factory shuts down — the hard part isn't just noticing the disruption, it's figuring out which response (rerouting, stockpiling, expediting shipments) actually recovers the most value, and that's a much harder decision problem. This paper builds a synthetic but realistic testbed with known cause-and-effect relationships baked in, so researchers can score different decision strategies against a ground truth of what would have happened under each choice. They test a machine-learning ranking method (LambdaMART, normally used for search-engine result ranking) against simpler fixed-rule strategies, finding the fancy model wins for things like semiconductors and rare materials, but for digital infrastructure a simple 'keep a steady buffer' rule actually does better — a useful reminder that more sophisticated models aren't always the right call.

Technical view

CriticalSCM-Bench v1 is a synthetic benchmark with causal ground truth and paired factual/counterfactual rollouts, enabling direct evaluation of intervention-selection policies against a net-value objective rather than mere disruption detection. LambdaMART (a learning-to-rank gradient-boosted model) is evaluated as a policy for ranking candidate interventions, improving median normalized net value by 5.7–16.2% over a full-information static baseline on semiconductor and critical-material supply-chain archetypes, with statistical significance, but underperforming a domain-informed constant-buffer heuristic on digital infrastructure. Under partial-information and delayed-response settings, LambdaMART retains 33–75% of full-clamp (full-information) value, and the benchmark includes stress tests varying intervention fidelity, timing, cost, and held-out disruption types — useful for anyone building or benchmarking decision-policy models for operational risk domains.

arXiv · cs.DCBuildable

Scheduling Mixed RL Rollouts Beyond Prefix Locality

Traffic-controlling AI training jobs so different learning styles don't clog the same memory lane.

When companies train large language models using reinforcement learning (a technique where the model learns by trial, feedback, and reward), they now often run several different flavors of that training at once — some based on verifiable right/wrong answers, some based on human preference feedback, some for multi-step agent tasks. These different jobs all compete for the same expensive computer memory (a 'cache' that stores partial results to avoid redoing work), and because their patterns of memory use are so different, mixing them badly wastes resources or breaks the intended balance between them. This paper introduces a scheduling system that intelligently decides which training 'sessions' get admitted to run at any moment, aiming to use the shared memory efficiently without messing up the mix of training types the trainer actually wants.

Technical view

MISA-T is a routing-layer admission-control policy for serving mixed RL rollout workloads (RLVR, RLHF, agentic) on a shared asynchronous inference service, addressing a gap left by prefix-aware routing: existing cache-reuse-optimized routing doesn't account for how heterogeneous session types compete for KV-cache capacity given their differing sequence lengths, interaction patterns, and cache-residency times. It combines adaptive session admission control to manage this contention while preserving the trainer-specified workload mixture ratios across domains/paradigms — i.e., avoiding distortion of the intended sampling distribution due to differential cache pressure. This targets infrastructure engineers building or scaling RL post-training pipelines that mix reward paradigms on shared inference clusters, where naive routing can silently skew which rollout types actually complete.

arXiv · cs.CVBuildable

CausalSplat: Towards Comprehensive Hierarchical Reasoning in 3D Gaussian Splatting

Getting 3D scene-scanning AI to understand 'the mug I'd grab if thirsty,' not just 'the mug.'

3D Gaussian Splatting is a technique for building photorealistic 3D scenes from photos, and researchers have taught it to recognize objects by name (like 'find the chair'). But real requests are often implicit — like 'what would I use to reach that high shelf' — requiring common sense, spatial reasoning, and imagining hypothetical situations, which current systems handle poorly. This paper creates two new test sets specifically designed to probe that kind of reasoning, shows that today's best methods struggle with them, and proposes a new system that combines a vision-language model (which understands both images and instructions) with a 3D 'scene graph' (a structured map of how objects relate to each other in space) to separate basic object recognition from the harder logical reasoning on top of it.

Technical view

CausalSplat addresses reasoning-based 3D Gaussian segmentation — going beyond explicit open-vocabulary queries to handle implicit intent, spatial constraints, and counterfactual/commonsense reasoning in embodied 3DGS scenes. The authors introduce two benchmarks, Causal-LERF and Causal-ScanNet, spanning commonsense, spatial, affordance, and counterfactual reasoning categories, on which they show SOTA 3DGS methods perform poorly. Their proposed architecture disentangles explicit structural/geometric perception (via 3D scene graphs) from implicit logical inference (via VLM reasoning), reporting SOTA results on the new benchmarks — relevant for embodied AI/robotics researchers needing scene understanding that goes beyond literal object-name matching.

arXiv · cs.CVBuildable

PRMU: A Corpus-Free Benchmark for Person-Centric Knowledge Unlearning in Multimodal Large Language Models

Testing whether AI can truly forget a person — without needing the data used to teach it.

AI models that understand both text and images can end up memorizing detailed facts about real people, which raises privacy concerns when someone asks to have their information removed. The tricky part is that most 'unlearning' methods to erase this knowledge assume you still have the exact original training data to work from — but in real deletion requests, that data usually isn't available anymore. This paper builds a benchmark to test unlearning without needing that original data, using varied text and image prompts (including tricky adversarial ones) to check both whether the target person's info is really gone and whether unrelated knowledge about other people stays intact. They also introduce an editing technique to actually perform this kind of targeted, surgical forgetting.

Technical view

PRMU is a corpus-free benchmark for evaluating person-centric knowledge unlearning in MLLMs — i.e., unlearning methods that don't assume access to the original forget/retain training corpora, matching realistic deletion-request scenarios (e.g., GDPR-style requests) where such data is unavailable. It evaluates naturally-acquired (not synthetically inserted) person knowledge using diverse textual and visual probes, adversarial evaluation, and fine-grained locality analysis (checking that unrelated knowledge isn't collaterally damaged). The paper also proposes Similarity-Gated Projection Editing (name truncated in abstract) as a corpus-free unlearning method, giving practitioners both a benchmark and a candidate technique for auditing or implementing privacy-compliant unlearning in deployed MLLMs.

arXiv · cs.CLConceptual

The Illusion of Cross-Lingual Safety in Low-Resource Languages

AI safety training in English barely protects speakers of African languages from harmful prompts.

Big language models are trained to refuse harmful requests, but that training happens mostly in English, and this paper checks whether those safety habits actually carry over to other languages — specifically Twi, Hausa, Amharic, and Swahili. The researchers built a dataset that pairs word-for-word translated harmful prompts with versions rewritten to fit local culture, then looked not just at whether the model's final answer refused the request, but at the model's internal 'thought patterns' (hidden numerical representations) to see if a genuine refusal signal was present. They found the safety signal mostly doesn't transfer — under 10% of the English-level refusal strength survives in most of these languages — even though the translated and localized versions of prompts are numerically very similar in meaning at first, suggesting the model's understanding of them diverges as it processes deeper into the network.

Technical view

The paper introduces LoDNA, a safety evaluation dataset for four African languages (Twi, Hausa, Amharic, Swahili) with paired literal-translation and culturally-localized harmful prompts, and a latent geometric probing framework that measures 'refusal representations' in hidden states rather than relying solely on surface-level generation outputs. Findings show severe failure of cross-lingual safety transfer: harmful prompts retain less than 10% of the English refusal signal across most language-model pairs tested, despite literal and localized prompt pairs being highly semantically aligned at the embedding level (cosine similarity 0.95–0.996), with representational drift emerging across transformer layers. This suggests refusal behavior is encoded in a way that's brittle to language shift even when semantic content is preserved, offering both a diagnostic methodology (hidden-state probing) and a benchmark for auditing multilingual safety alignment beyond generation-based metrics.

arXiv · cs.LGBuildable

A Recommendation System Approach for Interference-Robust Sensor Subset Selection

Like Netflix picks your next show, this picks which cameras should watch a moving car.

Tracking a moving vehicle with a network of sensors is expensive if every camera has to run constantly, so systems try to guess in advance which small subset of cameras will give the best view. Earlier work used cheap microphones' signal-strength readings to make that guess, but background noise easily throws those readings off. This paper instead extracts richer frequency-band sound features and feeds them into a 'two-tower' neural network, the same architecture recommendation engines use to match users with products, to score which sensor combinations will track best. In outdoor tests on real vehicles, this boosted tracking accuracy by about 20% over the old noise-sensitive method while staying fast enough to run in real time.

Technical view

The system reframes sensor-subset selection as a recommendation problem, replacing RSSI-based scoring with frequency-band acoustic features that are more robust to interference, fed through a Two-Tower MLP that embeds sensor context and candidate subsets separately and scores their compatibility. Outdoor vehicle-tracking deployments show ~20% accuracy gains over the RSSI baseline while preserving the low latency/compute footprint needed for real-time selective activation of expensive sensors like cameras. A practitioner could adapt the two-tower embedding approach to other cheap-proxy/expensive-modality selection problems beyond acoustic-visual sensor fusion.

arXiv · cs.CVBuildable

SAR2Agri: Learning SAR Intensity Representations for Agricultural Monitoring

Teaching AI to read radar satellite images of farms, through clouds, rain, or pitch dark.

Satellites that use radar (called SAR) can photograph farmland day or night and through clouds, unlike regular cameras, which makes them valuable for tracking crops over a growing season. Most existing general-purpose 'foundation' AI models learn to interpret this radar data indirectly, by pairing it with easier-to-understand optical photos, or focus on unrelated tasks like flood mapping rather than farming. SAR2Agri instead tries to build representations learned directly from the radar signal itself, aimed specifically at agricultural questions like what crop is growing where, how much it will yield, and when key growth stages happen. The goal is a model tuned to farming's seasonal rhythms rather than a generic vision model repurposed for it.

Technical view

SAR2Agri pursues SAR-specific representation learning for agriculture, positioned against cross-modal foundation models (TerraMind, CopernicusFM) that ground SAR in optical imagery via contrastive learning, and against generic SAR pretext-task models (SAR-JEPA, SARMAE, SAR-W-MixMAE) tuned for detection/flood/land-cover tasks rather than phenology. It targets crop type mapping, yield prediction, and phenological event detection, apparently drawing on phenology-inspired temporal pretext tasks previously shown effective with optical imagery. The abstract cuts off before detailing the exact pretraining objective, so the specific mechanism remains unconfirmed.

arXiv · stat.MEConceptual

Goodness-of-Fit Tests and Calibration Machine-Learning Algorithms for Logistic Regression with Sparse Data

Stress-testing the statistical checkups that risk-prediction models rely on, to see which ones lie.

Logistic regression is the workhorse model behind many risk predictions, like a patient's chance of disease, and before trusting it you're supposed to run a 'goodness-of-fit' test to check the predictions actually match reality. The problem is that with continuous inputs like age or weight, the data becomes 'sparse,' meaning there aren't enough repeated exact values, and this breaks the math behind classic tests like chi-square, so they can falsely say a bad model fits fine. This thesis systematically compares roughly 30 different fit-checking methods, from decades-old classics to modern machine-learning-based calibration checks, to find out which ones still give trustworthy answers when the data is sparse.

Technical view

A simulation-based comparison of ~30 goodness-of-fit and calibration procedures for binary logistic regression under grouped versus sparse continuous-covariate data, spanning chi-square and Hosmer-Lemeshow variants, standardized Pearson statistics, covariate-space partitioning, smoothing-based tests, and modern ML calibration/bootstrap methods. At matched test size, methods like the GiViTI calibration test, McCullagh's test, and Osius-Rojek emerge as strong performers, giving practitioners an evidence-based shortlist for validating logistic models with continuous predictors, e.g. in clinical risk scoring.

arXiv · cs.CLBuildable

Attention-Path Fragility as an Uncertainty Signal in Large Language Models

Catches an AI's confidently wrong answers by seeing if its reasoning wobbles when you jostle it.

Language models sometimes sound very sure of a wrong answer, and typical ways of measuring 'how confident is this model' just look at how spread out its guesses are, which misses these cases. This paper's idea is that real uncertainty also shows up in fragility: if you slightly disable parts of the model's internal attention (the mechanism it uses to route information between words) and its answer changes meaning, that prediction was shakier than it looked. They measure this by comparing many such 'jostled' versions of the model and checking how much they actually disagree in meaning, ignoring cases where they just phrase the same answer differently. On fact-based question answering, this catches confident-but-wrong answers that standard confidence scores miss, and acting on the signal roughly cuts the errors that slip through in half.

Technical view

ASMI (Attention-Subnetwork Mutual Information) is a training-free uncertainty estimator that ablates attention heads to generate an ensemble of subnetworks, computes BALD mutual information across their outputs, and applies a semantic-agreement kernel so surface-form paraphrases don't register as disagreement. On an out-of-fold grounded-QA evaluation it provides error-predictive signal beyond single-pass softmax confidence and entropy, concentrated on 'confident-but-fragile' predictions, and using it as a filter roughly halves retained error versus confidence-only filtering. Being post-hoc and training-free, it can be layered onto any existing transformer LLM as an inference-time uncertainty/abstention signal.

arXiv · cs.AIBuildable

sLTN: Structural Logic Tensor Networks

Teaching neural nets to follow logical rules that also respect time, order, and connections.

Neurosymbolic AI tries to combine hard logical rules with the flexible, trainable style of neural networks, and Logic Tensor Networks (LTN) are one framework for doing this by translating logic statements into tensor math. The catch is that the original LTN treats all your data as just an unordered pile of items, so it can't naturally express things like 'this happens after that,' 'this is item 3 in a sequence,' or 'these two nodes are connected in a graph.' sLTN fixes this by adding named 'structural dimensions,' like time steps, sequence positions, or graph links, as first-class parts of the logical language, so you can write rules that directly reference order, timing, or connectivity and have them enforced during training.

Technical view

sLTN extends Logic Tensor Networks by introducing structural axes, temporal, sequential, and graph/relational, as explicitly quantifiable dimensions within the fuzzy first-order logic grounding semantics, allowing structural relations to be stated as logical formulas that map to differentiable tensor operations. This lets constraints such as temporal ordering, positional dependencies, or graph connectivity be embedded directly as loss terms alongside standard LTN satisfaction objectives, extending applicability to sequence-labeling, temporal reasoning, and graph-structured neurosymbolic learning tasks that plain LTN's flat-individual assumption couldn't express.

arXiv · cs.CVRunnable

Is There Really a Camouflaged Object? Towards Realistic Camouflaged Object Detection

Testing whether AI camouflage-hunters can admit 'nothing's hiding here' instead of imagining monsters.

Camouflaged object detection is about finding things that blend into their surroundings, like an insect that looks exactly like a leaf, and it's grown popular as a computer vision task. The catch is that nearly all existing test sets assume every photo definitely contains a hidden object, so models trained on them never learn to say 'there's nothing camouflaged here,' and they hallucinate hidden shapes even in plain, empty scenes. The researchers built OPC16K, a much larger benchmark of over 16,000 images mixing real camouflaged objects, plain backgrounds, and ordinary visible objects, so models can finally be tested on whether they correctly recognize when nothing is hiding, not just on how well they find things when something is.

Technical view

OPC16K is a 16,245-image benchmark aggregated from 14 sources and split into camouflaged-object, pure-background, and non-camouflaged-object subsets, enabling joint evaluation of segmentation quality and negative-sample rejection under an open-world setting, unlike prior closed-world COD benchmarks that guarantee a target is present. It exposes the false-positive failure mode of existing COD models trained under the closed-world assumption, and the authors build on this benchmark to propose a new detection approach (details truncated in the abstract) presumably incorporating explicit rejection of non-camouflaged inputs.

arXiv · math.STConceptual

Posterior contraction rates in Sobolev norms and Bayesian derivative estimation for infinite-dimensional exponential families

Proving Bayesian math can learn not just a curve, but reliably learn its slope too.

When statisticians try to estimate an unknown function from data, such as an underlying probability curve, using flexible Bayesian methods that don't assume a fixed simple shape, they want mathematical guarantees that the estimate gets closer to the truth as more data comes in, and ideally that this holds even for the function's rate of change (its derivative), not just its raw values. This paper proves that, for a broad and mathematically well-behaved class of statistical models, a carefully chosen type of prior belief achieves the best possible convergence speed, even when accuracy is measured in a way that's sensitive to how smoothly the estimated derivative behaves. It's a purely theoretical result establishing when and how well Bayesian nonparametric estimation can be trusted for both a function and its slope.

Technical view

The paper proves minimax-optimal posterior contraction rates in positive-order Sobolev norms for infinite-dimensional exponential family models, by embedding the natural parameter in a Hilbert scale and using Gaussian series priors expanded in the scale's generating eigenbasis. Under a two-sided Fisher information link condition and local regularity assumptions, contraction is shown to be rate-optimal across the whole Hilbert scale up to the ground truth's smoothness level. The proof extends Dolera et al.'s (2024) Wasserstein-distance approach to posterior contraction, combining Laplace-type approximations for infinite-dimensional integrals with stability estimates under geometric perturbation, giving a template for proving derivative-estimation guarantees in other Bayesian nonparametric settings.

arXiv · cs.CVRunnable

AlbumentationsX: One Augmentation Pipeline for Images and Related Annotations

A photo-editing tool for AI training data that never lets labels drift out of alignment.

When you train computer vision models, you randomly tweak training images, like cropping or rotating them, to make the model more robust, a trick called augmentation. But if the image and its labels, such as outlines, boxes, or key points, get randomly tweaked separately, they can silently fall out of sync, quietly corrupting the training data without anyone noticing. AlbumentationsX solves this by picking one random transformation and applying it identically to the image and every kind of label attached to it, including masks, boxes, keypoints, even paired stereo images or video frames, all in a single step. It can also save exactly what transformation it applied so the same operation can be reproduced later, which is handy for debugging or verifying results.

Technical view

AlbumentationsX centralizes random-parameter sampling inside a single Compose call so that one drawn transform state is applied consistently across all annotation types (masks, bounding boxes, keypoints, multi-view/stereo pairs, video/volume frames), eliminating the desync bugs common when augmentation code paths handle each annotation type independently. It supports pipeline serialization and exact replay for reproducibility and debugging, is extensible with custom transforms, and is designed to slot in after data decoding and before batch collation in frameworks like PyTorch, making it a practical drop-in evolution of Albumentations for multi-annotation training pipelines.

arXiv · cs.LGBuildable

Two-stage Odd Residual Flows for Mean-Preserving Probabilistic Time Series Forecasting

A two-step trick lets weather-style forecasts be both sharp on average and honest about uncertainty.

Forecasting things like electricity demand or stock prices isn't just about predicting one number — you also want to know how confident to be, and how wrong you might be. The problem is that models trying to do both at once usually get worse at the basic 'what's the average outcome' prediction because they're distracted by also modeling uncertainty. This paper splits the job into two stages: first, a dedicated model just nails down the best average prediction; then a second, specialized model layers on top to describe the spread of possible outcomes around that average without disturbing it. This matters for things like financial risk or long-range planning, where getting the average right and knowing your error bars both count.

Technical view

TORF decouples point forecasting from distributional/uncertainty estimation by using a pretrained deterministic forecaster for the mean, then applying a second-stage 'Restricted Normalizing' residual flow (odd-symmetric) to model the residual distribution while provably preserving the first-stage mean. This avoids the NLL-driven degradation in joint MVE training and sidesteps the costly Monte Carlo sampling typical of diffusion/flow-based probabilistic forecasters. Practitioners could plug in any strong deterministic backbone for stage one and reuse the odd-residual-flow module as a lightweight, mean-preserving uncertainty head for long-horizon time series.

arXiv · cs.CLConceptual

Actions Speak Louder than Words: Measuring Cross-Lingual Policy Retention in Tool-Using Agents

Ask an AI agent the same task in 41 languages — does it actually do the same thing, or just say so?

AI agents that use tools (like booking a flight or searching a database) are usually graded only on whether they got the final answer right, even when tested in different languages. But this paper argues the real product is the sequence of actions the agent takes — because that's what determines cost, speed, and how things go wrong when they do. The researchers ran millions of these agent 'action traces' across 8 AI models and 41 languages, then discovered that naive ways of comparing traces are misleading: a lazy agent that does almost nothing scores artificially well, and even the same model asked twice in the same language doesn't behave identically. After correcting for these five hidden biases, they get a much more honest measurement of whether an agent's behavior stays consistent across languages — important for anyone deploying AI agents globally and trusting them to act the same way no matter what language the user speaks.

Technical view

The authors evaluate cross-lingual 'policy retention' — whether tool-use action traces (not just final answers) remain consistent across languages — using 2.38M rollouts across 8 models, 6 benchmarks, and 41 languages. They identify five confounds that bias naive trace-similarity metrics: trace-length bias, empty-trace inflation, chance agreement on unrelated traces, model-specific reproducibility ceilings, and lack of a same-language baseline (since repeated queries in one language already diverge). Correcting for all five yields a defensible cross-lingual consistency metric; a practitioner could adopt this corrected framework to audit agent deployments for language-dependent behavioral drift before production rollout.

arXiv · cs.CVBuildable

Every Packet Counts: Dispersing Information for Loss-Resilient Learned Image Compression

Making compressed images survive dropped internet packets, like satellite or emergency radio glitches.

When you compress an image with modern AI compression, it works great — until part of the data gets lost in transit, which happens a lot over satellite links or during emergencies. The problem is that these AI compressors tend to cram the most important information into just a few 'channels' of data, so losing one packet can wreck the whole picture, and the decoding process reads pieces in sequence so one loss cascades into more damage. The fix here spreads the important information evenly across all the channels and then deliberately interleaves the data before splitting it into network packets, so no single lost packet can take out anything too critical, and they also change how decoding handles a loss so errors don't spread. The payoff is that images sent over unreliable connections — think disaster response or satellite feeds — stay recognizable even when the network drops chunks of data.

Technical view

The method targets two failure points in learned image compression under packet loss: non-uniform channel-wise information density before packetization, and sequential entropy-coding dependencies during decoding. Inter-Channel Redistribution (ICR) rebalances energy across latent channels so no channel dominates, while Interleaved Channel Grouping (ICG) strides channels across packets (each capped at a fixed size) to disperse critical information; a modified two-stage decoding scheme then limits how far errors from a lost packet cascade. This gives an end-to-end trainable LIC pipeline directly optimized for loss resilience, useful as a drop-in replacement for standard LIC in lossy-channel deployments like satellite or tactical communications.

arXiv · cs.AIConceptual

Why Does CLAUDE.md Keep Growing? Catastrophic Remembering in Agentic Coding

AI coding assistants' instruction files balloon forever because deleting an old rule feels too risky.

Many teams keep a CLAUDE.md-style file that tells their AI coding assistant how to behave in their codebase — but these files just keep growing and growing, almost never shrinking, until someone finally rewrites the whole thing from scratch. The researchers figured out why: it's cheap to add a new instruction, but once you've forgotten *why* an old instruction was added, removing it risks breaking something, so people just leave everything in, forever. They studied nearly 250,000 individual instructions across almost 1,900 real repositories and found these files more than triple in size over their lifetime, gaining about 5 new instructions every commit, and the older an instruction is, the less likely anyone ever removes it. This is basically 'hoarding' for AI instructions, and it matters because bloated instruction files become slower, more confusing, and harder for the AI to actually follow well.

Technical view

The paper coins 'catastrophic remembering' — the inverse of catastrophic forgetting — where agentic-coding instruction files (e.g., CLAUDE.md) accrete unboundedly because appending an instruction is O(1) but safely deleting one, once its rationale is lost, is O(2^|D|) in the number of existing instructions (you must verify it doesn't interact with any subset of the rest). Empirically, across 247,694 instruction lifetimes in 1,867 repos, prompts grow +226% over their lifetime, gain +4.9 net instructions per commit, and show a -0.032/commit log-hazard of deletion (older instructions are progressively less likely to be removed). The paper also begins exploring mitigations (e.g., using comments to preserve rationale), suggesting a concrete direction: instrument instruction provenance/rationale metadata to make safe pruning tractable instead of combinatorial.

arXiv · cs.LGConceptual

Cross-View Feature Matching: Survey, Benchmarking, and Foundation-Model Perspectives

A big survey maps a decade of teaching computers to match the same scene from wildly different camera angles.

Imagine two photos of the same building taken from a drone and from street level — figuring out which pixels in one photo correspond to which pixels in the other is 'cross-view feature matching,' and it's a building block for things like 3D reconstruction, navigation, and image search. Over the last ten years, researchers moved from narrow, task-specific tricks toward more general-purpose matching systems, especially as powerful pretrained 'vision foundation models' emerged that already understand images broadly. But the field has become a patchwork of incompatible methods, architectures, and ways of measuring success, making it hard to know what's actually working best. This paper is a comprehensive survey that organizes the whole landscape into one clear taxonomy and benchmark, essentially a map for anyone entering or building on this area.

Technical view

The survey organizes cross-view feature matching research into a taxonomy spanning feature extraction, single-type and multi-type feature matchers, VFM-based (vision foundation model) approaches, training strategies, and robust estimation (e.g., outlier rejection for pose/geometry fitting). It includes benchmarking across methods and likely a comparative evaluation protocol, positioning recent VFM-driven approaches (e.g., using DINO/SAM-style backbones) against classical geometric matchers like SuperGlue/LoFTR-style pipelines. For practitioners, this is a reference point for selecting or extending a matcher for large-viewpoint-change tasks (SLAM, aerial-to-ground localization, multi-view 3D) and for identifying gaps where foundation-model-based matching still underperforms specialized architectures.

arXiv · cs.NIRunnable

A Systematic Sample Size Analysis of ML-Based Path Loss Prediction for LPWAN

How much real-world data do you actually need to teach an AI to predict radio signal loss in a city?

LoRa is a long-range, low-power wireless technology used for smart city sensors, and to plan a good network you need to predict how much a radio signal will weaken ('path loss') as it travels through a city's buildings and terrain. Old-school physics-based formulas aren't very accurate for this, so researchers tried machine learning instead — but ML needs training data, and collecting real measurements is expensive, so a key question is: how much data is actually enough? Using real measurements from an urban LoRa deployment, they trained two different ML approaches, one using 3D laser-scanned terrain data and one using just GPS coordinates, and tracked how accuracy improved as they fed in more and more training data. Both ML methods beat the traditional formulas at every data size tested, and with the most data they cut prediction error by roughly a third compared to the best baseline — useful for anyone deciding how much measurement effort is worth investing before deploying a smart city network.

Technical view

The study benchmarks two ML approaches for LoRa path-loss prediction — Random Forest using LiDAR-derived terrain features, and k-Nearest Neighbors using coordinate-only features — against empirical and specialized LPWAN propagation models, using real urban measurement data, with a systematic sweep of training set size under random pooled splits. Both ML models dominate baselines at every tested sample size, reaching RMSE below 6.5 dB versus 9.7 dB for the best empirical baseline at maximum training size. This gives network planners an empirical sample-size-vs-accuracy curve to decide how much measurement campaign effort is needed before ML path-loss prediction saturates in return, and offers a reproducible feature-engineering baseline (LiDAR terrain vs. raw coordinates) for LPWAN deployment planning.

arXiv · cs.AIRunnable

RTSKG: Building a Rail Transit Station Knowledge Graph Dataset

A knowledge graph that connects subway stations, roads, and nearby shops to better predict city transit patterns.

Rail transit stations aren't isolated dots on a map — they're shaped by the roads around them, the shops and offices nearby, and how all these pieces interact, and tasks like predicting how many riders will use a station need to account for all of that. Most existing research treats these city elements separately instead of capturing how they connect to each other. This paper builds a 'knowledge graph' — a structured web of connections — that links stations, road segments, and points of interest (like restaurants or offices) together with a consistent, unified format. Having this shared, richly connected dataset means researchers working on ridership prediction or other station-related problems can now plug in a realistic, interconnected picture of the city instead of building their own patchwork data from scratch every time.

Technical view

RTSKG is a knowledge graph dataset that integrates heterogeneous urban entities — rail transit stations, road network segments, and points of interest — under a unified schema explicitly encoding both spatial and semantic relations between them, rather than treating these entity types as siloed data sources. The design targets downstream city-level station tasks such as ridership prediction, where multi-entity spatial context (road connectivity, nearby POI mix) is a known but underexploited signal. Researchers can use RTSKG directly as a benchmark dataset or as a template schema for constructing similar multi-entity urban knowledge graphs, and can build graph neural network or knowledge-graph-embedding models on top of it for ridership or land-use prediction tasks.

arXiv · cs.AIBuildable

SkillZip: Evaluation-Free Skill Compression for Self-Evolving Agents by Discovering Reusable Structure

Shrinking a self-improving AI's growing rulebook of learned tricks without breaking any of them — and without retesting.

Some AI agents get smarter over time by saving 'skills' — notes to themselves about successful procedures and fixes for past mistakes. The problem is these skill notes get bloated: the same requirement gets restated across multiple examples, warnings pile up, and repeated action sequences get copy-pasted instead of written once and reused, making the skill expensive to load into the AI's context and hard to maintain. One way to compress these notes is to test different shortened versions against real tasks to make sure nothing important got cut, but that's slow and costly. SkillZip instead compresses a skill by looking directly at its underlying structure — noticing what's genuinely repeated versus what's a rare-but-important exception — and shrinking it to the shortest version that's still faithful, without running any test evaluations at all.

Technical view

SkillZip addresses skill compression for self-evolving agents, where naive generic prompt compression fails because a skill has structured components (a name/description gating when it applies, a workflow controlling execution, tool/output contracts constraining validity, and rare exceptions that matter even if unsampled by any given task). Rather than evaluation-guided compression, which requires costly rollouts against a compression-time eval set, SkillZip discovers the skill's reusable structure directly (deduplicating restated requirements, factoring repeated action sequences) to find the 'shortest faithful' representation without running any evaluations. This is directly useful for anyone maintaining growing agent skill libraries (a similar bloat problem to catastrophic remembering in CLAUDE.md files, item 4) who wants cheaper, safer compression without needing a held-out benchmark to validate each compression pass.

arXiv · cs.CVBuildable

Learning Gaussian Structure: Intervention-Guided Density Control for Feed-Forward Driving Reconstruction

Letting self-driving-car 3D scenes learn where they need more detail, on the fly.

Self-driving systems build live 3D reconstructions of the road from camera and LiDAR (laser-scanner) data, using clouds of tiny colored blobs called Gaussians to represent surfaces cheaply and fast. Older fast methods just lock in the blob layout from the very first sensor reading and never revisit it, even though some areas (like a fast-moving car or a fine road sign) need more blobs than others. This paper's trick is to test what happens if you nudge the system by experimentally adding or deleting blobs and watching how the error signal reacts, which reveals where the model actually needs more detail, then also better combines evidence collected across multiple moments in time for each blob. The payoff is sharper, more accurate real-time 3D reconstructions of driving scenes without the heavy computation of traditional optimization methods.

Technical view

LGS augments feed-forward 3D Gaussian Splatting for LiDAR-based driving reconstruction by introducing intervention-guided density control: rather than freezing the initial point-to-primitive correspondence, the method probes local gradient responses to synthetic prune/add operations to infer where densification is warranted, mimicking the gradient-accumulation densification signal used in slower optimization-based 3DGS but without per-scene optimization. It also explicitly aggregates cross-timestamp evidence per primitive rather than relying on the shared sparse backbone's implicit fusion. This targets a known gap between feed-forward and optimization-based Gaussian reconstruction quality, and practitioners building real-time driving-scene reconstruction pipelines could adopt the intervention-signal approach as a lightweight densification module without needing full backprop-based scene optimization.

arXiv · cs.CVBuildable

Foundation Model-Enabled Efficient Data Sampling (FEEDS): A label-efficient training strategy for pan-cancer, multi-tracer PET/CT datasets

Teaching AI to pick the best few medical scans to label, instead of labeling everything.

Doctors want AI that can automatically spot cancer lesions across whole-body PET/CT scans, but training such a model normally needs huge numbers of scans painstakingly outlined by experts, which is slow and expensive. FEEDS uses embeddings — compact numeric fingerprints — from an existing general-purpose vision AI to scan through a big pile of unlabeled scans and pick out the ones that are most different and informative, so human experts only need to label that small, smart subset instead of everything. This is a one-shot selection process rather than a repeated back-and-forth loop like typical active learning, making it simpler and faster to deploy. The result is a way to build accurate, generalizable cancer-detection AI across different cancer types and imaging tracers while spending far less expert time on annotation.

Technical view

FEEDS is a one-step, label-efficient sampling strategy for training pan-cancer, multi-tracer PET/CT lesion segmentation models: it uses embeddings from a pretrained vision foundation model to select a diverse, representative subset of unlabeled cases for expert annotation, in contrast to iterative active-learning or semi/unsupervised pipelines that require repeated model retraining cycles. By front-loading diversity-aware sample selection into a single pass, it reduces both annotation and compute cost while aiming to preserve coverage of variation in lesion size, distribution, and radiotracer appearance. Practitioners with large unlabeled multi-tracer PET/CT archives could adopt this embedding-based coreset selection as a preprocessing step before any segmentation architecture, rather than building a bespoke active-learning loop.

arXiv · cs.CVConceptual

Static in Frames, Dynamic in Events: Rethinking Features in Event Cameras as Motion Cues

Camera pixels that fire only on motion turn out to encode direction, not just edges.

Event cameras are a different kind of camera that doesn't take full snapshots; instead each pixel independently reports the instant it senses a change in brightness, giving extremely fast, motion-sensitive data. This paper looks at two mathematical features long used to detect corners in that data — essentially measures of how sharply and densely points changes cluster — and argues these aren't just static shape descriptors but are actually revealing which direction things are moving. The authors prove this connection with math and then test it on both synthetic and controlled experiments to see if combining these motion-revealing features with basic shape information can make motion-tracking algorithms better. The bigger idea is that event cameras should be treated fundamentally differently from ordinary frame-based cameras, since their raw features carry motion information that normal images don't have an equivalent for.

Technical view

The paper reinterprets the structure-tensor eigenvalues and spatiotemporal density values used in event-based corner detectors as motion cues rather than purely geometric descriptors: it derives a theoretical relationship between structure-tensor eigenvalues at moving corners and motion direction, then validates via synthetic-dataset and controlled experiments that combining these features with local geometry improves motion estimation. This reframes standard event-camera corner-detection features as directly informative for optical-flow/motion-estimation pipelines rather than treating event data as a drop-in analog of frame-based intensity images. Researchers building event-based visual odometry or motion-estimation systems could incorporate these eigenvalue/density signals as auxiliary motion cues without needing additional sensors or learned models.

arXiv · cs.CVRunnable

CapProbe: Evaluating Detailed Image Captions via Full-Scene Dense Question Answering

A dense fact-checking quiz that grades AI image captions region by region, not just vibes.

When a vision-AI writes a detailed caption for an image, how do you know if every claim in it is actually true, not just generally plausible-sounding? Existing scoring methods either compare wording loosely to a reference caption or ask another AI to judge quality, both of which miss specific factual errors buried in dense descriptions. CapProbe instead chops each image into meaningful regions — like the background, or a specific object — and generates multiple-choice questions tied to each region, covering ten different types of visual facts (like color, position, or count), so it can check a caption against a thorough checklist of ground-truth answers. This turns caption evaluation into precise, verifiable fact-checking rather than fuzzy similarity scoring, which matters because it exposes exactly which details a captioning AI is getting wrong and where.

Technical view

CapProbe is a benchmark that converts detailed-caption evaluation into region-aligned dense QA: each image is segmented into coarse semantic regions (foreground and background), and for every region multiple-choice questions are generated spanning 10 semantic categories, organized under a two-tier taxonomy of 37 L1 domains and 219 L2 sub-domains, yielding a high-density checklist of probed visual facts per image. This design directly addresses known weaknesses of CIDEr/SPICE-style reference metrics and LLM-as-scorer protocols (low factual verification granularity) and prior QA-based benchmarks (sparse probing, weak region alignment). Practitioners evaluating VLM captioning systems can use CapProbe as a drop-in benchmark to get fine-grained, per-region factual accuracy scores rather than a single holistic quality number.

arXiv · quant-phConceptual

Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory

A math proof that quantum memory beats classical memory for AI systems tracking state over time.

Many AI tasks require quietly keeping track of information as it streams in — like remembering who's who in a long conversation — and this paper asks whether a quantum computer could do this 'remembering' job with fundamentally less memory than any classical computer ever could. The authors build a theoretical framework that counts exactly how much information needs to pass between the part that reads the stream and the part that answers questions about it later, then mathematically show that certain tasks provably need less quantum memory than classical memory to solve, no matter how cleverly the classical system uses caching or recomputation. One concrete example is a task about tracking matching pairs of entities mentioned in text, where the size gap between the needed classical and quantum memory can be dramatic (logarithmic versus larger). This matters because it's a rigorous mathematical case that quantum computing could give real efficiency advantages for specific AI memory/state-tracking problems, not just abstract cryptography or chemistry problems.

Technical view

The paper establishes inference-time quantum advantages for streaming/adaptive AI state-tracking tasks by formalizing a boundary-preserving semantic-compilation theorem: it maps a finite one-way, streaming, or adaptive causal task into a 'semantic AI interface' that preserves event order and past-input access, while accounting for communication (B), persistent instance-dependent memory (M), and local work (D), with classical recurrence, caching, and recomputation explicitly allowed and charged. Classical boundary-state lower bounds and quantum-memory upper bounds are shown to transfer through this compilation up to explicit overhead, independent of the underlying finite-precision recurrent architecture — meaning the result applies architecture-agnostically to RNN-like or transformer-like solvers. A concrete application, matched-entity synopsis QA, inherits an O(log N)-qubit vs. larger classical-memory separation from the hidden-matching communication complexity problem, giving a template for identifying other AI tasks with provable quantum memory advantages.

arXiv · cs.CVBuildable

Entropy-Centric Explainable AI for Remote Sensing Image Segmentation

Using randomness/uncertainty math to make satellite-image AI explain its own decisions.

AI models that classify satellite and aerial imagery — say, labeling every pixel as forest, water, or building — are often 'black boxes' that give no insight into why they made a call, which is a problem when the stakes are high (disaster response, land-use policy) and people need to trust the output. Explainable AI (XAI) is the field trying to open up that black box, and while there's been good progress explaining simple image-classification decisions, doing so for pixel-by-pixel segmentation of complex scenes is much harder and underexplored. This paper proposes an approach centered on entropy — a measure from information theory of how uncertain or 'spread out' a prediction is — to generate explanations that highlight where and why the segmentation model is confident or unsure. The goal is to give remote-sensing analysts clearer, trustworthy insight into pixel-level AI decisions so these tools can be adopted more safely in critical applications.

Technical view

The paper proposes an entropy-centric explainability framework specifically for remote sensing image segmentation, addressing the relative lack of XAI methods tailored to dense pixel-wise prediction compared to the more mature literature on image classification explanations. The core mechanism uses entropy (uncertainty) measures over model outputs to construct explanations that localize and quantify prediction confidence/ambiguity at the pixel or region level, rather than relying solely on saliency-map-style attribution. This targets the transparency gap that limits adoption of deep segmentation models in critical remote-sensing applications; practitioners could apply this entropy-based diagnostic on top of existing black-box segmentation networks to audit low-confidence regions without retraining the underlying model.

arXiv · cs.LGConceptual

Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training

For recommender AI on a memory budget: bigger batches beat more negative examples.

Recommendation systems (like the ones suggesting products or videos) are trained by comparing a real user choice against many possible wrong choices, called negative examples, and this comparison eats up huge amounts of computer memory when there are millions of possible items. Engineers have to make a trade-off: given a fixed memory budget, should they process more examples at once (bigger batches) or compare each example against more negative options? This paper works out the math of how training speed depends on that trade-off under a fixed memory limit, and finds, somewhat surprisingly, that it's almost always better to spend your memory budget on bigger batches and keep the number of negative examples per item small, rather than the reverse. This gives engineers building large-scale recommender systems a concrete, theoretically justified rule of thumb for configuring training instead of guessing.

Technical view

The paper analyzes sampled-softmax training for large-vocabulary recommender systems under a fixed memory budget B = n·k (batch size n times negatives per example k, since the softmax layer requires O(nk) memory for logits/gradients). Under standard smoothness and gradient-variance assumptions, their theoretical analysis shows convergence is fastest under an n ~ B, k ~ 1 allocation — i.e., maximize batch size and minimize negatives per example — rather than the reverse allocation, giving a concrete, provably-motivated selection rule. This directly informs hyperparameter configuration for anyone training softmax-based recommenders (e.g., two-tower or sequential recommendation models) with memory-constrained final classification layers, replacing ad hoc batch/negative-count tuning with a theory-backed default.

arXiv · cs.LGConceptual

Uncertainty-Aware Deep Learning for Genomics Applications: Insights from an Empirical Study

Testing which 'AI is unsure' methods actually deserve trust in genomics research.

Deep learning models are now widely used in genomics — for example, predicting how a DNA sequence affects gene activity, or analyzing gene expression in single cells — but these models rarely tell scientists how confident they are in their predictions, which matters a lot when a wrong guess could send research down the wrong path. This paper systematically compares three popular techniques for getting AI to express its own uncertainty: Deep Ensembles (training many versions of a model and seeing how much they disagree), Bayesian Neural Networks (a more mathematically principled but complex approach), and Monte Carlo-dropout (a cheap trick using random dropout at prediction time). The researchers run these methods across different genomics scenarios and data types to see which ones give trustworthy, reliable confidence estimates versus which ones are misleading. The outcome is a practical guide helping genomics researchers choose the right uncertainty method for their specific data and question rather than picking one arbitrarily.

Technical view

This is an empirical benchmarking study comparing three uncertainty quantification (UQ) methods — Deep Ensembles, Bayesian Neural Networks, and Monte Carlo Dropout — across deep learning models in genomics, specifically sequence-to-activity prediction models and single-cell expression analysis, evaluating how dataset characteristics in each modality affect UQ reliability. The paper doesn't propose a new UQ method but instead provides a systematic comparison framework and empirically-derived guidelines on which method suits which genomics application/modality. Practitioners building genomics deep learning pipelines (e.g., regulatory sequence models or single-cell analysis tools) can use these findings directly to select an appropriate, validated UQ approach instead of defaulting to an unvalidated choice.

arXiv · cs.CVRunnable

A Comparative Evaluation of Deep Learning Object Detection Models on a Real-World Multi-Plant Dataset from Africa

Six AI vision models battled it out spotting crops on real Nigerian farms.

Researchers wanted to know if computer-vision systems that spot crops in tidy lab photos actually work on messy real farms in Africa, where lighting, shadows, and camera angles vary wildly. They built a dataset of over 3,000 photos of sesame, cabbage, and tomato plants taken on real Nigerian farms, then tested six popular 'object detection' AI models (algorithms that draw boxes around things they recognize in images) against each other. One model, called RT-DETR, came out on top at correctly finding and identifying the crops. This matters because most farm-AI research is built and tested on clean, controlled datasets from wealthier regions, so tools often fail when deployed in the real, unpredictable conditions many African farmers face.

Technical view

The study benchmarks YOLOv5, YOLOv8, YOLO11, YOLO26, Faster R-CNN, and RT-DETR on AgriAISeg, a novel 3,382-image dataset of sesame, cabbage, and tomato crops collected under uncontrolled field conditions (variable illumination, occlusion, viewpoint) in Nigeria. Models were trained and compared via precision, recall, mAP@0.5, and mAP@0.5:0.95, with RT-DETR (a transformer-based detector) achieving the best overall metrics. The dataset and evaluation protocol offer a reusable, region-specific benchmark for practitioners building precision-agriculture pipelines for underrepresented geographies, and the released data enables direct fine-tuning or further model comparisons.

arXiv · cs.LGBuildable

Efficient Hypergradient Descent for Inverse Reinforcement Learning

A math shortcut makes AI learn 'why' someone acted the way they did, faster.

Inverse reinforcement learning is about watching someone act — say, an expert driver or player — and figuring out what goal or reward they must be pursuing to explain their choices. The tricky part is that this involves a nested optimization: you're tuning a guessed-at reward while simultaneously simulating how an agent would behave under it, and that combination is normally very slow and computationally expensive to differentiate through. This paper finds a mathematical shortcut: at the point where the inner learning process has settled, a complicated matrix in the calculation turns out to be proportional to a simpler, well-understood quantity from statistics (the Fisher information matrix), making the whole process much cheaper to compute. That matters because it could make learning reward functions from demonstrations — used in robotics and imitation learning — dramatically more practical to run at scale.

Technical view

IRL is framed as bilevel optimization where the outer loop fits a reward function and the inner loop solves policy optimization under it; naive hypergradient computation requires an inverse-Hessian-vector product that's costly at scale. The authors show that at the inner optimum, the inner objective's Hessian is proportional to the policy's Fisher information matrix, yielding a Fisher-based hypergradient closely related to Natural Hypergradient Descent, avoiding explicit Hessian inversion. This connects bilevel IRL to natural-gradient methods and should let practitioners substitute cheaper Fisher-vector-product approximations (already common in RL) for full inverse-Hessian computation in existing bilevel IRL pipelines.

arXiv · cs.CVBuildable

HUI360: A 360° Egocentric Dataset and Baselines for Human-Robot Interaction Anticipation

A robot wandered public spaces for months filming how humans react to it.

For robots to work safely and smoothly around people, they need to predict what a human is about to do — step aside, approach, ignore them — before it happens. This project built HUI360, a huge dataset made by sending a mobile robot with a 360-degree camera out into real public spaces over three months, capturing how ordinary people naturally behaved around it, not actors following a script. The team also built a pipeline to automatically label these interactions from the wide-angle video, and trained baseline AI models to test how well they could anticipate human behavior. Because the data spans many different people, places, and days, it's meant to push robot perception systems to generalize better to the messy, unpredictable real world rather than just memorizing a narrow lab setting.

Technical view

HUI360 is presented as the largest in-the-wild dataset for human-robot interaction anticipation, collected via a mobile robot's 360° equirectangular camera over a 3-month, multi-environment deployment capturing spontaneous, unscripted behavior from passersby and users. The authors contribute an automated annotation pipeline for interaction labeling directly on equirectangular video, plus baseline anticipation models trained and evaluated on the dataset. This provides a large-scale, diverse benchmark and reusable annotation tooling for researchers building or testing socially-aware perception models for embodied agents in real-world deployment conditions.

arXiv · cs.CVBuildable

3D Weighted Geometric Graph Neural Networks for Sheep Facial Pain Assessment

AI reads sheep faces in 3D to spot pain a flat photo would miss.

Vets have a clinically validated scale for judging sheep pain from facial expressions, but most AI systems try to read this from flat 2D photos, which loses important information about how the ears, eyes, and nose are positioned relative to each other in real space. This paper builds a system that estimates the sheep's face in 3D from an ordinary single camera (using a depth-estimation AI so no special hardware is needed), then represents each key facial point as a node in a graph, connected by weighted links describing how they relate to each other. Essentially, it teaches the AI to look at facial geometry the way a trained vet would, but automatically and from video. This could make automated animal welfare monitoring far more accurate and accessible, since it doesn't require expensive depth cameras.

Technical view

3D-SPFES is a monocular depth-aware geometric graph neural network that lifts the clinically-validated Sheep Pain Facial Expression Scale (SPFES) landmarks (ears, eyes, nose) into 3D Euclidean coordinates using VideoDepthAnything for depth estimation from single RGB video, avoiding dedicated depth sensors. Each landmark becomes a graph node with a feature vector of 3D coordinates, estimated surface normal, and facial-attribute class embedding, with edges weighted by an aggregate relational metric between landmarks. This graph-based, geometry-aware formulation lets a GNN reason over cross-landmark spatial relationships rather than treating the face as a flat 2D image, offering a template for extending clinical facial-expression scales into 3D animal-welfare assessment pipelines.

arXiv · cs.CLRunnable

Multiclass Sentiment Analysis for Identifying Political Viewpoints

Teaching AI to sort political social-media posts by more than just good or bad.

When people argue about politics online, their tone isn't just 'positive' or 'negative' — it spans many shades of opinion. This project tries to get AI to automatically sort political social-media posts into multiple sentiment categories rather than a simple two-way split, using labeled real-world posts about political issues and figures. The researchers compared two very different AI approaches: XGBoost, a fast tree-based method good with structured features, and BERT, a deep language-understanding model, to see which handles this nuanced classification better. The result was that XGBoost performed better in their tests, which is a useful and somewhat counterintuitive finding for anyone building tools to track public opinion or study political discourse at scale.

Technical view

The paper compares XGBoost (a gradient-boosted tree classifier over engineered text features) against BERT (a transformer-based contextual language model) on multiclass sentiment classification of political social-media posts, evaluated with standard classification metrics on a labeled dataset spanning political issues and figures. XGBoost outperformed BERT in their experiments, a result worth replicating since it runs counter to the usual assumption that transformer fine-tuning dominates classical ML on text tasks. Practitioners building political discourse monitoring or opinion-mining pipelines can use this as a baseline comparison when choosing between lightweight feature-based classifiers and heavier fine-tuned LLMs.

arXiv · cs.AIBuildable

V-FiLLM: Verified Financial LLM Reasoning Benchmark

A benchmark that auto-generates provably-correct finance math questions to stress-test LLMs.

It's hard to know if an AI is truly good at financial reasoning — like reading a spreadsheet and computing a correct ratio — because most benchmarks are hand-written and limited in scale, or graded by another imperfect AI. This project builds questions automatically from 'computation trees' rooted in real financial tables: essentially a recipe of calculations whose correct answer can be computed exactly with plain math (symbolically), then turned into natural-language questions, so there's no risk of mislabeled answers and no ceiling on how many questions can be generated. The benchmark also lets researchers dial up difficulty along four separate knobs, like how many calculation steps are involved or how complex the financial concepts are. Testing open-source models this way revealed their accuracy drops sharply — by up to half — as the reasoning gets deeper, exposing a real weak spot in current AI's financial reasoning.

Technical view

V-FiLLM generates financial-reasoning benchmark items from executable computation trees grounded in real tabular data; ground truth is obtained via symbolic evaluation of the tree rather than model-generated labels, eliminating annotator/generator error and enabling unlimited-scale generation. Difficulty is controlled along four independent axes — computation depth, expression breadth, financial concept complexity, and context size — allowing fine-grained diagnostic evaluation. Evaluating open-source LLMs shows accuracy degrades by up to 51% as reasoning depth increases, providing both a scalable eval framework and reusable methodology (symbolic tree → NL rendering) practitioners can adapt to other verifiable structured-reasoning domains.

arXiv · cs.LGBuildable

ReRound: Reconstructive Rounding to Resolve Midpoint Ambiguity in Calibration-Free LLM Quantization

A diffusion model helps decide which way to round tricky borderline AI weights.

When you shrink an AI model to use fewer bits per number ('quantization', which makes it smaller and faster to run), you have to round each weight to the nearest allowed value — but for weights sitting right between two options, standard rounding is basically a coin flip that can hurt accuracy. This method, called ReRound, trains a separate small AI (a 'diffusion model', the kind of AI that generates images by refining noise) to predict a better, continuous version of what those low-precision weights should look like, and uses that prediction to break the tie in the right direction. It only intervenes for the ambiguous middle-of-the-road cases — weights confidently near their rounding target are left to standard, cheaper rounding. This means better-compressed models without needing extra calibration data, which is valuable for deploying large language models cheaply on limited hardware.

Technical view

ReRound is a post-training LLM quantization method targeting the midpoint-ambiguity problem in round-to-nearest (RTN) schemes: it trains a conditional diffusion model to produce continuous reconstructions of low-bit weights, which serve as a guidance signal to disambiguate rounding direction for weights near quantization interval midpoints. A tolerance metric measures each weight's distance from its midpoint (in continuous quantized-weight space, not integer space) — weights within tolerance use diffusion-guided reconstruction while weights near boundaries fall back to standard RTN, keeping the method calibration-free. This hybrid approach could be integrated into existing RTN-based quantization pipelines to selectively improve accuracy at low bitwidths without requiring calibration datasets.

ROB

Robotics

50 new
arXiv · cs.ROBuildable★ flagship

Surgical WAM: A World-Action Model for Data-Efficient Surgical Robot Learning

Watching cheap surgery videos to teach a robot precise hands with far fewer costly demos.

Training a surgical robot to manipulate tissue reliably needs demonstrations where every hand movement is recorded alongside the robot's exact joint positions — data that's expensive and slow to gather. Plain endoscopic surgery *video*, by contrast, is cheap and plentiful, but it lacks those action labels telling the robot what motions produced what it sees. The idea here is a 'world model': the robot first watches lots of unlabeled video to learn how surgical scenes evolve — how tissue moves, how tools interact — building intuition about cause and effect without ever being told the actions. Then it fine-tunes on the small precious pile of action-labeled demos. The paper asks a sharp question — with a fixed budget of labeled demos, does this action-free video pretraining actually improve real closed-loop control? — and builds Surgical WAM, a combined world-and-action model, to test it.

Technical view

Surgical WAM couples an action-free video world model (learned dynamics of endoscopic scenes) with an action head to yield closed-loop control on a dVRK-style platform, targeting the action-labeled-demo bottleneck. Unlike prior surgical world models used only for simulation or offline policy evaluation, this translates learned dynamics into policies deployed in the control loop, and the central experiment holds labeled-demo budget fixed to isolate the marginal value of video pretraining. The mechanism is representation transfer: dynamics learned from abundant unlabeled video initialize or condition a policy that then needs fewer synchronized video–kinematics trajectories to achieve precise contact-rich, bimanual, long-horizon manipulation. Practitioners can replicate by pretraining a video-prediction world model on endoscopic corpora, then attaching and fine-tuning an action decoder on limited teleoperation data, benchmarking closed-loop success against a demos-only baseline.

arXiv · cs.RORunnable★ flagship

HandEdit: A Unified Benchmark for Egocentric Human-to-Robot Dexterous Hand Image Editing

Digitally repainting human hands in first-person video into robot hands to train robots cheaply.

Robots with dexterous multi-fingered hands could learn a lot from the huge amount of first-person ('egocentric') video of people using their hands — but human hands and robot hands look and bend completely differently, so you can't just feed human footage to a robot and expect it to work. HandEdit tackles this with image editing: it takes a frame showing a human hand and arm and rewrites the pixels so the same scene now shows a *robotic* hand doing the same thing, preserving the task while swapping the 'embodiment.' To make this possible at scale, the authors built a massive dataset — over 200 million editing examples drawn from five video sources, covering 26 different robot hand types — and a benchmark to measure how well editing models perform. The insight is that generic image editors don't know robot anatomy, so they need this embodiment-specific training data to bridge the human-to-robot gap. The result is a resource for turning cheap human video into robot-usable training footage.

Technical view

HandEdit is a large-scale embodiment-aware image-editing dataset and benchmark for transforming human hands/arms into diverse dexterous robot embodiments within egocentric frames, comprising 200M+ editing instances derived from five source datasets and spanning 26 distinct embodiments. It targets the human–robot co-training gap where appearance, articulation, and viewpoint discrepancies plus the lack of embodiment-specific priors cause general image-editing models to fail. The contribution is data-and-benchmark: it enables training or fine-tuning editing models that inject embodiment priors so edited frames are viable for downstream manipulation policy co-training. Practitioners can use HandEdit to benchmark editing fidelity and to generate embodiment-translated visual data that augments scarce teleoperation datasets.

arXiv · cs.ROBuildable

Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments

Planning safe robot paths across alien terrain even when the ground's mechanics are unknown.

When a rover explores another planet, it doesn't fully know how the terrain will behave under its wheels — soft sand, loose rocks — and that uncertainty, plus noisy sensors, can lead the robot to pick paths that seem fine but are secretly risky. This paper tackles the problem in two steps: first, a randomized path-search algorithm called AO-RRT sketches out a rough but physically realistic, risk-aware route considering the vehicle's motion and cost; then that rough plan gets refined and smoothed using a mathematical optimization technique (sequential convex programming) so the final path is both safer and more efficient. This combination aims to give space robots a practical way to navigate hazardous, uncertain alien environments without needing perfect knowledge of the ground beneath them.

Technical view

The paper addresses cost-optimal kinodynamic motion planning under uncertainty for planetary rovers, where learned environmental interaction models (e.g., wheel-terrain mechanics) and perception introduce risk. Their two-stage pipeline first uses AO-RRT, a sampling-based planner, to generate a dynamically feasible, asymptotically cost-optimal, risk-aware trajectory, then formulates refinement as a nonlinear optimization problem solved via sequential convex programming (SCP) initialized from the AO-RRT solution. This combination of sampling-based global search with local trajectory optimization gives practitioners a concrete recipe for incorporating risk/uncertainty quantification into kinodynamically-constrained motion planning for field/space robotics.

arXiv · cs.ROConceptual

VIScore: Diagnosing Planning-Relevant Quality in Latent World Models

Two math tricks make an AI's imagined 'world' shape actually help it plan.

Some AI systems build an internal mental model of the world to imagine what happens next before acting — a 'world model.' To make that internal model useful, researchers squeeze its representations into a well-behaved statistical shape (like a bell curve) using a regularizing math technique. This paper compares two such techniques, SIGReg and VISReg, which push toward the same target shape but give different control over centering, scaling, and shape of the data. Surprisingly, the one that's better for general self-supervised learning (VISReg) isn't the one that's better for planning — it's the other way around for tasks the model hasn't seen before. This matters because it reveals that 'looks statistically nice' and 'is actually useful for planning' are two different things, and figuring out why should help build more reliable AI planners.

Technical view

The paper contrasts SIGReg and VISReg, two regularizers that both target an isotropic Gaussian latent distribution but differ in how independently they control center, scale, and shape terms, with VISReg additionally benefiting from larger batch sizes for finer distributional approximation. Empirically, SIGReg-style regularization aids self-supervised representation quality but fails to improve planning, while VISReg improves planning success specifically on out-of-domain datasets. The authors use this contrast to probe which latent-space properties actually correlate with downstream planning success rather than assuming SSL quality metrics transfer directly. This suggests practitioners building world models for planning should evaluate regularizers against planning success rather than standard SSL benchmarks alone.

arXiv · cs.ROBuildable

Deployment Is Not Destiny: Robot Recomposition in the Field with Unseen Software, Hardware, and Compute Payloads

Robots that snap on new sensors and brains in the field, no engineer required.

Most robots are built as one tightly-integrated package, so adding a new sensor or software module after deployment usually means calling in an expert and spending hours rewiring things. This paper builds a framework that lets robots recognize and absorb new hardware, software, or computing power on the fly, like plugging in a new gadget and having it just work. A non-expert in the field can snap on a new capability, and it doesn't just help that one robot — the new capability gets shared with other nearby robots too, so weaker robots can borrow power from stronger ones. This matters because it turns rigid, hard-to-update robots into flexible systems that adapt in minutes instead of hours, which is crucial for robots working in remote or changing environments.

Technical view

The framework provides runtime abstractions for 'recomposition' — dynamic integration of previously unseen modular software, hardware, and compute payloads into a running robot without developer intervention. New resources become available not just to the host robot but are shared across a distributed peer network, letting compute-constrained robots offload to newly available remote capabilities. The system reportedly reduces reconfiguration time from hours of expert effort to minutes. This is directly applicable to fleets of heterogeneous field robots where hot-swapping sensors or compute modules and sharing capabilities peer-to-peer would otherwise require custom integration work each time.

arXiv · cs.ROBuildable

Seeing above the waves: A modular sensing framework for data acquisition at sea

A plug-and-play sensor rig lets boats 'see' fog, waves, and other ships reliably.

Building self-driving boats requires good sensors, but the ocean is a brutal testing ground: fog and choppy seas mess with sensors, vessel layouts limit where you can mount them, and missions can run for days. This paper presents a blueprint for a modular sensor kit — combining radar, laser scanning (LiDAR), motion sensors, GPS, ship-tracking radio (AIS), regular cameras, and infrared cameras — that can be swapped and reconfigured for different boats and missions. It's all tied together with a standard robotics software framework (ROS2) so the data can be collected, stored, and tested consistently over long voyages. This matters because it gives maritime autonomy researchers a shared, reproducible way to gather the real-world data needed to make autonomous ships safer and smarter.

Technical view

The paper presents a modular maritime sensing platform integrating RADAR, LiDAR, IMU, GNSS, AIS, RGB, and LWIR (long-wave infrared) cameras plus weather sensors, built on a ROS2-based data management framework. It's designed for long-duration data collection, hardware-in-the-loop testing, and integration with existing shipboard sensor suites, addressing constraints unique to maritime deployment like installation layout limits and hard-to-reproduce conditions such as fog and sea clutter. Researchers could adopt this blueprint directly to standardize multi-modal dataset collection for surface-vessel perception research, replicating its sensor mix and ROS2 architecture rather than building bespoke rigs per project. Its value is largely infrastructural — enabling reproducible benchmarking rather than introducing a novel algorithm.

arXiv · cs.ROBuildable

Aerial Layouting: Design and Control of a Compliant and Actuated End-Effector for Precise In-flight Marking on Ceilings

A flying robot with a springy 'smart hand' draws millimeter-precise lines on ceilings.

Drones can already fly through tight gaps and perform stunts, but tasks like marking exact lines on a ceiling for construction workers need millimeter precision — far tighter than the centimeter accuracy drones normally achieve. This paper designs a drone fitted with a special 'compliant' (springy, force-absorbing) and actuated end-effector — essentially a smart robotic hand-tool — that can push and slide against a surface while correcting for the drone's own wobble. The tool is engineered to stay stable even as it makes contact, letting it lay out precise markings mid-flight. This matters because it opens the door to drones doing real construction-site work, like automatically marking where pipes or walls should go, saving human workers time and effort.

Technical view

The system pairs an aerial vehicle with a novel actuated, compliant end-effector optimized for stability during contact-based interaction, aimed at achieving millimetre-level positioning accuracy for tasks like construction-site layouting and push-and-slide operations — an order of magnitude tighter than the centimetre accuracy typical of aerial contact-inspection tasks. The mention of a 'stability-optimized' design suggests the end-effector's compliance is tuned to decouple vehicle-level disturbances from tool-tip positioning during marking. This is a hardware-plus-control contribution: practitioners interested in aerial manipulation for construction or precision marking could build on the end-effector design and its control scheme for other high-precision contact tasks beyond ceiling marking.

arXiv · cs.CVConceptual

GESTO: Human-Centric Spatio-Temporal Memory for Reasoning in Dynamic Scenes

A robot's memory that tracks not just where objects are, but how you used them.

For a robot to be genuinely helpful around people, it needs more than a map of where objects sit — it needs to remember how people actually interacted with those objects over time, like picking up a cup, filling it, and carrying it to the table as part of a larger goal. GESTO is a memory system that builds a persistent 3D+time map of a space and layers on top of it a two-level record: small individual interactions (like touching an object) and the bigger goal-driven events they add up to (like 'making coffee'). It automatically extracts these interactions from a stream of camera video, links them to consistent objects and places in its memory, and uses the bigger event context to fix mistakes in figuring out which object was involved. This matters because robots that understand human activity structure, not just object positions, can better assist, predict needs, and reason about ongoing tasks.

Technical view

GESTO (Grounded Event and Spatio-Temporal memOry) extends 4D scene graphs — which track objects and places over time — by coupling them with a two-level hierarchy of atomic human-object interactions and higher-level goal-driven events, addressing the gap where existing scene graphs lack activity structure and existing activity models aren't grounded in persistent 3D scenes. From an RGB-D stream, it automatically extracts timestamped interactions, grounds them to persistent scene entities, groups them into events, and uses event-level context to refine uncertain object associations — a feedback loop from coarse to fine-grained understanding. This architecture is directly relevant to building household or assistive robots that need to reason about ongoing multi-step human activities rather than just instantaneous object states, and the grounding/refinement mechanism could be reused wherever noisy object-tracking needs disambiguation from activity context.

arXiv · eess.SYBuildable

Robust Safety Filtering for Input-Constrained Underactuated Linear Systems

A safety net for wobbly robots that keeps them stable even with weak motors and disturbances.

Some robots — like a self-balancing two-wheeled robot — have fewer motors than degrees of freedom to control (called 'underactuated'), and those motors have limits on how hard they can push, while the real world throws unpredictable disturbances at them. This paper builds a 'safety filter': a layer that takes a baseline control command and adjusts it just enough to keep the robot safe, using a combination of worst-case game-theory-inspired control and a disturbance estimator that guesses how much the robot is being pushed around and how wrong that guess might be. The system checks in real time whether there's still a valid safe action available given the motor limits. This matters because it offers a principled way to keep physically constrained robots — like balancing robots or aerial vehicles with limited thrust — safe without abandoning performance.

Technical view

The framework combines a baseline H-infinity controller (derived from a zero-sum differential game against worst-case disturbances) with a disturbance observer that yields both a real-time disturbance estimate and a bound on its transient error; these feed into robust high-order control barrier function (CBF) constraints that adjust the baseline input while guaranteeing forward invariance of the safe set as long as the admissible-input set stays nonempty. For scalar-input systems, they derive an exact feasible input interval whose width serves as a real-time feasibility margin, and they formalize a finite-horizon H-infinity performance bound tracking cumulative deviation from the baseline policy. Validated in simulation on a linearized two-wheeled balancing robot, this gives control practitioners a certifiable, disturbance-aware safety filter that could be layered on top of existing input-constrained underactuated controllers (e.g., segways, legged robots, quadrotors with saturated actuators).

arXiv · cs.ROBuildable

Flex-$π$: A Multi-Stream World-Action Model with Compute Flexibility

A single AI 'imagination' model for robots predicts pixels, 3D shape, and meaning together for free.

Robots that plan by imagining what will happen next usually only predict future camera pixels, missing out on understanding 3D geometry or what objects actually are — information that matters for manipulating things. The researchers discovered a lucky shortcut: an off-the-shelf video-generation AI component (called a VAE, which compresses images into a compact code) already encodes 3D shape information almost perfectly, even though it was never trained to. They exploit this free bonus to train Flex-π, a large 6-billion-parameter model, to jointly predict pixels, 3D geometry, and object meaning (via another AI's semantic features) — all using the same shared internal code, without needing extra sensors or extra training cost. By randomly dropping some of these prediction 'streams' during training, the single trained model can flexibly run in a fast mode using only the essentials or a slower, richer mode using everything. This matters because it makes robot 'imagination' models both smarter about the physical world and adaptable to different amounts of available compute.

Technical view

Flex-π is a 6B-parameter world-action model built on the finding that a frozen video-generation VAE's RGB latent space already near-losslessly encodes 3D pointmaps without any pointmap-specific training — a 'free lunch' the authors exploit to add 3D geometry and DINO-based object-semantic supervision alongside RGB, at zero extra sensor or pretraining cost. All modalities (RGB, pointmaps, semantics, actions) are projected into a shared latent space and jointly denoised inside a Mixture-of-Transformers backbone, with per-stream dropout and cross-modality forcing during training so a single checkpoint can run inference on any subset of streams — from an action-only fast mode to full joint generation. This is a concrete architecture pattern (shared-VAE multi-modal supervision + stream dropout for compute-flexible inference) that practitioners building world-action models could replicate to get 3D/semantic grounding without new sensors, and to trade off latency versus richness at inference time via a single trained model.

arXiv · cs.ROBuildable

Enabling Scalable Kinesthetic Teaching via Observer-based Hand-guiding with Active Support

A robot arm that actively helps you move it, instead of just going limp, when teaching it tasks.

To teach a robot a new task, people often physically grab its arm and guide it through the motion — this is called kinesthetic teaching — but doing this repeatedly is tiring and tired demonstrations are sloppy, which limits how much training data you can collect. Most robots today either offer no help while being guided (you fight the robot's own weight and motors) or need expensive extra force sensors, or rely on learned patterns that don't exist yet for a brand-new task. RHOAS instead treats the guiding process as an active back-and-forth between human and robot, estimating the forces involved using the robot's own model (no extra hardware) and then actively assisting the motion the person seems to intend, essentially lending a hand rather than just being dragged. This matters because it could make collecting large amounts of high-quality robot demonstration data much less physically exhausting, which is a bottleneck for teaching robots new skills.

Technical view

RHOAS (an observer-based hand-guiding scheme) reframes kinesthetic teaching as an actively controlled human-robot interaction rather than the standard passivity-based compliant-control approach that treats guidance as interaction with a passive environment. It uses model-based force estimation — inferring interaction forces from the robot's dynamics model rather than a wrist-mounted force-torque sensor — to actively support operator-intended motions, avoiding both extra hardware costs and dependence on pre-learned motion priors for the target task. This targets the operator-fatigue bottleneck in programming-by-demonstration and imitation-learning data collection; practitioners could adopt the force-observer-plus-active-assistance architecture on existing compliant-control robot arms without adding force-torque sensors to improve demonstration throughput and quality.

arXiv · cs.ROBuildable

Neural Introspection Gating for Adaptive KV-Cache Reuse in Vision-Language-Action Models

Robot brains skip re-checking frames that look the same — unless they start feeling unsure.

Vision-Language-Action models are AI systems that turn a camera feed and a spoken instruction directly into robot motor commands, using a big transformer network that reprocesses visual information at every step. That reprocessing is expensive, so some methods save time by reusing old calculations when the camera image barely changes between frames. This paper adds a twist: the system also watches its own confidence — specifically how close the top two possible next actions are in likelihood — and if it starts to waver, it throws out the shortcut and recalculates properly. That way it stays fast on easy moments but stays careful when things get uncertain, without needing any retraining.

Technical view

Building on VLA-Cache's visual-similarity-based KV reuse for static patches, this work adds a training-free introspective gate: it monitors the logit margin between the top-two predicted action tokens as a zero-cost decoding-time confidence signal, invalidating the cache and forcing full recomputation when the margin falls below a threshold. This couples observation-space caching with model-internal uncertainty rather than relying on visual similarity alone. It's implementable as a drop-in wrapper around any autoregressive VLA decoder without modifying weights, useful anywhere latency-accuracy tradeoffs matter in real-time robot control.

arXiv · cs.ROBuildable

AECNav: Active Evidence Consolidation for Efficient Zero-Shot Open-Vocabulary Object Navigation

A robot hunts for an object it's never seen labeled, weighing clues like a detective before committing.

Object-goal navigation means telling a robot 'find the mug' in a house it's never been in, for objects it was never specifically trained to recognize — that's the 'zero-shot, open-vocabulary' part. Existing approaches are often slow and prone to false alarms because they re-run redundant perception steps and jump to conclusions too quickly, especially when a lookalike object fools them. AECNav tackles this by sharing one visual analysis across all its reasoning steps to cut wasted computation, and by piling up evidence over time — like adding up points of confidence — before deciding a detection is real, explicitly discounting things that just resemble the target. The result is a system meant to be both faster and more reliable at finding the right object in a new place.

Technical view

AECNav reframes zero-shot object navigation as an evidence-driven pipeline built on a shared encoding backbone reused across perception stages (avoiding redundant forward passes), plus an 'evidence consolidation' module that aggregates per-detection observations into cluster-level log-odds beliefs — a Bayesian-style accumulation that separates true target support from distractor-driven false positives. The whole pipeline is training-free, so it can be dropped onto existing open-vocabulary detectors/VLMs. Practitioners building ZSON systems could adopt the log-odds clustering step directly to reduce false target confirmations without added training data.

arXiv · cs.ROBuildable

Dual Stress: Runtime Safety Monitoring for Safety-Constrained MPC Navigation

A self-driving car's internal math homework reveals danger before its cameras and radar do.

When a robot or car uses model-predictive control (MPC) — a planning method that constantly re-solves 'what's the safest path forward' — it produces, as a side effect, numbers called Lagrange multipliers that measure how hard the controller is straining to avoid each obstacle. Normally safety monitors just look at simple geometric facts like how close things are or how fast you'd need to brake. This paper asks whether that 'strain' signal, added up over the planning horizon, can flag danger that pure geometry misses. They tested it against fifteen traditional geometric hazard detectors, all tuned to raise the same rate of false alarms, using simulated cars crossing paths with obstacles. It's a way of getting a 'free' extra warning signal out of a controller a robot is already running.

Technical view

The method computes a horizon-weighted sum of the KKT multipliers from a safety-constrained MPC's constrained optimization at each control step — effectively measuring marginal control effort spent maintaining collision-avoidance constraints — and uses that as a hazard signal complementary to standard geometric monitors (predicted clearance, time-to-collision, required deceleration). It's benchmarked against 15 geometric detectors matched to the same false-alarm budget on preregistered held-out crossing scenarios in a physics simulator. Since the multipliers are already computed by any constrained MPC solver, this is a near-zero-cost addition for any MPC-based navigation stack to evaluate for hazard detection gains.

arXiv · cs.ROBuildable

JEPA-WAM: Stage-Level Joint-Embedding Prediction for World-Action Models in Robot Manipulation

A robot doesn't just predict the next second — it predicts which stage of the task comes next.

Generalist robot policies try to turn what a robot sees and hears (instructions) into actions across many different tasks. Most current systems only predict the immediate next moment — like a few frames of video and matching motion — but that misses the bigger picture of how a task should unfold in stages, like 'pick up the cup' then 'move to the sink' then 'pour it out.' JEPA-WAM adds a second predictor, Stage-JEPA, that specifically forecasts this stage-level progress using a frozen pretrained visual understanding model, working alongside the short-term motion predictor. The idea is that combining 'what happens right now' with 'where the task is headed overall' should make robots better at completing multi-step tasks correctly.

Technical view

JEPA-WAM extends a Motus-based World-Action Model by adding Stage-JEPA, a goal-conditioned Joint-Embedding Predictive Architecture module that forecasts stage-level task progress (as opposed to the WAM's existing short-term video-action chunk prediction) using representations from a frozen V-JEPA2 encoder. This decouples local scene-evolution modeling from higher-level task-progression modeling within the same policy. Practitioners working on long-horizon manipulation could adopt the dual-future decomposition (physical vs. semantic/stage future) as a template for augmenting existing world-action models without retraining their visual backbone.

arXiv · cs.ROBuildable

Embodied Multimodal Grounding for Open-Vocabulary Mobile Manipulation via Semantic 3D Gaussian Splatting

A household robot builds a live labeled 3D map of a room just to know where to grab something.

For a robot to fetch an arbitrary item you name in your house, it needs to line up your words, what it sees, the room's 3D shape, and whether it can physically reach the spot — all at once. This system builds a live 3D map using 'Gaussian Splatting,' a technique that represents a scene as a cloud of small blobs tagged with meaning (so the robot knows 'that blob-cluster is a mug'), updated as the robot looks around from different angles. It uses that shared map to figure out where to stand, avoid obstacles, and guide a learned grasping policy, while carefully only feeding the 3D information into the later stages of the action model so it doesn't disrupt what the robot already learned from pretraining. In 50 real-robot trials, it was tested against other current systems for locating and manipulating objects in open-ended, few-example household settings.

Technical view

The pipeline builds a task-driven local Semantic-3D Gaussian Splatting map from active multi-view sensing, using it as a shared representation for language-conditioned 3D localization, obstacle-aware reasoning, reachability-aware base positioning, and conditioning of a diffusion-based VLA policy. Notably, 3D semantic cues are injected only into late action-expert blocks to preserve pretrained action priors rather than retraining the whole policy. It was validated in 50-trial real-robot evaluations against representative VLA baselines for open-vocabulary mobile manipulation — a concrete architecture pattern (late-stage 3D conditioning) that others could replicate on their own diffusion-policy stacks.

arXiv · cs.RORunnable

TCAM for Autonomous Deformable Manipulation: The RMC2 Champion System for WBCD 2026 Track 4

A robot autonomously grabs one T-shirt from a stack, aligns it, and smooths it for printing — no human hands.

This is a competition report about a robot system that had to pick exactly one T-shirt off a stack (without grabbing several stuck together), load it onto a printing surface, line up the collar precisely, and smooth out wrinkles — all without any human stepping in, which is much harder than it sounds because fabric is floppy and unpredictable. The team's winning approach, called TCAM, was built around the philosophy that better hardware, sensing, and data collection should do as much of the 'hard work' as possible, so the learned control policy has an easier job. They even 3D-printed a custom gripper specifically designed to peel apart single layers of fabric reliably, mounted on a two-armed robot. This system won the WBCD 2026 deformable-manipulation competition's autonomous track.

Technical view

The RMC2 team's champion solution for WBCD 2026 Track 4 combines a custom 3D-printed single-layer-separation gripper on a dual-arm platform with the TCAM (TermiBrain Causal Action Model) learning framework, following a design philosophy of offloading physical interaction complexity to hardware/perception/data rather than the policy alone. The task chain covers single-layer fabric separation, deformable transport, precise collar alignment, and contact-rich surface smoothing, executed fully autonomously. For practitioners in deformable-object manipulation, the transferable insight is the hardware-perception-data co-design principle for reducing what the causal action policy needs to learn end-to-end.

arXiv · cs.ROBuildable

Robust Sliding Mode and Admittance Control of Underactuated Aerial Manipulators for Contact-Based Inspection

A flying robot arm presses steadily against a wall to inspect it without shaking itself off course.

Drones with attached robot arms (aerial manipulators) are useful for touching and inspecting things like pipes or building walls, but they're tricky to control because pushing on a surface fights against the drone's own flight stability. This paper builds a control system for a six-rotor drone with a simple one-joint arm that keeps steady contact with a surface: one part (sliding mode control) keeps the drone flying on the right path despite disturbances, while another part (admittance control) manages how hard it pushes, feeding that push-back into how the drone tilts so the arm stays flush against the surface. Tested in simulation, this combined approach tracked better and resisted the drone-arm 'fighting each other' problem more than a standard PID controller (a simpler, more common control method).

Technical view

The framework combines integral-augmented Sliding Mode Control for trajectory tracking with an admittance control law for contact-force regulation on an underactuated hexarotor carrying a 1-DoF manipulator; measured contact force is mapped into a feedforward attitude correction, while the arm actively compensates tilt to maintain surface alignment during sustained contact. Software-in-the-loop simulations show improved tracking accuracy and disturbance/coupling rejection versus a traditional PID baseline. This offers a concrete controller architecture (SMC + admittance + feedforward attitude coupling) that others building contact-based aerial inspection platforms could implement and benchmark against PID directly.

arXiv · cs.ROConceptual

OAA: Three Phases of Vocal Guidance in Human-Drone Teleoperation

People guiding a drone by voice naturally speak in three predictable acts, like a mini play.

When someone verbally guides a drone (or another person) to a location, this study found their speech and movement isn't random — it consistently breaks into three phases: first Orientation (figuring out which way to face/go), then Approach (heading toward the target), then Adjustment (fine-tuning position once close). The researchers discovered this by recording motion and speech from two setups — people guiding each other by pointing, and people teleoperating a drone with a gamepad — then using statistical 'change point' detection to automatically spot where behavior shifts in the movement data. They confirmed the phases were real using standard statistical tests, and noticed the words people use also shift by phase, like using rotation words during Orientation but not during Approach. This matters for building voice-controlled robots that can anticipate what stage of guidance a person is in and respond appropriately.

Technical view

Using motion-capture and speech corpora from human-human pointing guidance (N=10 dyads) and human-drone gamepad teleoperation (N=29 dyads), the authors apply change-point detection to 3D trajectory signals to automatically segment guidance behavior into three phases — Orientation, Approach, Adjustment — validated statistically via Kruskal-Wallis tests (p<.001). They further show three lexical families (e.g., rotation vocabulary concentrated in Orientation, sparse in Approach) replicate consistently across both the human-human and human-drone configurations. This gives designers of voice-controlled teleoperation systems an empirically grounded phase model and associated lexical cues to build adaptive, phase-aware speech interfaces rather than treating commands as a stationary stream.

arXiv · cs.CVBuildable

Precise Top-Layer Fabric Segmentation for Fabric Destacking with Edge- and Shape-Aware Deep Networks

Teaching robots to peel exactly one layer off a stack of near-identical fabric.

Robots that pick clothing or textiles from a stack struggle to tell where the top piece ends and the next begins, since the layers look almost identical and the seam between them is subtle. This work builds a neural network that doesn't just guess "fabric or not" pixel by pixel, but also pays special attention to edges and to overall shape, comparing against a reference outline pulled from CAD design files (like a digital blueprint). Two extra "helper" branches push the main network to get boundaries and shapes right during training, without slowing it down later. This matters for automating tasks like laundry folding or garment assembly, where grabbing the wrong layer ruins the process.

Technical view

The method augments a standard encoder-decoder segmentation backbone with two auxiliary supervision branches — an edge-aware branch enforcing accurate boundary maps and a shape-aware branch that aligns predicted masks to CAD-derived reference shapes — trained jointly to regularize the backbone toward precise top-layer masks despite low inter-layer visual contrast. This multi-task supervision scheme improves boundary delineation and shape consistency without adding inference-time cost. Practitioners in robotic manipulation (destacking, garment handling) could adopt the auxiliary-branch idea with their own CAD/mask priors on existing segmentation backbones.

arXiv · cs.ROBuildable

When Your State Estimator Has Lost The Plot: Detecting Estimator Failures Via Spectral Analysis

Robots can now catch their own navigation software 'losing the plot' by listening to its frequency signature.

Robots like drones rely on internal software (a state estimator) that fuses sensor data to figure out where they are and how fast they're moving — but that software can quietly fail when sensors get confused by unexpected noise or conditions. Instead of trusting the estimator's own confidence score, which is often falsely optimistic, this method looks at the "shape" of recent velocity estimates in frequency space, similar to noticing a wobbling wheel by its vibration pattern, to spot when something's going wrong. It works regardless of which sensors the robot uses — cameras, lidar, or radar. Catching a failing estimator early like this could prevent a drone from crashing.

Technical view

The approach performs spectral (frequency-domain) analysis of recent velocity-estimate windows to detect anomalous power distributions indicative of estimator degradation, avoiding reliance on estimator-reported covariances (often overconfident) or learned models tied to specific training distributions. It's evaluated as sensor-agnostic across visual-inertial, LiDAR-inertial, and radar-inertial odometry pipelines using real outdoor aerial flight data containing induced estimator failures. Practitioners could integrate this as a lightweight, backend-independent health monitor on top of any velocity-estimating odometry stack.

arXiv · cs.ROConceptual

Toward the Cognitive--Physical Limits of Embodied Intelligence through a World-Model-Centric Autonomous Racing Agent

Pushing a self-driving race-car AI to the literal edge of crashing to learn its true limits.

Most robot AI systems today are tested cautiously, well within safe limits, so we don't really know how they behave when pushed to the edge of what's physically possible. Autonomous racing is used here as an extreme stress test, since a race car must perceive its surroundings and react at high speed while its tires and physics are almost maxed out. The researchers build an AI with an internal "world model" — essentially a learned simulation of how the car and track interact — trained on both its near-crash failures and successes, refining its sense of danger and capability together. This matters because building genuinely robust embodied AI (robots acting in the physical world) requires understanding not just what they can do safely, but exactly where and how they break.

Technical view

The system is a world-model-centric agent for autonomous racing that learns predictive dynamics models from both near-limit successes and failures, jointly refining cognitive (perception/decision) and physical (control) boundaries rather than treating them separately. It targets high-frequency localization/perception fused with adversarial multi-agent interaction and near-saturated vehicle dynamics as a testbed for embodied-intelligence capability limits. This suggests a template for stress-testing other embodied systems by explicitly modeling failure-adjacent regimes rather than avoiding them.

arXiv · cs.ROBuildable

BooST: Bridging Semantics and Motions for Efficient Skill Transfer

A two-step trick teaches robots skills that transfer by learning both 'what to do' and 'how to move.'

When robots learn reusable skills, like "pick up an object," they usually capture either the high-level goal (what to do) or the low-level physical motion (how to move), rarely both — making the learned skill a weak starting point for new tasks or robots. BooST fixes this with a two-stage system: it first trains a special encoder that links language/vision meaning with motion patterns using a technique called VQ-VAE, which compresses complex data into a discrete, learnable "vocabulary," so each skill carries both semantic and physical information together. This bridges the gap so a robot facing a new task or environment needs far less new training data to adapt. It matters because it makes robot learning more sample-efficient and robust to visual changes, a key bottleneck for real-world deployment.

Technical view

BooST is a two-stage skill-abstraction framework that first trains a cross-modal VQ-VAE to jointly encode semantic intent and low-level motion dynamics into a shared discrete latent space, then uses this representation as a prior for downstream policy learning/transfer. By unifying "what" (semantic) and "how" (motion) in one skill representation, it aims to satisfy generalization, robustness to perturbation, and deployment efficiency simultaneously — properties prior single-modality skill methods only partially achieve. Practitioners could adopt the cross-modal VQ-VAE pretraining stage to bootstrap policies with reduced in-domain data requirements.

arXiv · cs.ROBuildable

Nonlinear Model Predictive Control via Sequential Convex Programming for Drone-to-Drone Docking

Math that lets one drone smoothly and safely dock onto another mid-flight, even in gusty wind.

Getting one flying drone to physically dock with another moving drone mid-air is tricky, especially when wind or other disturbances push the target around unpredictably. This work treats docking as an optimization problem: given the drone's current state and a simplified physics model that accounts for disturbances, it repeatedly solves — in real time, using a technique called sequential convex programming, which breaks a hard nonlinear problem into a series of easier straight-line approximations — for the best trajectory to reach the docking point. It also handles noisy sensor readings by predicting the relative motion between drones. Tested in a realistic physics simulator, the approach reliably converges to a successful dock even when the target is moving.

Technical view

The paper formulates drone-to-drone docking as a finite-horizon nonlinear optimal control problem over a reduced-order model augmented with disturbance states, solved online via sequential convex programming (SCP) within an MPC receding-horizon loop, with state estimation handling noisy relative-motion measurements. It's validated in high-fidelity MuJoCo rigid-body simulation against stationary and constant-velocity targets, reporting reliable convergence while respecting geometric capture constraints. Practitioners building aerial docking/recovery systems could reuse the reduced-order-model-plus-SCP-MPC formulation directly, as it's designed for real-time onboard feasibility.

arXiv · cs.ROBuildable

JitTrack: Onboard Multi-Object Tracking Against Viewpoint Jitter for Agile UAVs

Teaching a jittery drone camera to keep track of multiple moving targets without losing them.

When a drone flies aggressively, its camera shakes and jerks, so objects can jump wildly between video frames, confusing software trying to track multiple moving targets at once. JitTrack tackles this with a transformer-based tracker (an AI good at connecting related pieces of information) enhanced with two tricks: better recognition of newly appearing targets, and a correction step that predicts how much the camera itself moved so it doesn't mistake camera shake for target movement. Unlike most prior work tested only on pre-recorded video, this system is built and tested for real onboard use during actual flight. This matters for tasks like search-and-rescue or wildlife monitoring, where a drone must actively follow moving subjects despite its own violent motion.

Technical view

JitTrack is a query-based transformer multi-object tracker for onboard UAV deployment that adds semantic refinement for improved detection of emerging targets and motion-aware query rectification to compensate for ego-motion-induced target displacement caused by aggressive attitude changes. Unlike prior UAV MOT work evaluated offline on benchmarks, it targets real-time, active tracking under real camera jitter and drone dynamics. Practitioners building active-tracking UAV payloads could adopt the query rectification module to decouple ego-motion from target motion in any transformer-tracker pipeline.

arXiv · cs.RORunnable

Lost in Reconstruction: Aligning Action Representations with Language in Vision-Language-Action Models

Robot actions get 'lost in translation' when compressed — this fix keeps their meaning intact.

Robots trained to follow instructions like "push the block gently" versus "shove it hard" need to capture not just where things end up, but how the action was performed — yet current systems compress action sequences into simplified codes optimized purely to reconstruct the motion numerically, which can accidentally erase these meaningful distinctions. SALT fixes this by adding an extra training goal: after compressing an action into discrete codes using a VQ-VAE (a method for turning continuous data into a compact vocabulary of symbols), a frozen language-understanding AI must be able to recover the original instruction just from those codes. This forces the compressed representation to actually preserve the verb's meaning, not just its raw trajectory shape. Robots trained this way follow instructions far more successfully — 71.9% versus 42.7% success in simulated manipulation tests.

Technical view

SALT extends a VQ-VAE-style action tokenizer with an auxiliary objective requiring a frozen vision-language model to reconstruct the original language instruction from quantized action latents, countering the tendency of pure L1/L2 reconstruction losses to discard verb-grounding information not reflected in raw visual state changes. On BridgeV2-derived data, VLA policies trained with SALT-tokenized actions reach 71.9% average success in SimplerEnv versus 42.7% for reconstruction-only tokenization, a substantial gain attributable purely to the tokenizer's representation quality. Practitioners building VLA policies could swap in SALT's tokenizer as a drop-in replacement to improve instruction-following fidelity without touching the downstream policy architecture.

arXiv · cs.ROBuildable

PBD-AG: Persistent Baseline-Delta Active Graphs with Uncertainty-Aware Inspection for Long-Horizon Service Robots

A robot's memory system that separates the furniture from what changed on the shelves.

A service robot working in the same building for a long time needs a mental map that's both stable (walls and furniture don't move) and updatable (objects on a table get added or shuffled), but existing approaches either drift from accumulated sensor errors, freeze the map so it can't reflect real change, or make vague high-level guesses without solid 3D evidence. PBD-AG splits the world model into two parts: a verified "baseline" of permanent fixtures the robot builds by exploring, and a revisable "delta" layer of object states updated as things change, each tracked with a confidence score across properties like identity and existence. The robot actively inspects what it's found to firm up its beliefs, rather than passively logging camera frames. This matters for robots meant to operate reliably in homes or offices over weeks and months, not just single short runs.

Technical view

PBD-AG maintains a persistent scene graph decoupled into a robot-verified static baseline (structural fixtures grounded via autonomous exploration and inspection) and a revisable delta layer tracking dynamic object events, with reliability-weighted beliefs spanning geometry, semantics, identity, existence, and support relations, using geometric visibility reasoning to decide what needs re-inspection. This design directly targets failure modes of pure online SLAM-style mapping (error accumulation), static maps (can't capture change), and holistic VLM predictions (no verifiable 3D grounding). Practitioners building long-horizon service robot memory systems could adopt the baseline/delta decoupling and uncertainty-aware inspection policy as a general pattern for balancing map stability against real-world change.

arXiv · cs.HCBuildable

Elbow Angle Guidance System Based on Surface Haptic Sensations Elicited by Lightweight Wearable Fabric Actuator

A soft fabric sleeve gently nudges your elbow into place using inflatable muscle-like tubes.

This is a wearable device that teaches or guides your arm's elbow angle using touch instead of sound or sight. It's made of soft fabric with two 'McKibben' artificial muscles sewn in — these are simple rubber-tube actuators that contract like real muscle when inflated with air. As they inflate and deflate, they press on your skin in a way that naturally nudges your elbow to bend or straighten, and because the whole thing is lightweight fabric, it moves with you instead of blocking your motion. The goal is a haptic (touch-based) guidance system for things like physical rehab or posture training that feels intuitive rather than robotic.

Technical view

The system uses two fabric-integrated McKibben pneumatic artificial muscles to deliver directional surface haptic cues that intuitively map to elbow flexion/extension, avoiding the bulk and kinematic interference of rigid exoskeleton-style haptic devices. Actuation intensity is modulated to both sense/estimate and guide elbow joint angle, effectively closing a haptic feedback loop with a soft, wearable actuator. This is relevant to labs building lightweight guidance or biofeedback systems for rehabilitation, sports training, or teleoperation cueing without restricting natural range of motion.

arXiv · cs.HCBuildable

Automatic Field-of-View Adjustment for a View-Expansive Microscope via LSTM-Based Gaze and Pipette Motion Interpretation

AI watches a fertility doctor's eyes and needle to auto-zoom the microscope during IVF injections.

During a common fertility procedure called ICSI (where a single sperm is injected into an egg), doctors constantly have to zoom in and out to see fine detail versus the bigger picture, which slows things down. This system uses a special microscope that can capture both a wide view and a sharp zoomed-in view at once without physically swapping lenses, using tiny steerable mirrors and a fast camera. An AI model then watches where the doctor's eyes are looking and how the injection needle (pipette) is moving to predict what zoom level they'll need next, and adjusts automatically. The point is to keep the procedure flowing smoothly and reduce the tedious manual fiddling that eats up time in a delicate medical process.

Technical view

The system pairs a galvanometer-mirror-based multiview microscope (single objective, high-speed vision) with an LSTM that predicts the required field-of-view size from real-time pipette position/velocity and operator gaze tracking, trained on real ICSI procedure data. This removes the latency of mechanical lens switching and illumination changes, enabling continuous FOV adaptation. It's a concrete template for anticipatory AI control in other microscopy or teleoperated fine-manipulation tasks where operator gaze and tool kinematics predict intent.

arXiv · cs.AIConceptual

Hidden in Plain Sight: Diffusion-Based Unrestricted Robotic Attacks on Vision-Language-Action Models

Researchers hide invisible attacks inside normal-looking images to hijack robot AI brains.

Vision-Language-Action models are AI systems that let robots see a scene, understand instructions, and decide how to move — but this paper shows they can be tricked. The attack, called DURA, creates a patch of image that looks completely natural (not the weird static-like noise typical of past attacks) but secretly steers the robot to do something the attacker wants. It works by using a diffusion model (the same kind of AI behind image generators) to craft the patch, and it can work even without inside access to the target robot's AI, just by seeing its output actions. This matters because it exposes a real safety gap: a sticker or altered object in the real world could silently hijack a robot's behavior.

Technical view

DURA optimizes adversarial patches along the latent trajectory of a pretrained diffusion model rather than perturbing pixels directly, producing visually natural, unrestricted adversarial examples that evade typical perturbation-norm defenses. It supports both white-box (gradient access) and a more practical black-box setting requiring only the victim VLA's predicted actions, and is shown to reliably steer manipulation behavior toward attacker-specified targets. This is directly useful for red-teaming and robustness research on deployed VLA-controlled robots, and motivates defenses beyond pixel-space adversarial training.

arXiv · cs.ROConceptual

Hip Energized Monopedal Hopping

A one-legged hopping robot steals energy from its own balance-correcting wobbles to keep bouncing.

This is about a robot that hops on one leg, like a pogo stick with a body, and needs to keep re-adding energy to keep moving since friction and damping bleed it away. Normally, the torque a robot uses just to keep from pitching forward or backward (tipping) is 'wasted' effort spent purely on balance. This paper's trick is to shift the robot's center of mass so that same balance-correcting torque also injects useful energy into the hop, and a new control strategy decides how to split that energy between hopping higher versus moving forward faster. It's validated with math (closed-form analysis) and simulations on robot models, and it matters because it's a more efficient, elegant way to keep legged robots hopping without extra dedicated energy sources.

Technical view

The authors present a stepping/control strategy for pitch-unlocked planar monopedal hoppers where reaction torques from a standard PD+feedforward pitch stabilizer are repurposed to counteract damping losses, achieved by shifting the center-of-mass location to amplify stabilization torque as an energy source. A new stepping policy tunes the energy split between radial (height) and angular (forward speed) degrees of freedom, and hybrid averaging analysis yields closed-form fixed points and eigenvalues characterizing gait stability and tunability. Validated on a 5-link biped model and a detailed Penn Jerboa model, this gives legged-robotics practitioners an analytically grounded, low-actuation way to sustain energy-efficient hopping gaits with tunable speed/height tradeoffs.

arXiv · cs.LGBuildable

Dreamer-SAC: Off-Policy Learning in Latent World Models for Sample-Efficient Autonomous Driving

A self-driving car AI dreams up practice scenarios in its head to learn faster with less real driving.

Self-driving AI usually needs tons of real (or simulated) driving experience to learn good behavior, which is slow and expensive. 'World models' let the AI build an internal mental simulation of driving and practice inside its own imagination, but if that imagined world is inaccurate, the AI can learn bad habits. Dreamer-SAC combines a world-model AI (which predicts what will happen next) with a proven decision-making algorithm (Soft Actor-Critic) that trains directly on the AI's internal, compressed representation of the world using a mix of real short driving snippets and imagined trajectories. This lets it learn safe, efficient driving behavior with far less real driving data than typical AI methods, while limiting how much the AI's flawed imagination can mislead it.

Technical view

Dreamer-SAC couples a recurrent state-space world model (RSSM, à la Dreamer) with off-policy SAC trained in latent space, using n-step target estimation over short-horizon imagined rollouts combined with real transitions plus multi-objective (efficiency + safety) supervision to bound model-bias exploitation. It's benchmarked against DreamerV3, SAC, and PPO in autonomous driving tasks, reportedly beating them on both sample efficiency and driving performance. Practitioners building sample-efficient AV policies could adopt this latent off-policy critic-training scheme in existing Dreamer-style pipelines, particularly where real-world rollout cost is high and reward objectives are multi-faceted.

arXiv · cs.ROBuildable

Real-World Cooperative Bimanual Dexterous Grasp of Large Objects from Single-View Observations

Two robot arms team up to lift and carry big awkward objects using just one camera view.

Picking up a large object with two robot arms working together (like carrying a big box) is much harder than one arm grabbing a small item, especially when the robot only has one camera angle instead of a full 3D scan. This project built a real-world (not just simulated) system: it collected a dataset of joint movements, camera images, and force sensor readings from real bimanual grasps, then trained a generative AI (a diffusion model, similar to those used for image generation) to propose how each arm's joints should move based on a partial 3D point-cloud view of the object. A final execution layer plans the motion and makes small real-time adjustments to keep the grasp stable and physically realistic. This matters because most prior bimanual grasping work stayed in simulation, and moving it to messy real-world conditions is a genuine engineering leap.

Technical view

The pipeline combines a multimodal real-world dataset (joint angles, RGB(-D) vision, force signals) with a DDPM-based generative module that maps segmented single-view point clouds to joint-level dual-arm grasp configurations, followed by a motion-planning-plus-online-refinement executor that enforces physical stability during execution. This directly targets the sim-to-real gap in cooperative (simultaneous, not sequential) bimanual grasping of large objects. Roboticists working on dual-arm manipulation could reuse the dataset structure or diffusion-based grasp generation module as a drop-in component for point-cloud-conditioned grasp synthesis under single-view constraints.

arXiv · cs.ROBuildable

A Neural Network Based Teleoperation for Remote Controlled Vehicles

A neural network lets you smoothly steer a remote vehicle even through laggy, unpredictable signals.

Remotely driving a vehicle (like a rover or drone-car) over a network is hard because of signal delay and because the operator can't feel real-world forces like wind drag or road tilt that the vehicle experiences. This system tackles delay using a known trick called 'wave variables' that mathematically guarantees the control stays stable even when lag is unpredictable, and pairs it with a neural network (a Radial Basis Function Network) that learns and compensates in real time for the vehicle's specific quirks — how it handles turns, drag, and traction — without needing a precise physics model beforehand. Unlike older versions of this idea built for robot arms with two-way force feedback, this one is custom-tailored to how cars actually drive (forward speed and steering separately). The payoff is smoother, safer remote driving that adapts on the fly instead of needing constant re-engineering.

Technical view

The framework combines the Wave Variable (WV) transformation for passivity-guaranteed stability under stochastic communication delay with an adaptive Radial Basis Function Network (RBFN) that compensates unmodeled vehicle dynamics (aerodynamic drag, bank angle, nonlinear tire-road interaction) online. It introduces decoupled adaptive laws for longitudinal and lateral vehicle dynamics, differing from prior WV+neural-network work built for bilateral robotic-arm teleoperation, and is positioned as lighter-weight than model-predictive-control approaches since the RBFN requires no precise vehicle model and adapts rapidly online. This offers a reusable stability+adaptation control template for teleoperated ground vehicles operating over unreliable, delay-prone links.

arXiv · physics.flu-dynRunnable

Wind-Informed Rapid Flight-Planning in Complex Urban Topologies via Machine Learning and Experimental Validation

An AI predicts dangerous wind gusts between city buildings so air taxis can plan safer flight paths.

As flying taxis and delivery drones become more real, one big danger is turbulent wind swirling between buildings in cities, which is hard to predict and can be hazardous to fly through. This project trains a machine-learning model to quickly estimate how wind will flow around buildings just from the building shapes and the incoming wind direction, instead of running slow, expensive physics simulations every time. From that predicted wind pattern, they compute a 'danger score' map across the 3D space that factors in turbulence severity and closeness to buildings, then use a pathfinding algorithm to plot a route through the safest, least turbulent corridor. They tested this with real flight experiments, not just computer simulations, showing it can genuinely help route aircraft safely through gusty urban airspace.

Technical view

The system trains a learned surrogate model to rapidly approximate CFD-like flow fields from building geometry and incident wind conditions, replacing costly real-time fluid simulation, then derives a volumetric 'flight challenge' scalar field combining turbulence/flow severity with structure proximity. A cost-minimizing pathfinder searches this field for a wind-aware, low-risk trajectory, and the full pipeline is validated with real flight tests, not just simulation. This is a practical building block for urban air mobility flight planners needing sub-real-time wind-hazard-aware routing without running full CFD online.

arXiv · cs.ROBuildable

FACT: Failure-Aware Causal Training for World-Action Models

Robots usually only learn from successes — this one also learns from its own screwups.

Many robot AI systems learn to act by predicting a video of what should happen next, then figuring out the actions that get them there — but they're trained almost entirely on demonstrations that succeed, so they never learn what a bad move actually leads to. FACT fixes this by feeding the model's own executed actions back into its video predictions, including the failed ones, so a dropped object or a missed grasp becomes a real lesson instead of being thrown away. It also tracks 'task progress' alongside the video, so the model learns to recognize when things are going wrong, not just what wrong looks like. The payoff is a robot brain that's better calibrated about consequences, because it has actually seen bad outcomes during training, not just good ones.

Technical view

FACT is an action-conditioned world-action model that jointly predicts future video and task-progress conditioned on the executed action, rather than only on successful rollouts as in typical WAM/inverse-dynamics or goal-video pipelines. By conditioning explicitly on the action taken, failure rollouts become valid supervised targets (predicted video + degraded progress) instead of being filtered out, giving the progress predictor exposure to both success and failure trajectories. This should improve downstream policy robustness and failure detection since the learned dynamics model captures a broader action-consequence distribution. Practitioners building WAM-style robot policies could adopt this action-conditioned failure supervision to reduce the success-only bias inherent in video-based world models.

arXiv · cs.ROBuildable

Whole-Body Planning for Humanoids Navigating Confined Spaces via Self-Collision Avoidance References

Teaching a human-shaped robot to squeeze through tight spaces without tripping over its own arms.

Humanoid robots have to navigate narrow, cluttered spaces like doorways or cramped rooms, but this is really hard because the robot's own body parts can bump into each other, not just the environment. Standard planning tools treat the robot like a simple dot or stick figure moving through space, which works fine in open areas but leads to bad, stuck plans in tight quarters. This paper builds a three-stage planner that reasons about the actual reachable volume of the robot's limbs and torso, uses smooth math (differentiable collision avoidance) to steer around obstacles and self-collisions, and produces a rough guiding path that a more detailed physics-aware planner then refines over long distances. Finally, they use those high-quality plans to train a reinforcement-learning policy that can react and adjust in real time, so the robot learns from good examples rather than starting from scratch.

Technical view

The authors propose a three-stage whole-body planner for humanoid navigation in confined spaces: (1) kinematic path planning directly over kinematically reachable rigid-body volumes rather than particle abstractions, (2) differentiable collision avoidance embedded in a reachability-constrained formulation to produce volume-informed guide trajectories, and (3) a full-order trajectory optimizer that uses these guides to avoid poor local minima over long horizons. The resulting optimized trajectories then serve as reference data to train a residual reinforcement learning policy, combining the reliability of trajectory optimization with the reactivity of learned control. This addresses a known failure mode where spline-based planners on point/particle abstractions get stuck in local minima under dense self-collision and environmental constraints — relevant to anyone building humanoid navigation stacks for warehouses, homes, or disaster sites.

arXiv · cs.ROBuildable

Navigating the Proximity-Safety Balance: Constraint Decomposition for Human Following in Pedestrian Crowds

Teaching a robot to tail a person through a crowd without losing them or plowing into anyone.

Imagine a robot assistant trying to follow a specific person through a busy crowd — stay too close and it risks bumping into people, stay too far back and it loses track of them, especially since it can't predict exactly how strangers around it will move. Most robot-training approaches lump 'stay close' and 'stay safe' into one blended reward number, which makes it hard to tune how cautious versus clingy the robot should be. This paper instead splits the problem apart: one simple reward just for successfully following the person, plus separate 'cost budgets' for things like getting too close to pedestrians, each with its own adjustable safety threshold that has a clear real-world meaning. That separation lets engineers dial in exactly how aggressive or cautious the robot should be, rather than fumbling with abstract reward weights that don't map to anything intuitive.

Technical view

The paper formulates human-following in dense pedestrian crowds as a constrained (safe) reinforcement learning problem, decomposing the objective into a sparse task reward (successful following) and multiple independent cost constraints (e.g., pedestrian proximity, obstacle proximity) each governed by an interpretable threshold, rather than folding everything into one dense reward via implicit weight tuning. This constraint-decomposition approach in a multi-constraint RL formulation lets practitioners directly set behavioral bounds (e.g., minimum pedestrian clearance) instead of searching reward-weight space, which should generalize better across crowd densities and improve interpretability/debuggability of the resulting policy. It's directly applicable to mobile service robots or delivery robots operating in human-dense environments.

arXiv · cs.RORunnable

XPolicyLab: A Unified Standard and Open Ecosystem for Robot Policy Evaluation and Deployment

A universal adapter so any robot AI can be tested in any robot simulator without custom glue code.

If you have N different robot AI models and M different testing environments, hooking them all up to each other normally takes N times M separate integration efforts — a nightmare as both numbers grow. XPolicyLab solves this like a universal power adapter: it defines a common format for what a robot 'sees,' 'does,' and records, plus a simple plug that lets any policy talk to any environment, so you only need N+M pieces of glue instead of N×M. It also splits the 'thinking' part (running the AI model) from the 'acting' part (running the simulated world) so each can use its own software stack locally or over a network without conflicts. The team proved this works by connecting 42 different robot AI models to this shared standard, cutting out huge amounts of duplicated custom code.

Technical view

XPolicyLab defines standardized observation, action, and trajectory schemas plus a minimal adapter interface (observation updates, action prediction, batched execution, episode reset) to reduce the integration cost of connecting N robot policies to M evaluation environments from O(NM) to O(N+M). Its dependency-isolated client/server architecture decouples policy inference from environment execution so each retains its native dependencies and can run locally or remotely, avoiding the version-conflict hell common in robot learning stacks (e.g., conflicting simulator/ML framework requirements). The ecosystem currently integrates 42 policies with standardized install/debug/serve/evaluate workflows, making it a practical infrastructure layer for benchmarking or CI-testing robot policies across simulators — useful for labs wanting to compare policies without maintaining bespoke integration code per pair.

arXiv · cs.RORunnable

RoSE: A Robotic Soft Esophagus for Endoprosthetic Stent Testing

A robotic fake esophagus that swallows so scientists can test cancer stents without risking real patients.

When esophageal cancer narrows the food pipe, doctors often insert a mesh tube called a stent to hold it open, but these stents can slip out of place later, which weakens a patient's ability to swallow safely — and there haven't been enough clinical trials to know which stent designs prevent this. RoSE is a soft, robot-built model of a human esophagus that mimics real swallowing motions, letting researchers test different stents in a lab instead of on patients. They installed two stents with different stiffness levels into RoSE and measured how hard each one pushed against the esophagus walls (its 'radial force'), since that force is believed to be key to keeping the stent from migrating. This gives doctors and device makers a safe, repeatable way to figure out which stent designs actually stay put, filling a gap left by limited human trials.

Technical view

RoSE is a bio-mimicking soft robotic testbed that replicates esophageal peristalsis to serve as an in vitro platform for evaluating endoprosthetic stents used in dysphagia management from malignant esophageal strictures. The study implants two stents (A and B) with differing radial stiffness and directly measures radial force (RF) exerted on the simulated esophageal wall alongside endoscopic manometry, testing the hypothesis that RF is the primary determinant of stent migration risk. This provides a reproducible, ethically unconstrained alternative to randomized controlled trials for characterizing stent-tissue interaction, letting device engineers iterate on stent stiffness/design and generate quantitative RF-migration data to inform stenting guidelines currently lacking robust clinical evidence.

arXiv · cs.ROConceptual

Energy-Structured Latent World Models with Neural Time Fields for Physically Constistent Open-World Motion Planning

Giving a robot's imagination the laws of physics baked in, not just guessed from data.

When robots plan their movements by imagining what will happen next, most AI 'world models' just learn loose statistical patterns from data, without any built-in sense of real physics like energy or momentum — which makes them unreliable in unfamiliar, open-world situations. This paper's model instead forces its internal representation of the world to explicitly track energy and momentum, the same quantities physicists use, so that predicted transitions between states must obey physical rules like energy dissipation rather than being freely invented. It learns from a mix of camera-with-depth footage and motion-sensor data, so its 'imagined futures' are grounded in how objects and forces actually behave. The result is a planning system whose imagined paths are more trustworthy and reusable across new environments, because it's reasoning with physics rather than just pattern-matching.

Technical view

ELWM (Energy-Structured Latent World Model) constrains its latent state to explicitly encode energy and momentum, enforcing causal state transitions through dissipation and control 'ports' — a structure reminiscent of port-Hamiltonian/passivity-based system modeling — rather than learning an unconstrained latent dynamics function as in typical latent world models. Trained on multimodal RGB-D and inertial data, this architecture aims to guarantee physically consistent forward predictions and produce reusable physical knowledge that transfers better to unseen open-world navigation scenarios than implicit latent dynamics. The model is further coupled with neural time fields for motion planning, letting practitioners derive feasible, physically grounded trajectories directly from the structured latent rollouts — a promising direction for anyone building physics-informed model-based RL or planning systems for embodied agents.

arXiv · cs.ROBuildable

Entanglement-Free Trajectory Planning for Tethered Mobile Robots with a Slack Tether

Plotting a robot's path so its own leash never gets tangled around obstacles.

Some mobile robots are tethered — physically connected by a cable to a fixed point, like an anchor or power source — and if the robot isn't careful about where it drives, that cable can loop around obstacles and get stuck or tangled, especially since a slack (loose) tether doesn't just hang in a predictable shape but flops around based on the robot's motion and outside forces. This paper builds a path-planning method that thinks ahead about how the tether will move and twist as the robot drives, not just where the robot's body goes, so it can guarantee the path stays untangled around static obstacles. It's a physics-aware planning problem: the algorithm has to reason jointly about robot dynamics and cable dynamics at the same time. This matters for robots doing tasks like inspection, mining, or underwater work where a cable is essential but tangling could strand the robot.

Technical view

The paper presents a motion planning algorithm for tethered mobile robots operating with a slack (non-taut) tether, where tether shape depends not only on obstacle geometry but on tether dynamics, robot trajectory, and exogenous forces, making entanglement prediction significantly harder than the taut-tether case. The method computes dynamically feasible trajectories that are provably entanglement-free with respect to static obstacles by explicitly tracking an entanglement-state definition jointly with robot and tether dynamics during planning, rather than post-hoc checking. This is directly applicable to tethered inspection/rescue/underwater robots where cable management is safety-critical, and the entanglement-state formulation could be extended or reused as a general dynamic constraint in other tethered-robot planners.

arXiv · cs.ROBuildable

Agentic Harnesses: LLM-Driven Verification Layers for Robot Autonomy

A committee of AIs double-checking a robot's plan before it's allowed to act.

As AI systems start planning real robot actions, there's a real risk they'll suggest something unsafe, unethical, or just wrong — and unlike a human, they might not remember past safety incidents or could be tricked by adversarial inputs. This paper inserts a checkpoint between 'the AI decides what to do' and 'the robot actually does it': a panel of large language models that each reason step-by-step about whether a proposed action is actually okay, then combine their verdicts into one judgment, similar to how a group of experts might vote and a top model synthesizes their opinions. This 'LLM-as-a-judge' layer acts like a safety gate, blocking risky or misaligned plans before they ever reach the robot's motors. It's a practical way to add a layer of caution to increasingly autonomous robot-planning systems without having to redesign the planners themselves.

Technical view

The authors propose an LLM-driven verification middleware layer sitting between robot action-planning models and execution, using an LLM-as-a-Judge ensemble that combines chain-of-thought reasoning across multiple models and synthesizes their outputs — described as blending mixture-of-experts routing with self-consistency voting — to assess action permissibility before gating plans through to execution. This targets specific failure modes of robotics planning models: goal-misaligned or unethical action suggestions, lack of persistent memory of prior safety incidents, and vulnerability to adversarial manipulation of the planning pipeline. Practically, this is a model-agnostic safety layer that could be bolted onto existing robot planners/policies as a runtime filter, and the ensemble-judge design offers a template for building auditable, multi-model safety gates in other agentic/robotic autonomy stacks.

arXiv · cs.ROBuildable

RynnValue: Scaling Robotic Value Foundation Models with Temporal Distance

Teaching robots to judge 'how far am I from done?' using millions of unlabeled clips.

Robots that learn from trial and error need some way to know if they're getting closer to finishing a task, but grading progress usually requires humans to painstakingly label how 'done' each moment of a video is. RynnValue sidesteps that by using time itself as the label: if a robot clip ends with the goal achieved, then every earlier frame gets scored by how many seconds it was from that success, no human judgment needed. Because timestamps are free, the team could train on over 7,000 hours and 3 million video clips from many different robots and tasks. The payoff is a general-purpose 'value model' that can plug into many robot learning pipelines to tell them whether an action is helping or hurting.

Technical view

RynnValue reframes value learning as predicting temporal distance (directed cost-to-go) between an observation and a language-specified goal, replacing preference or normalized-progress supervision that doesn't transfer across embodiments. Because labels are derived purely from clip timestamps, the approach scales to ~7,000 hours / 3M instruction-conditioned clips without manual annotation, using techniques like random temporal sampling and temporal-order objectives to stabilize learning at scale. This yields an open-source, embodiment-agnostic reward/value foundation model usable as a drop-in critic or reward signal for downstream RL or planning pipelines. Practitioners could fine-tune or query it as a general progress estimator instead of hand-engineering task-specific reward functions.

arXiv · cs.ROBuildable

Hierarchical Fast-Slow ReAct Agent for Zero-Shot Object-Goal Navigation

A robot that remembers every room it's passed through instead of forgetting the instant it looks away.

Imagine searching a house you've never been in for, say, a coffee mug — you'd remember which rooms you've already checked and use that memory to decide where to look next. Most robot navigation systems don't do this: they just glance at whatever's in front of them right now and make a snap decision, throwing away everything they saw a minute ago. This paper builds a 'fast-slow' system where a quick reflex module keeps the robot moving while a slower, more deliberate reasoning module builds and consults a running map of rooms and objects it has already spotted, deciding when to double back or try a new area. The result is a robot that searches unfamiliar buildings for named objects more like a person would, rather than forgetting its own experience.

Technical view

The system tackles zero-shot object-goal navigation by decoupling a fast, always-on frontier value-map controller from a slow deliberative loop built around a large vision-language model (VLM), addressing two failure modes of prior work: discarding evidence once a frontier score is computed, and never revisiting previously observed regions. As the robot moves it writes a coordinate-anchored memory — a semantic grid of room types plus confirmed object instances — that the slow VLM-based reasoner can query to reconsider earlier observations and recover from failed VLM calls via defined fallbacks. This hierarchical architecture is a concrete blueprint for combining reactive value-map navigation with episodic spatial memory in embodied agents, and could be replicated by adding a persistent semantic grid layer to any frontier-based ZSON stack.

arXiv · cs.ROBuildable

WRAP: Wasserstein-Robust Adaptive Plug-in for Robot Localization

A statistical safety net that stops robots from trusting their GPS-like sensors too much when things go weird.

Robots that track their own position (like with GPS-style radio beacons plus motion sensors) use a mathematical filter that not only estimates where they are, but also estimates how confident it should be — and if that confidence estimate gets miscalibrated, the robot can trust bad data and drift off course. WRAP is an add-on that sits on top of these existing tracking filters without changing their core machinery, and instead adjusts how cautious the filter is about its sensor readings and its predictions, using a mathematically 'worst-case robust' approach borrowed from statistics (Wasserstein distance, a way of measuring how different two probability distributions are). Tested on real radio-and-motion-sensor data, it cut positioning errors by over a quarter compared to the standard approach. This matters because reliable self-localization is the backbone of almost every autonomous robot task.

Technical view

WRAP is an adapter-agnostic plug-in for EKF/ESKF localization stacks that keeps the propagation model, residual, and retraction untouched while replacing nominal process/measurement covariances with least-favorable covariances computed via a mean-preserving Wasserstein-ball robustification, using separate uncertainty radii for propagation versus sensing and a causal module for time-varying effective statistics. On 18 held-out UWB-IMU sequences, adapter-only calibration and full WRAP reduce mean 3D position RMSE by 19.8% and 27.4% respectively versus nominal ESKF, with an isotropic-radius ablation reaching 19.5%, isolating the gain attributable to directional (anisotropic) process-covariance robustification. Because it only modifies the gain/covariance computation, it's a drop-in retrofit for existing EKF/ESKF localization code without redesigning the filter's dynamics model.

arXiv · cs.ROBuildable

RoboSeg: Online Part-Level Semantic Reconstruction for Robotic Manipulation via a Single Eye-in-Hand Camera

A one-camera robot that builds a live 3D map labeling every handle, trigger, and grip point it sees.

For a robot to pick up a mug by its handle or pull a trigger, it needs to know not just 'that's a mug' but exactly where the graspable part is in 3D space — and normally that requires pre-scanned 3D models. RoboSeg instead uses a single camera mounted on the robot's own hand: a vision-language AI first looks at the scene and names the useful parts (handle, rim, tip), then as the robot moves, one fast process builds a live 3D shape map while a second, slower process paints semantic labels onto that shape using an image-segmentation AI, voting across many views to keep the labels consistent. The output is a running 3D map where every functional part is labeled, which then feeds directly into picking the right grasp point — all without needing a pre-made CAD model of the object.

Technical view

RoboSeg combines VLM-based functional-part prompting with asynchronous dual-thread RGB-D reconstruction from a single eye-in-hand camera: a high-frequency thread performs RGB-D odometry and TSDF fusion for geometry, while a keyframe-triggered thread runs SAM3 to generate part masks that are back-projected and fused via voxel-level temporal voting into a persistent part-labeled point cloud. This part-labeled map is consumed by a task-oriented grasp module (built on AnyGrasp) to select 6-DoF grasps targeting specific functional parts rather than whole-object bounding volumes, eliminating the need for CAD models or offline pre-scanning. The asynchronous two-thread design (fast geometry, slow semantics) is a reusable pattern for anyone building online part-aware perception on a moving single camera.

arXiv · cs.ROBuildable

SLIM-0.5B: Learning Action-Grounded Predictive Latents for Robot Manipulation

A tiny half-billion-parameter brain that predicts what actions do, instead of memorizing what everything looks like.

Most robot-control AI models are built on giant multipurpose models that also handle general language and vision understanding, which is overkill when all a robot arm really needs is to predict what its next action will do. SLIM is a much smaller model, trained to focus specifically on the relationship between actions and their effects — it learns to predict how the scene changes after an action, and in reverse, to figure out which action must have caused an observed change, similar to filling in missing pieces of a puzzle. This compact, action-focused approach avoids wasting effort predicting pixel-perfect details that don't matter for control, like exact lighting or background texture. The result is a lightweight, efficient policy that should be cheaper to run while still capturing what actually matters for manipulation.

Technical view

SLIM is a 0.5B-parameter Self-supervised Latent Interaction Model that learns action-grounded predictive latents via masked trajectory prediction, jointly optimizing action reconstruction (inferring the action from observed transitions) and future-latent prediction (predicting the transition induced by a given action), rather than modeling raw pixels as in typical world models. This targets a middle ground between oversized VLA backbones carrying unneeded open-domain semantic capacity and pixel-level world models that waste capacity on control-irrelevant visual detail. The compact latent space is designed to serve as a lightweight, action-centric representation that downstream manipulation policies can condition on directly. Practitioners could adopt SLIM as a drop-in perception/dynamics backbone for VLA-style policies where inference cost and control-relevant representation matter more than open-vocabulary generality.

arXiv · cs.ROBuildable

Efficient Real-World Online Reinforcement Learning for Robot Manipulation via Centralized Training and Critic Decomposition

Robots that learn to grab and complete tasks by practicing live in the real world, sharing one brain across many arms.

Training a robot arm through trial-and-error directly in the physical world (rather than in simulation) avoids the classic problem of skills not transferring from simulation to reality, but it's slow and gets messy when you try to speed things up by running several robot arms at once, since they interfere with each other's learning signal. This work has multiple robot arms train together under one shared 'critic' brain that evaluates their progress, but splits that critic into two specialized parts — one that judges overall task success and one that specifically judges whether the grasp itself is going well — so the feedback is clearer and more useful. Humans occasionally step in to nudge the robots when they're stuck, which speeds up learning. The result is faster, more reliable real-world learning that can handle a wider range of object positions and variations than before.

Technical view

The framework applies Centralized Training with Decentralized Execution (CTDE) to real-world online RL for manipulation, letting multiple physical actors share a centralized multi-head critic while acting independently, which addresses non-stationarity from concurrent multi-agent training. A Hybrid Reward Architecture decomposes the critic into a task head (sparse task-completion reward) and a grasp head (potential-based shaping reward for grasping), giving cleaner credit assignment than a single scalar reward. Combined with human-in-the-loop intervention for sample efficiency, the system reportedly handles larger randomization ranges than prior real-world online RL methods. This is a concrete recipe (shared critic + decomposed reward heads) practitioners could adapt to scale multi-robot real-world RL fleets without each robot needing its own critic.

arXiv · cs.ROBuildable

TAMS: Task-Aware Multi-View Adaptive Streaming for Wireless Telerobotic Manipulation

Streaming video to a remote-controlled robot smarter, by giving more bandwidth to whatever view matters right now.

When a human operator controls a robot arm remotely using multiple camera views, the internet connection often can't carry full-quality video from every camera at once, so something has to give. TAMS watches simple signals from the robot itself to figure out what phase of the task is happening — like 'reaching for an object' versus 'placing it down' — and then shifts more of the limited bandwidth to whichever camera view is most useful for that phase, while still keeping the other views watchable. It's like a video call that automatically sharpens the speaker's face while slightly blurring the background when needed. In tests under tight network conditions, this cut task completion time nearly in half compared to just splitting bandwidth evenly.

Technical view

TAMS performs task-phase-aware, multi-view bitrate allocation for wireless teleoperation, inferring the current manipulation phase from lightweight robot-side signals (rather than requiring heavy video analysis) and dynamically prioritizing uplink bitrate to the operator's most task-relevant camera view while enforcing a baseline visibility floor for secondary views. Evaluated on a 6-DoF teleoperation testbed across three constrained network conditions, it improves primary-view SSIM, reduces task completion time, and raises trial success rate versus equal and static bitrate allocation baselines — under the tightest bandwidth condition, mean completion time drops from 68.9s to 43.9s. The approach is essentially a task-conditioned QoS scheduler and could be implemented as a bitrate controller layered on existing WebRTC-style multi-stream teleoperation pipelines.

DEV

Semiconductors & Devices

36 new
arXiv · eess.SYConceptual★ flagship

Digital Twin Networks for 6G Wireless Systems: Architecture, Enabling Technologies, Intelligent Control, and Open Challenges

Building live virtual clones of 6G networks so they can steer themselves before problems happen.

6G mobile networks will have to guarantee extreme performance — near-instant, ultra-reliable links for things like remote surgery or self-driving cars — which means the network can't just react to problems, it has to anticipate them. A Digital Twin Network is a constantly-updated virtual replica of the real network: a high-fidelity simulation fed by live data that mirrors what the physical system is doing right now. With such a twin, operators can test decisions and forecast trouble in the copy before acting on the real hardware. This survey organizes the messy state of the field, drawing a key line between 'passive' twins that only monitor and 'active' twins that actually control the network, and it evaluates the enabling technologies — like ray-tracing for radio-wave prediction — and, importantly, whether they're computationally feasible to run in real time. It's a map of where the technology stands and what problems remain open.

Technical view

This survey formally taxonomizes Digital Twin Network (DTN) architectures for 6G into passive monitoring twins versus active control twins, addressing a literature gap in technical classification and computational-feasibility assessment. It evaluates enabling technologies — notably ray-tracing for high-fidelity channel/propagation modeling and reconfigurable elements — and their real-time computational tractability against 6G KPIs (URLLC, eMBB, mMTC). The framing emphasizes proactive, deterministic orchestration: real-time synchronized virtual replicas that support intelligent closed-loop control rather than mere visualization. Researchers can use the taxonomy and feasibility analysis to position architectures, select enabling tech per latency/fidelity budget, and target the enumerated open challenges.

arXiv · cond-mat.mes-hallConceptual★ flagship

Exact solution for stationary states of a closed memristor with mobile charged vacancies

Solving exactly how charged defects settle inside a memristor — and why its on/off states stay fixed.

A memristor is a tiny device whose electrical resistance depends on its history — a property that makes it attractive for brain-like computing and memory. In this model, the resistance is controlled by 'vacancies': mobile, electrically charged defects in the material that drift when current flows and pile up in different places. Because these charges push on each other electrostatically, working out where they finally settle is hard, but the authors derive exact analytical formulas for those steady-state distributions. A neat finding is that this mutual repulsion carves out a neutral buffer zone sandwiched between the charge-depleted and charge-rich regions. Most surprising: the device's limiting 'on' and 'off' resistances turn out not to depend on how strongly the charges repel each other — the interaction reshapes the distribution but leaves those key resistance values untouched, at least to leading order.

Technical view

The work analyzes a nonlinear memristor model with charged mobile vacancies including their mutual electrostatic interaction, deriving closed-form analytical expressions for the stationary (limiting) vacancy distributions under steady current. The interaction induces an intermediate electrically neutral region separating reduced- and increased-concentration zones — a structural feature absent from non-interacting treatments. A key exact result: the leading-order 'on' and 'off' limiting resistances are independent of the electrostatic interaction strength (to first order in vacancy concentration), despite the interaction reshaping the spatial profile. These analytics give device modelers benchmark solutions for interpreting switching states and validating numerical drift-diffusion simulations of vacancy-based memristors.

arXiv · eess.SYBuildable

SelectLight: Learning to Select Signal Plans Generated by Distributed Model Predictive Control for Urban Traffic Networks

Traffic lights that let an optimizer propose several good plans, then let AI pick the best one from experience.

Controlling traffic lights across a whole city is a balancing act between competing goals — less waiting time, shorter queues, fewer stop-and-go moments — and a classic optimization method can generate a handful of solid trade-off options in real time, but it needs a fixed rule to pick just one, and that rule can't learn from what actually happens on the road. SelectLight keeps the traditional optimizer generating a short list of good candidate signal plans at each intersection, but replaces the fixed picking rule with a machine-learning agent that has learned, from experience, which plan tends to work out best given the current traffic pattern across the whole network. The intersections also pay attention to what's happening at nearby intersections, since traffic light decisions ripple outward. This combines the reliability of guaranteed-feasible optimization with the adaptability of learning from real outcomes.

Technical view

SelectLight couples distributed model predictive control (DMPC) with multi-agent reinforcement learning: at each control step, state-pruned multi-objective dynamic programming (SP-MODP) uses a Newellian point-queue traffic model to generate a bounded Pareto-optimal set of candidate signal plans trading off total delay, peak queue accumulation, and stop count, and a topology-aware attention policy (trained with independent PPO) selects among these candidates rather than hand-coding a selection rule. This decouples feasibility guarantees (from DMPC) from adaptive decision-making (from RL), letting the learned policy exploit realized closed-loop outcomes and network topology (via attention across intersections) that a fixed selection heuristic cannot. The architecture is a reusable pattern — generate a nondominated candidate set with classical control, then learn the selector — applicable to other multi-objective control domains beyond traffic signals.

arXiv · cond-mat.mes-hallConceptual

Second-Chern Bounds in Non-Abelian Quantum Geometry

A hidden geometric rulebook forces certain quantum states to nest inside strict mathematical bounds.

This paper is about the strange 'shape' of quantum states when two energy levels stay perfectly tied together (degenerate) as you tune four independent knobs at once. Physicists have found that this shape can't be arbitrary — it obeys two mathematical inequalities, like a speed limit, that link how stretched (anisotropic) the geometry is to how much the underlying quantum 'twisting' curls back on itself. When the tightest possible version of this limit is hit exactly, the space acquires an elegant, highly symmetric structure called a quaternion Kähler structure — a four-dimensional cousin of the smooth complex geometry seen in simpler 2D topological materials. It matters because these bounds constrain what kinds of exotic quantum materials and topological effects (like protected zero-energy points) can exist, giving theorists a compact checklist for classifying quantum matter.

Technical view

The work derives inequalities relating the quantum metric g and Berry-type curvature F for doubly-degenerate SU(2)-structured bands in a 4D parameter space: (tr g)^2/16 ≥ √(det g) ≥ |Tr(F∧F)|/12, tying metric anisotropy to curvature self-duality under the Hodge star and to inter-level transitions outside the three SU(2) rotation generators. Saturating the determinant bound is shown to induce a quaternion Kähler structure, generalizing the ideal-band/complex-structure correspondence known for 2D Chern insulators. Four-band Dirac Hamiltonians are given as explicit examples that automatically saturate the bound and host a topological zero, making them a natural testbed for further non-Abelian quantum geometry results.

arXiv · cond-mat.mes-hallConceptual

Electron transport in a 1.6~nm-thick double-gated (100) silicon nanosheet: A theoretical study accounting for phonon confinement and remote-phonon scattering

How electricity moves through a silicon sheet thinner than a virus depends on invisible vibrating heat waves.

As transistors shrink to just a few atoms thick, the silicon 'nanosheet' channel that carries current starts behaving very differently, partly because heat-carrying vibrations (phonons) get squeezed and reflected by the surrounding insulating layers. This study builds a detailed computer model of a 1.6-nanometer-thin silicon layer sandwiched between gate oxides, tracking how these confined vibrations and 'remote phonons' (vibration-like ripples from the neighboring oxide interface) scatter the flowing electrons and slow them down. The approach combines quantum band-structure calculations with continuum models of how phonons bounce or get absorbed at each material boundary. The key finding is that the assumed boundary behavior — whether phonons are 'clamped' at interfaces or can leak through — dramatically changes the predicted electron mobility, meaning realistic assumptions give a much lower speed limit than the simplified models chip designers often use.

Technical view

The authors compute room-temperature electron transport in a double-gated (100) Si nanosheet (1.6 nm body, SiO2/HfO2 gate stacks) using local empirical pseudopotentials for the band structure, an elastic continuum model for acoustic phonon confinement, and the dielectric continuum approximation for interface hybrid plasmon-phonon (remote phonon/IPP) excitations. They compare different boundary-condition assumptions for phonon confinement and show that the physically motivated case — phonons clamped at SiO2/HfO2 interfaces with optical phonons pinned at Si/SiO2 — yields substantially lower mobility than commonly used simplified boundary conditions. This is directly relevant to predictive TCAD-style mobility modeling for sub-2nm nanosheet FET technology nodes.

arXiv · physics.med-phConceptual

A 2D Hydrothermodynamic Analytical Model for Rapid Tumor Ablation using High-Intensity Focused Ultrasound

A one-second ultrasound pulse could cook a tumor from the inside using its own trapped acoustic pressure.

High-intensity focused ultrasound (HIFU) is a way to destroy tumors non-invasively by aiming sound waves at them until the tissue heats up and dies, but predicting exactly how that heat builds up is hard. This paper builds a mathematical model showing that because a solid tumor's cell structure resists flowing (unlike liquid), the usual 'acoustic wind' that normally carries sound energy away gets blocked, so nearly all of the sound's push instead turns into localized static pressure — and that pressure converts efficiently into heat right where you want it. Using a short, powerful one-second pulse of sound and equations that track how heat spreads in tissue, the researchers derive a simple criterion for how much sound the tumor needs to absorb to ablate it quickly. This matters because it could let doctors design faster, more precise, less invasive tumor treatments with fewer side effects than surgery.

Technical view

The authors derive a self-consistent 2D hydrothermodynamic model by expanding compressible Navier-Stokes equations to second order for a mechanically stationary (non-flowing) dense tumor matrix, showing that suppression of acoustic streaming forces the absorbed wave momentum flux entirely into time-averaged second-order static pressure gradients rather than bulk flow. They couple this to a simplified Pennes bioheat equation solved for a 1 s high-amplitude top-hat HIFU pulse under non-diffusive (short-timescale) heat transport, extending a hydrodynamic optimization framework from Tsiklauri (2026). The result is a closed-form physical criterion relating the acoustic absorption coefficient to ablation efficacy, offering a design equation practitioners could use to tune HIFU pulse parameters for rapid, localized tumor ablation.

arXiv · eess.SYRunnable

NetlistBench: Evaluating LLM Reliability in SPICE Netlist Recognition and Manipulation

Researchers built a test to catch AI chatbots quietly botching circuit-design files.

SPICE netlists are the text files engineers use to describe electronic circuits to simulators, and companies increasingly want AI language models to read and edit them. This paper introduces NetlistBench, a large test set of over 2,300 tasks — like recognizing which component connects where, editing values, or judging if two circuit descriptions are equivalent — specifically checking whether AI models handle these files reliably, separate from harder circuit-design reasoning. A strict automated checker (not another AI) verifies each answer against the actual circuit structure. They found today's models are great at simple, local edits but stumble as tasks get more structurally complex, revealing a hidden reliability gap that matters a lot before anyone trusts an AI to touch real chip designs.

Technical view

NetlistBench is a structure-verified benchmark of 2,342 SPICE netlist tasks spanning 24 task families — parameter/connectivity recognition and editing, hierarchical operations, equivalence judgment, and long-horizon compound edits — scored by a deterministic, structure-aware oracle rather than an LLM judge, avoiding evaluation noise from free-text grading. Across six non-thinking LLMs, accuracy ranges from 96-100% on simple local edits down to much lower performance as operation-level structural complexity increases (e.g., hierarchical or compound multi-step edits). Practitioners building LLM-assisted EDA tools can use this benchmark to stress-test netlist-manipulation reliability independently of higher-level circuit design reasoning, and to target failure modes tied to specific structural complexity classes.

arXiv · cond-mat.mes-hallConceptual

Lectures on ultrathin film ferromagnetism

Stack a few atomic layers of iron-like metal and magnetism starts playing by two-dimensional rules.

When you grow metals like iron, cobalt, or nickel one atomic layer at a time into ultra-thin films, the material's magnetism starts behaving in surprising ways because the electrons get trapped in a very thin 'quantum well.' These lecture notes review why some of these films develop 'dead' layers that lose their magnetism entirely, or conversely become more strongly magnetic than the bulk material, and why the film's favorite magnetic direction can flip between pointing through the film versus lying flat within it. The explanation traces back to the physics of confining electrons to two dimensions, plus how magnetic layers can 'talk' to each other through a spacer in an oscillating pattern. This foundational knowledge underpins spintronic devices like the magnetic memory and sensors used in computer hard drives and next-gen electronics.

Technical view

This review surveys the physics of layer-by-layer-grown 3d transition-metal ultrathin films, framing their magnetic behavior through the quantum-well states produced by vertical confinement combined with in-plane 2D spin ensembles. Key phenomena covered include magnetically 'dead' layers, enhanced magnetic moments relative to bulk, oscillatory interlayer exchange coupling (RKKY-like coupling through spacer layers), and anomalous perpendicular-versus-in-plane magnetic anisotropy crossovers/spin-reorientation transitions. As a pedagogical synthesis, it consolidates decades of surface-magnetism results relevant to spintronic device design (e.g., perpendicular magnetic anisotropy media, spin valves) and gives readers the theoretical grounding to interpret experimental thin-film magnetometry data.

arXiv · cs.CYConceptual

Co-constructing sociotechnical AI governance: participatory system mapping using algorithm registers

Public lists of government algorithms don't show the messy human systems those algorithms actually live in.

Cities increasingly publish 'algorithm registers' — public lists disclosing what automated tools their agencies use — as a transparency measure, but this paper asks whether that's actually enough. The researchers dug into one Dutch city's register, focused on a decision-support tool used by social caseworkers, and ran a participatory exercise where different stakeholders mapped out the broader system the algorithm sits inside, not just the algorithm itself. They found that registers can hide as much as they reveal, since they rarely capture the human processes, incentives, and context surrounding the tool, and different groups care about very different kinds of transparency. This matters because real accountability for AI in government services requires understanding the whole sociotechnical system, not just publishing a spec sheet for the software.

Technical view

The paper conducts a qualitative case study of a Dutch municipality's algorithm register, centered on a decision-support tool for caseworkers, using participatory system mapping to elicit diverse stakeholder perspectives on what the register does and doesn't make legible. Framed through a system-theoretic safety-analysis lens (evoking STAMP/STPA-style thinking), the authors argue registers formatted as static tool inventories struggle to represent the sociotechnical system — organizational processes, human oversight, feedback loops — that actually determines accountability outcomes. The contribution is methodological: a participatory mapping approach that governance researchers or municipal policy teams could adapt to audit their own algorithm registers and surface gaps between documented transparency and lived system behavior.

arXiv · physics.ins-detBuildable

From Simulation to Real Scans: Anomaly Detection in Maritime Cargo with Muon Scattering Tomography

AI trained on simulated cosmic-ray scans learns to spot hidden threats in real shipping containers.

Cosmic rays constantly rain down tiny particles called muons that can pass through dense material like a shipping container, bending slightly as they go — the denser the material, the more they bend. By tracking those tiny deflections, you can build a 3D density map of what's inside a sealed container without opening it, a technique called muon scattering tomography. The problem is that real muons arrive slowly and unpredictably, so there aren't enough labeled real scans to train detection software, forcing researchers to train on computer-simulated scans instead — but simulated and real data don't always match, which can trip up the AI. This paper builds the first complete pipeline that trains an anomaly-detection system on realistic simulations, treating anything unusual as an 'out of place' pattern, and then tests it against actual scans from a real-world port security demonstration to see how well it transfers.

Technical view

The paper addresses the sim-to-real gap in Muon Scattering Tomography (MST) for maritime cargo screening, where labeled real scans are scarce due to low, stochastic cosmic muon flux. Anomaly detection is framed as an out-of-distribution (OOD) problem, with models trained on physically consistent simulated scans and validated against real container scans from the SilentBorder demonstration campaign. This establishes what appears to be the first end-to-end, simulation-to-deployment anomaly detection framework for MST in this domain, providing a template for others to benchmark domain-adaptation or OOD techniques against real acquisition-condition mismatches in radiation-imaging security applications.

arXiv · physics.ins-detConceptual

Background decomposition of the CONUS+ run 1 data

Physicists map out exactly what noise is hiding the faintest possible neutrino 'nudge' in a detector.

Neutrinos are famously hard to detect because they barely interact with matter, but a rare process called coherent elastic neutrino-nucleus scattering (CEvNS) lets physicists catch them via a tiny, whole-nucleus recoil instead of hitting a single particle — making it detectable at much lower energies than usual. The CONUS+ experiment sits near a nuclear reactor (a strong neutrino source) using ultra-sensitive germanium detectors to catch this faint signal, and it already achieved a first-of-its-kind measurement at a reactor. But to trust that signal, scientists must know exactly what else could mimic it — background noise from cosmic rays, radioactivity, or the reactor itself. This paper carefully breaks down and models all those background sources using detailed particle-physics simulations, showing that reactor-related noise is a minor contributor in the critical low-energy range where the real neutrino signal is expected, which strengthens confidence in the original detection.

Technical view

CONUS+ measures CEvNS using reactor antineutrinos and four point-contact HPGe detectors with a 160 eVee energy threshold. This work presents a full background decomposition for the three run-1 detectors and constructs a Geant4-based Monte Carlo background model that serves as the likelihood-fit input for the CEvNS analysis. Key finding: reactor-correlated backgrounds are subdominant across all energy regions, including specifically below 350 eVee, the region of interest for the CEvNS search — meaning the observed signal excess is not an artifact of reactor-induced background. This background model provides a template other reactor-based rare-event searches (dark matter, neutrino magnetic moment) can adapt for similar low-threshold germanium detector systems.

arXiv · eess.SYBuildable

Network Topology Reconfiguration: Optimal Transition Planning

Power grids can't just flip a switch to save money — the in-between steps can blow a fuse.

Electric grid operators can save money by reconfiguring which power lines and substations are connected, while also adjusting how much power each plant generates. But you can't just jump straight to that better setup — you have to pass through a sequence of in-between states, and each one has to keep the flow of electricity within safe limits on every wire. The problem is that if you switch connections before you adjust generation (or vice versa) in the wrong order, some line in the middle of the transition could get overloaded even though the start and end points are both fine. This paper designs a method that plans the whole step-by-step journey — not just the destination — so every intermediate state stays safe, using a rolling planning approach that looks a few steps ahead at a time.

Technical view

The authors formalize Optimal Transition Planning (OTP): jointly optimizing a discrete switching sequence and continuous dispatch trajectory such that every intermediate operating point satisfies full AC power flow equations and thermal limits, addressing the gap left by snapshot network topology reconfiguration methods that only certify a target state. Their solution uses a receding-horizon framework where a DC (linearized) planner proposes candidate transition steps that are presumably validated/refined against AC feasibility. This is directly applicable to grid operators wanting to safely execute cost-saving substation switching plans without manual trial-and-error sequencing.

arXiv · cs.LGBuildable

Clustered Randomized Smoothing for Stochastic Prediction Functions

When an AI predicts many possible futures, this trick keeps its 'safety buffer' from blurring them into mush.

Some AI prediction models don't give one answer — they give a whole spread of plausible outcomes, like predicting several different paths a self-driving car's neighbor might take. A popular way to make predictions more robust against small malicious tweaks to the input (adversarial attacks) is called randomized smoothing, which essentially averages many noisy versions of a prediction. But when the true answer has multiple very different 'modes' (like 'turn left' or 'turn right'), naive averaging collapses them into a meaningless blend, like averaging left and right into 'go straight into the wall.' This paper's fix is to first group the noisy samples into clusters (say, one cluster per plausible mode), smooth within each cluster separately, and then recombine them into a mixture of possibilities — preserving the distinct options while still gaining the robustness guarantee.

Technical view

The paper introduces clustered α-smoothing: partition noisy input samples via an arbitrary clustering algorithm, apply α-smoothing independently within each cluster, then recombine cluster-level smoothed outputs into a mixture distribution rather than a single averaged point estimate. This avoids the mode-collapse failure of standard randomized smoothing on stochastic, multi-modal regression predictors. They derive a certified robustness lower bound for this mixture-based smoothing scheme, giving practitioners a way to certify adversarial robustness for multi-modal predictors (e.g., trajectory forecasting) while retaining distributional expressiveness.

arXiv · cond-mat.otherBuildable

Formally Verified Lock-Free Software Transactional Memory for Scientific Measurement

A 16-year-old lab software trick keeps physics experiments from crashing when multiple threads grab the same data.

Lab instruments running physics experiments — like nuclear magnetic resonance (NMR) machines — need several computer threads to read and control shared settings at once: one thread talks to the instrument, one collects data, one updates the screen. If you lock all that shared data with one big lock, threads wait around and you can literally lose a sample mid-measurement; if you use lots of small locks instead, you risk threads getting stuck waiting on each other forever (deadlock). This paper describes a 'lock-free' solution that's been quietly running in real physics labs for 16 years: it organizes the shared settings as a tree structure and lets threads grab consistent snapshots of any branch instantly, without ever blocking each other, using a clever pointer trick. They also formally proved key safety properties of the system correct using a mathematical verification tool called TLA+, rather than just testing it and hoping.

Technical view

The system implements a lock-free software transactional memory (STM) over a hierarchical (tree-structured) shared state, providing atomic subtree updates and O(1) consistent subtree snapshot acquisition via a custom lock-free atomic shared pointer (after initial bundling), avoiding both coarse-grained lock contention and fine-grained deadlock risk from cross-instrument lock ordering. Correctness was verified using TLA+/TLC model checking, exhaustively checking bounded configurations of the concurrent protocol rather than relying solely on empirical testing. It has been deployed in production for 16 years across NMR and optically detected magnetic resonance experiment control software, making it a battle-tested reference design for concurrency-heavy instrument-control systems that need snapshot consistency without blocking.

arXiv · eess.SYConceptual

Distributed Nash Equilibrium Seeking with Logarithmic Bit Rates over Digital Channels

Rival players can find their game's equilibrium by trading almost no information at all.

Imagine many players in a competitive game (like companies setting prices) trying to settle into a stable balance point where no one wants to change their strategy — this stable point is called a Nash equilibrium. Normally, algorithms that find this point require players to repeatedly send each other detailed numeric messages over a network, which costs bandwidth. This paper shows you can shrink those messages down to just a few bits — dramatically less data — using smart 'quantization' techniques (rounding and compressing numbers) that only send the essential changes (sparsification) instead of full precision updates, and still have the players' strategies reliably converge to the equilibrium.

Technical view

The authors develop a Passivity-Based Nash-equilibrium-seeking Algorithm with Time-varying scaling Error state Quantization (PBA-TEQ) for distributed NE computation over digital (bit-limited) communication channels. By combining sparsification with uniform quantization under a general class of ultimate-boundedness-based quantizers, they achieve an exponential reduction in required bit rate compared to standard distributed NE algorithms, while preserving convergence guarantees via passivity-based analysis. This is relevant to multi-agent systems and network games (e.g., distributed resource allocation, smart grids) operating over bandwidth-constrained or noisy digital networks where communication efficiency is a hard constraint.

arXiv · eess.SYBuildable

Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems

Engineers built matching thermostats for hydrogen-making machines and the compressors that push the gas along.

Making hydrogen fuel with electrolyzers and then compressing it for storage or transport are usually treated as separate systems, but when the power grid or hydrogen demand suddenly changes, the two need to react together smoothly. This paper builds a mathematical model of an electrolyzer connected to an electric-driven compressor station and designs automatic feedback controllers (PID controllers, the same kind of logic used in thermostats and cruise control) to keep both running safely and efficiently when disturbances hit either side. They tested two versions — a cautious one and a fast-reacting one — under several simulated disturbance scenarios. This matters because as more renewable-powered hydrogen infrastructure gets built, keeping these coupled systems stable during sudden swings avoids equipment damage and downtime.

Technical view

The authors derive linearized dynamic models of an electrolyzer and an electric-driven compressor station (EDCS) and design two PID control schemes — a conservative and a fast-tracking variant — to coordinate their response to transient disturbances originating in either subsystem. The integrated model is validated across four disturbance case studies, addressing a previously unexplored gap in coupled dynamic (not just steady-state) electrolyzer-compressor operation. Practitioners working on power-to-hydrogen plant control could use the linearized models and PID tuning approach as a starting point for their own controller design or as a benchmark for more advanced (e.g., MPC) coordination schemes.

arXiv · cond-mat.supr-conConceptual

Spin-polarized supercurrents and Josephson diode effect in altermagnets

A weird magnet that isn't quite magnetic can make superconducting current flow only one way.

Superconductors carry electric current with zero resistance, and when you sandwich a special material between two superconductors you can get a 'Josephson' current that flows even without an applied voltage. This study looks at what happens when the sandwiched material is an altermagnet — a recently discovered class of magnet that has some of the spin-sorting properties of a ferromagnet but without the usual overall magnetization. Using detailed quantum theory, the researchers modeled how electrons cross the boundaries between the superconductors and the altermagnet, especially when that boundary is 'spin-active' (it treats electrons of different spins differently). They found that depending on how strongly the altermagnet polarizes electron spins, the current-vs-phase behavior changes in distinctive ways, laying groundwork for using altermagnets to build diode-like devices that let supercurrent flow more easily in one direction than the other.

Technical view

The authors theoretically model a superconductor/d-wave-altermagnet/superconductor (SC/AM/SC) Josephson junction with spin-active interfaces (spin-dependent delta potentials with arbitrary exchange-field orientation), solved via both fully quantum (Gor'kov) and quasiclassical (Eilenberger) Green's function formalisms. They compute the current-phase relation (CPR) in both the weakly spin-polarized regime (exchange field ≪ Fermi energy), which recovers a conventional Josephson effect, and the strongly spin-polarized regime, where deviations tied to altermagnet orientation emerge. This provides a quantitative theoretical framework for predicting and engineering the Josephson diode effect (nonreciprocal supercurrent) in altermagnet-based junctions, directly usable by experimentalists designing SC/AM/SC devices or by theorists extending the Green's function approach to other altermagnet symmetries.

arXiv · cs.LGBuildable

Forward and Inverse Virtual Metrology for Phototransistor Gain: A Hierarchical, Uncertainty-Aware Approach for Small Production Datasets

With only 13 test runs, engineers predict — and reverse-engineer — the perfect chip recipe.

Building a specialized light-sensing transistor (phototransistor) in a chip fab is slow: tweaking the manufacturing recipe and testing the result can take months per cycle, so even an imperfect model that predicts device performance before you run it saves huge amounts of time. The challenge here is that the researchers only had thirteen or fourteen past production runs to learn from — far less data than typical machine-learning approaches expect. They found that about half the variation in the final device performance comes from run-to-run differences rather than the recipe itself, meaning there's a hard ceiling on how well you can predict from recipe alone. Using this insight, they built a forward model (predict performance from a recipe, with honest uncertainty) and an inverse model (given a target performance, suggest a recipe), suited specifically to this small, structured-data situation.

Technical view

Working with a real fabrication dataset of only 13-14 process runs of a silicon bipolar phototransistor, the authors perform a variance decomposition of device gain and find roughly 50% of variance is between-run rather than within-run, which caps the achievable accuracy of any recipe-only forward predictor — a key diagnostic for small hierarchical production datasets that differs from standard large-corpus virtual metrology assumptions. They then build a hierarchical, uncertainty-aware forward gain predictor (relative rather than absolute accuracy signal) and a corresponding inverse search that returns candidate recipes for a target gain. This variance-decomposition-first methodology is directly reusable for other low-volume, hierarchically structured fab processes where conventional large-data virtual metrology techniques don't apply.

arXiv · eess.SYBuildable

Disturbance-Observer-Based Grid-Forming Control for Unbalanced Grids

A power converter self-corrects for lopsided grid faults using only its own current sensor.

Electrical grids sometimes get 'unbalanced,' meaning the voltage isn't the same across all three phases — often during faults — and power converters (grid-forming inverters) need to keep supplying stable power even then. This paper proposes a control method that keeps the useful ('positive-sequence') power flowing steadily while actively canceling out the problematic ('negative-sequence') voltage component, all using a clever internal estimator (a disturbance observer) that only needs to measure the converter's own output current rather than the grid voltage directly. The system also includes logic to cap the current safely during both balanced and unbalanced faults. The team proved the approach mathematically and then tested it on a real 12.5 kVA converter, showing it holds voltage steady through unbalanced grid faults.

Technical view

The proposed grid-forming control regulates positive-sequence active power injection while actively suppressing negative-sequence converter voltage under unbalanced grid conditions, using only AC-side current measurement — a disturbance observer estimates positive- and negative-sequence grid voltages and provides synchronization plus integral/resonant control action, avoiding the need for direct grid-voltage sensing. A current-limitation scheme handles both balanced and unbalanced fault ride-through within converter physical limits, backed by a full stability analysis and tuning guidelines. The method is experimentally validated on a 12.5-kVA converter, giving practitioners a concrete, current-sensor-only architecture and tuning procedure for unbalanced-fault-tolerant grid-forming inverters.

arXiv · cond-mat.mes-hallConceptual

Quantum Anomalous Hall Effect in $d^{10}$ Oxide Monolayers

A simple oxide monolayer could host frictionless one-way electron highways with no magnet needed.

Physicists usually get exotic 'quantum anomalous Hall' behavior — where electricity flows in lossless one-way lanes around the edge of a material — by using metals with partially filled d-orbitals (think iron, cobalt) or complex twisted-layer materials. This paper proposes something surprising: a family of simple two-dimensional oxide crystals (like Zn2SeO6) that pull off the same trick using oxygen atoms' own electron orbitals, which spontaneously line up like tiny magnets on their own. Because of the material's triangular symmetry, this magnetism opens special protected 'gaps' in how electrons can move, forcing current to flow only along the edges without needing an external magnet or the exotic metals other designs need. This matters because it points to a much simpler, more oxide-chemistry-friendly recipe for building future dissipationless electronic devices.

Technical view

The authors predict quantum anomalous Hall effect (QAHE) in M2DO6 (M=Zn,Cd; D=Se,Te) monolayers driven by ferromagnetism from half-filled O-2p orbitals rather than transition-metal d states or moiré correlations. Spin-polarized Dirac points emerge at K/K' and along Γ-K/Γ-K' lines; C3 symmetry produces eight symmetry-related Dirac crossings in the Brillouin zone, each gapped by spin-orbit coupling and contributing a half-integer Chern number that sums to a nontrivial total Chern number. This is a first-principles/tight-binding prediction offering a chemically distinct, p-orbital-based route to QAHE that could be tested via ARPES or transport measurements on synthesized monolayers.

arXiv · physics.ins-detBuildable

Usage of GPUs for ALICE Run 3 Offline Reconstruction on the GRID

CERN's ALICE experiment now reuses its GPU farm to crunch particle-collision data even when the LHC is off.

The ALICE experiment at CERN's Large Hadron Collider records enormous numbers of lead-ion collisions and has long used graphics chips (GPUs) — the same kind that power video games and AI — to process data in real time as it streams in. This paper describes how ALICE now also puts those same GPUs to work 'offline,' reprocessing already-recorded data more thoroughly whenever the collider isn't actively running, so the expensive hardware doesn't sit idle. By porting more analysis steps (like particle-track reconstruction) onto GPUs and spreading the work across other computing sites in the worldwide GRID network, they've sped up processing by double-digit percentages. It's essentially a scheduling and engineering win that squeezes far more scientific output from the same hardware investment.

Technical view

ALICE's Run 3 online reconstruction already offloads over 90% of compute to GPUs; this work extends that to offline reconstruction on the GRID, running TPC tracking on GPUs since 2023 and progressively porting more stages, including track-model decoding and ITS tracking, which yielded a 29% throughput improvement. The approach reuses the online computing farm's idle GPU capacity during LHC downtime and extends GPU-based offline processing to additional GRID sites beyond the online farm, with a 2026 run mentioned as a milestone deployment. This is a systems/HPC contribution relevant to anyone designing heterogeneous CPU/GPU pipelines for large-scale, distributed scientific data processing.

arXiv · eess.SPBuildable

TRACE: A Modular Framework for RIS-Assisted Channel Estimation and Differential Channel-Aware Reconfiguration

A plug-and-play toolkit lets researchers fairly test different 'smart mirror' wireless algorithms head-to-head.

Reconfigurable Intelligent Surfaces (RIS) are like programmable mirrors for wireless signals — flat panels of tiny elements that can bounce radio waves in controlled directions to boost signal quality, and researchers are racing to find the best ways to estimate the wireless channel and steer these surfaces in real time. The problem is that most existing test setups bake in one fixed algorithm, so nobody can cleanly compare different approaches under the same conditions. This paper builds TRACE, a modular software framework that separates the transmitter, the environment, the controller, and the receiver into swappable pieces connected over a network, so researchers can mix and match different estimation and control strategies fairly. They also introduce a new lightweight algorithm (DCAR) for updating the RIS configuration efficiently as the wireless channel changes over time, reducing the overhead of constantly re-measuring everything.

Technical view

TRACE is a socket-based, modular framework decoupling transmitter, radio channel, RIS controller, and receiver via separate control-plane and data-plane interfaces, enabling reproducible, apples-to-apples benchmarking of channel-estimation, tracking, and reconfiguration algorithms under identical experimental conditions. The paper's second contribution, the Differential Channel-Aware RIS update (DCAR) algorithm, estimates channel changes to drive low-overhead RIS phase updates under time-varying conditions rather than requiring full re-estimation each cycle. Practitioners can plug custom estimation/control modules into TRACE's interfaces to benchmark against DCAR or other baselines, making it a useful testbed for RIS-assisted wireless research and hardware-in-the-loop experiments.

arXiv · cs.CVRunnable

Automated binary classification of hazelnut X-ray images: A deep-learning benchmark for quality assessment

AI trained on X-ray images can spot rotten hazelnuts hidden inside their shells.

Hazelnuts can have defects on the inside — like mold or empty spots — that are invisible from the outside but show up in X-ray scans, similar to how doctors use X-rays to see broken bones. The challenge is that automatically teaching a computer to read these scans is hard because the differences between healthy and defective nuts can be subtle, defective examples are rarer than healthy ones (imbalance), and there isn't much labeled training data. The researchers built a public benchmark of nearly 800 X-ray images of individual hazelnut kernels, and tested seven individual AI models plus ten ways of combining multiple models' predictions (ensembles), using a careful group-based testing method across five different random splits to make sure results were trustworthy rather than lucky. This kind of benchmark helps food-quality industries know which AI approaches actually work reliably before deploying automated sorting lines.

Technical view

The authors present a binary (healthy vs. defective) hazelnut classification benchmark using 799 segmented single-kernel X-ray images (224x224 grayscale) from 101 acquisition units, evaluated with seven single-model configurations and ten probability-aggregation ensemble strategies. Evaluation used a group-wise split-rotation protocol across five random-seed data splits, with decision thresholds tuned on validation sets and performance measured deterministically on held-out validation/test sets, addressing class imbalance and limited annotation concerns typical of agricultural X-ray inspection tasks. This provides a reproducible baseline and dataset/protocol other researchers can build on for non-destructive food-quality deep-learning classification, particularly for studying ensemble aggregation strategies under data scarcity.

arXiv · eess.SYBuildable

Reinforcement Learning-Based Output Feedback LQR for Continuous-Time MIMO Systems

A smarter math trick lets AI-based controllers steer complex systems using only sensor outputs, not hidden internals.

In control engineering, 'LQR' is a classic recipe for automatically steering a system (like a robot arm or aircraft) toward a target while minimizing wasted effort, but it traditionally needs full knowledge of the system's internal 'state' — information you often can't directly measure. This paper works on model-free reinforcement learning methods that instead use only what you can observe: the inputs you give the system and the outputs it produces over time, filtered through a mathematical trick to approximate the hidden state. The authors discover that the standard way of building this filtered approximation includes unnecessary redundant information, which can make the learning math unstable or ill-defined (rank deficient). They pin down exactly how much genuinely independent information is needed, which should make these learning algorithms more reliable and efficient for real multi-input, multi-output systems.

Technical view

The paper addresses model-free output-feedback LQR for continuous-time LTI systems using filtered input-output data as a state surrogate, since true state feedback is unavailable. It identifies that the conventional filtered-vector parametrization contains deterministic redundancy that causes rank deficiency in Bellman-equation regressions used by reinforcement-learning-based LQR solvers, and characterizes the intrinsic (minimal) dimension: 2n independent components for SIMO systems and n(m+1) for general MIMO systems. This result lets practitioners construct minimal, well-conditioned filtered-state parametrizations for RL-based output-feedback control design, improving numerical stability and sample efficiency of policy/value-iteration-style LQR learning algorithms.

arXiv · cond-mat.mes-hallConceptual

Magnetic noise of a dark exciton Bose-Einstein condensate

A cloud of 'invisible' quantum particles gives off a magnetic hum that reveals it's really there.

Excitons are paired-up electrons and 'holes' (missing-electron spots) inside a material that, under the right conditions, can merge into a special collective quantum state called a Bose-Einstein condensate (BEC) — the same exotic state of matter achieved in ultracold atom clouds. A particular type, the 'dark' triplet exciton, would be an especially good candidate for this because it lives a long time, but that same property means it doesn't glow or interact with light, making it essentially invisible to normal detection methods. Here the researchers realized that because these dark excitons carry magnetic character, the condensate should produce a faint, fluctuating magnetic field — noise — that can be picked up using an ultra-sensitive magnetic sensor built from a defect in diamond (an NV center). By tuning an external magnetic field to flip the material between two magnetic orderings, they could watch this magnetic 'sound wave' signature change, giving the first indirect way to confirm this elusive quantum state exists.

Technical view

The work targets S_z=±1 triplet excitons as exciton-BEC candidates, whose long lifetimes (from suppressed radiative recombination) make them attractive for solid-state BEC but also optically dark and thus hard to detect directly. The authors show that the condensate's magnetic character produces measurable stray magnetic-field noise, detected via nitrogen-vacancy (NV) center magnetometry, and by sweeping an external field to tune the system between antiferromagnetic and ferromagnetic ordering, they track the longitudinal spin sound mode's evolution as an indirect BEC signature. This establishes NV magnetometry as a viable non-optical probe for dark-exciton condensates, opening a route to characterize collective excitations (e.g., Goldstone/sound modes) in systems where standard optical spectroscopy fails.

arXiv · physics.ins-detBuildable

Development and Initial Performance of an Upgraded NaI(Tl) Crystal Encapsulation for COSINE-100U

A redesigned crystal-and-sensor mount helps a dark-matter detector catch fainter signals more clearly.

The COSINE-100 experiment hunts for dark matter — the invisible substance thought to make up most of the universe's mass — by watching for tiny flashes of light in sodium-iodide crystals, and it specifically tests a decades-old, disputed claim (from the DAMA/LIBRA experiment) that dark matter causes a seasonal 'annual modulation' signal. For this upgrade, the team redesigned how the light-sensing tubes attach to the crystals, removing an extra glass layer and instead directly gluing the sensors to the crystal with a thin silicone pad, and even beveling the crystal edges on larger crystals to funnel more light toward the sensor. Collecting more of that faint light means the detector can catch weaker signals, improving its ability to spot very light, weakly-interacting dark matter particles that would otherwise be missed. They tested the new design with about 100 days of real data compared against the old detector's performance.

Technical view

COSINE-100U replaces the quartz optical windows of COSINE-100 with a direct PMT-to-crystal coupling via 2-mm silicone optical pads, reducing optical interfaces, and adds beveled crystal edges on larger NaI(Tl) crystals to improve light guidance to 3-inch high-quantum-efficiency PMTs, aiming to boost light-collection efficiency and thus lower-energy-threshold sensitivity for low-mass WIMP dark matter searches. Performance is benchmarked against 2462 hours (102.6 days) of room-temperature COSINE-100U data compared with contemporaneous COSINE-100 reference data. This encapsulation redesign is directly relevant to other NaI(Tl)-based direct-detection experiments seeking to independently test the DAMA/LIBRA annual-modulation claim with improved light yield and lower energy thresholds.

arXiv · physics.opticsBuildable

Near-Unity Excitation and Radiative Efficiencies in Electroluminescence Without External Carrier Injection

LEDs that glow bright without ever plugging in electrons directly.

Normally, an LED lights up because you inject electric charge (electrons and their positive counterparts, 'holes') directly into it, and making light without that direct injection has always been dim and power-hungry. This work builds a device that instead pulls charge from a 'remote reservoir' sitting off to the side, and pairs it with specially engineered nanocrystals (quantum dots) whose outer shells are layered in a gradually changing way. The result is a device that converts almost every excitation event into light instead of wasting it as heat, and channels that light out efficiently even under strong electric fields. The payoff is eye-poppingly bright red/green/blue displays that turn on at low voltage, hinting at a new, more efficient way to build screens.

Technical view

The authors demonstrate non-injecting electroluminescence (NI-EL) by decoupling excitation from direct carrier injection, instead sourcing carriers from remote, state-abundant reservoirs, which pushes excitation efficiency close to unity (>20x over baseline). Combined with quantum dots featuring nonmonotonically graded shell profiles that boost high-field radiative efficiency ~7-8x, the RGB devices achieve a 3.7 Vrms red turn-on threshold and luminance up to 291,628 nits under pulsed drive. This reframes AC/field-driven EL device design around reservoir engineering and shell-grading rather than conventional injection-layer optimization, offering a template for ultra-bright, low-power QD-EL displays.

arXiv · physics.app-phBuildable

A Frequency-Space Terahertz Transceiver Chip for Multi-Agent Communications and Spatial Awareness

A fingernail-sized chip lets robots talk and 'see' each other using invisible terahertz beams.

For robots or smart devices sharing a room to coordinate, they need both fast wireless links and a way to sense where each other are — and terahertz waves (way higher frequency than WiFi) offer huge bandwidth plus natural direction-finding ability. The catch is that steering those beams usually needs bulky, complicated antenna arrays. This team built a single tiny chip that combines the radio circuitry with a clever metasurface — a patterned layer of subwavelength structures — that bends different frequencies to different angles, so simply changing the signal's frequency sweeps the beam across 75 degrees using just four control points. That means one small, simple chip can both send data to many agents and know where they are, which is key for indoor robots, drones, or AR devices working together.

Technical view

The paper presents a 208-258GHz, 65nm CMOS transceiver integrating broadband front ends with a heterogeneous leaky-wave metasurface (HLM) aperture in a 1.5mm x 4.9mm footprint, achieving 75 degree frequency-controlled beam scanning with only four meta-atoms instead of dense phased-array beamforming networks. By co-designing frequency response and spatial radiation pattern, the chip performs integrated sensing and communication (ISAC) for multi-agent scenarios without element-level phase control or external THz illumination. This is a compact, scalable ISAC building block practitioners could adapt for indoor swarm robotics or embodied-AI localization/comms fabrics.

arXiv · eess.SYBuildable

Energy-Aware Wind-Resilient Routing for Truck-Assisted Multi-UAV Delivery under Wind Uncertainty

Delivery drones plan smarter flight paths so gusty wind doesn't strand them mid-route.

When trucks carry drones that hop out to make deliveries, wind can silently drain a drone's battery more than expected, risking it not making it back. This paper builds a route-planning system that treats the delivery area like a map of paths whose 'cost' (energy used) updates in real time as noisy wind readings come in, factoring in headwinds, crosswinds, battery voltage, and safety margins for the return trip. Instead of assuming calm, predictable conditions like older methods, it constantly re-plans conservatively to avoid drones getting stranded. The goal is safer, more reliable drone delivery networks that don't fail when the weather turns.

Technical view

EWR models the truck-UAV delivery problem as a time-dependent directed energy graph whose edge costs are updated online from delayed, noisy wind estimates, payload state, and conservative uncertainty margins, then performs risk-sensitive routing that accounts for return-to-truck feasibility under wind uncertainty. This contrasts with static/deterministic energy models that underestimate wind-driven propulsion cost risk. Evaluated on synthetic delivery graphs replayed against real wind logs from a public truck-drone dataset, the framework could be extended or benchmarked by researchers building risk-aware routing stacks for logistics UAVs.

arXiv · cond-mat.mes-hallRunnable

Realization of Arbitrary Gauge Fields via Symmetry-Protected Zero Modes

Sound-wave crystals fake exotic magnetic fields by cleverly wiring simple connections.

In physics, 'gauge fields' are like invisible force fields (similar to magnetism) that shape how particles move, and they're normally very hard to engineer artificially. This team found a general trick: by building networks of connected units with a specific imbalance and specific coupling strengths, they can make 'zero modes' (special resting states) that exactly mimic any desired gauge field pattern, not just an approximate one. They proved it works by building real acoustic crystals (structures that guide sound waves) that reproduce three different exotic physics scenarios, including one that mimics non-Abelian forces, a step up from ordinary magnetism-like fields. This gives physicists a hands-on toolkit to simulate exotic field theories using sound instead of exotic particle experiments.

Technical view

The method encodes arbitrary static O(N) lattice gauge configurations into the connectivity and coupling strengths of sublattice-imbalanced bipartite units, such that the target gauge Hamiltonian emerges as an exact spectral block (via decoupled zero-mode manifolds) rather than a perturbative approximation. The authors experimentally validate this in acoustic crystals across three cases: a Z2 quadrupole topological insulator, an SO(2) Hofstadter model, and an SO(3) non-Abelian topological insulator. This provides a reproducible, purely classical (acoustic) platform for realizing and probing non-Abelian and higher-symmetry gauge physics without cold-atom or superconducting-qubit infrastructure.

arXiv · cond-mat.mes-hallConceptual

Spatially Resolving the Pre-Thermal Anatomy of a Driven Bosonic Fluid

Scientists filmed, atom by atom, how a driven magnetic wave 'boils' toward equilibrium.

When you pump energy into a quantum system, it doesn't instantly settle into a calm equilibrium — it goes through messy intermediate stages, and understanding that process is a big open question in physics. Here, researchers used an ultra-sensitive magnetic sensor (built from defects in diamond called nitrogen-vacancy centers) to directly image, at micron scale, how spin waves ('magnons') in a thin magnetic film spread energy after being driven. They found the energy cascades through distinct, traceable steps — like dominoes — rather than instantly turning to chaotic heat, and they could even isolate individual interaction steps by using two tuned driving tones. This gives a rare direct, spatial picture of the 'road to chaos' in a quantum material, which matters for understanding and controlling energy flow in future magnetic and quantum devices.

Technical view

Using NV-center magnetometry for micron-scale spatial imaging of room-temperature magnon dynamics in YIG thin films, the authors resolve a discrete hierarchy of parametric scattering events preceding thermalization. A two-tone wave-mixing protocol isolates the elementary four-magnon interaction, with coupling strength extracted from the spatial growth of the scattering product; driving near ferromagnetic resonance with a single strong tone then reveals a spontaneous multi-generation scattering cascade. This spatially resolved, generation-by-generation dissection of pre-thermal dynamics offers a experimental benchmark for theories of driven many-body thermalization and a technique replicable in other magnon or bosonic platforms.

arXiv · eess.SYConceptual

Poisson Tangent Limits and Critical Policy Switching for Sampled Bellman Operators

Math reveals exactly how 'good enough' random guesses converge to the perfect decision.

Imagine an AI controller that, instead of considering every possible action, just randomly samples a handful of candidate actions at each step and picks the best one — a common shortcut in decision-making algorithms. This paper works out, in precise mathematical terms, how quickly that shortcut approaches the truly optimal decision as you sample more candidates, and what determines the pattern of near-miss choices along the way. They show the near-optimal candidates statistically cluster like a specific kind of random scatter (a Poisson process), and derive an exact formula for how far off the sampled approach is from optimal. This matters because sampling-based decision-making is everywhere in reinforcement learning and robotics, and knowing precisely how much accuracy you sacrifice for speed helps engineers choose how many candidates to sample.

Technical view

For discounted MDPs with continuous action spaces where the controller samples N candidate actions per state and selects among them, the authors develop first-order asymptotics for the value gap when the optimal action set has zero mass under the sampling distribution: the rescaled near-optimal candidates converge to a marked Poisson point process, and the leading-order value gap is characterized as the fixed point of a nonlinear tangential Bellman operator, a stochastic generalization of the classical resolvent operator arising from competition among near-optimal actions. This gives a rigorous convergence-rate and selection-rule theory for random-candidate/sampled Bellman methods, useful for practitioners tuning sample counts in sampling-based RL/continuous-control algorithms and for theorists extending large-deviations analysis to policy optimization.

arXiv · eess.SYConceptual

A Conceptual Framework for Enhancing Workforce Readiness for Smart Manufacturing in the AI Era

A 'readiness scale' to tell if workers are ready for AI-run factories.

This paper borrows the idea of a NASA-style 'Technology Readiness Level' scale, but points it at people instead of machines, to measure how prepared workers and students are for smart factories where AI, robots, and networked sensors run the show. It breaks readiness into nine progressive stages and grades people on four skill areas: understanding digital/AI tools, working with cyber-physical systems (machines linked to computers), collaborating with robots, and making decisions from data. A 'no-thin-pillar' rule means you can't just be great at one skill and weak everywhere else — you need balance across all four. The framework was tested at a university lab using 89 real industry-sponsored student projects, aiming to close the gap between what factories need and what schools currently teach.

Technical view

The Workforce Readiness Level (WRL) framework adapts NASA's TRL scale into nine competency stages scored against a four-pillar rubric — digital/AI literacy, cyber-physical systems fluency, human-machine collaboration, and data-driven decision making — aggregated into a composite per-stage score and a cohort-level index, with a 'no-thin-pillar' constraint preventing uneven skill profiles from scoring well. It was instantiated and validated at a university smart-manufacturing teaching lab using data from 89 sponsored capstone projects. Curriculum designers or workforce-development researchers could adopt the rubric directly or adapt the scoring weights for other technical domains. The main contribution is a structured, quantifiable way to benchmark competency development rather than relying on ad hoc course outcomes.

arXiv · cond-mat.mes-hallConceptual

Dynamics of the spontaneous emission factor in multiple quantum well nanowire lasers

The 'luck factor' behind laser light turns out to change from moment to moment, not fixed.

Quantum well lasers (a common design in nanowire laser chips) have a property called the eta factor, which describes how much of the light created inside them actually turns into a directed, coherent laser beam versus getting wasted. Researchers have usually treated this number as fixed, estimating it once and plugging it in, but this paper shows it actually depends on the physics happening inside the device — specifically how electrons jump between energy bands and how the laser cavity shapes those jumps. By calculating eta directly from these quantum details rather than guessing it, the team shows it shifts depending on things like how many charge carriers are present and how thick the internal layers are. This matters because it makes models of these tiny, energy-efficient lasers more accurate, which matters for designing better chips.

Technical view

The paper computes the spontaneous emission factor (η) for multiple quantum well (MQW) nanowire lasers directly from valence-to-conduction band transition physics combined with cavity mode structure, rather than treating it as a fitted constant as prior models did. This yields η as a function of charge carrier density and quantum well thickness, revealing dynamic behavior that affects predicted threshold power and the shape of the light-in/light-out (L-L) curve. Device modelers working on MQW nanowire lasers can use this dynamic η calculation to replace post-hoc fitting with a first-principles term, improving predictive accuracy of laser performance simulations.

arXiv · eess.SYConceptual

Matched Disturbance Rejection for Port-Hamiltonian Systems with Coupled Dynamics

Teaching machines to shrug off outside shoves by tracking energy flow, not just force.

Port-Hamiltonian systems are a way of modeling physical systems (robots, circuits, mechanical devices) by tracking how energy moves through them, which makes it easier to design stable controllers. This paper tackles the problem of external disturbances — unwanted pushes or interference — that themselves behave like their own little energy-based system coupled to the main one, which is harder to cancel out than a simple noise source. The authors build a unified model that folds the disturbance's dynamics into the main system's energy description, then design controllers that cancel it out, first assuming the disturbance's internal properties are known, then extending to the case where those properties are unknown and must be estimated on the fly. This generalizes disturbance-rejection to more realistic, tangled situations than prior methods allowed.

Technical view

The paper addresses matched disturbance rejection where the disturbance itself is generated by coupled port-Hamiltonian (PH) dynamics affecting the plant via both the matched input channel and the interconnection structure, relaxing the restrictive disturbance-structure assumptions of prior work by allowing nonzero interconnection and damping terms. A baseline rejection scheme is derived assuming known disturbance storage parameters, then extended via online estimation of an unknown symmetric storage matrix, with two control designs under different structural conditions. Control engineers working with PH-modeled plants (robotics, power electronics, mechatronics) could apply this to reject structured, dynamically-coupled disturbances beyond what standard matched-disturbance observers handle.

arXiv · eess.SYBuildable

Forward Trajectory Steering for Hamilton-Jacobi Reachability Analysis

A neural network learns where robots can safely go, without solving giant equations by hand.

Hamilton-Jacobi reachability is a rigorous mathematical way to guarantee that a robot or vehicle stays safe (e.g., a drone avoiding obstacles), but the underlying equations become brutally expensive to solve as systems get more complex. Physics-informed neural networks offer a shortcut by training a network to approximate the solution instead of grinding through it directly, but they're finicky about which sample points you train on. This paper introduces STEER2REACH, a method that smartly and cheaply picks better training points as it goes, without needing the complicated extra scaffolding other approaches require. The payoff is a simpler, more practical way to compute safety guarantees for complex robots and autonomous systems.

Technical view

S2R (STEER2REACH) is a physics-informed neural network (PINN) solver for Hamilton-Jacobi-Isaacs safety value functions that introduces a lightweight, low-overhead adaptive collocation sampling distribution, avoiding the complex training pipelines and auxiliary supervision that existing PINN-based HJ reachability solvers require. It requires minimal modification on top of standard PINN training, making it easier to integrate into existing safe-control pipelines for high-dimensional dynamical systems. Practitioners building safety-critical controllers (autonomous driving, aerospace) could adopt S2R's sampling strategy as a drop-in improvement to accelerate learning accurate safety value functions without redesigning their PINN architecture.

PHY

Physics

50 new
arXiv · cond-mat.mes-hallConceptual★ flagship

Wormhole Geometry from a Magnetic Vortex

An electron sliding through a magnetic whirlpool feels the same curved space as a wormhole throat.

In some magnetic materials, the magnetization swirls into a vortex — a whirlpool-like pattern with a fixed topological 'winding.' When an electron moves through such a texture while strongly coupled to it, its spin gets dragged along, and the physics is mathematically identical to the electron traveling through *curved space* — the same warped geometry that describes the throat of an Ellis wormhole from general relativity, a tunnel-like bridge with a minimum radius. The authors show this vortex reproduces a wormhole's exterior geometry, with the throat's size set by the vortex's winding number and the strength of the electron-magnet coupling. Two clean fingerprints follow: electrons deflect along a single universal 'Ellis curve,' and a quantum spin phase produces a half-strength Aharonov–Bohm effect that switches on or off depending on whether the winding is even or odd. Excitingly, you don't need a real wormhole — the same effect can be engineered in a designer honeycomb lattice and probed by watching how electrons scatter.

Technical view

Strong coupling of an itinerant electron to a magnetic vortex maps its spatial propagation onto motion in an emergent ultrastatic curved metric identical to the exterior of an Ellis wormhole, with throat radius fixed by the topological winding charge and the Hund exchange coupling and regularized at short range by the microscopic core. Two separable, falsifiable signatures result: electron deflection collapses onto a single Ellis geodesic curve parameterized by winding and exchange, and the spin Berry phase yields a half-flux Aharonov–Bohm response gated by winding parity (on for odd, off for even). The metric is emulable in a designer honeycomb lattice where the valley-symmetrized wave-packet response follows the predicted exterior geodesic. Experimental probes are real-space electron deflection and scattering measurements, giving distinct routes to test the emergent-geometry prediction.

arXiv · cond-mat.str-elConceptual★ flagship

Two routes to quantum anomalous Hall states in altermagnets

Two ways to make an exotic magnet carry electricity along its edges without any magnetic field.

This is a theory paper about "altermagnets" — a newly recognized kind of magnet where the up-spin and down-spin atoms are arranged in a way that isn't quite like ordinary magnets, giving them unusual behavior even though they have no net magnetic pull. The researchers ask whether such a material can become a "quantum anomalous Hall" state, meaning electricity flows perfectly along its edges while the inside stays insulating — a robust, lossless conduction that normally needs a strong magnet. Using a simplified computer model of atoms on a square grid, they show two tricks to switch on this special edge-conducting phase: one is tweaking the crystal so its two otherwise-identical atom sites become subtly unequal (a "staggered potential"), and the other is applying a magnetic field pointing out of the flat sheet. Either route flips an ordinary altermagnet into a topological one with a precisely quantized electrical response. It matters because such lossless, protected edge currents are prized building blocks for low-power and quantum electronics.

Technical view

Starting from a minimal square-lattice Hubbard model with antisymmetric spin-orbit coupling reflecting an orthorhombic structure — a setup that hosts a topologically trivial altermagnetic state — the authors add Rashba spin-orbit coupling plus perturbations to drive topological transitions. Route one uses a staggered sublattice potential that breaks the symmetry relating crystallographically equivalent sublattices, producing a Chern number C=1 phase with quantized Hall conductivity |σ_xy| = e²/h. Route two induces the same topological character via an out-of-plane magnetic field. The mean-field/tight-binding framework is standard and reproducible, and the identified symmetry-breaking knobs give experimentalists concrete design criteria — orthorhombic altermagnets with engineered sublattice asymmetry or applied field — for realizing quantized anomalous Hall transport.

arXiv · cond-mat.str-elConceptual

Proliferation Transitions for Non-Abelian Anyons

A recipe for 'melting' exotic quantum particles into new phases of matter, mathematically.

In certain 2D quantum materials, strange particle-like excitations called anyons can exist, some of which are 'non-abelian,' meaning the order in which you swap them changes the outcome — a property with potential use in quantum computing. This paper works out how to trigger a phase transition where these anyons 'proliferate' (spread and merge into the vacuum), which changes the material's overall topological character. The authors use a technique called Symmetry Topological Field Theory as a systematic toolkit, essentially building a higher-dimensional 'sandwich' model that captures the symmetry structure and lets them trigger the transition in a controlled way. They demonstrate the method on both simpler and more exotic examples, extending physicists' toolkit for understanding how these bizarre matter phases transform into each other.

Technical view

The paper constructs proliferation phase transitions for condensable anyons in general 2+1d topological orders, including non-abelian ones, using Symmetry Topological Field Theory (SymTFT) as the organizing framework: the symmetry is identified from transparent lines generated by condensable anyons, and the topological order is realized as a 3+1d SymTFT sandwich, with the transition implemented by coupling scalar fields to anyons on the symmetry boundary. The construction is demonstrated for abelian theories as well as non-abelian examples, D(S₃) and SU(2)_k Chern-Simons theories, and extended to anomalous anyons. This gives condensed-matter/topological-order theorists a systematic, generalizable recipe for constructing and analyzing anyon condensation transitions beyond case-by-case abelian examples.

arXiv · quant-phBuildable

Quantum-limited imaging using diffractive optical neural networks

An all-optical AI 'lens' that images at the sharpest limit physics allows.

This work treats the problem of imaging — capturing a picture of something — as a question of how precisely you can measure fine spatial detail, framed using the rules of quantum measurement, which set a hard theoretical limit on how sharp any image can ever be. The team designs a physical device made of layered, sculpted optical material (a 'diffractive optical neural network') combined with photon counting that processes light as it passes through, reaching that theoretical sharpness limit rather than falling short of it like conventional cameras. They show, through reconstructed images, that this approach recovers finer detail than standard direct imaging methods. The bigger goal is a practical way to build microscopes, telescopes, or remote-sensing instruments that get as much information out of every photon as physics allows.

Technical view

The authors frame imaging as multiparameter quantum estimation of band-limited spatial-frequency amplitudes, computing precision limits for separable (single-copy) measurements via semidefinite programming to evaluate the Nagaoka-Hayashi Cramér-Rao bound. They propose a diffractive optical neural network combined with photon counting as a measurement architecture that saturates this bound, and demonstrate via image reconstructions that it recovers fine features at the quantum limit, outperforming direct imaging. This provides a scalable, physically realizable architecture (all-optical layers plus photon counting, no digital processing bottleneck) that researchers in superresolution microscopy, telescopy, or remote sensing could adapt to approach quantum-optimal imaging precision.

arXiv · quant-phBuildable

Eigenstate Preparation Through Near-Optimal Eigenprobability Filtering

A quantum algorithm hunts down the right 'answer state' without knowing the answer in advance.

Quantum computers are expected to shine at simulating molecules and materials, but a key challenge is preparing 'eigenstates' — the stable, well-defined configurations (like specific energy levels) a quantum system can settle into — especially when you don't already know which energy level you're looking for or your starting guess isn't close enough. This paper introduces an algorithm called DEFEAT that filters out and amplifies the eigenstate most similar to whatever initial state you feed in, without needing to know its energy value beforehand. The trick is a mathematical procedure that converts the initial state into a kind of probability map over all possible eigenstates, then sharpens that map to pick out the dominant one. This removes a major practical roadblock for using quantum computers in chemistry and materials science simulations.

Technical view

DEFEAT (Dominant Eigenstate Filtering via Eigenprobability Amplification and Thresholding) prepares the eigenstate with largest overlap with a given initial state without requiring prior knowledge of its eigenvalue, by constructing twirling superoperators that map the initial state to an eigenprobability density operator ρ diagonal in the Hamiltonian eigenbasis, encoding its spectral weights, implemented via block-encoding. This sidesteps the usual requirement of a good eigenvalue estimate or strong initial-state overlap that limits standard quantum phase estimation-based state preparation. Researchers building quantum simulation algorithms for chemistry or materials science could use DEFEAT as a subroutine to robustly prepare excited or ground states when the target eigenvalue is unknown or overlap is weak.

arXiv · hep-exConceptual

Measurement of the $\bar ν_μ-$Hydrogen Charged-Current Quasi-Elastic Cross Section using the NOvA Near Detector

Physicists measured, with record precision, how ghostly antineutrinos crash into lone protons.

Neutrinos (and their antimatter partners, antineutrinos) are nearly massless particles that barely interact with anything, making them notoriously hard to study, yet precise knowledge of how they interact with matter is essential for experiments trying to understand these particles. This measurement focuses on a specific, cleaner type of interaction — antineutrino hitting a lone hydrogen proton and converting it into a neutron plus a muon — using a massive detector exposed to an intense particle beam. By carefully selecting signal events and using real data to correct for contamination from antineutrinos hitting heavier atomic nuclei (which behave differently and muddy the picture), the team achieved the most precise and highest-statistics measurement of this reaction ever made. This kind of precise cross-section number is a key ingredient other neutrino experiments need to correctly interpret their own data.

Technical view

Using the NOvA near detector's hydrogen-rich (10.8%) target with a 1.2×10²¹ proton-on-target NuMI beam exposure, the authors measure the charged-current quasi-elastic cross section for ν̄μ + H → μ⁺ + n, selecting 35,509 signal events via topological and kinematic constraints — the highest-statistics (anti)neutrino-hydrogen interaction sample to date. Backgrounds from interactions on heavier nuclei were constrained using dedicated data control samples, substantially reducing systematic uncertainty. The result, σ = 0.538 ± 0.009(stat) ± 0.010(syst) ± 0.055(flux) × 10⁻³⁸ cm² at ⟨E⟩ = 1.9 GeV, is the most precise such measurement to date and provides a valuable free-nucleon benchmark for tuning nuclear interaction models used across the neutrino oscillation program.

arXiv · quant-phBuildable

A Unified Quantum Interferometric Framework for Interaction-Free Measurement and Delayed-Choice Experiments

A quantum switch lets physicists dial smoothly between two famous 'seeing without touching' experiments.

This is a theory paper that builds one unified toolkit for two classic quantum weirdness demos: 'interaction-free measurement' (detecting a bomb without touching it, since just checking whether light could have hit something changes the outcome) and 'delayed-choice' experiments (deciding whether to look for particle-like or wave-like behavior after light has already passed through). The problem is these two effects have always been treated as separate quantum tricks. The authors add an extra 'helper' qubit (a quantum bit) that can partially trigger the photon-bomb interaction, letting the system smoothly slide between the two behaviors instead of jumping between them. This matters because it shows both phenomena spring from the same underlying quantum mechanism, which could simplify how quantum sensing devices are designed.

Technical view

The authors embed IFM and DC experiments into a single quantum-circuit formalism where an ancillary control qubit coherently gates the photon-bomb interaction, producing a continuously tunable superposition of 'interaction' and 'non-interaction' branches. Sweeping the control qubit's state interpolates between canonical IFM outcomes and DC particle/wave complementarity, unifying both as limits of one gate-controlled process. The framework stays fully consistent with unitary QM, and the proposed circuit could be implemented on gate-based photonic or superconducting-qubit hardware to experimentally realize both effects and the continuum between them.

arXiv · quant-phConceptual

Conditional dependence and Scrooge ensembles in shallow random quantum circuits

Measuring a few qubits in a 'shallow' random circuit can secretly link far-apart qubits together.

Random quantum circuits are grids of quantum gates applied in just a few layers, so normally information in them only spreads a limited distance, like ripples that don't reach far. But this paper shows that if you measure some of the qubits, the remaining ones can become strangely correlated even at long distances — an effect that emerges only from the act of measuring. The researchers split the qubits into three groups and study how what's observed in one group affects the possible states of another, comparing the pattern to a known statistical model called a 'Scrooge ensemble.' This matters for quantum computing because such measurement-induced correlations are central to proving a quantum computer can outperform a classical one.

Technical view

The authors study measurement-induced conditional correlations in 2D shallow random quantum circuits, where the post-measurement state on region A conditioned on outcomes in B (averaged over outcomes in C) is conjectured to converge, above a critical depth d*, to a Scrooge ensemble — a generalization of the Haar-random ensemble with fixed average density matrix. This formalizes how measurement induces long-range entanglement absent from the pre-measurement lightcone-bounded state. The result bears directly on quantum advantage protocols like random circuit sampling, since Scrooge-ensemble statistics govern achievable correlations and hence classical simulability bounds.

arXiv · astro-ph.GAConceptual

Evidence for the First Globular Cluster Stellar Stream beyond the Milky Way

Astronomers found the first-ever shredded-star-cluster trail outside our own galaxy.

When a small clump of stars called a globular cluster orbits too close to a galaxy, gravity can slowly pull it apart into a long thin trail called a tidal stream. These streams are great for measuring a galaxy's invisible dark matter, because how the stream bends and stretches reveals the pull of unseen mass. Until now, such globular-cluster streams had only been spotted in the Milky Way. Using deep Hubble Space Telescope images, this team found one in a distant, faint, puffy galaxy called UGC9050-Dw1, based on the stream's shape, color, and its link to a compact star clump — opening a new way to weigh dark matter beyond our own galaxy.

Technical view

The authors report photometric evidence from deep HST imaging of a tidal stellar stream associated with a globular cluster in the ultra-diffuse galaxy UGC9050-Dw1, identified via stream morphology, color consistency with an old stellar population, and spatial association with a compact progenitor-like source. This is presented as the first extragalactic globular-cluster stream, extending a well-established Milky Way technique (stream width/thickness constrains halo mass and substructure) to external galaxies for the first time. Since ultra-diffuse galaxies are central to the dark-matter-content debate, this stream offers a direct dynamical handle to constrain UGC9050-Dw1's halo mass independent of kinematic methods; follow-up spectroscopy could quantify these constraints further.

arXiv · quant-phConceptual

Isospectral majorization and isoperimetric inequalities for coherent states on the Bloch sphere

A math proof shows quantum 'fuzziness patterns' spread out most when arranged in one natural order.

In quantum physics, 'coherent states' are the closest thing to a point in space that quantum mechanics allows, and the Husimi function plots how spread out or 'fuzzy' a quantum state looks over that space. This is a pure-math result proving that among all quantum states sharing the same set of underlying probability weights, the one arranged in decreasing order produces the most spread-out, least-concentrated fuzziness pattern, no matter how you choose to measure 'spread.' It generalizes a known inequality (Lieb-Solovej) to compare the whole shape of these patterns, not just totals. This sharpens tools researchers use to bound quantities like entropy (a measure of uncertainty) across huge families of quantum states at once, useful in quantum optics and information theory.

Technical view

Working in the (N+1)-dimensional space of SU(2) Bloch coherent states, the authors prove that the Husimi function of a density operator ρ, when its eigenvalues are sorted in decreasing order along the monomial basis (ρ↓), majorizes that of any other ρ with the same spectrum — an isospectral strengthening of the Lieb-Solovej inequality holding for every convex function Φ. Applying this to the concave entropy function Φ(t) = -t log t yields sharp Wehrl entropy bounds, proved by showing the Lieb-Solovej channel output for ρ is majorized by that for ρ↓. This gives a systematic tool for bounding Wehrl-type entropies and isoperimetric quantities across entire spectral families of states, useful for extremal-state problems in quantum optics.

arXiv · hep-thConceptual

Quantum Airy Structures and Matrix Models: a supercurrent approach

A new math trick unifies four flavors of supersymmetric string equations into one elegant transformation.

This is deep mathematical physics connecting matrix models (grids of numbers used in string theory and quantum gravity calculations) to structures called 'Airy' constraints, extended to include supersymmetry — a theoretical pairing between different particle types. There are four flavors of these supersymmetric setups, normally handled with separate, incompatible math. The authors build a unified 'supercurrent' language treating all four flavors' hidden symmetries with one framework, and find an exact dictionary translating between two of them. This matters to theoretical physicists because these constraint structures underlie calculations in string theory and 2D quantum gravity, so a unifying framework could simplify very hard computations.

Technical view

The paper extends Quantum Airy Structures to the N=1 super-Virasoro setting via a 'supercurrent' assigning independent bosonic and fermionic monodromies, unifying the NS-NS, NS-R, R-NS, and R-R sectors of external-source matrix models through a super-Miwa transform expressing the projected super-stress tensor as a spectral differential operator. Dilaton shifts produce genuine Super Quantum Airy Structures in NS-NS/R-NS, while R-R/NS-R require an extra Grassmann coordinate. The main result is an exact similarity transformation mapping NS-NS to R-R constraints, with an intertwining kernel built from a bosonic determinant, cubic Airy weight, and Grassmann exponential — a concrete Ward-identity system that matrix-model/topological-recursion researchers could use to derive R-R partition functions from known NS-NS solutions.

arXiv · hep-thConceptual

A sharp bound on spacetime distance from quantum entanglement

How entangled two boundary regions are sets a hard limit on how far apart they are inside spacetime.

In holography, physicists believe a universe with gravity can be fully described by a lower-dimensional 'boundary' theory without gravity, and that quantum entanglement (intimate correlation between distant particles) on that boundary encodes the interior's geometry. Earlier work showed entanglement determines the area of interior surfaces; this paper shows it also strictly limits the distance between two interior points, a limit that blows up to infinity as boundary correlation fades to zero. They build this local rule into a broader argument about when the interior can even stay connected. This matters because it's a concrete, checkable link tying abstract quantum information to actual geometric distance, deepening the idea that spacetime is built out of entanglement.

Technical view

Extending the Ryu-Takayanagi area/entanglement correspondence, the authors derive a metric-level statement: boundary mutual information between two regions gives a rigorous lower bound on bulk geodesic distance between corresponding points, diverging logarithmically as mutual information vanishes. A multiscale iteration of this local inequality constructs a global obstruction to bulk connectivity based purely on boundary correlation data. Applied to parallel strip regions in AdS5/CFT4, the bound forces a quantum resolution of the known classical mutual-information phase transition and pins down the asymptotic scaling of bulk geodesic distance with boundary separation, giving holography researchers a sharp inequality usable for constraining candidate bulk reconstructions.

arXiv · hep-thConceptual

Aspects of Carrollian field theory from holography

Physicists derive the 'speed-limit-free' rules of flat spacetime gravity straight from its holographic shadow.

Holography says gravity in a region of spacetime can be equivalent to a simpler theory on its boundary, one dimension down and without gravity. This is well understood for spacetimes that curve inward, but our universe is closer to flat, and physicists are still building the flat-spacetime version, where the boundary theory is a strange 'Carrollian' theory — essentially what happens if the speed of light shrinks to zero. This paper works out, directly from the gravity side, key energy-and-momentum bookkeeping quantities of that boundary theory for flat 3D spacetimes and shows they match abstract predictions. This is a concrete brick in building 'flat-space holography,' a major open problem for understanding quantum gravity in our more realistic, non-curved universe.

Technical view

The paper constructs the holographic quasilocal stress tensor for three-dimensional asymptotically flat spacetimes carrying Bondi mass and angular momentum, showing that under BMS3 (2d Carrollian conformal) transformations it acquires an inhomogeneous 'BMS Schwarzian' anomaly term. Extracting central charges from this term reproduces the known algebraic result (cL=0, cM=3/G) obtained via the c→0 ultrarelativistic contraction of Brown-Henneaux central charges, verifying the flat-space/Carrollian holographic dictionary at the stress-tensor level rather than just the asymptotic symmetry algebra. This gives a computable stress-tensor formalism researchers can extend to correlators or entanglement entropy within BMS/Carrollian holography.

arXiv · quant-phBuildable

Capability-Adaptive Cryptanalysis with Reduced-Space Quantum Verification

A framework melds classical code-breaking tricks with quantum search to narrow down secret keys faster.

Cryptanalysis is the art of breaking codes, and there are classical techniques — linear, differential, and side-channel attacks that watch physical clues like power usage — for narrowing down which secret key a cipher might use. This paper combines all these classical filtering techniques into one framework that shrinks the candidate-key pool as much as possible, then hands the smaller pool to a quantum computer, which uses 'amplitude amplification' (a quantum search speedup) to verify the real key faster than checking candidates one by one classically. They back this with formal math on how much the pool shrinks and how that trades off against quantum verification effort, plus a physics-style description of how the quantum search step could run on real hardware. This matters for security researchers estimating how quantum computers, combined with smart classical pre-filtering, could weaken existing encryption.

Technical view

The framework layers linear cryptanalysis, differential cryptanalysis, and side-channel leakage analysis as classical candidate-space reduction stages feeding into a Grover-style amplitude-amplification quantum verification step over the reduced key-candidate space, with a formal model characterizing the trade-off between candidate-space contraction and quantum query complexity. A Hamiltonian formulation frames the reduced-space verification oracle as a physically realizable quantum search process rather than an abstract circuit. This targets a practical hybrid attack complexity model useful for estimating realistic security margins of ciphers under combined classical-plus-quantum attacks, though the abstract doesn't specify which ciphers or concrete speedup factors were evaluated.

arXiv · quant-phConceptual

Parity Mapping for Quantum Optimization on Frustrated Ising Rings

A clever relabeling trick makes quantum computers solve a notoriously tricky puzzle ring faster.

Imagine a ring of tiny magnets that can never all agree on which way to point — that frustration makes it a brutal test case for quantum computers trying to find the lowest-energy, most stable arrangement. This paper studies a mathematical trick called 'parity mapping,' which relabels the problem in a different way before handing it to two flavors of quantum optimization: slow, continuous 'quantum annealing' and a step-by-step algorithm called QAOA. The trick widens the narrowest bottleneck (the 'gap') that normally makes these ring problems exponentially hard as they get bigger, essentially giving the quantum computer a wider, smoother path to the answer. That matters because these frustrated rings are stand-ins for much harder real-world optimization problems, so anything that speeds them up hints at broader quantum speedups.

Technical view

The authors examine how a parity (redundant qubit) encoding of the frustrated Ising ring affects the minimum spectral gap relevant to adiabatic quantum annealing and QAOA performance. Finite-size numerics show the parity mapping increases the minimum gap under their chosen energy normalization, improving continuous-time ground-state preparation. An idealized Parity-QA implementation with a single global constraint shows no evidence of exponential gap closing across accessible system sizes, while a more hardware-realistic decomposition is also examined (abstract cuts off before full comparison). This suggests parity encodings could mitigate the exponential slowdown that plagues QA on frustrated systems, offering a concrete encoding-level lever for practitioners benchmarking annealers or QAOA circuits on hard Ising instances.

arXiv · gr-qcConceptual

A Covariant Distributional Approach for Junctions in Torsional Locally Rotationally Symmetric Class II Spacetimes

Physicists build a coordinate-free rulebook for stitching together warped spacetimes with twist.

In general relativity, sometimes you need to glue two different patches of spacetime together — like matching the inside and outside of a star — and making sure that seam is smooth. The usual method for checking that seam depends on which coordinate system you happen to be using, which is awkward and can hide mistakes. This paper develops a coordinate-independent way to check these seams, extending the math to also handle 'torsion,' a twisting property some gravity theories include beyond standard Einstein gravity. They apply it to a particular torsion-including theory and show their method gives cleaner, more reliable conditions for a smooth join than the older approach. It matters because it gives theorists a more trustworthy toolkit for building consistent models of exotic spacetime regions, like stellar interiors or cosmic transitions.

Technical view

The paper extends distribution theory on curved manifolds with torsion, combined with a covariant formalism, to derive coordinate-independent differentiability conditions for junctions between spacetime regions ('thin shells' or matching surfaces) in Locally Rotationally Symmetric class II spacetimes. Specializing to Einstein-Cartan-Sciama-Kibble gravity, they derive explicit smooth-junction conditions that hold regardless of coordinate choice, avoiding the gauge-dependence pitfalls of the standard Israel-Darmois formalism. This provides a rigorous, reusable framework for researchers studying junction conditions (e.g., stellar surfaces, bubble walls, torsion-sourced matter shells) in torsionful gravity theories, replacing ad hoc coordinate-specific derivations with a general covariant machinery.

arXiv · gr-qcBuildable

Finding black hole spins efficiently during a numerical binary evolution

A faster math shortcut lets simulations track spinning black holes without grinding to a halt.

When two black holes orbit and merge, supercomputers simulate the whole collision, and one useful thing to extract along the way is each black hole's 'spin' — but there's no single perfect definition of spin when the holes are close together, only reasonable approximations. One popular method finds special symmetry patterns ('Killing vectors') on the black hole's surface, but the calculation gets brutally expensive as simulations use finer detail, scaling so badly that doubling the resolution can make it over 60 times slower. This paper describes a smarter, more efficient way to do that same calculation without sacrificing accuracy. That matters because it lets researchers run higher-resolution, more realistic black-hole merger simulations — especially tricky cases with fast spins or very unequal masses — without spin calculations becoming the bottleneck.

Technical view

Computing Approximate Killing Vector (AKV) spin in numerical relativity (as used in SpEC) requires solving a generalized eigenvalue problem of size O(L²) on the apparent horizon, with a naive direct solve costing O(L⁶) in the spherical-harmonic resolution L. The authors present a more efficient algorithm for this AKV spin computation, reducing the computational cost relative to the direct solve while preserving accuracy, which matters for simulations of high-spin or high-mass-ratio binaries that require large L. This directly benefits practitioners running SpEC (or similar codes) by removing a scaling bottleneck in apparent-horizon-based spin/mass diagnostics during binary black hole evolutions.

arXiv · hep-thConceptual

On divergences in a four-derivative scalar field theory

Mathematicians prove a weird four-derivative particle theory stays finite and tidy at every loop order.

Some proposed theories of particles use unusual equations with four layers of derivatives instead of the usual two, and physicists worry these could spiral into infinite, meaningless answers when you calculate more precisely (adding more 'loops' to the calculation, like adding more decimal places of rigor). This paper carefully checks a specific family of these four-derivative theories through three loops of calculation and proves that a whole class of quantities stays finite at every order, no matter how far you push the math. They also discover a special hidden symmetry that keeps a particular simple version of the theory's equations protected from being messed up by these corrections. This matters because such theories are candidates for taming the notorious infinities in quantum gravity, so proving they behave predictably is a real step toward usable quantum theories of gravity.

Technical view

The authors extend the renormalization analysis of Holdom's shift-symmetric four-derivative scalar theories from one to three loops, using both the R* method and asymptotic momentum expansions. They prove Euclidean off-shell correlators are IR finite to all orders and derive a non-renormalization theorem: the purely cubic interaction is RG invariant and a perfect-square Lagrangian structure is preserved under renormalization, a result traced to a Ward identity in the conformally flat limit of quadratic gravity (CFQG). This gives a concrete, checkable all-orders structural result for a toy model relevant to quadratic-gravity-based approaches to renormalizable quantum gravity, and the R*/asymptotic-expansion machinery is directly reusable for higher-loop checks or related shift-symmetric theories.

arXiv · astro-ph.IMRunnable

LIGO Detector Characterization in the Second and Third Parts of the Fourth Observing Run

LIGO engineers detail how they hunted down noise gremlins during a year of gravitational-wave hunting.

LIGO detects gravitational waves — ripples in spacetime from colliding black holes and neutron stars — by measuring impossibly tiny stretches in laser beams, which means any stray noise (traffic, earthquakes, equipment glitches) can fake or mask a real signal. This paper is essentially a detailed maintenance and detective report from LIGO's two observatories covering a chunk of their fourth observing run, describing hardware upgrades, repairs, and investigations into noise sources. They explain how they identify what's causing glitches in the data and how they clean or filter them out so scientists can trust the hundreds of detected black-hole and neutron-star mergers from that run. It matters because good 'detector characterization' is the unglamorous but essential work that makes every gravitational-wave discovery scientifically credible.

Technical view

This is a detector characterization report covering LIGO Hanford and Livingston operations across O4a's tail, O4b, and O4c, summarizing hardware/configuration changes (including a commissioning break before O4b and mid-run repairs during O4c) and the instrumental noise investigations conducted to identify and mitigate glitches and transient noise affecting compact binary coalescence searches. It documents the methods used to trace noise couplings back to instrumental/environmental origins and the mitigation strategies applied. For practitioners, this serves as the reference for data-quality vetoes, noise-subtraction choices, and known instrumental artifacts relevant to any analysis using O4b/O4c LIGO strain data.

arXiv · math.AGConceptual

K3 atoms of the cubic fourfold and the BPS structure of the Painlevé I determinant line

String theorists use a famous unsolvable-looking equation to test a conjecture about hidden geometric 'atoms'.

Deep in advanced geometry, mathematicians study 'cubic fourfolds' — a class of higher-dimensional shapes — and a conjecture that a hidden K3-surface-like structure ('K3 atom') inside them is somehow protected by the dynamics of the system as you deform it. This paper tests that idea using exactly-solvable toy models, including a classic equation from 1900s mathematical physics called Painlevé I, and a structure from string theory called BPS states (special stable particle-like configurations). They trace how certain mathematical invariants evolve, find that a supposed crossover point is not actually a barrier ('not a wall'), and connect the whole picture to a precise number-theoretic dictionary. This matters for the ongoing project of understanding how abstract geometric shapes decompose into simpler pieces, a deep question linking algebraic geometry, string theory, and mathematical physics.

Technical view

The paper investigates whether the semiorthogonal decomposition of a cubic fourfold remains compatible with Bridgeland stability conditions away from the generic point, testing the conjectured 'dynamical protection' of the K3 atom via exactly solvable noncommutative minimal models (uncoupled Fano models like P¹ and P¹×P¹ at resonance, and the coupled A₂ quiver case). They track the quantum cohomology path's exit from the geometric stability chamber and show a resonance-associated ε-crossover is not a genuine wall. They further formulate a 'tau-JLO dictionary' linking the deformed cubic oscillator/Painlevé I tau function to a BPS determinant line identification, computing closed-form quantum periods through order Z₄ and establishing all-orders flatness — providing concrete computational anchors for researchers working on categorical/derived approaches to Fano and cubic fourfold geometry.

arXiv · hep-phConceptual

The $D^*D^*π$ and $B^*B^*π$ couplings from light-cone sum rules

Physicists pin down precisely how strongly heavy quark particles talk to pions using QCD sum rules.

Particles called D and B mesons (built from heavy quarks) can emit a lightweight particle called a pion, and how strongly they do so — the 'coupling strength' — is a key ingredient for predicting all sorts of particle physics processes. Since you can't just solve the underlying quark theory (QCD) exactly, physicists use a clever indirect technique called light-cone sum rules, which relates known quantities to the unknown coupling through mathematical consistency conditions. This paper sharpens that calculation by including more correction terms and more detailed descriptions of the pion's internal structure than before, squeezing out a more precise, trustworthy prediction. It matters because these coupling numbers feed directly into predictions and interpretations of experiments studying heavy-particle decays and exotic multi-quark states.

Technical view

The authors recompute the D*Dπ-type strong couplings g_{D*D*π} and g_{B*B*π} via light-cone sum rules (LCSR), extending the correlation function's accuracy by deriving the hard-collinear factorization formula at leading power to next-to-leading order in α_s, and by systematically including next-to-leading power contributions from two- and three-particle pion light-cone distribution amplitudes up to twist-4. Matching QCD-level spectral representations to hadronic dispersion relations, they extract numerical predictions with quantified uncertainty from finite heavy-quark-mass effects and the quark-hadron duality ansatz. These refined couplings are directly usable as inputs for effective Lagrangians (e.g., heavy meson chiral perturbation theory) and for modeling heavy-quark hadronic decay and exotic-state phenomenology.

arXiv · gr-qcConceptual

Robustness of the primordial power spectrum in hybrid loop quantum cosmology to approximations near the bounce

A quantum tweak to Big Bang theory gives the same answer no matter how you approximate the bounce.

Loop quantum cosmology is a theory that replaces the Big Bang's problematic infinite crunch with a smooth 'bounce,' and one of its jobs is to predict the pattern of density ripples that seeded galaxies — the primordial power spectrum. Doing that calculation exactly is hard, so physicists use an approximation for how the 'effective mass' of these ripples behaves near the bounce, often modeled with something called a Pöschl-Teller potential (a specific mathematical curve shape). This paper checks whether that choice of approximation actually matters by trying different reasonable stand-ins for the true mass curve and comparing the resulting predictions. They find the predictions barely change as long as the approximation captures the right characteristic scale of the bounce, meaning the method is robust rather than a fragile artifact of one specific choice. This matters because it strengthens confidence that loop quantum cosmology's predictions about the early universe aren't just mathematical flukes.

Technical view

In hybrid loop quantum cosmology with the non-oscillatory vacuum state (asymptotic Hamiltonian diagonalization), the authors test the robustness of the analytic approximation used to compute the primordial power spectrum by varying the modeled effective mass of cosmological perturbations near the quantum bounce. Comparing the standard Pöschl-Teller potential approximation against alternative estimations of the effective mass, they find the resulting power spectra are indistinguishable provided each approximation correctly captures the bounce's characteristic scale (which sets the power-suppression scale). This confirms that prior LQC power-spectrum predictions aren't artifacts of the specific Pöschl-Teller choice, giving practitioners license to use simpler analytic mass approximations without sacrificing predictive accuracy in the vacuum-state calculation.

arXiv · quant-phConceptual

Floquet-Resolved Dissipation Selects Entanglement Beyond Population Spectroscopy

Two 'equally valid' theories of a driven quantum device secretly disagree about whether entanglement survives.

This is about qubits (tiny quantum switches) that get periodically shaken by an external drive while also leaking into their environment. Physicists usually check such setups by comparing how often each state gets occupied over time, but this paper shows that two different, seemingly equivalent ways of modeling the environment's effect can match perfectly on those occupation numbers while predicting completely different amounts of surviving quantum entanglement. The two approaches differ in how they mathematically track which 'channel' the system leaks energy through — one uses a fixed reference frame, the other tracks the full rhythm of the drive including its harmonics. The takeaway is that just matching the easy-to-measure spectrum isn't enough to guarantee you're engineering the right quantum state.

Technical view

The authors compare the partial harmonic decomposition approach (PHDA), which uses a static dressed basis, against Floquet-Born-Markov (FBM) theory, which resolves dissipation in the full Floquet basis including drive sidebands, for identical parametrically coupled qubits with identical microscopic bath couplings. Despite near-identical period-averaged population maps and shared resonance structure, the asymptotic steady-state entanglement diverges qualitatively between the two treatments. This implies that entanglement-sensitive quantum control protocols must be validated against sideband-resolved dissipation models rather than population spectroscopy alone, a concrete design constraint for parametric qubit engineering.

arXiv · gr-qcConceptual

Models of a point particle in a three-dimensional AdS universe

How much does a 'point particle' actually weigh when it warps space into a cone around itself?

In a simplified toy universe with only two space dimensions plus time, a point particle doesn't pull matter in with gravity the usual way — instead it creates a cone-shaped dent in space, like a rolled-up sheet of paper missing a wedge. The problem is that Einstein's equations of gravity are nonlinear, so you can't just plug in an idealized infinitely-small point and expect sensible answers, especially since this universe has a background 'cosmological' energy everywhere that makes total mass tricky to define. The researchers get around this by modeling the particle as a small but not infinitely small blob of matter, then shrinking it down while keeping the far-away shape of the universe fixed, so they can cleanly separate the particle's contribution from the background. Their result backs up the standard assumption: the mass of the particle equals the size of the missing wedge (angular deficit) in the cone.

Technical view

Working in 2+1D gravity with AdS asymptotics, the authors regularize the distributional point-source (conical deficit) by an extended, sufficiently smooth energy distribution and take the zero-size limit while holding the asymptotic geometry fixed, which lets them consistently subtract the background cosmological energy. This confirms that the point-particle mass equals the angular deficit of the resulting conical spacetime, derived as a limit rather than assumed, giving a rigorous justification for a widely-used but previously heuristic identification in 2+1D gravity and clarifying how to compare spacetimes with matched asymptotics.

arXiv · gr-qcConceptual

Coherent quantum geometry: de Sitter spacetime in different foliations

Can 'as classical as possible' quantum states reproduce our textbook picture of an expanding universe?

Quantum gravity tries to describe spacetime itself using quantum mechanics, and a natural test is whether familiar solutions to Einstein's equations — like the expanding universe described by de Sitter spacetime — can pop out as the 'average' behavior of some quantum state. The authors use coherent states, a special class of quantum states that are as close to classical, minimum-uncertainty behavior as quantum mechanics allows, and apply them to different ways of slicing de Sitter spacetime into moments of time (called foliations). They build a general mathematical framework for this and track how these states evolve and whether results stay consistent no matter which slicing you choose. They find a catch: for the math to actually make sense (the states to be 'normalizable'), you need to use time-slicings that avoid coordinate singularities — regions where the coordinate system itself breaks down, not physical reality.

Technical view

The paper constructs coherent states of the metric operator for globally-diagonalizable foliations of de Sitter spacetime and studies their temporal evolution and coordinate-invariance properties within a general quantum-gravity framework. The key finding is that normalizability of these coherent states demands reference frames free of coordinate singularities, ruling out naive coordinate choices and constraining which foliations admit well-defined coherent-state descriptions of classical de Sitter geometry.

arXiv · hep-thConceptual

Fortuity and fragility in supersymmetric SYK

Special protected quantum states usually vanish as you scale a system up — this maps when a few can be rescued.

SYK models are toy systems of many randomly-interacting particles used to study quantum gravity and black holes; a supersymmetric version has special 'BPS' states that are extra stable because of a mathematical symmetry. The twist here is that these BPS states are 'fortuitous' — they only exist for a narrow range of system sizes and normally disappear if you scale the system up. The authors ask whether, by also increasing a related quantity called charge, you can walk these states along a path to arbitrarily large systems, and they build a tool (a 'decoder') to measure exactly how well and how costly that rescuing process is. They find some model variants allow this rescue cleanly, while the most generic version eventually fails no matter what you try.

Technical view

In the N=2 SUSY SYK model, BPS states exist only over finite ranges of fermion number N (fortuity); the authors study lattice-walk uplifts of BPS classes to larger N as charge increases and show no canonical uplift exists in general. They introduce a decoder operator D whose spectrum quantifies uplift fidelity and its 'metric fragility' cost, finding perfect bare uplift in Chen's single-matrix model, dressed uplift in the two-flavor SYK protected tower, and eventual failure in the generic one-flavor model, with D†D exhibiting GUE-like level statistics — a concrete probe for future SYK/BPS spectroscopy studies.

arXiv · cond-mat.str-elConceptual

Connecting the tensor-categorical formulation of anyon condensation with operator algebras and entropic order parameters

A new dictionary translates between two rival math languages for describing how exotic 2D particles merge.

In certain 2D quantum materials, exotic particle-like excitations called anyons can 'condense' — undergo a phase transition — connecting one topological phase of matter to another. Physicists describe this using two different mathematical toolkits: tensor categories (an abstract algebra of particle types and how they combine) and operator algebras (built from the physical operators acting on quantum fields). This paper builds an explicit, almost picture-like translation between the two toolkits using a recently developed structure called DHR bimodules, and along the way defines a clean quantitative 'order parameter' — a number that tells you how much condensation has happened, based on quantum information theory (specifically entropy). They also prove a simple mathematical bound on this quantity.

Technical view

The authors formulate anyon condensation as an extension of a quasi-local C*-algebra using Doplicher-Haag-Roberts bimodules, making the correspondence between the tensor-categorical and operator-algebraic pictures diagrammatically explicit. They define an entropic order parameter from this operator-algebraic construction as a quantum-information measure of condensation and give a short proof of a bound on it, providing a rigorous bridge that practitioners in either the categorical or algebraic community can use to translate results and derive entropic diagnostics of topological phase transitions.

arXiv · hep-thConceptual

Why There is No Memory Burden in Holographic Space-time Models of Black Hole Formation and Evaporation

A recent claim that black holes get a 'memory tax' slowing their death doesn't survive in this model.

Some recent papers argued that basic quantum information rules force black holes to hold onto a 'memory burden' — essentially a growing resistance to evaporating that could measurably extend their lifetimes, with implications for astrophysics and cosmology. This paper checks that claim inside Holographic Space-Time (HST) models, a specific framework for describing black holes using holography (the idea that a black hole's interior information is encoded on its boundary). The authors show that in HST models, this memory-burden slowdown simply doesn't happen, and trace the reason to a basic physics principle called detailed balance (roughly: transition rates between quantum states balance out predictably), combined with how HST defines energy and enforces cause-and-effect.

Technical view

The paper directly rebuts the memory-burden effect proposed for black hole evaporation by examining Holographic Space-Time models of black hole formation and evaporation, showing the effect is absent as a consequence of Fermi's Golden Rule and detailed balance. The absence hinges specifically on HST's particular definitions of energy and causality, meaning the result is a structural feature of the HST framework rather than a general refutation, useful for researchers comparing semiclassical vs. holographic black hole evaporation predictions.

arXiv · quant-phConceptual

The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation

A textbook formula for 'perfect entanglement extraction' turns out to be an overestimate, solving an 8-year puzzle.

Entanglement distillation is the process of turning many noisy entangled quantum states into fewer, perfectly entangled ones — a key resource for quantum communication. Since 2016, there's been an open question about whether a specific mathematical bound (the min-Rains relative entropy) always correctly predicts the best possible distillation rate under a broad class of allowed operations. This paper answers no: they find a hidden constraint — any process that distills perfectly must act like doing nothing (identity) on the relevant part of the input state — that the old bound was missing, and use it to build a new, tighter bound that beats the old one for certain quantum states.

Technical view

Under completely PPT-preserving operations, the additive min-Rains relative entropy was conjectured tight as a single-letter upper bound on the exact (zero-error) entanglement distillation rate; the authors disprove this by identifying a tensor-stable rigidity condition — every feasible exact-distillation effect must act as the identity on the input state's support — absent from the min-Rains relaxation. They convert this into a new single-letter bound via a non-Hermitian, range-supported witness, and demonstrate on rank-three subspaces that it lies strictly below the min-Rains value for every state with that support, giving a concrete counterexample and a reusable technique for tightening distillation bounds.

arXiv · gr-qcConceptual

Lorentz Symmetry Breaking Traversable Wormhole Models Supported by Einasto Dark Matter

A theoretical wormhole stays open using dark matter and a twist in spacetime symmetry, not exotic sci-fi matter.

Wormholes are hypothetical tunnels connecting distant points in spacetime, but standard general relativity says you need bizarre 'exotic' matter that violates normal energy rules to keep the throat from collapsing. This paper builds a wormhole model using Kalb-Ramond gravity, where a background field spontaneously breaks Lorentz symmetry (meaning space stops looking exactly the same in every direction at a fundamental level), combined with the Einasto profile — a realistic mathematical description of how dark matter is distributed in galaxies. They derive the wormhole's shape mathematically, confirm it satisfies the geometric requirements for a real traversable tunnel, and show that the 'exotic' matter violating normal energy conditions is only needed in a small region right at the throat, with energy staying positive everywhere else.

Technical view

The authors solve for static, spherically symmetric traversable wormholes in Kalb-Ramond gravity with spontaneous Lorentz symmetry breaking sourced by a nonzero Kalb-Ramond field VEV, using an Einasto dark matter density profile to derive an analytical shape function via the incomplete Gamma function. The solution satisfies throat, flare-out, and asymptotic-flatness conditions with positive energy density throughout, while the radial null energy condition is violated only near the throat, and the model is further characterized via a complexity factor — providing a concrete, dark-matter-motivated alternative to purely exotic-matter wormhole constructions for follow-up stability or observational analyses.

arXiv · astro-ph.COConceptual

CIBER $\times$ galaxy cross-correlations reveal a bright, low-redshift NIR background

The night sky's infrared glow is brighter than expected, and nearby galaxies are why.

Scientists study the faint glow of infrared light that fills the space between galaxies, called the extragalactic background light, to figure out where it comes from. Using a telescope instrument (CIBER) that mapped this glow at two infrared wavelengths, they compared it statistically against catalogs of known galaxies to see which patches of sky correlate. They found the glow is brighter than predicted just from adding up light from all known galaxies, and the extra light is concentrated around relatively nearby galaxies and their surrounding halos of dark matter and diffuse gas. This matters because it suggests there's unaccounted-for light sources close to home, not some mysterious signal from the very early universe as some had hoped.

Technical view

The authors cross-correlate CIBER 1.1/1.8 μm imaging with DESI Legacy Survey and HSC photometric galaxy catalogs to tomographically decompose near-IR EBL anisotropies by redshift. They find cross-power excess over an IGL model at ℓ<2000, dominated by z≲0.6 structure, with cluster members contributing only 15-20% of large-angle power. A halo-model fit separates two-halo (large-scale clustering) and one-halo (intra-halo) terms, both declining smoothly from z=0 to 1, with consistent one-halo amplitudes between the shallower DESI-LS and deeper HSC samples — pointing to diffuse intrahalo light in group/galaxy-scale halos as the dominant source, testable with deeper multi-wavelength cross-correlation surveys.

arXiv · hep-phConceptual

Photon emission from rotating plasmas: a generalized McLerran-Toimela formula and the onset of superradiance

Spinning plasma doesn't just glow — it can amplify light out of nothing, like a cosmic laser.

When a hot soup of charged particles (a plasma) rotates, physicists want to know what light it gives off, since this could apply to fireballs made in particle collider experiments or exotic astrophysical objects. This paper works out the math for how much light a rotating plasma emits versus a still one, using tools from quantum field theory to model how photons interact with the churning particles. They discover that spinning plasma emits far more low-energy photons than expected, and strikingly, some light waves actually get amplified rather than absorbed as they pass through — a phenomenon called superradiance, similar to how a spinning black hole can boost light. That amplification, they argue, can destabilize the plasma's magnetic field, which could matter for understanding heavy-ion collision experiments or magnetized rotating cosmic plasmas.

Technical view

The authors derive a rotating-plasma generalization of the McLerran-Toimela photon emission/absorption formula in terms of the current-current spectral function, showing the leading contribution appears already at one-loop order (unlike the two-loop leading term for a static plasma). Applying this to a rotating quark-gluon plasma, they compute the photon emission spectrum and its elliptic flow, finding enhanced soft-photon emission relative to the non-rotating two-loop baseline. Analysis of cylindrical wave modes shows that photons with ω<mΩ are emitted faster than absorbed — the superradiance condition — and the authors argue these modes drive an instability in the ambient magnetic field, a mechanism relevant to heavy-ion collision phenomenology and magnetized rotating plasma astrophysics.

arXiv · nucl-thConceptual

Transport properties in binary neutron star mergers: Effect of magnetic field

Neutron star crashes get extra-hot magnetic fields that change how neutrinos escape.

When two neutron stars collide, the wreckage briefly becomes one of the most extreme environments in the universe — tens of billions of degrees hot, laced with magnetic fields trillions of times stronger than any on Earth. Ghostly particles called neutrinos carry away huge amounts of energy and drive the nuclear reactions that shape what elements form in the debris, but current computer simulations of these collisions assume there's no magnetic field when calculating how neutrinos are produced and absorbed. This paper builds a more exact mathematical framework that includes the magnetic field's effect on the nuclear reactions that make and interact with neutrinos, using a technique that accounts for how densely packed particles blur these reactions. They find that strong magnetic fields make it noticeably harder for neutrinos to travel through the star's core, meaning previous simulations may have missed important physics that affects what we'd observe from these cosmic collisions.

Technical view

The authors present an exact finite-temperature, finite-magnetic-field calculation of charged-current Urca process emissivity and neutrino opacity relevant to binary neutron star merger cores, addressing the fact that existing merger simulations use zero-field neutrino microphysics despite fields reaching ~10^17 G. They apply the Nucleon Width Approximation to capture collisional broadening effects that dominate at merger core densities, computing how the field modifies the charged-current cross sections. Their key result is that extreme magnetic fields substantially enhance charged-current opacity, shortening the neutrino mean free path relative to zero-field predictions — a correction that could be incorporated into radiation-transport modules of merger simulation codes to improve predictions of ejecta composition and kilonova signatures.

arXiv · quant-phBuildable

Design of monolithic microcavities for enhancing organic quantum emitters

Trapping single glowing molecules in tiny mirrored boxes to make purer single photons.

Individual organic molecules can emit single particles of light one at a time, which is useful for quantum computing and secure communication technologies that need reliable single photons. The problem is that these molecules also waste energy emitting light at unwanted colors due to molecular vibrations, so only a fraction of their light comes out at the precise, useful wavelength. The standard fix is to build the molecule into a tiny mirrored cavity — like a nanoscale echo chamber — that boosts emission at the wanted color and suppresses the rest, but building such cavities out of delicate organic material using standard chip-fabrication techniques has proven extremely hard, so nobody had managed to do it in a single, fully integrated structure. This paper works out how to design such a monolithic microcavity, paving the way toward efficient, sharply-colored single-photon sources for quantum technology.

Technical view

The paper addresses the challenge of embedding single organic-molecule emitters — valued for lifetime-limited, high-purity, high-indistinguishability single photons — into fully monolithic photonic microcavities to Purcell-enhance zero-phonon-line emission and suppress the red-shifted phonon sideband that otherwise dominates output. Prior work has been blocked by the incompatibility of organic host materials with standard clean-room fabrication processes needed to build integrated cavity structures. The authors present a cavity design approach that resolves this integration barrier, aiming to deliver narrowband, high-efficiency single-photon sources; the design principles could inform future device fabrication for quantum photonic circuits and networks.

arXiv · hep-phBuildable

Dark sector radiation corrections to invisible dark photon production: beyond fixed order

Hunting invisible 'dark photons' at colliders means taming a sneaky infinity in the math.

Physicists are searching for a hypothetical particle called the dark photon, which would belong to an invisible 'dark sector' of the universe and could help explain dark matter. One way to look for it is to smash electrons and positrons together and watch for events where a regular photon is produced but some energy seems to go missing, carried off by dark photons that fly away undetected. This paper does a more careful calculation of what those missing-energy events should look like, including next-order corrections, and finds that a naive calculation blows up (produces an infinite, nonsensical answer) when the invisible particles are much lighter than the collision energy. Using a mathematical technique called resummation, borrowed from the toolkit used to describe particle jets, they tame this infinity and produce a sensible, usable prediction — improving the accuracy of what experimenters should look for when hunting dark photons.

Technical view

The authors compute NLO corrections to invisible dark photon production e+e−→γA′ in a dark Abelian Higgs model, focusing on the missing-mass-squared (M_X^2) differential distribution rather than just the total cross section. While the fixed-order total cross section is IR-safe, the M_X^2 spectrum develops a quasi-collinear 1/M_X^2 divergence in the limit where dark-sector masses are much smaller than the hard scale, analogous to jet-mass singularities in QCD. They apply Sudakov resummation to obtain a finite, normalized M_X^2 distribution — effectively the 'jet mass' of the dark photon branch — providing a resummed prediction that experimentalists can use to refine missing-mass search strategies and background modeling at e+e− colliders like Belle II or future facilities.

arXiv · hep-thConceptual

On Hypergraph Representation of Multipartite Quantum Systems

Borrowing string-theory geometry tricks to draw quantum systems as networks with 'super-edges'.

Physicists often draw quantum systems made of many interacting particles as graphs, where particles are dots and their interactions are lines connecting pairs of dots. But some quantum interactions involve three or more particles at once, which ordinary graphs can't represent well. This paper borrows an idea from string theory — where exotic higher-dimensional shapes called Calabi-Yau spaces are described using geometric objects — to build 'hypergraphs,' where a single connector (a hyperedge) can link many particles simultaneously, matching how complex many-particle interactions actually happen. They use this framework to catalog all the possible ways such multi-particle interactions can be organized and to study how quickly these delicate quantum states lose their special properties (decohere), finding that maintaining large hypergraph states requires long-lasting quantum coherence and strong interactions between particles.

Technical view

The authors adapt the correspondence between Calabi-Yau singularities and toric geometry from string compactifications to construct a hypergraph representation of multipartite quantum systems, generalizing standard graph-state formalisms to capture higher-order (multi-particle) correlations via hyperedges in many-body Hamiltonians. They establish a mapping between hypergraph structure and the dynamics of hypergraph quantum states, and the resulting 'Hamiltonian hypergraph' formalism enumerates the hierarchy of possible multipartite interaction terms. Analyzing decoherence, they show it imposes practical limits on realizing large hypergraph states, concluding that long coherence times and strong many-body coupling strengths are prerequisites — a framework potentially useful for classifying multipartite entanglement structures or designing hypergraph-based quantum error-correcting codes.

arXiv · hep-latRunnable

Real-time topological rate at non-zero momentum in quenched QCD

Simulating how quark soup can spontaneously flip its quantum 'handedness' over time.

In the extremely hot early universe or particle collider experiments, the strong nuclear force's field (from the theory called QCD) can spontaneously make quantum 'jumps' called topological transitions, which are thought to play a role in matter-antimatter asymmetry and other deep puzzles. These jumps happen at a certain rate, but calculating that rate directly from a computer simulation is hard because the relevant physics lives in real time, while most numerical QCD simulations only work naturally in a mathematically rotated ('imaginary time') setting. This paper takes a known trick for solving that mismatch — an inverse-problem technique — and extends it to also handle transitions that carry momentum (movement) through the plasma, not just ones sitting still, as a stepping stone toward doing the full calculation with real quark dynamics included. It's a technical proof-of-concept showing the method can be pushed further toward realistic conditions.

Technical view

The authors present a proof-of-concept lattice QCD calculation of the real-time topological (sphaleron) rate at nonzero spatial momentum in quenched (no dynamical quarks) simulations near T≃1.24 Tc≃360 MeV. They extract the rate by solving an inverse problem via the Hansen-Lupo-Tantalo (HLT) method applied to the Euclidean thermal correlator of the topological charge density, extending prior zero-momentum sphaleron-rate calculations in pure Yang-Mills and full QCD. The method must control three systematic limits simultaneously — continuum extrapolation, vanishing HLT smearing width, and vanishing smoothing radius for the topological charge operator — using standard Wilson gauge action discretization; this establishes methodology that can be extended to full (unquenched) QCD to compute momentum-dependent topological rates relevant to chiral anomaly transport and baryogenesis scenarios.

arXiv · cond-mat.str-elRunnable

Phonon anomalies and critical scaling in the spin-$1/2$ trimer chain Na$_2$Cu$_3$Ge$_4$O$_{12}$

A crystal's vibrations reveal secret handshakes between electron spins as it cools.

Some magnetic materials are built from chains of atoms where electron spins (tiny magnetic compasses inside atoms) group into threes and interact antiferromagnetically, meaning neighboring spins prefer to point opposite ways. In a material called Na2Cu3Ge4O12, these spin interactions overlap in energy with the material's natural vibrations (phonons), so the two effects can influence each other. The researchers shine laser light on the material and analyze how it scatters (Raman spectroscopy) across a range of temperatures from very cold to room temperature, watching for shifts in vibration frequencies and background signals that reveal what the spins are doing. They find that below 170 K, new hybrid particle-like excitations emerge from the coupling between spin and vibration, and that the vibrations themselves suddenly behave differently as the material transitions into this correlated magnetic state — evidence of tight coupling between magnetism and the crystal lattice.

Technical view

The authors perform temperature-dependent Raman spectroscopy (80-400 K) on the spin-1/2 antiferromagnetic trimer chain compound Na2Cu3Ge4O12, whose high-energy spin excitations spectrally overlap with lattice phonon modes, enabling spin-lattice coupling studies. Analysis of the broad Raman background yields the dynamic spin susceptibility, revealing emergent quasiparticle excitations below 170 K, alongside an anomalous crossover in phonon linewidth/frequency behavior at the transition from the paramagnetic to correlated quantum magnetic regime. They further report power-law scaling of the integrated Raman susceptibility, consistent with critical behavior near the crossover — data that could constrain spin-phonon coupling models and motivate complementary probes (inelastic neutron scattering, thermal transport) to map the excitation spectrum of trimer-chain cuprates.

arXiv · math.NABuildable

Numerical methods for the simulation of quantum walks and quantum annealing

A free, open-source toolkit makes simulating quantum computers' weird math faster and more precise.

Quantum computers can be simulated on ordinary computers, but the math involves huge grids of numbers (matrices) that are brutally slow to crunch directly. One trick is to approximate the tricky function you need with a much simpler polynomial (think of it like sketching a curve with a handful of straight-line segments instead of computing every point exactly). This paper studies the best possible version of that trick, called minimax approximation, works out exactly how much error it introduces, and ships a fast, open C++ library implementing three such methods. It matters because better simulation tools let researchers test quantum algorithms like quantum walks and quantum annealing on classical hardware before running them on real, expensive quantum machines.

Technical view

The work analyzes Chebyshev-based polynomial approximation for computing functions of Hermitian matrices (used to simulate quantum walk propagators and adiabatic/annealing Hamiltonians), and extends prior treatments by rigorously characterizing true minimax (Remez-optimal) approximation rather than just near-optimal Chebyshev truncation. It provides error bounds and a high-performance open-source C++ implementation of three approximation schemes. Practitioners can use the library directly to simulate large Hermitian time-evolution operators with controlled, provable error, useful for benchmarking quantum walk and annealing algorithms classically.

arXiv · quant-phConceptual

Enhancing the power of a quantum heat engine via control of the system--reservoir coupling

Physicists sped up a tiny atomic engine by controlling how fast heat flows into it.

A quantum heat engine is like a microscopic steam engine, except its 'fuel' is heat moving between ultra-cold clouds of atoms instead of steam and pistons. Engineers have long suspected that if you could control not just the hot and cold temperatures but how quickly heat actually transfers, you could make the engine more powerful — but nobody had directly controlled that transfer speed at the atomic level before. Here, researchers built an engine using cesium atoms as the 'engine' and rubidium atoms as the 'heat reservoir,' and exploited the physics of how these atoms collide (their scattering behavior changes with energy) to speed up or slow down heat exchange during the engine's cycle. This is a step toward practical quantum machines, since squeezing more power out of a quantum engine could matter for future nanoscale technology and for understanding thermodynamics at the smallest scales.

Technical view

The authors realize a quantum Otto cycle using ultracold Cs-133 atoms as the working substance coupled via inelastic s-wave collisions to an ultracold Rb-87 bath, exploiting the reservoir's energy-dependent scattering cross-section to asymmetrically tune equilibration rates during the isochoric heating and cooling strokes. By adjusting the Rb-87 reservoir's kinetic temperature, they experimentally demonstrate direct microscopic control over system-bath heat exchange dynamics — previously only predicted theoretically — and show this enhances engine performance/power. This establishes atomic-mixture cold-atom platforms as a testbed for engineering non-equilibrium thermodynamic control, relevant to anyone designing quantum thermal machines or studying open-quantum-system heat transport experimentally.

arXiv · astro-ph.COConceptual

MeerKAT Reveals Evidence of a Radio Megahalo at GHz Frequency

A radio telescope spotted a giant 2-million-light-year glow hiding around a known galaxy cluster halo.

Galaxy clusters — huge collections of galaxies bound by gravity — sometimes glow faintly in radio waves due to fast-moving electrons spiraling in magnetic fields, a phenomenon called a radio halo. Recently astronomers discovered an even bigger, fainter version called a 'megahalo' using a telescope tuned to low frequencies, but it wasn't clear if these show up at higher radio frequencies too. Using the MeerKAT telescope (a powerful radio dish array in South Africa) tuned to a higher frequency band, the team looked at a known cluster's radio halo and found it's actually surrounded by a much larger, fainter glow stretching nearly twice as far as previously thought. This matters because it hints that the turbulent, energetic processes filling galaxy clusters with cosmic-ray particles extend far beyond what was known, and would be the first time this kind of extended glow was seen at this higher frequency.

Technical view

The team observed the massive cluster RXC J0528.9-3927 with MeerKAT at 1.28 GHz (L-band) and detected low-surface-brightness diffuse synchrotron emission extending to ~2 Mpc, well beyond the previously known ~1.14 Mpc radio halo. The radial surface-brightness profile flattens beyond ~0.55 R500, indicating a distinct outer emission component consistent with a 'megahalo' — a class previously identified only via LOFAR at lower frequencies. If confirmed with deeper multi-frequency follow-up, this would be the first GHz-frequency megahalo detection, constraining the spectral index and turbulent reacceleration models thought to power cluster-scale diffuse radio emission.

arXiv · quant-phBuildable

Efficient Assembly of a Defect-Free Quantum Register of 1024 Neutral-Atom Qubits

Scientists snapped 1024 single atoms into a perfect defect-free grid for quantum computing.

Many quantum computers work by trapping individual atoms with laser 'tweezers' and using each atom as a qubit, the basic unit of quantum information. The catch is that laser-trapped atoms are loaded somewhat randomly, so you usually end up with gaps where an atom failed to load — and you need a defect-free, fully-filled grid for serious computing. This team built a new kind of optical hardware that makes every tweezer beam equally strong (instead of some being weaker than others) and moves many atoms into place at once in parallel, letting them rapidly assemble a huge, gap-free 32x32 grid of 1024 atoms. This is a big deal because bigger, cleaner atom arrays are exactly what's needed to scale neutral-atom quantum computers toward more powerful, error-corrected machines.

Technical view

The authors demonstrate rapid, defect-free assembly of a 1024-site (32x32) two-dimensional optical tweezer array of neutral atoms, enabled by a novel micro-optical architecture that separates intensity-homogenization and tweezer-patterning into distinct functional units — avoiding the light-field control bottlenecks that arise when trying to combine high power, high resolution, and large scale in one optical system. Parallelized atom transport allows efficient, high-rate filling of vacancies to reach full occupancy with uniform trap depth and vibrational frequencies across the array. This modular optical design offers a practical scaling path for neutral-atom quantum processors and simulators toward thousand-plus qubit registers.

arXiv · gr-qcConceptual

Emergent scalar field dynamics in a cosmological spacetime from GFT quantum gravity

A quantum-gravity theory of spacetime's building blocks reconstructs how matter fields evolve across the Big Bang.

Group field theory (GFT) is an approach to quantum gravity that treats spacetime itself as emerging from a vast collection of tiny quantum building blocks, similar to how a smooth fluid emerges from countless jostling molecules. This paper starts from that fundamental quantum picture and derives, mathematically, how an ordinary field of matter (a simple 'scalar field,' like a stripped-down version of matter/energy) should behave once you zoom out to the smooth, everyday universe we observe. They do this by treating time and space as defined relative to the matter field itself (a 'relational' approach, since there's no outside clock in quantum gravity), and they track both the big-picture expansion of the universe and small ripples (inhomogeneities) within it. The payoff is a unified description that matches standard Einstein-gravity physics at late cosmic times but reveals new quantum corrections near the Big Bang itself, potentially replacing the classical Big Bang singularity with a smooth 'bounce.'

Technical view

Working within group field theory (GFT) condensate cosmology, the authors derive an effective scalar field theory for matter by treating the collective hydrodynamics of the GFT condensate as the origin of both homogeneous FLRW background dynamics and inhomogeneous perturbations, using a relational (matter-clock) framework rather than a fixed background time. At the homogeneous level they recover a modified scalar field equation on the emergent FLRW spacetime that reduces to standard massless-scalar GR dynamics at late times while exhibiting quantum-gravity corrections that resolve the cosmological singularity into a bounce. They extend the formalism to perturbative/inhomogeneous scalar fluctuations, providing a route to compute observable signatures (e.g., primordial power spectrum deviations) of GFT quantum gravity that could be compared against standard inflationary cosmology predictions.

arXiv · quant-phConceptual

Contextuality in the $n$-qubit Pauli group

Mathematicians find hidden 'quantum weirdness' rules baked into the basic building blocks of quantum computers.

The Pauli group is a small, well-defined set of mathematical operations that show up everywhere in quantum computing, from running algorithms to correcting errors. Even though it's a simple, discrete list of operators, it displays a deep quantum phenomenon called contextuality — roughly, the idea that a measurement's outcome can depend on which other measurements you're doing alongside it, defying the classical assumption that things have fixed, independent properties. This paper introduces a new mathematical tool ('noncontextual properties') to probe this weirdness more precisely than earlier tools, and fully works out what these properties look like for the Pauli group with any number of qubits. It matters because contextuality is believed to be a key ingredient that gives quantum computers their edge over classical ones, so understanding exactly where and how it appears helps clarify what actually powers quantum advantage.

Technical view

The paper generalizes classic Kochen-Specker style no-go arguments (based on the nonexistence of valuations) by introducing 'noncontextual properties' — a broader notion whose nonexistence still proves contextuality — and formally connects this to the existence of Boolean-valued frame functions. They fully characterize such frame functions for the n-qubit Pauli group, and for the two-qubit case show the surprising result that the Pauli group admits noncontextual properties even though it admits no valuations, separating these two notions of classicality. This refines the toolbox for quantifying contextuality as a resource in quantum computing, error correction, and benchmarking protocols that rely on Pauli-group structure.

arXiv · quant-phConceptual

Perfect State Transfer on Oriented Circulant Graphs: A Complete Classification

Mathematicians fully map out which directed networks let quantum information teleport perfectly between two points.

Imagine a quantum particle hopping around a network of nodes according to the rules of quantum mechanics — this is called a continuous-time quantum walk, and it's a building block for quantum algorithms and communication. 'Perfect state transfer' is when a quantum state placed at one node ends up, with 100% certainty, at another specific node after some time — extremely useful for shuttling quantum information around a chip without loss. This paper studies circulant graphs (a symmetric network layout where connections repeat in a circular pattern) that also have directionality (oriented edges), and completely classifies exactly which such networks can achieve perfect transfer, tying the answer to some elegant number theory. This is valuable because knowing exactly which network designs support perfect transfer helps engineers design quantum communication architectures that reliably move information between specific qubits.

Technical view

The paper analyzes continuous-time quantum walks on oriented circulant graphs, whose dynamics are governed by the Fourier eigenvalues of the graph's Hermitian adjacency matrix. It gives a complete classification of perfect state transfer (PST) in this family, showing each PST-capable graph corresponds to an odd primitive quadratic Dirichlet character of conductor Δ combined with a chosen set of gcd-classes and edge orientations, and derives explicit eigenvalue formulas without the usual coprimality assumption on n/Δ. The main result restricts PST to conductors Δ∈{3,4,8} (equivalently square-free radicands 1, 2, 3), with explicit necessary-and-sufficient conditions on the connection set for each case — giving quantum-walk/network designers a concrete, checkable criterion for building oriented circulant topologies that guarantee perfect quantum state transfer.

arXiv · gr-qcConceptual

Blandford-Znajek Scaling in a Power-Law Rotating Kalb-Ramond Geometry: Magnetic-Flux Systematics and Bayesian Identifiability

Testing Einstein's black hole jet formula against an exotic 'stringy' twist on spinning black holes.

Some of the most powerful phenomena in the universe are relativistic jets — beams of matter blasted out from spinning black holes — and the leading theory for how they form is called the Blandford-Znajek mechanism, which relies on twisted magnetic fields around the black hole. This paper asks: what happens to that jet-power formula if black holes aren't quite the simple 'Kerr' black holes of standard general relativity, but instead carry an exotic modification predicted by certain string-theory-inspired models (involving something called a Kalb-Ramond field, a kind of extra background field beyond ordinary gravity)? The researchers work out how this modification changes the black hole's geometry and, in turn, how much jet power it should produce under different assumptions about the magnetic field, then check whether astronomers could realistically tell the difference (statistically distinguish, or 'identify') this exotic black hole from an ordinary one using real observations. This matters because jets from black holes like the ones imaged by the Event Horizon Telescope are one of our best real-world tests of whether Einstein's gravity is exactly right or needs modification.

Technical view

The paper computes leading-order Blandford-Znajek jet-power scaling for the power-law rotating Kalb-Ramond black hole metric (Kumar-Ghosh-Wang), used as a fixed stationary background rather than a verified exact solution. They show the s=2 deformation is fully mass-redefinable (indistinguishable from Kerr via mass alone), while s>2 corrections decay more slowly than the Kerr mass term; the paper's main focus is the s=3/2 case, whose correction decays faster than the mass term, with s=3 as a secondary comparison. BZ power scaling is evaluated under three distinct magnetic-flux prescriptions (fixed total horizon flux, fixed local normal field with proper horizon area, and a third unstated variant), paired with a Bayesian identifiability analysis to assess how well jet-power observations could statistically distinguish the Kalb-Ramond deformation from standard Kerr — providing a concrete observational test framework for beyond-Kerr gravity via jet-power measurements (e.g., from EHT or radio-jet catalogs).

arXiv · gr-qcConceptual

Squeezed quantum states and partner modes in the moving mirror model of black hole evaporation

A toy 'mirror' universe shows hidden quantum twins hiding inside Hawking radiation.

Black holes slowly evaporate by emitting faint radiation, and physicists study this using a simplified stand-in: a perfect mirror accelerating through empty space, which emits radiation resembling what a real black hole would give off. This paper rewrites that model using a different set of building blocks (called Rindler and Milne modes) that better track how quantum information gets stretched and paired up, a process known as squeezing. Squeezing means each emitted particle has an invisible 'partner' particle, and the previous version of the model couldn't clearly show these partners. The new approach reveals them naturally, and shows that the radiation an observer would actually detect carries extra subtle quantum correlations beyond the simple thermal glow usually described.

Technical view

The authors recast the (1+1)-dimensional moving mirror model in terms of Rindler/Milne mode bases rather than the standard in/out formulation, showing that the approximate thermal Hawking-like spectrum emerges as a consequence of Bogoliubov/squeezing transformations between these bases. This reformulation naturally identifies partner modes associated with each Hawking quantum, something absent in the in-out treatment. They further show the squeezing induces additional nontrivial correlations in the radiation detected by an inertial observer at future null infinity, beyond the standard thermal prediction — a result relevant to entanglement/information-loss discussions and replicable via mode-decomposition calculations in the mirror trajectory of choice.

arXiv · hep-thConceptual

Non-unitary Haagerup-like TQFTs and RCFTs from generalized S-fold SCFTs

Exotic math theories from string-theory 'twisted mirrors' turn out to share deep patterns with strange quantum codes.

In theoretical physics, certain abstract 'theories of everything' toy models (S-fold superconformal field theories) can be mathematically twisted into simpler 3D theories called topological quantum field theories (TQFTs), which describe how particle-like excitations braid around each other without caring about exact distances. These TQFTs are paired with 2D 'boundary' theories (RCFTs) through a well-known physics duality. This paper extends earlier work to find new families of these theories that are 'non-unitary' (meaning they break some usual physics rules, but are still mathematically consistent and useful) and shows some of them match a known exotic mathematical structure called Haagerup-Izumi symmetry, previously thought to be an isolated curiosity. It matters because it suggests these unusual symmetries, which have puzzled mathematicians, actually arise naturally from string theory constructions.

Technical view

Building on Gang-Kim-Lee, the authors apply topological twists to generalized S-fold SCFTs to generate new non-unitary 3D TQFTs, using bulk-boundary correspondence to derive associated 2D non-unitary RCFT data. For several families they give explicit simple-line spectra, character formulas, and modular S-matrices, and for a broader family they compute modular S and T matrices directly. Notably, some resulting modular data match the generalized Haagerup-Izumi modular matrices up to Galois conjugation, providing a physical (SCFT-twist) origin for these previously ad hoc fusion categories — useful for researchers working on modular tensor category classification or non-unitary CFT constructions.

arXiv · hep-thConceptual

Carrollian Dictionary for Massive Particles at Null Infinity

A new translation guide lets physicists describe massive particles using the language built for light.

When physicists study what happens 'at infinity' in spacetime, massless things like light rays naturally reach a boundary called null infinity, but massive particles (like electrons) veer off toward a different boundary, so existing boundary-description toolkits didn't quite work for them. This paper builds a 'dictionary' that translates the motion of massive particles into the same boundary language, without needing their paths to actually reach that boundary, by tracking how their momentum projects onto directions associated with each point on the sky. They test it on known physics results, like formulas connecting particle spectra to two-point correlations and 'soft theorems' describing very low-energy photon or graviton emission, and show the framework correctly reproduces known symmetry behavior. This matters for a research program (celestial/Carrollian holography) trying to describe gravity and particle physics as if painted on a distant boundary, similar in spirit to holographic ideas from string theory.

Technical view

The paper constructs a Carrollian boundary representation for massive one-particle states on timelike-adjacent null infinity by encoding bulk four-momentum via its projections onto the null frame at each celestial point, sidestepping the need for worldlines to terminate on scri. They show the full (multi-component) Carrollian representation is required to satisfy Poincaré intertwining relations. Applying the dictionary to the Källén-Lehmann spectral representation fixes the non-contact two-point coefficient function in terms of the bulk spectral density, and applying it to soft photon/graviton theorems shows global U(1)/Poincaré charges emerge correctly while local versions require integration over celestial directions — a concrete building block for extending celestial/Carrollian holography to massive external states.

arXiv · physics.acc-phBuildable

State-resolved quantum transport of vortex electrons in accelerators

Electrons carrying tiny quantum swirls can be tracked and protected as they race around particle accelerators.

Some electron beams can be prepared with a built-in 'twist,' or orbital angular momentum, like a tiny vortex, and this paper works out how to keep track of that twist as the electrons zip around a circular accelerator many times. They find that the quantity actually conserved isn't the twist you'd naively measure at each instant, but a more subtle 'invariant' that accounts for the beam's constantly changing shape. Random imperfections in the magnets act like noise that can smear or leak this twist away, and the authors model that noise mathematically (similar to how physicists model quantum systems interacting with an environment) to predict how many times the beam can loop before it starts leaking badly. They give concrete numbers for two real accelerator facilities, showing the twist survives hundreds of thousands to millions of loops before problems set in.

Technical view

The authors develop a density-matrix framework for vortex-electron beam transport in periodic accelerator lattices, identifying the conserved quantity as a Lewis-Floquet OAM invariant (rather than instantaneous kinetic OAM), with ideal transport described by a metaplectic representation. Stochastic magnet imperfections are modeled as a Lindblad master equation: dipole noise causes removable centroid smearing, while quadrupole noise drives intrinsic Δl=±2 leakage between OAM states. Benchmarking against white noise gives inverse initial leakage rates of 2×10^5 turns for IOTA and 2×10^6 turns for PETRA III, giving accelerator physicists concrete design targets for preserving vortex-electron coherence.

BIO

Biology

45 new
bioRxiv · bioinformaticsBuildable★ flagship

Scalable Extraction of Information on Protein-Protein Interactions using Topological Data Analysis

Using the pure math of shape to spot where two proteins will grab onto each other.

Proteins do their jobs by sticking to other proteins, and knowing exactly which patch of one protein's surface will latch onto another is hugely valuable for designing drugs. Powerful deep-learning methods can predict these binding spots from the bumpy 3D surface of a protein, but they are slow and need enormous amounts of training data. This work instead borrows "topological data analysis" (TDA), a branch of math that measures the essential shape of something — its loops, pockets, and connectivity — in a way that stays stable even when the fine details wobble. The authors chop a protein surface into small local patches and compute compact shape-fingerprints for each at multiple scales, then use those fingerprints to flag likely interaction interfaces. The payoff is a method that is lightweight and scalable rather than data-hungry, making it easier to screen many proteins for where they bind.

Technical view

The method extracts multiscale topological descriptors — persistence-based features — from localized protein molecular-surface patches to characterize protein-protein interaction interfaces. Rather than training a heavy geometric deep-learning model on full surfaces, it computes robust, deformation-stable topological summaries per patch, trading representational richness for computational scalability and lower data requirements. Practitioners could compute these persistence descriptors over surface patches and feed them into a lightweight classifier for interface prediction, or use them as features complementing existing surface-geometric pipelines like MaSIF. The abstract emphasizes scalability and mathematical rigor of the TDA features; concrete benchmark numbers aren't given here, so the main claim is a favorable accuracy-versus-cost tradeoff.

bioRxiv · neuroscienceRunnable

Myelin-Free Nuclei Isolation from Mouse Hippocampus and Cerebellum for snRNA-Seq with Benchtop Gradient Centrifugation

A better recipe for cracking open fatty brain cells to read their genes one by one.

To study which genes are active in individual brain cells, scientists need to break cells open and isolate just their nuclei (the compartment holding DNA), then sequence what's inside — a technique called single-nucleus RNA sequencing. Brain tissue like the hippocampus and cerebellum is especially hard to work with because it's rich in myelin, the fatty insulation around nerve fibers, which gums up the process and contaminates results. This paper describes a refined lab protocol — grinding tissue gently, spinning it in a sugar-density gradient using an ordinary lab centrifuge, and then using magnetic beads for a final cleanup step — that reliably yields clean, intact nuclei. The payoff is a practical, accessible recipe (no specialized equipment required) that other labs can adopt to get higher-quality single-cell gene-expression data from tricky, myelin-heavy brain regions.

Technical view

The protocol addresses myelin/debris contamination in snRNA-seq workflows for adult mouse hippocampus and cerebellum by combining tube-and-pestle mechanical homogenization, low-volume sucrose-gradient centrifugation on a standard benchtop centrifuge (avoiding ultracentrifugation), and a magnetic-bead-based enrichment step as the final debris-removal stage. The output nuclei preparations are validated as compatible with downstream 10x Genomics Flex and PARSE WT library chemistries, suggesting broad platform compatibility. This is directly actionable for labs lacking ultracentrifuges, offering a lower-cost, more accessible route to high-quality nuclei suspensions from myelin-rich CNS tissue for single-nucleus transcriptomics.

bioRxiv · cell biologyBuildable

ProtJEPA: A Multimodal Joint-Embedding Predictive Architecture for Protein Biological World Modeling with Multi-TeacherModality-Attentive Fusion

An AI learns to guess a protein's job from its sequence alone, by studying ten kinds of clues at once.

Most known proteins have never been experimentally tested to find out what they actually do in the body — over 99.9% lack that kind of annotation. ProtJEPA is an AI system trained to predict a rich, combined representation of a protein by learning from ten different types of information simultaneously — its sequence, 3D structure, known interactions, relevant scientific literature, where it's found in the body, and more — but crucially, once trained, it only needs the raw sequence to make predictions, since the other data was just used as a teacher during training. The key technical trick, called 'target whitening,' fixes a subtle math problem where all the training targets looked artificially similar to each other, which was preventing the model from learning meaningful distinctions. Tested on totally unfamiliar 'dark' proteins with no overlap to its training data, the model noticeably improved at guessing a protein's function, its enzyme class, and where in the cell it's located. This matters because it could help biologists prioritize which of the millions of mystery proteins are worth studying in the lab.

Technical view

ProtJEPA is a multimodal Joint-Embedding Predictive Architecture: a sequence-only student encoder is trained to predict joint embeddings that fuse ten biological modalities (sequence, structure, KG, PPI, literature, localization, tissue expression, GO, anatomy, disorder) via a multi-teacher, modality-attentive fusion scheme, while requiring only sequence input at inference time. The core methodological contribution is target whitening, which reduces severe embedding anisotropy (mean cosine similarity dropping from 0.984 to 0.086) and prevents representation collapse without needing explicit covariance regularization terms. On 1,828 held-out 'dark' proteins with zero Pfam family overlap with training data, it achieves 58.07% Hit@10 on zero-shot GO retrieval (+2.80pp, p=0.020), 69.99% enzyme class accuracy (+9.64pp, p<0.001), and an 11.87pp gain in subcellular localization accuracy. Practitioners could use the sequence-only encoder as a drop-in function-prediction tool for uncharacterized proteins, or adapt the target-whitening trick to other multimodal JEPA-style pretraining setups suffering from anisotropic target collapse.

bioRxiv · ecologyRunnable

The Role of Arthrobacter pascens 13LEP5 in mitigating Drought and Cold stress in Soybean (Glycine Max (L.) Merr.)

A soil bacterium helps soybean plants shrug off drought and cold, tested in growth chambers.

Soybean crops in Europe are increasingly hurt by drought and cold snaps, which disrupt the plant's internal chemistry and cut yields. One eco-friendly fix being explored is 'biostimulants' — beneficial microbes or plant extracts added to help crops cope with stress — instead of relying purely on breeding or chemicals. This study tested a locally isolated soil bacterium called Arthrobacter pascens, another bacterium (Bradyrhizobium japonicum), and a protein extract derived from plants, applying them alone and in combinations to soybean plants grown under controlled stress conditions in growth chambers. Researchers measured the plants both before stress hit and after they'd had time to recover, checking whether the treatments boosted growth and resilience. The goal is finding practical, locally-sourced biological treatments that farmers could use to protect soybean yields as climate conditions become less predictable.

Technical view

The study evaluates two bacterial biostimulants (Arthrobacter pascens 13LEP5 and Bradyrhizobium japonicum) and a plant-derived protein hydrolysate, applied individually and in combination (six treatment groups including controls) to soybean (Glycine max) under drought and cold stress in controlled growth-chamber conditions. Physiological and biochemical measurements were taken at the VC growth stage (pre-stress, to assess baseline biostimulation) and again at V3 stage post-stress-recovery, allowing separation of general growth-promotion effects from specific stress-mitigation effects. This design lets researchers or agronomists assess whether combinatorial biostimulant treatments (e.g., BJ+AP+PH) outperform single-agent applications, informing formulation choices for climate-resilient soybean cultivation in temperate European agriculture.

bioRxiv · ecologyConceptual

Responses of dissolved organic matter to temperature change in the global ocean

As oceans warm, the dissolved carbon 'soup' in seawater reacts differently at every depth.

The ocean holds enormous amounts of dissolved organic matter — essentially a vast, invisible soup of carbon-based molecules from decayed plankton and other sources — and how this soup responds to warming affects how much carbon the ocean can lock away versus release. Using over 800 samples collected from surface waters down to the deep Atlantic, Southern, and Pacific oceans, researchers examined how the chemical makeup of this dissolved matter shifts as water temperature rises. They found that in deeper water, the overall strength and variety of these temperature-driven chemical changes both shrink — but tougher, harder-to-break-down molecules become relatively less concentrated near the surface and more concentrated in the deep, even as this pattern's diversity is best explained by sunlight-driven chemical reactions happening in shallower water. This matters because it helps climate scientists predict whether ocean carbon storage will strengthen or weaken as the planet warms.

Technical view

Using a dataset of 800+ molecular-level DOM samples spanning surface-to-deep-water profiles across three ocean basins, the authors characterize 'DOM thermal responses' — compositional shifts in dissolved organic matter as a function of ambient temperature — and find that both the magnitude and molecular diversity of these responses attenuate with depth. Notably, recalcitrant (refractory, slow-to-degrade) molecule concentrations show opposing depth trends relative to thermal-response strength (decreasing) versus diversity (increasing), and diversity is more strongly linked to surface photochemical degradation processes than response strength is. These findings support depth-resolved, photochemistry-aware terms in ocean carbon-cycle models, suggesting that projections of DOM-related carbon flux under warming should not treat the water column as chemically uniform.

bioRxiv · ecologyConceptual

Interspecific variation in reproductive and foraging traits for raptors breeding in Norway

Picky-eater hawks lay more eggs than generalists — a clue to how climate change will reshuffle predators.

As the Arctic and boreal (northern forest) regions warm, the mix of predator birds like hawks, owls, and skuas living there is expected to shift, and ecologists want tools to predict what future communities will look like. This study looked at 34 predatory bird species in Norway and compared those that specialize in eating one type of prey versus generalists that eat whatever's available, asking whether diet choice relates to reproductive success. They also built mathematical predator-prey models to figure out under what conditions a new species could successfully invade and establish itself in a region. The key finding is that specialist hunters lay bigger clutches of eggs and fledge more chicks per clutch than generalists, and this pattern holds even when accounting for how closely species are related evolutionarily. This kind of trait-based approach could let scientists forecast, rather than just observe after the fact, how climate-driven ecological shake-ups will play out.

Technical view

The authors analyzed reproductive traits (clutch size, fledging proportion per clutch, and their variance) against diet-specialization status for 29 raptor species plus 2 skuas and 3 corvids breeding in Norway, then built predator-prey invasion models parameterized with foraging traits distinguishing specialists from generalists to derive conditions for successful species invasion. They report that specialist raptors have significantly larger clutch sizes and higher fledging success than generalists, with the relationship persisting within phylogenetic orders (i.e., not just a byproduct of shared ancestry). This trait-based, community-assembly-theory framework offers a template for predicting how borealization and climate-driven range shifts will restructure northern predator communities, and the invasion-condition models could be parameterized with other regions' trait data to forecast specific species turnover events.

bioRxiv · evolutionary biologyConceptual

Forging an evolutionary individual from separate replicators

Scientists watched separate DNA molecules evolve into one cooperative unit inside living yeast cells.

One of biology's deepest puzzles is how separate, independent self-copying entities — like early genes or organelles — ever merged to become a single evolving individual, the way organelles inside our cells today act as one unit with the rest of the cell. To study this in real time, researchers engineered yeast cells to carry two separate self-replicating DNA rings (plasmids), one glowing red and one glowing green, and then selected for cells that appeared yellow — a color only achievable by having both. Without any selection pressure favoring the collective yellow trait, cells quickly lost it, reverting to being just red or green. But when researchers kept selecting for yellow cells generation after generation, over 70 cycles the two once-separate plasmids gradually fused into single hybrid molecules that reliably passed both colors on together to their offspring. This shows that heredity — reliable transmission of a trait — can actually evolve as a result of selection pressure, rather than needing to already exist beforehand, offering a live demonstration of how biological individuality itself might arise from natural selection.

Technical view

The authors engineered Saccharomyces cerevisiae carrying two independently self-replicating plasmids labeled with RFP and GFP respectively, such that collective yellow fluorescence required maintenance of both; they then imposed collective-level selection for yellowness across serial passaging. Without collective selection, yellowness was lost rapidly (as expected from stochastic plasmid segregation), but under sustained collective selection over 70 cycles, initially unfaithful transmission (offspring not resembling parental phenotype) evolved into faithful heredity, driven by recombination generating single chimeric plasmids carrying both fluorescent markers. This provides direct experimental evidence that heredity — long assumed a precondition for evolution by natural selection — can itself be a product of selection during evolutionary transitions in individuality, and offers a tractable synthetic-biology system (dual-plasmid yeast under collective selection) for further probing the population-genetic conditions favoring egalitarian major transitions.

bioRxiv · evolutionary biologyConceptual

Eco-evolutionary feedbacks generate bistability in population persistence under gradual environmental change

Whether a species survives a warming world can hinge on where it started, not just how fast climate changes.

This is a math-modeling study about how populations of animals or plants survive an environment that keeps getting worse, like steady warming. Scientists usually ask: how fast can conditions change before extinction becomes inevitable? But this study shows that even below that 'safe' speed limit, a population can still die out if it starts out too small or too genetically uniform. That's because population size, genetic diversity, and how fast the average trait (like heat tolerance) evolves all feed back into each other, and a weak starting position can spiral downward instead of stabilizing. The upshot: two populations facing identical, survivable rates of change can have completely different fates depending on their starting condition, which matters a lot for conservation planning.

Technical view

The authors build a quantitative-genetic model coupling population size, additive genetic variance, and mean-trait evolution under a gradually shifting optimum, going beyond prior work that only derived a critical rate of environmental change for guaranteed extinction. They show that below this critical rate the system is bistable: a stable persistence equilibrium coexists with an extinction outcome, and which basin a population falls into depends on initial population size and initial genetic variance, not just the rate parameter. This reframes evolutionary rescue as a transient-dynamics problem rather than a threshold problem, implying that risk assessments based solely on rate-of-change thresholds can misjudge extinction risk for small or genetically depauperate populations. Practitioners modeling climate-driven extinction risk could incorporate initial-condition-dependent basins of attraction rather than single critical-rate cutoffs.

bioRxiv · geneticsRunnable

MMMAS: A Mendelian Mismatch Matrix Analysis System for Deterministic Pre-Screening of Germplasm Collections

A new free tool spots fake or duplicate seed-bank records just by counting genetic mismatches, no guesswork needed.

Big collections of crop seeds and plant varieties (germplasm banks) often have messy records — mislabeled parents, accidental duplicates, or unknown family relationships. MMMAS is a free software tool that checks genetic data for pairs of plants and counts how many spots don't match according to basic inheritance rules (a child should share DNA with each parent in predictable ways). From that simple mismatch count, it builds five different scorecards that flag likely duplicates, verify or refute claimed parentage, and rate how thoroughly a collection has been checked, all without needing to know population-wide allele frequencies or make statistical assumptions. When tested on over a thousand apple and cherry plant records, it matched the results of an established genetics program about 97% of the time, showing it's a reliable, simpler alternative.

Technical view

MMMAS computes a pairwise Mendelian mismatch number (Mmn) across a marker set for every accession pair, assembling an N×N mismatch matrix, then derives five diagnostics: minimum mismatch (Mmin), average mismatch (Mavg), zero-mismatch partner count (Mzmp), a mismatch-mode duplication index (Mmmd), and an exhaustive stratification grading (MES). Because it relies purely on deterministic Mendelian-inheritance-rule violations rather than likelihood models needing allele-frequency priors, it avoids the statistical assumptions underlying tools like CERVUS. Validated against 1,085 apple and 383 sweet cherry accessions from the German Fruit Genebank, it reproduced CERVUS parentage/duplicate assignments at 97.31% concordance. It's open-source (v1.0.0), making it a drop-in pre-screening step for genebank curators before deeper statistical parentage analysis.

bioRxiv · animal behavior and cognitionConceptual

Recent social loss, not chronic isolation, reshapes sleep in Drosophila

Fruit flies barely notice being alone for weeks — but losing company suddenly makes them sleep a lot more.

Scientists have long used fruit flies to study how social life affects behavior, and past work suggested that isolated flies sleep differently. But there's been a mix-up: was that because the flies were alone for a long time, or because researchers changed their social situation right before testing, which could itself disturb sleep? This study built a new tracking system, sociSleep, that watches individual flies' sleep without disturbing their social setup at test time. They found that flies who'd been alone for a long while slept about the same as ones with company — but flies who had just lost their companions abruptly slept a lot more. This shows it's the shock of a recent social change, not prolonged loneliness, that drives sleep changes in flies, which reshapes how we should interpret earlier isolation studies.

Technical view

The authors developed sociSleep, an identity-preserving video-tracking pipeline that measures individual fly sleep continuously without requiring the researcher to alter social grouping at the moment of testing (a confound in prior designs). Comparing flies under chronic isolation versus flies that recently transitioned from group to solitary housing, they found chronic isolation produced minimal sleep changes, while recent social loss produced a robust increase in sleep. This decouples 'social state' from 'social state transition' as independent variables and suggests earlier isolation-sleep phenotypes in Drosophila literature may be artifacts of testing-induced state changes rather than true isolation effects. Researchers studying social modulation of sleep or arousal circuits in flies should now control for recency of social transitions as a distinct experimental variable, and sociSleep offers a reusable tool for doing so.

bioRxiv · bioinformaticsBuildable

Addressing challenges in agentic retrieval of structured data from biomedical databases

AI agents querying medical databases often silently give incomplete or inconsistent answers — this tool tries to fix that.

Biomedical researchers increasingly ask AI 'agents' to look up facts in giant curated databases linking diseases, genes, drugs, and more, using plain English questions that the AI translates into database queries. The problem is these agents can quietly fail: they might cut off long result lists, miss records because they used different wording than the database, or give different answers each time you ask the same question — all without any error message. This paper measures exactly how often and how badly that happens, and then introduces BioChirp, a new system built to retrieve information from these databases reliably and reproducibly. The point matters because scientists use these lookups to prioritize which drug or gene variant to investigate next, and an AI that quietly gives incomplete answers can send research down the wrong path.

Technical view

The paper systematically benchmarks failure modes of agentic NL2SQL and Model-Context-Protocol-based retrieval agents querying structured biomedical databases (Open Targets, the Highly Confident Drug-Target Database), quantifying result-set truncation, vocabulary-mismatch misses, and run-to-run non-determinism. They introduce BioChirp, a goal-directed autonomous retrieval system engineered to counter these specific failure modes (implementation details on architecture are truncated in the abstract but framed around reliability/reproducibility guarantees over the same query classes). This is directly relevant to anyone building LLM-agent pipelines over structured scientific databases, since it provides both a failure taxonomy and a reference system to benchmark against for retrieval completeness and determinism. Practitioners building similar NL2SQL agents over curated databases could reuse the failure-mode framework as a test suite before deployment.

bioRxiv · bioinformaticsRunnable

pyfraglib: An integrated cfDNA fragmentomics platform

A one-stop Python toolkit turns the tiny broken pieces of DNA floating in your blood into disease clues.

When cells die, they release fragments of DNA into the bloodstream called cell-free DNA (cfDNA), and the size, cut-points, and end-sequences of these fragments carry hidden clues about disease, including cancer. Researchers have created tools to look at each of these clues separately, but no single package let scientists extract fragments, model their statistical features, compare them across patient groups, and even simulate fake test datasets with known answers, all in one place. pyfraglib is a new Python platform that bundles all of this together, working with both short-read and long-read sequencing data. Having one integrated toolkit instead of scattered ones makes it much easier for researchers to develop and validate new cfDNA-based diagnostic methods, like non-invasive cancer or prenatal tests.

Technical view

pyfraglib is a Python package unifying the cfDNA fragmentomics pipeline: fragment extraction from both short- and long-read sequencing data, statistical feature modeling (Gaussian mixture modeling and NMF decomposition of fragment-length profiles, end-motif diversity metrics, windowed protection scores), cohort-level differential feature testing, and a built-in simulator for generating ground-truth-labeled synthetic datasets. This consolidates functionality previously spread across single-purpose tools into one package, letting users benchmark or develop new fragmentomic biomarkers (e.g., for liquid biopsy) against simulated data with known truth. Practitioners can plug it directly into existing cfDNA sequencing pipelines for feature extraction plus statistical comparison without stitching together multiple tools, and use its simulator to validate new fragmentomic methods before clinical application.

bioRxiv · bioinformaticsRunnable

pysigscore: gene signatures scoring across bulk and single-cell transcriptomics

A Python toolkit lets you test 18 different ways of scoring a gene 'signature' in your cell data — and check if the score is trustworthy.

In genomics, a 'gene signature' is a curated list of genes whose combined activity indicates something meaningful, like whether a tumor is aggressive or whether a cell is under stress. But there are many different mathematical recipes for turning a gene list plus expression data into a single score, and none of them is best for every situation. pysigscore is a Python tool that bundles 18 of these scoring recipes together, lets users build and test their own custom ones, and works on both bulk tissue data and single-cell data. It also checks how reliable a score is — for example by estimating statistical significance and testing what happens if you leave out one gene at a time — so researchers can trust their results rather than assume one method just works. The team validated it on major public datasets and confirmed it correctly recovered known biology, like liver-specific gene activity.

Technical view

pysigscore is a Python framework offering 18 built-in gene-set scoring methods plus a fully customizable scorer interface for bulk and single-cell RNA-seq, alongside reliability diagnostics including permutation-based p-value estimation and leave-one-out gene-contribution analysis. This directly addresses the lack of a universally optimal scoring method by letting users benchmark multiple approaches (and custom ones) against the same dataset within one framework rather than reimplementing each separately. Validation on CCLE, TCGA, and PBMC datasets recovered expected biological enrichments (e.g., liver, hypoxia, inflammation signatures), supporting its use as a standard benchmarking layer for signature-based analyses. Researchers building diagnostic or prognostic signature pipelines can use it to select the most robust scoring method for their specific data type and assess gene-level sensitivity of their signature scores.

bioRxiv · bioinformaticsBuildable

Move BeTween modAlities (MBTA) employs flow matching to predict single cell data modalities

New AI keeps each type of cell data in its own separate 'view' instead of blending them into a blurry average.

Cells can be measured in different ways — by which genes are active, which proteins are present, and so on — and scientists want to combine these views to understand a cell's full identity. The catch is that two cells that look similar under one measurement type might look quite different under another, and current methods usually squash everything into one shared space, which erases exactly those meaningful differences. MBTA takes a different approach: it keeps each data type in its own separate mathematical space and instead learns a flexible pathway, called flow matching, connecting one space to another, like a translator instead of a blender. This preserves the unique structure of each modality while still letting researchers predict one type of data from another. It matters because losing that structural nuance can hide real biology about how a cell's genetic, protein, and other layers relate to each other.

Technical view

MBTA (Move BeTween modAlities) tackles 'structural mismatch' — the fact that the k-nearest-neighbor/manifold structure of cells differs depending on which molecular modality defines it — by explicitly avoiding a shared latent embedding. Instead, it maintains separate modality-specific latent spaces and learns cross-modal transport via flow matching (a continuous-time generative modeling technique that learns vector fields transporting samples between distributions), enabling cross-modal prediction while preserving each modality's intrinsic geometry. This is positioned as the first framework to explicitly model and preserve structural mismatch rather than treating it as noise to be embedded away, unlike standard multimodal integration methods (e.g., joint VAEs or shared PCA/UMAP spaces). Practitioners doing multi-omic single-cell integration (RNA/ATAC/protein) could adopt this flow-matching-based cross-modal prediction approach when preserving modality-specific structure is more important than forcing a unified embedding.

bioRxiv · biophysicsBuildable

XSSDense: Time-resolved X-ray Solution Scattering Density Reconstruction Using a Variational Autoencoder

A neural network helps turn blurry X-ray scattering signals of wobbly proteins into actual 3D density pictures.

When scientists shine X-rays through a solution of proteins, they get a scattering pattern that reveals structural information, especially useful for capturing floppy or changing shapes that don't sit still for standard imaging. The problem is that this scattering data is quite limited and ambiguous on its own, so interpreting it usually means guessing candidate shapes and checking which one fits, rather than directly building a 3D density map of the molecule. XSSDense solves this by training a type of AI model called a variational autoencoder on many predicted or simulated protein shapes, then using a genetic algorithm (a trial-and-improve search inspired by evolution) to refine a density map that matches the actual scattering data. The team tested it on a well-studied small protein and also used it to reveal the messy, shifting shapes of proteins that don't fold into one fixed structure, showing it can capture real structural flexibility that other methods miss.

Technical view

XSSDense combines a variational autoencoder (VAE), trained on electron-density maps derived from predicted or simulated protein conformational ensembles, with a genetic-algorithm-based refinement step that optimizes the VAE's latent representation against experimental time-resolved solution X-ray scattering profiles, producing direct electron-density reconstructions rather than relying solely on candidate-structure fitting. It's validated on synthetic crambin data, applied to recover conformational heterogeneity in the unfolded state of the Avena sativa LOV2 domain, and used to resolve a de novo density for an additional protein target. This offers a generative-model-plus-search alternative to conventional ensemble-fitting approaches (e.g., EOM) for time-resolved SAXS/WAXS interpretation, and the VAE-prior approach could be extended by training on other simulated ensemble libraries for different protein families or by swapping in alternative refinement optimizers.

bioRxiv · cancer biologyBuildable

Tumor-specific Kinase Motif Enrichment Analysis Identifies Personalized Therapeutic Cancer Targets

A new tool reads tumors' protein chemistry to find drug targets DNA tests miss.

Phosphoproteomics looks at which proteins get chemically 'tagged' by kinases — enzymes that flip other proteins on or off — instead of looking at DNA mutations. GEP-NETs are rare gut/pancreas tumors that often kill by spreading to the liver, but they carry very few DNA mutations, so standard genetic tests find no obvious treatable weak spot. Researchers built KMEA, a tool that scans a huge library of kinase 'fingerprints' against each patient's tumor sample to spot which kinases are secretly overactive. It found some patients had hyperactive mTOR and others hyperactive CK2 (two different signaling enzymes), and this matched how their tumors actually responded to drugs targeting those kinases — pointing to a personalized treatment path genomics alone would have missed.

Technical view

KMEA compares mass-spec phosphoproteomic profiles of GEP-NET liver metastases against patient-matched uninvolved liver, scoring phosphosite motif enrichment against the Kinase Library's substrate-specificity compendium for nearly the full human kinome, thereby inferring per-tumor kinase activity independent of genomic drivers. It identified patient-specific upregulation of mTOR or CK2 activity undetectable by DNA/RNA sequencing, which concorded with each tumor's actual sensitivity to matching kinase inhibitors. As a generalizable activity-based (not mutation-based) target-discovery pipeline, KMEA could be applied to other low-mutational-burden cancers lacking actionable genomic drivers.

bioRxiv · pathologyConceptual

Hepatocyte Angiotensinogen Deletion Protects Against Diet-induced Metabolic Disorders in Mice Under Thermoneutral Conditions

Even at cozy temperatures, cutting one liver hormone still shields mice from diet-driven fat damage.

Angiotensinogen (AGT) is a liver-made hormone precursor tied to blood pressure control, and deleting it from liver cells was already known to protect mice from obesity and fatty liver on a junk-food diet. But mice are normally housed at room temperature, which is chilly enough that they burn extra calories just to stay warm — a hidden confound. This study first housed regular mice at a cozier 'thermoneutral' temperature and found that, surprisingly, the warmer housing made diet-induced liver damage worse and caused their fat-burning brown fat to lose function. They then tested whether removing liver AGT still protected mice under these warmer, less metabolically stressed conditions, addressing whether the earlier protective effect was real or just an artifact of forced calorie-burning.

Technical view

Compares wild-type vs hepatocyte-specific Agt-knockout mice fed a Western diet under conventional room-temperature housing (20°C, imposing cold-induced thermogenic demand) versus thermoneutral housing (30°C, removing it). Thermoneutral housing alone worsened diet phenotypes — brown adipose tissue whitening and more severe hepatic steatosis — despite no difference in body weight, confirming housing temperature as an underappreciated confound in rodent metabolic studies. The hepatic AGT knockout is then evaluated under thermoneutral conditions to determine whether RAS (renin-angiotensin system)-dependent hepatic protection persists independent of thermogenic masking, which matters for translating mouse metabolic-disease findings to humans, who live near thermoneutrality.

bioRxiv · pharmacology and toxicologyConceptual

Vorapaxar and aripiprazole suppress hepatitis B virus replication through distinct host signaling pathways

A heart drug and an antipsychotic turn out to quietly switch off hepatitis B's genes.

Hepatitis B hides a resilient loop of viral DNA (cccDNA) inside liver cells that today's antiviral pills can suppress but not erase, so the virus keeps producing proteins even during treatment. Researchers tested 1,470 already-approved drugs against a lab system that lights up when HBV's genetic 'on-switch' (its promoter) is active, and found two surprising hits: vorapaxar, a blood-clot-prevention drug, and aripiprazole, an antipsychotic. Both drugs shut down viral replication in infected liver cells, but through different routes — aripiprazole lowers a liver protein the virus depends on via a stress-signaling pathway, while vorapaxar works some other way entirely. Because both are already FDA-approved for unrelated conditions, they could potentially be repurposed as add-on hepatitis B treatments faster than a brand-new drug could be developed.

Technical view

Screened 1,470 FDA-approved compounds against an HBV enhancer I/X promoter luciferase reporter and identified vorapaxar (a PAR-1 antagonist) and aripiprazole (a dopamine/serotonin partial agonist) as promoter inhibitors; both suppressed replication in HBV-producing cell lines, HepG2-hNTCP infection models, and primary human hepatocytes. Aripiprazole acts by downregulating HNF4α, a core transcription factor for the HBV core promoter, via ERK/JNK signaling, while vorapaxar suppresses enhancer I/X activity through an HNF4-independent mechanism. Since both are repurposable approved drugs, natural follow-up work would test combination with nucleos(t)ide analogs or cccDNA-targeting agents in vivo to see if transcriptional suppression translates toward a functional cure.

bioRxiv · physiologyConceptual

15-Hydroxyeicosatetraenoic Acid and GPR39 Together Orchestrate Coronary Autoregulation: A Comprehensive Metabolomic Analysis

A little-known receptor and a fat-derived molecule team up to keep heart blood flow steady.

The heart needs constant blood flow even as blood pressure fluctuates, a trick called coronary autoregulation, but exactly how the body pulls this off has never been fully explained. This study proposes that GPR39, a receptor on the muscle cells wrapping coronary blood vessels, gets triggered by 15-HETE, a signaling molecule made from fatty acids, and together they act like a thermostat that widens or narrows vessels to hold flow steady. Researchers tested this in dogs by narrowing coronary arteries to different degrees while measuring blood flow, pressure, and various fat-derived blood signals, then repeated the experiment while blocking GPR39 with a specific drug to see whether autoregulation broke down. Pinning down this previously mysterious control system matters because it fails in heart disease, where blood flow to the heart muscle becomes dangerously unreliable.

Technical view

In open-chest anesthetized dogs, researchers created graded coronary stenoses to map coronary blood flow (CBF) against coronary driving pressure (CDP), sampling coronary venous blood for eicosanoids, adenosine, endothelin-1, PUFAs, and prostaglandins. They repeated the stenosis protocol during infusion of VC108, a selective GPR39 antagonist, testing whether blocking the receptor disrupts autoregulatory flow maintenance, and implicate 15-HETE (an arachidonic acid metabolite) as GPR39's endogenous agonist in vascular smooth muscle. This establishes a specific ligand-receptor axis underlying coronary autoregulation and opens GPR39 as a pharmacological target for ischemic heart disease research.

bioRxiv · synthetic biologyConceptual

Engineered protein circuits for cancer therapy

An mRNA-built molecular trap kills cancer cells only when it detects the mutant protein driving them.

RAS is the single most commonly mutated gene across cancers, but it's notoriously hard to drug directly. Researchers built 'protein circuits' — engineered proteins made from protease enzymes (molecular scissors) — that only trigger a cell-death switch when they sense mutant RAS inside a cell, like a lock that opens only with the right key. These circuits are delivered as mRNA instructions wrapped in fatty nanoparticle bubbles, the same delivery method used in mRNA vaccines, so cells temporarily build the circuit themselves rather than getting permanently altered. In lab dishes and in mice with aggressive liver tumors, the circuits selectively wiped out RAS-mutant cancer cells, actually killed them (rather than just pausing their growth like typical RAS drugs), and crucially didn't quickly evolve resistance the way standard treatments do.

Technical view

Modular protease-based synthetic protein circuits sense oncogenic mutant RAS via a sensor domain and trigger proteolytic release of an effector that induces cytotoxic (not cytostatic) cell death, delivered transiently via mRNA-LNP to avoid permanent genetic integration. Because the circuits act catalytically rather than through stoichiometric binding, they stay potent even at low mutant-RAS occupancy and resist the amplification/bypass-signaling escape routes that undermine small-molecule RAS inhibitors. Demonstrated efficacy against multifocal RAS-driven liver tumors in vivo plus minimal resistance under prolonged in vitro selection suggests a generalizable synthetic-biology killing platform, extendable to other driver mutations by swapping the sensor domain.

bioRxiv · systems biologyBuildable

Dynamic knowledge representation of blood brain barrier activation, injury and restitution with a novel agent-based model

A computer simulation builds a virtual blood-brain barrier to test how it breaks and heals.

The blood-brain barrier is a tightly sealed checkpoint made of several cell types working together that keeps the brain protected from the bloodstream, and it malfunctions in diseases like multiple sclerosis, Alzheimer's, traumatic brain injury, and stroke. Researchers built a computer simulation called BBBABM, an 'agent-based model' where each cell type (endothelial cells, pericytes, astrocytes, microglia, neurons) is programmed as its own virtual agent following its own rules, then let those agents interact to recreate how the barrier activates, gets damaged, and repairs itself. This gives scientists a mechanistic way to test hypotheses about barrier breakdown and predict drug effects without needing live animals for every experiment.

Technical view

BBBABM is presented as the first agent-based computational model mechanistically representing the full neurovascular unit — endothelial cells, pericytes, astrocytes, microglia, and neurons — along with their molecular signaling, to simulate BBB activation, injury, and restitution dynamics. Agent-based modeling encodes cell-type-specific rules and interaction pathways, letting emergent tissue-level behaviors like permeability change and repair kinetics arise from the simulation and be probed under perturbation before wet-lab testing. Researchers could calibrate the model with disease-specific parameters to simulate BBB dysfunction in MS, Alzheimer's, TBI/CTE, or stroke, or use it to virtually screen candidate drugs targeting barrier permeability.

bioRxiv · neuroscienceBuildable

Falsifiable substitution tests reveal task-structured neural evidence for auditory attention

New stress-tests catch brain-decoders that seem to read attention but are secretly cheating.

When scientists use EEG (brainwave recordings) to detect which of two speakers someone is listening to, there's a real risk the 'decoder' is picking up on incidental noise rather than actual attention. This paper designs falsifiable tests: swap out pieces of the experimental setup — the listener, the response type, the command — and check whether the decoder's supposed evidence survives, since genuine attention signals should persist in new data but shift in predictable ways under valid swaps. Applying this rigorous checking approach across six EEG datasets, plus eye-movement-only comparisons to rule out cheating via eye tracking, they found that combining several independent signals gave a more reliable, verified read on what someone is actually attending to. This matters for building trustworthy hearing aids or brain-computer interfaces that adapt to a listener's focus.

Technical view

Introduces a falsification framework for auditory-attention decoding: candidate neural evidence must persist across disjoint held-out data yet respond appropriately to capacity-matched substitutions (organization, listener/population template, target response mapping, command identity), with EOG-only controls ruling out ocular/motor confounds. Drawing on a Kakeya-proof-inspired strategy of examining the organized family/concentration rather than a single strongest statistic, averaging four neural-speech margins improved 5-second decoding accuracy over the single best margin across three pre-registered evaluation datasets (41 participants, gain 0.0201, 95% CI 0.0125–0.0279). A 16-cell scalp-direction decomposition further localizes where genuine attentional evidence resides, offering practitioners a validation template for any auditory-attention-decoding or BCI system before deployment.

bioRxiv · neuroscienceBuildable

Continuous attractor circuits for decision making with Laplace-domain neural representations

A brain-inspired circuit model shows two very different neuron firing styles secretly compute the same decision.

When brains make decisions by gradually accumulating evidence over time, neuroscientists see two puzzlingly different firing patterns among neurons: some ramp up smoothly, others fire in a sequence like a relay race passing a baton. This paper argues these are just two different 'codes' for the exact same underlying decision signal, similar to writing the same number in decimal versus binary. They build a computer model called a continuous attractor network — a system that can stably hold a whole range of values — using math inspired by how the brain represents time, and show it naturally produces both firing patterns while accumulating evidence toward a choice. When simulated, the circuit's trial-by-trial behavior closely matches real recorded neural activity, suggesting this could be how brains actually implement decisions at the circuit level.

Technical view

Proposes ramping and sequentially-firing neural populations as complementary population codes for a shared low-dimensional decision variable, unified through Laplace-domain temporal representations: exponential receptive fields yield a translating edge-like activity profile (ramping code) while localized receptive fields yield an aligned bump-like profile (sequential code). The authors construct a continuous attractor neural network that jointly maintains both representations on a shared latent manifold while integrating noisy evidence, and single-trial simulated trajectories closely match empirical neural recordings from decision-making tasks. This offers a concrete, implementable circuit-level mechanism combining attractor dynamics with Laplace-transform receptive fields, adaptable for modeling other accumulation-to-bound decision tasks and reconciling disparate single-neuron firing phenomenology under one computational framework.

bioRxiv · neuroscienceBuildable

ABISS: An Open-Source, Low-Cost Platform for Auditory and Visual Intrinsic Optical Signal Imaging

An Arduino kit turns brain-imaging of sound and sight into a $200 DIY setup.

Scientists who study how the brain responds to sounds and images need to know exactly where in the cortex (the brain's outer layer) that response happens. One good technique, called intrinsic optical signal imaging, watches for tiny light-reflectance changes in active brain tissue, but normally requires a costly, custom-built stack of stimulus generators, timing devices, and cameras that only a few well-funded labs can assemble. ABISS solves this by packing tone generation, visual stimulus display, precise timing, and camera triggering into one programmable Arduino-based box. Because it's open-source and cheap, more labs can now map brain function routinely instead of only in specialized facilities.

Technical view

ABISS is an open-source, Arduino-controlled platform that unifies auditory tone generation, VGA-based visual stimulus presentation, trial timing, and camera-trigger synchronization for intrinsic optical signal imaging (IOSI) experiments, replacing the ad hoc combinations of proprietary hardware/software typically required. By consolidating stimulus generation and acquisition triggering into a single programmable device, it removes a major integration barrier for labs mapping stimulus-evoked cortical activity for downstream targeting of electrophysiology, optical imaging, or viral injections. As an open hardware/firmware release, it's directly replicable and extensible — labs can adapt the Arduino code and stimulus modules to their own sensory paradigms.

bioRxiv · neuroscienceBuildable

A Low-Cost, Modular Hardware and Software Platform for Head-Fixed Mouse Decision-Making Tasks

A cheap, modular touchscreen rig lets whole labs train mice on decision-making tasks together.

Studying how the brain makes decisions often means training mice, one at a time, on choice tasks while their heads are gently fixed in place so scientists can image their brains — but the training is slow, labor-intensive, and commercial equipment is expensive and rigid. This paper offers an open-source, modular alternative built from affordable parts, controlled through a simple touchscreen interface, that automatically advances each mouse through training stages with minimal room for human error. That lets many people on a research team pitch in on training instead of relying on one expert. The team proved it works by teaching mice a task where they had to keep updating their guesses about which choice pays off as the rules secretly changed.

Technical view

The authors present a low-cost, modular, open-source hardware/software stack for head-fixed rodent decision-making experiments, featuring a touchscreen GUI and automated training-stage progression to reduce experimenter labor and standardize protocols across multiple trainers. They validate the system with a two-choice probabilistic rapid-reversal task, in which mice continuously update value estimates as reward contingencies switch — a classic paradigm for probing adaptive decision-making circuits. Because it's modular and open-source, labs can swap in their own imaging or optogenetic hardware around the same behavioral chassis, and the automated progression logic is reusable for other head-fixed task designs.

bioRxiv · immunologyConceptual

B7-H4 represents a site-specific immunotherapy target in small bowel gastrointestinal stromal tumor

A hidden 'off switch' on immune cells explains why gut tumors in the small bowel are so aggressive.

Gastrointestinal stromal tumors, or GISTs, are a type of cancer that can grow in different parts of the digestive tract, and for reasons that weren't understood, the ones in the small bowel behave much more aggressively than those in the stomach. This study compared gene activity in tumors from both locations and found that small-bowel GISTs pump out far more of a molecule called B7-H4, which acts like a brake that switches off nearby immune cells so they can't attack the tumor. Notably, the standard immune-boosting drugs used for other cancers (which target different brakes like PD-L1) wouldn't touch this one, since those levels were normal. This points to B7-H4 as a distinct, location-specific target for future small-bowel GIST immunotherapy.

Technical view

Bulk RNA-seq of 42 primary GISTs (36 gastric, 6 small bowel) identified marked upregulation of VTCN1/B7-H4 in small-bowel tumors (log2FC = 7.95, adj. P < 0.001), while PD-L1, PD-1, and CTLA-4 expression did not differ by site. B7-H4 enrichment correlated with an immunosuppressive microenvironment — reduced antigen-presenting cells, fewer effector-memory CD8+ T cells, lower granzyme B, and blunted interferon/inflammatory signaling — suggesting B7-H4 drives site-specific immune evasion rather than the checkpoints current immunotherapies target. This nominates B7-H4-directed agents (already in clinical development for other cancers) as a rational, biomarker-selected strategy for small-bowel GIST, distinct from PD-1/PD-L1 approaches.

bioRxiv · immunologyConceptual

IL-17A Restrains Antiviral Immunity to Promote Chikungunya Virus Infection and Pathogenesis in the Heart

A supposedly protective immune signal actually helps a mosquito-borne virus attack the heart.

Chikungunya is a mosquito-borne virus that's increasingly tied to heart problems, but scientists didn't know why. This study looked at a signaling molecule called IL-17A, which the immune system normally uses to fight infections, and found — surprisingly — that it does the opposite here: it actually helps the virus infect heart tissue and cause damage. Using specially engineered mice and human heart cells grown in the lab, the researchers showed that mice lacking IL-17A or its receptor were much better protected against chikungunya's heart effects. This flips IL-17A from a helper into a target, suggesting drugs that block it could protect the heart during chikungunya infection.

Technical view

Using heterozygous interferon-α/β/γ receptor-deficient (Ifnagr+/-) mice and primary human cardiac fibroblasts, the authors show CHIKV infection induces cardiac IL-17A production, and that Il17a-/- and Il17ra-/- mice exhibit marked resistance to CHIKV infection and cardiac pathology. This positions IL-17A signaling as a host factor that restrains antiviral immunity in cardiac tissue rather than promoting viral clearance, contrary to its typical antimicrobial role. The findings suggest IL-17A/IL-17RA blockade (an approach already used clinically for autoimmune disease) as a candidate therapeutic strategy for CHIKV-associated cardiovascular disease, with the Ifnagr+/- model offering a tractable system for further mechanistic dissection.

bioRxiv · immunologyConceptual

Mechanical Activation of Piezo1 by Virus-like Nanospikes to Potentiate STING-driven Macrophage Reprogramming

Spiky virus-mimicking nanoparticles physically 'poke' immune cells to switch on cancer-fighting mode.

Immune cells can sense physical touch and pressure, not just chemical signals — a process called mechanotransduction. This study builds nanoparticles studded with tiny rigid spikes, like a virus's surface, and shows that longer spikes more strongly trigger a pressure-sensing protein called Piezo1 on macrophages (immune cells that engulf threats), causing calcium to flood into the cell. The researchers then coated these spiky particles in cancer-cell membranes and loaded them with an immune-stimulating drug (MSA-2) that activates another pathway called STING, essentially combining a mechanical 'poke' with a chemical alarm to more powerfully reprogram macrophages against tumors. It's a proof that nanoparticle shape itself, not just its chemistry, can be engineered as a drug.

Technical view

The authors demonstrate a structure-activity relationship in which virus-like mesoporous silica nanoparticles (VLPSi) with tunable rigid nanospike lengths drive Piezo1-dependent Ca2+ influx in macrophages, with longer spikes producing stronger mechanosensitive activation. They combine this mechanical trigger with cancer-cell-membrane-coated, MSA-2-loaded VLPSi (CM/MSA-2@VLPSi) to co-engage Piezo1 mechanotransduction and STING agonism, aiming to potentiate macrophage reprogramming toward an antitumor phenotype. This establishes nanotopography (spike geometry) as an independent, tunable design axis for immunomodulatory nanoparticles, offering a template for combining mechanical and pharmacological activation in cancer immunotherapy nanoparticle design.

bioRxiv · microbiologyRunnable

A membrane-impermeant nucleic acid dye converts bacteriophage plaque assays into a machine-readable format for automated counting

A glowing dye turns virus-killing bacteria spots into dots a computer can count automatically.

When scientists want to measure how many viruses are in a sample that infect bacteria (called bacteriophages, or phages), they grow the phages on a lawn of bacteria and count the clear 'plaques' — holes where the phages killed the bacteria — by eye, which is slow and doesn't scale well. This paper shows that adding a dye that can't cross cell membranes and only lights up nucleic acids makes those plaques glow with much higher contrast, even the small or faint ones. That contrast boost lets free, off-the-shelf software (ImageJ) automatically count the plaques using a simple 'find local brightness peaks' method, no fancy machine learning or custom coding required. It's a simple fix that could make routine phage counting faster and more consistent across labs.

Technical view

The authors apply a membrane-impermeant nucleic acid dye to standard soft-agar overlay plaque assays, exploiting differential dye access/staining in lysed vs. intact bacterial regions to generate high-contrast, fluorescent plaque images. This enables automated plaque detection and counting via a simple, open-source ImageJ pipeline built on the Find Maxima algorithm, without requiring phage genetic engineering, machine learning models, or custom software — a low-barrier upgrade path for any lab already running plaque assays. Because the method enhances the raw image contrast rather than relying on downstream algorithmic sophistication, it could also serve as better training/input data for future ML-based plaque quantification tools.

bioRxiv · microbiologyRunnable

BACTERIAL AND FUNGAL CONTAMINATION OF STAIRCASE BANISTERS AT THE COLLEGE OF SCIENCE, KWAME NKRUMAH UNIVERSITY OF SCIENCE AND TECHNOLOGY, GHANA

Ghanaian university stair handrails were swabbed and found harboring a surprising mix of germs.

Staircase handrails get touched by hundreds of people a day, picking up whatever's on their hands, yet nobody had really checked what's actually living on them at this particular university. Researchers swabbed six handrails — a mix of wood and metal, in high-traffic buildings — across upper and lower sections, over three separate afternoons, then grew whatever bacteria and fungi were present on standard lab culture plates to identify them. This is a straightforward environmental health survey rather than a mechanistic experiment: it establishes a baseline of what germs are present on a common shared surface. It matters because these findings could inform cleaning practices and hygiene policy on campus.

Technical view

This cross-sectional environmental microbiology study sampled 12 surfaces (upper and lower sections of 6 wooden and metal banisters across three campus buildings) at KNUST, swabbing ~150 cm2 per section with buffered peptone water and culturing on standard bacteriological and mycological media over three consecutive Monday afternoons. The design (purposive selection of high-traffic, material-diverse sites; repeated timepoints) supports basic prevalence estimation and material/location comparisons of contaminant load, though the abstract doesn't specify identified taxa or quantitative results. As a baseline surveillance dataset, it could be replicated across other institutions or extended with molecular identification (e.g., 16S/ITS sequencing) for species-level resolution and antimicrobial resistance profiling.

bioRxiv · microbiologyConceptual

DrtA, a novel major facilitator superfamily transporter, contributes to intrinsic tolerance to the chemotherapeutic agent mitomycin C in Acinetobacter baumannii

A drug-resistant hospital superbug uses a newly found pump to shrug off a cancer chemo drug.

Acinetobacter baumannii is a notoriously drug-resistant hospital bacterium, and scientists are increasingly finding that even drugs designed for humans (not as antibiotics) can accidentally have antibacterial effects — except this bug tends to shrug them off. This study identifies a specific molecular pump in the bacterium's membrane, named DrtA, that helps it survive exposure to mitomycin C, a chemotherapy drug. Much like a bouncer ejecting unwanted guests, DrtA appears to pump the drug back out of the cell before it can do damage, and the gene for it is conserved across a related family of dangerous bacteria. Understanding pumps like this matters because blocking them could make existing drugs, including repurposed cancer drugs, effective again against tough infections.

Technical view

The authors characterize H0N29_04330 (DrtA), a Bcr/CflA-subfamily Major Facilitator Superfamily (MFS) transporter in Acinetobacter baumannii, showing it is highly conserved across the A. calcoaceticus-baumannii complex and contributes to intrinsic tolerance to the chemotherapeutic agent mitomycin C, alongside broader substrate specificity for antibiotic and non-antibiotic compounds. This extends prior efflux-resistance work — dominated by RND-family transporters — to underexplored MFS pumps, implicating DrtA in cross-tolerance between clinical antibiotics and repurposed non-antibiotic drugs. Practically, DrtA is a candidate target for efflux-pump inhibitor development or combination-therapy strategies aimed at restoring non-antibiotic drug efficacy against MDR A. baumannii.

bioRxiv · microbiologyBuildable

CRISPR-activation reveals key resistance genes and vulnerabilities of copy number variants in Candida albicans

Scientists turn on genes one by one to find which ones let deadly yeast dodge drugs.

Candida albicans is a yeast that can cause serious infections, and it often survives antifungal drugs by duplicating large chunks of its genome — sometimes hundreds of genes at once — a trick called a copy number variation, or CNV. The problem is that nobody knew which of those many duplicated genes actually caused the resistance versus just came along for the ride. The researchers used a technique called CRISPR-activation, which lets them artificially crank up one gene at a time without altering the DNA sequence, and tested about 800 genes individually across four different yeast strains and eight different conditions. This lets them pinpoint the real resistance-driving genes hidden inside these big genomic duplications, and also reveals hidden costs — genes that help under one condition but hurt under another.

Technical view

The authors deploy a CRISPR-activation (CRISPRa) library to individually overexpress ~800 genes located within recurrently amplified CNV regions across four genetically diverse C. albicans clinical isolates, assaying fitness across eight physiologically relevant conditions. This isolates single-gene dosage effects from the pleiotropic consequences of whole-region aneuploidy, distinguishing causal resistance genes from bystanders and revealing condition-dependent trade-offs. The screen format is directly extensible to other CNV hotspots or fungal pathogens with available CRISPRa toolkits. Results should yield a prioritized gene list for mechanistic follow-up and potential antifungal target validation.

bioRxiv · microbiologyRunnable

Mycobacteriophage D29-mediated lysis improves recovery of mycobacterial genomic DNA from low-biomass samples

A virus that only infects TB-like bacteria is used to crack them open for DNA testing.

Mycobacteria, including the bug that causes tuberculosis, have unusually tough, fatty cell walls that resist standard lab methods for breaking cells open to get their DNA — a real problem when you're working with tiny, low-bacteria clinical samples like sputum. This study tests whether a virus that specifically infects mycobacteria, called mycobacteriophage D29, can be used as a natural cell-popping tool instead. The researchers watched the phage infect and burst individual bacterial cells under controlled conditions, then compared how much usable DNA this method yielded against the standard chemical extraction technique (CTAB). The payoff is a gentler, more efficient way to pull out genetic material from scarce samples, which matters for diagnosing drug-resistant TB and studying rare bacterial variants.

Technical view

The authors characterize mycobacteriophage D29 lysis of Mycobacterium smegmatis at single-cell resolution, quantifying phage adsorption kinetics and lysis efficiency, then benchmark gDNA yield and quality against standard CTAB-based extraction. Phage-mediated lysis exploits the phage's own lytic enzymes to breach the mycolic-acid-rich cell envelope, potentially avoiding harsh detergents/mechanical disruption that can shear DNA or lose material in paucibacillary samples. This offers a biologically targeted lysis protocol relevant to low-biomass diagnostics (e.g., resistance genotyping from clinical TB specimens) and could be adapted to other D29-susceptible mycobacterial species.

bioRxiv · microbiologyBuildable

Structural modeling and experimental validation define the MxA-Thogotovirus nucleoprotein interface that drives restriction and escape

Modelers map exactly where a human antiviral protein grabs onto a flu-like virus to block it.

MxA is a protein our cells make to fight off certain viruses, including a tick-borne flu relative called Thogotovirus, by grabbing onto one of the virus's proteins and jamming it. Scientists have known for decades that this defense works but not exactly how the two proteins physically touch. Here the team combined computer structure-prediction tools, molecular dynamics simulations (essentially detailed physics simulations of atoms jiggling and bonding over time), and lab experiments to build and test a 3D model of where MxA locks onto the virus. They confirm that a specific loop on MxA latches onto an exposed patch on the viral protein, and check how stable that grip is. Understanding this interface at atomic detail helps explain how viruses might mutate to escape this defense, and how our immune system's antiviral arsenal actually works.

Technical view

The study integrates AlphaFold-style structure prediction, all-atom molecular dynamics simulations, and mutagenesis/binding experiments to resolve the interface between the MxA L4 loop (centered on residue 561) and the surface-exposed epitope on Thogotovirus nucleoprotein (NP). MD simulations assess binding stability of this interface, building on prior evolutionary and mutagenesis evidence implicating the L4 loop as the key restriction determinant. The resulting structural model provides testable predictions for NP escape mutations and MxA gain-of-function variants, and offers a template applicable to related orthomyxovirus-MxA interactions (e.g., influenza A NP).

bioRxiv · microbiologyConceptual

Inhibition of Nrf1 activity is a relevant for the HCV-dependent dysregulation of host lipid metabolism

Hepatitis C virus may hijack a cholesterol-sensing protein to rewire how liver cells handle fat.

Hepatitis C virus needs the host cell's fat-processing machinery to replicate, and infection is known to throw off normal lipid balance in liver cells. One of the proteins that normally keeps lipid levels in check is Nrf1, which exists in several different forms (proteoforms) that can sense cholesterol or turn genes on and off. The researchers had already noticed that HCV-infected cells have less of the full-length, active version of Nrf1, and here they dig into whether the virus is specifically disrupting how Nrf1 gets made or processed, and whether that disruption is what's driving the abnormal fat handling seen in infected cells. Pinning down this mechanism could reveal a new angle for understanding — or treating — the metabolic damage HCV causes.

Technical view

Building on prior observations that HCV replication reduces full-length Nrf1 protein levels, this study examines how HCV infection affects the processing and relative abundance of distinct Nrf1 proteoforms — which differentially function as a cholesterol sensor versus transcriptional activator/repressor — and tests whether this shift causally underlies HCV-associated lipid metabolism dysregulation. The approach likely combines HCV replicon/infection systems with proteoform-resolved analysis (e.g., isoform-specific antibodies or reporter constructs) and downstream lipidomic or transcriptional readouts of Nrf1 target genes. This positions Nrf1 proteoform balance as a candidate mechanistic node linking HCV infection to host lipid homeostasis, with potential relevance to HCV-associated steatosis.

bioRxiv · microbiologyConceptual

Requirements for swarming ability by lateral flagella on an agar surface in marine Vibrio cells

Marine bacteria grow a second set of legs to crawl across surfaces instead of swim.

Some marine bacteria, like Vibrio alginolyticus, carry two totally different propulsion systems: polar flagella for swimming freely in water, and lateral flagella that only appear when the bacterium lands on a surface — like a fish's body or your gut lining — letting it crawl or swarm instead. The long-standing idea, called the dynamometer hypothesis, is that the swimming flagellum somehow senses when its spinning is being slowed down by resistance, and that signal switches on the crawling flagella genes. But exactly how the cell detects that slowdown and flips the genetic switch has never been nailed down. This paper investigates what's actually required — physically and genetically — for the crawling flagella to work once they're switched on. Understanding this matters because this surface-sensing, gear-switching trick may be how many bacteria decide to colonize hosts or form biofilms.

Technical view

The study probes the mechanistic requirements for swarming motility driven by proton-powered lateral flagella (Laf) in V. alginolyticus/V. parahaemolyticus, cells that also possess sodium-powered polar flagella (Pof) used for swimming. It builds on the dynamometer hypothesis, wherein rotational load on the polar flagellar motor is proposed to trigger Laf gene induction, but focuses specifically on what lateral flagella need functionally to achieve surface swarming once expressed. Likely approaches include genetic manipulation of Laf components combined with surface motility assays on agar, possibly paired with biophysical or single-cell imaging methods referenced as recent trends in the field. Results would clarify structural or regulatory requirements for Laf-driven swarming, relevant to understanding surface colonization in Vibrio pathogens.

bioRxiv · microbiologyRunnable

Identification and Antibiogram Assay of Escherichia coli Isolated from Chicken Eggs

Researchers swabbed Bangladeshi chicken eggs and found drug-resistant E. coli lurking on shells.

E. coli bacteria can contaminate chicken eggs and, when resistant to antibiotics, can spread that resistance up the food chain to people who eat them. This study looked at eggs from commercial farms, open markets, and backyard flocks across seven areas of Natore District, Bangladesh, swabbing 84 eggshells to see how common E. coli contamination is. The researchers identified the bacteria using standard lab techniques — growing them on special media and checking their shape and biochemical traits — then tested which antibiotics the isolates could resist. The goal is straightforward but important: map out how much of a food-safety and antibiotic-resistance risk backyard and market eggs pose in a region where this data barely exists.

Technical view

The study surveyed 84 eggshell swabs (28 each from commercial farms, markets, and backyard flocks across seven upazillas of Natore District, Bangladesh, Jan–Jun 2023), isolating E. coli via standard culture, morphological, and biochemical identification, followed by antimicrobial susceptibility testing (antibiogram) to determine resistance profiles. This generates baseline prevalence and resistance data for a previously undocumented region, useful for food-safety risk assessment and regional AMR surveillance. Practitioners could replicate the sampling/testing pipeline in other under-surveyed poultry supply chains to build comparative resistance maps.

bioRxiv · molecular biologyRunnable

Improving metazoan biodiversity inventories associated with rocky subtidal habitats of the North Colombian Pacific through eDNA metabarcoding and DNA barcodes

Scientists filtered Colombian Pacific seawater for stray DNA to catalog hidden reef life.

The rocky underwater shores of Colombia's Pacific coast are biologically rich but barely studied, partly because they're hard to reach. To fill in this blank spot on the biodiversity map, researchers combined old-school methods — divers doing visual surveys and collecting specimens by hand — with newer genetic tools: environmental DNA (eDNA), which means filtering seawater to catch traces of genetic material that animals shed just by living there, and DNA barcoding, a way of identifying species from a short, standardized snippet of their genetic code (in this case a gene called COI). Divers collected samples from four coastal sites and specimens from fourteen locations at depths up to 25 meters. Combining these approaches gives a fuller, more reliable picture of what species actually live there than any single method alone, which matters for conservation planning in a hard-to-monitor ecosystem.

Technical view

The study combines visual census, SCUBA-based specimen collection, eDNA metabarcoding, and COI DNA barcoding to inventory metazoan biodiversity across four eDNA sampling sites and fourteen specimen-collection locations (1–25 m depth) on rocky subtidal habitats of the North Colombian Pacific. Barcode sequences were generated and validated from collected tissue, presumably cross-referenced against eDNA metabarcoding reads to assess concordance and complementarity between morphological and molecular detection methods. This multi-method approach establishes a baseline reference barcode/eDNA dataset for an undersampled region, providing a reusable framework and reference library for future biomonitoring or conservation genetics work in similar under-surveyed marine systems.

bioRxiv · cell biologyConceptual

piRNAs safeguard splicing and RNA fidelity

Tiny gene-silencing RNAs moonlight as quality inspectors for how genes get spliced.

piRNAs are small RNA molecules best known for silencing rogue DNA elements called transposons, but oddly they also latch onto thousands of the cell's own normal messenger RNAs, and nobody quite knew why. This study, done in the roundworm C. elegans, shows that this targeting actually helps ensure genes get spliced correctly — splicing being the editing process that cuts out unneeded bits of a gene's raw transcript to make the final usable version. By stressing worms with heat shock to trigger a burst of new gene activity, the researchers found that piRNAs and their partner protein PRG-1 trigger production of small RNAs that physically slow down the splicing machinery just enough to let it choose the right cut points. Without piRNAs, splicing happens faster but sloppier, producing more flawed, error-prone versions of genes — revealing a whole new quality-control job for these RNAs beyond their known role as genome defenders.

Technical view

In C. elegans, the authors show that PRG-1/piRNA-directed production of antisense 22G-RNAs from heat-shock-induced transcripts associates with RNA Pol II, the spliceosome factor MOG-7/C2orf3/Ntr2, and nascent RNA to delay splicing completion and modulate splice-site selection. Long-read transcriptome sequencing in prg-1/piRNA-deficient mutants shows accelerated but less accurate splicing, with increased aberrant isoform production that is normally cleared via alternative splicing/surveillance pathways. This establishes a co-transcriptional, kinetic-coupling mechanism linking small RNA-directed silencing machinery to spliceosome fidelity, distinct from piRNAs' canonical transposon-silencing role, and suggests a general model for endo-siRNA/Pol II interplay in splice-site accuracy that could be tested in other rapid-transcription contexts or organisms with piRNA/PIWI pathways.

bioRxiv · ecologyConceptual

Decline in Kappaphycus alvarezii invasion in the Gulf of Mannar, India

A seaweed farmed for profit went rogue in Indian waters — and now it's mysteriously retreating.

Kappaphycus alvarezii is a red seaweed prized for carrageenan, a gel used in food and cosmetics, so it's grown widely in aquaculture farms. The very traits that make it a good crop — fast growth, toughness, ability to spread — let it escape farms and invade the Palk Bay-Gulf of Mannar region, a fragile marine biodiversity hotspot in India. Researchers dove underwater to survey the seaweed directly, talked to local wild-seaweed harvesters about what they've seen over the years, and dug through past scientific reports to piece together the invasion's timeline. Surprisingly, they found the invasion has been fading rather than growing, which matters because it could reshape how we think about the long-term risks (and reversibility) of farmed species escaping into the wild.

Technical view

The study reconstructs the invasion trajectory of the aquaculture-escaped red alga Kappaphycus alvarezii in the Palk Bay-Gulf of Mannar region, one of only three global sites where this species has documented invasive spread, using a mixed-methods approach combining in-water ecological surveys, structured interviews with wild seaweed collectors, and a synthesis of prior literature. The key finding is a substantial decline in invasion extent, contrary to the assumption that fast-growing, stress-tolerant aquaculture species inevitably escalate as invaders once established. This has direct implications for Blue Economy policy, which leans on aquaculture expansion for food security, by suggesting invasion risk may be more dynamic and self-limiting than static risk models assume — useful groundwork for anyone building invasion-risk or aquaculture-siting frameworks.

bioRxiv · ecologyConceptual

From shielding effect to hierarchical structures: a coarse-grained description of diversity

Why can so many microbe species coexist when textbook math says only a few should survive?

Ecologists have long been puzzled by the 'paradox of the plankton': simple theory predicts that only as many species can coexist as there are resources to fight over, yet real ponds and oceans teem with far more species than that. One explanation is that microbes face trade-offs — being great at using one resource often means being worse at another — which lets many strategies coexist. This paper points out that past models only considered trade-offs around resource use, ignored that different groups of organisms face different trade-offs, and couldn't explain why species naturally cluster into groups with similar lifestyles. The authors build a more general mathematical framework that accounts for multiple resource types and different subsets of species facing different rules, aiming to explain both the raw diversity and the clustering pattern seen in nature.

Technical view

The paper extends trade-off-based coexistence theory (used to resolve the paradox of the plankton) into a coarse-grained framework incorporating multiple resource/interaction types, heterogeneous trade-off structures across taxa, and — critically — an explanation for empirically observed hierarchical clustering of taxa by functional similarity, which prior single-trade-off models could not produce. The approach models different subsets of taxa as subject to distinct trade-off constraints rather than a single universal shielding trade-off, generating hierarchical structure as an emergent property. This offers ecologists a more general, testable framework for linking microbial community structure to underlying physiological trade-offs, and a template for incorporating multi-resource, multi-interaction dynamics into diversity models.

bioRxiv · evolutionary biologyConceptual

Coexistence of phasmid sensory neurons and caudal glands offers a new perspective on cell type evolution in nematodes

A worm thought to lack 'smell' organs turns out to have them alongside its glue glands.

Nematodes (roundworms) are simple but ancient animals, and scientists use them to study how cell types evolve over deep time. Land-dwelling nematodes have sensory organs called phasmids (used for smelling chemicals), while older, water-dwelling lineages were thought to lack them entirely, relying instead on caudal glands — tail structures that secrete a sticky substance to anchor them underwater. Because these two features seemed to never appear together, scientists suspected phasmids might have literally evolved out of caudal glands as worms moved onto land. By examining a water-dwelling worm species under both light and electron microscopes, the researchers found both structures present at once in the same animal, disproving that neat evolutionary story and showing the picture is more complicated.

Technical view

Using light and electron microscopy on Mononchus aquaticus, a representative of the early-branching Dorylaimia lineage, the authors demonstrate that phasmid sensory neurons and caudal glands are not mutually exclusive as long assumed, refuting the hypothesis that phasmids evolved directly from caudal gland tissue during the aquatic-to-terrestrial transition in nematodes. This directly overturns the 'Aphasmidia' classification premise for early nematode lineages and reframes how cell-type origin should be modeled in this phylum. The finding is a useful data point for comparative developmental biologists studying convergent versus divergent origins of sensory versus secretory cell types, and argues for re-examining other 'lost trait' assumptions built on incomplete ultrastructural surveys.

bioRxiv · evolutionary biologyConceptual

The fate of a dynasty: Population genomics uncovers the demographic history of Ardea insignis, one of the rarest bird species in the world

Genome of a heron with under 60 birds left reveals whether it was always this rare.

The White-bellied Heron is one of the rarest birds on Earth, with fewer than 60 individuals known to survive, and conservationists have wanted to know whether that's because humans recently wrecked its population or because it's naturally always been scarce — the answer changes how urgently and how you'd try to save it. The researchers built the bird's first full genetic blueprint (genome) using modern long-read DNA sequencing technology, then compared it to related heron species to trace its family tree and history. They found the heron's closest living relative is the Purple Heron, and its DNA shows signs of long-term low genetic diversity and inbreeding (measured through patterns called 'runs of homozygosity,' essentially long identical stretches of DNA inherited from related ancestors). This genomic history helps conservationists judge whether the species has innate resilience or is genetically fragile going forward.

Technical view

The authors generated the first reference genome for Ardea insignis using Oxford Nanopore long-read sequencing plus Illumina short-read data, then performed comparative mitochondrial and nuclear phylogenomics establishing A. purpurea as its sister species while noting mitonuclear discordance among deeper ardeid lineages. Genome-wide heterozygosity and runs-of-homozygosity analyses show exceptionally low diversity relative to more common heron relatives, consistent with a long history of small effective population size rather than purely recent anthropogenic collapse. This reference genome and demographic reconstruction (likely via PSMC or similar coalescent methods) provides a template for genomic-informed conservation planning — e.g., assessing inbreeding depression risk and prioritizing genetic rescue or captive breeding strategies for critically small populations.

bioRxiv · evolutionary biologyBuildable

Decoupling epigenetic variation from genetic variation reveals complementary dimensions of coral eco-evolutionary dynamics

Coral DNA and coral 'settings' (epigenetics) tell two different stories about how reefs adapt.

Beyond the genes an organism inherits, cells also carry chemical marks on DNA called epigenetic modifications (like DNA methylation) that can switch genes on or off without changing the underlying code — think of it like sticky notes layered on top of a recipe book rather than rewriting the recipes themselves. Scientists know a lot about how genetic diversity is distributed across coral populations, but much less about whether this epigenetic layer varies independently and what that means for corals' ability to cope with environmental change. This study sampled two different reef-building coral species across several South Pacific locations and used a sequencing technique that reads both DNA sequence and methylation marks at once, carefully separating epigenetic patterns that merely track genetics from those that vary on their own. They found genetic and epigenetic patterns are spatially organized in different ways, suggesting epigenetics is an independent, complementary layer of diversity — potentially a faster way for corals to adjust to changing oceans than waiting for genetic evolution.

Technical view

Using genome-wide Enzyme-Methyl sequencing across Pocillopora acuta and Acropora hyacinthus sampled in New Caledonia, Fiji, and French Polynesia, the authors jointly called SNPs and CpG methylation to statistically partition genetically-linked epigenetic variation from genetically-independent ('pure' epigenetic) variation. The key result is that genetic and epigenetic population structure show contrasting spatial patterns, indicating epigenetic variation carries information not captured by genotype alone. This provides a methodological template (EM-seq plus genetic/epigenetic decomposition) for reef researchers to incorporate epigenetic markers into eco-evolutionary and climate-resilience models, potentially identifying acclimatization potential that pure population-genetic surveys would miss.

bioRxiv · geneticsConceptual

Auto-sumoylation of UBC9 coordinates meiotic prophase and protects ovarian reserves

A single self-tagging switch on one protein helps decide if egg cells survive or die.

During formation of sperm and eggs, chromosomes must pair up and swap DNA segments precisely — a process called meiosis — and a small protein tag called SUMO helps orchestrate this. One enzyme, UBC9, attaches SUMO tags to other proteins, but this study shows UBC9 can also tag itself at a specific spot (lysine 14), and that self-tagging changes which other proteins it targets. Using genetically engineered mice that can't make this self-tag, the researchers found problems with how chromosomes find their partners and exchange DNA correctly during meiosis, in both sperm and egg cells, though the defects looked somewhat different between the sexes. Because these errors are linked to how many healthy eggs a female mouse retains over her lifetime, the finding connects a specific molecular switch to fertility and reproductive aging.

Technical view

The study characterizes in vivo auto-sumoylation of UBC9 at lysine 14 using a Ubc9(K14R/K14R) knock-in mouse model, showing this modification is required for proper coordination of meiotic prophase I events including DNA strand-exchange complex assembly, timely homolog synapsis, and stable crossover recombination complex formation. Phenotypes diverge by sex: spermatocytes show reduced X-Y crossover efficiency, while oocytes display related but distinct synapsis/recombination defects that affect ovarian reserve maintenance. This establishes UBC9 auto-sumoylation as a substrate-selectivity switch relevant to reproductive biology, giving researchers a specific molecular handle (K14 mutation) for dissecting sex-specific meiotic quality control and its links to premature ovarian insufficiency.

CHM

Chemistry & Materials

50 new
arXiv · physics.app-phRunnable★ flagship

Measurement of third-order elastic constants using thermal modulation of ultrasonic waves

Gently heating a metal to measure how sound speed shifts and reveal its hidden nonlinear stiffness.

Materials have 'third-order elastic constants' (TOEC) that describe how their stiffness changes under strain — numbers crucial for detecting fatigue, damage, or stress in metals before they fail. Measuring them the usual way is tedious and error-prone. This paper's trick is to use temperature: warming a sample uniformly makes it expand slightly (a known strain) and subtly changes the speed of ultrasonic waves passing through it, and the authors derive equations linking that velocity change to the TOEC. They cross-check the new thermal method against the traditional approach of squeezing the sample under mechanical load, and the two agree well on an aluminum sample. Because heating a sample is far simpler and more sensitive than a precise mechanical stress rig, this thermal-modulation technique offers an easier, more accurate route to measuring nonlinear elastic properties.

Technical view

The Letter derives expressions for ultrasonic wave-velocity changes induced by homogeneous temperature variation and by uniaxial stress in isotropic media, expressing the third-order elastic constants (TOEC) in terms of thermally induced velocity change and thermal strain. TOEC of an aluminum sample were determined two ways — uniaxial loading (acoustoelastic) and thermal modulation — with good agreement between methods, validating the thermal approach. The thermal-modulation setup is simpler and offers higher measurement sensitivity than conventional stress-based acoustoelastic measurement, making it a practical route to TOEC and absolute acoustic nonlinearity parameters. Practitioners can adopt controlled-temperature ultrasonic velocity measurement plus the derived thermal-strain relations to characterize nonlinear elasticity with reduced setup complexity and error.

arXiv · eess.SPBuildable

Effects of Tool Wear on the Surface Texture in Turning: A Feature Characterization Approach Based on ISO 21920-2

The scratches a worn cutting tool leaves on metal secretly tell you exactly how worn it is.

When a lathe tool cuts steel, it leaves behind a surface texture that's like a fingerprint of both how the machine was set up and how worn the cutting edge has become. Simple average-roughness numbers used in industry today only give a single blurry summary and can't show where on the surface the wear-related patterns actually appear. This study tests a newer international standard (ISO 21920-2) that identifies specific surface 'features' rather than just averages, applying it to real roughness measurements from twelve coated cutting inserts machining steel across their entire working life. They then use an image-segmentation technique (watershed, like flood-filling valleys) to pull out these features and connect them to two specific wear types — crater wear and flank wear — and to how long the tool has been cutting. This matters for factories because it could let sensors read surface texture and tell operators exactly when to swap out a worn tool before quality suffers.

Technical view

The study benchmarks ISO 21920-2 feature-based surface characterization against classical global roughness parameters (Ra, Rq) for tracking tool wear, using roughness profiles from twelve AlTiN-coated carbide CNMG120408 inserts turning AISI 1045 steel at nine wear states with triplicate profiles each. Standardized field and feature parameters are first correlated against measured crater wear, flank wear, and cumulative cutting time, then watershed segmentation is adapted to spatially resolve deterministic, process-induced structures within the profiles. The approach demonstrates a path toward spatially-resolved, physically interpretable in-process wear monitoring that manufacturing engineers could implement with standard profilometry data and open watershed-segmentation tooling, going beyond single-number Ra/Rq thresholds currently used for tool-change decisions.

arXiv · cond-mat.mtrl-sciBuildable

The electrical transport of intrinsic two-dimensional ferroelectric metal PtBi2

A metal that's also a switchable electric compass, and it might reveal its own hidden crystal shape.

Normally you'd think a material can either conduct electricity like a metal or hold a switchable internal electric polarization like an insulating ferroelectric — not both. This paper studies PtBi2, an ultra-thin material that defies that rule by being both metallic and ferroelectric at once, and uses computer simulations to predict how it conducts electricity under an applied voltage, including nonlinear effects that only show up in materials without certain symmetries. The simulations also show the material stays magnetically well-ordered up to a very high temperature (800 Kelvin, hotter than a pizza oven), and predict that its high-temperature, non-polar crystal form can be told apart from other candidate structures just by measuring how conductivity differs along different in-plane directions. This matters because 2D ferroelectric metals are a fairly new class of material that could enable novel low-power memory and sensor devices.

Technical view

Using semiclassical Boltzmann transport theory combined with first-principles (DFT) calculations, the authors compute linear and nonlinear electrical transport responses of intrinsic 2D ferroelectric metal PtBi2 to an applied field. Ab initio molecular dynamics simulations put its Curie temperature at ~800 K, and the authors propose that in-plane electrical conductivity anisotropy measurements can experimentally discriminate the correct high-temperature paraelectric phase structure from competing candidates. This gives experimentalists a concrete, relatively simple transport measurement (rather than more difficult structural probes) to validate DFT-predicted crystal symmetry in 2D ferroelectric metals, and a first-principles transport framework replicable for related non-centrosymmetric metallic ferroelectrics.

arXiv · cond-mat.mtrl-sciConceptual

Beam Routing through Excitons in Transition Metal Dichalcogenide Monolayers

A semiconductor's own glow can steer light sideways without any nanostructured lens or antenna.

When a very thin sheet of certain crystals (just one layer of atoms thick) absorbs light, it creates tiny bound pairs of charge called excitons, which then re-emit light as they relax. Normally, engineers etch tiny patterns onto surfaces to control which direction emitted light travels, but this study shows the material itself can do that job. By cooling the material and studying the emitted light from many angles, the researchers found that different types of excitons — a bright one, a charged one, and a rare 'dark' one that's usually invisible — each send light off in their own characteristic directions. The dark exciton, oddly, shoots light out at steep angles that other excitons can't reach. This matters because it hints at building ultra-compact optical components with no extra fabrication, just by picking the right material and conditions.

Technical view

Using low-temperature angle-resolved cathodoluminescence on monolayer WSe2, MoSe2, and MoTe2, the authors resolve distinct angular radiation patterns tied to specific excitonic transitions: the in-plane transition dipoles of the bright exciton and trion emit predominantly near the surface normal, while the out-of-plane dipole of the spin-forbidden dark exciton — normally dark under normal-incidence optical excitation — produces a distinct high-angle emission channel. Because cathodoluminescence uses electron-beam excitation rather than optical pumping, it accesses transitions inconsequential to standard photoluminescence setups. They further show the neutral-to-charged exciton emission ratio can be tuned locally, suggesting a route to reconfigurable, structure-free directional light sources or on-chip beam routers built directly from 2D semiconductor physics rather than nanophotonic patterning.

arXiv · cond-mat.mtrl-sciBuildable

Thermoelastic Harvesting Outperforming Thermoelectric Generators Below 100 °C

A clever wire-based heat engine now beats thermoelectric chips at turning waste warmth into electricity.

Huge amounts of low-temperature waste heat — think warm water or exhaust below the boiling point — go unused because most heat-to-electricity devices (thermoelectric generators) are inefficient at these temperatures. This work uses a different trick: 'shape-memory alloy' wires made of nickel-titanium that physically flex and snap back as they heat and cool, and that mechanical motion is harvested as electricity, a method called thermoelastic harvesting. The team redesigned the whole system — using two wire sets that take turns doing work and recovering each other's stretching energy, adding an adjustable tensioning mechanism, and running water sideways across the wires so cycling speed isn't limited by wire length. The result converts heat to power far more effectively per volume of material than any previous thermoelastic, thermomagnetic, or pyroelectric device, making low-grade waste heat recovery much more practical.

Technical view

The system exploits the temperature-dependent phase transition (martensite-austenite) in NiTi shape-memory alloy wires, converting cyclic thermal strain into mechanical then electrical energy. Three architectural innovations enable the performance leap: a protagonist-antagonist wire pairing that recycles prestrain energy internally, a continuously tunable prestrain mechanism to optimize the force-strain operating point, and transversal (cross-flow) water delivery that decouples thermal cycling frequency from wire length, removing a key throughput bottleneck of prior designs. The directly measured power density is 366 mW/cm^3 relative to active material volume — about 1.7x the next-best thermoelastic device and superior to all reported thermomagnetic and pyroelectric harvesters — positioning thermoelastic conversion as newly competitive for sub-100°C waste heat recovery applications.

arXiv · cond-mat.mes-hallConceptual

Mismatch between Raman shear modes and ferroelectric polarization in 3R-MoS$_{2}$

Two 'silent' stacking patterns in a thin crystal turn out to vibrate in totally different ways.

Some ultra-thin, layered crystals can become mildly electrically polarized just by how their atomic layers are slid relative to each other, a trick called sliding ferroelectricity that could enable new kinds of tiny electronic devices. To use this trick, scientists first need a reliable way to tell which stacking arrangement a flake actually has without damaging it. Here researchers looked at three-layer molybdenum disulfide using two non-destructive probes: one that maps surface electric potential (Kelvin-probe force microscopy) and one that reads vibrational fingerprints (low-frequency Raman spectroscopy). Surprisingly, two stacking patterns that have zero net polarization and look identical to the potential probe show completely different vibration signatures in Raman, and the standard theoretical model can't explain why — meaning there's some extra physics still missing from our understanding of how these layers talk to each other.

Technical view

The authors combine KPFM and low-frequency (shear-mode) Raman spectroscopy on exfoliated trilayer 3R-MoS2 on hBN to disambiguate stacking order and polarization state. ABA and BAB stackings, both net-zero-polarization configurations, are electrostatically indistinguishable via KPFM but exhibit markedly different shear-mode Raman activity, a result reproduced across multiple flakes and cross-checked with low-temperature photoluminescence. Critically, the standard bond-polarizability model fails to reproduce the ABA/BAB shear-mode contrast, implying additional symmetry-breaking or electron-phonon coupling effects beyond current models. This gives a practical non-destructive metrology route for stacking assignment while flagging a gap in the theoretical description of shear-phonon activity in polar vdW stacks.

arXiv · cond-mat.mtrl-sciConceptual

Electronic structure, band offset, and interface electron population of the LaInO$_3$/BaSnO$_3$ system

X-rays and quantum math team up to map the electron traffic jam at an oxide interface.

When you stack two different oxide crystals together, a thin sheet of highly mobile electrons can spontaneously form right at the boundary between them — useful for fast, efficient electronics. This study looks at one such pairing, BaSnO3 and LaInO3, which recently achieved unusually high electron speeds at room temperature. The researchers used two flavors of X-ray spectroscopy to measure exactly which energy levels the electrons occupy on either side of the interface, then compared those measurements to detailed computer simulations of the chemical bonding. The goal is to fully explain why electrons pile up at this particular interface and how the material's atomic-level chemistry controls it, which matters for designing better high-speed transistors.

Technical view

The work combines soft and hard X-ray photoelectron spectroscopy (SXPS/HAXPES) with hybrid-DFT-derived densities of states to characterize BaSnO3, LaInO3, and their heterostructure interfaces across varying LaInO3 overlayer thickness. By resolving core, semi-core, and valence-band states, the authors extract the band offset and quantify the 2D electron gas population that forms at the interface, which underlies the >100 cm²/Vs room-temperature mobilities reported in this system. This gives a quantitative electronic-structure basis (band alignment, charge transfer mechanism) that device engineers can use to model or tune 2DEG density via overlayer thickness.

arXiv · cond-mat.mes-hallConceptual

Dimensional crossover and local strain induced deflection of the spin spiral state in multiferroic NiI2

A magnetic spiral inside an ultra-thin crystal twists and bends as you add more atomic layers.

NiI2 is a material where a spiral pattern of electron spins (tiny atomic magnets) can generate an electrical polarization even in a single atom-thick layer, linking magnetism and electricity in one material. This study asks how that spiral changes as you stack more layers on top, from 1 up to 7. Using a specialized microscope that can sense individual spins, plus careful layer-by-layer crystal growth and computer modeling, the team watched the spiral's wavelength stretch and its direction rotate as thickness increased, showing a gradual crossover from '2D-like' to more '3D-like' magnetic behavior driven by layers pulling on each other. They also found that physical wrinkles in the film locally bend the spiral's direction, revealing that simple mechanical strain can be a knob for controlling magnetism.

Technical view

Using spin-polarized STM, layer-resolved MBE-style growth, and multi-scale modeling, the authors track the spin-spiral order in NiI2 from monolayer to 7 layers, observing a continuous wavelength increase and a 90°-ish wavevector rotation ([110]→[1-10]) attributed to a dimensional crossover driven by increasing interlayer exchange coupling. They further show that local film wrinkles induce curvature that deflects the spin-spiral wavevector, linking mechanical strain directly to magnetic texture. This establishes thickness and strain as concrete tuning parameters for spiral-driven multiferroicity in vdW magnets, relevant to designing layer-number- or strain-programmable magnetoelectric devices.

arXiv · cond-mat.mtrl-sciBuildable

Magneto-optical magnetoelectric voltage sensor

A magnetic mirror that flips light when high voltage squeezes it, letting you read voltage from afar.

Measuring very high voltages safely, especially in electrically noisy or hazardous environments, usually requires the sensor to be physically isolated from the equipment being measured — often done today using light-based (optical) sensors. This paper introduces a new kind of optical voltage sensor: a piezoelectric material (which changes shape under voltage) is mechanically bonded to a magnetic film, so that voltage-induced stretching or squeezing changes the film's magnetization. That magnetic change is then read out optically by measuring how it rotates polarized light (called Faraday rotation), giving a fully light-based, electrically isolated voltage readout. This combines two known effects — piezoelectric and magneto-optical — in a new way that hasn't been well explored, potentially offering a more robust option for monitoring high-voltage power equipment.

Technical view

The sensor couples a piezoelectric actuator to a bismuth-substituted yttrium iron garnet (Bi:YIG) magneto-optical indicator film: applied voltage generates mechanical stress in the piezoelectric, which via magnetoelastic (strain-mediated magnetoelectric) coupling alters the film's out-of-plane magnetization, read out through magneto-optical Faraday rotation. A bias field is used to place the domain structure in a critical state so that voltage-induced domain nucleation produces a detectable optical signal. This strain-mediated magnetoelectric + magneto-optical readout approach is distinct from conventional electro-optic or direct piezoelectric-strain optical sensors, offering a new galvanically-isolated sensing architecture that could be replicated with other piezoelectric/magnetic-film pairings for high-voltage or harsh-EM-environment monitoring.

arXiv · cond-mat.mtrl-sciConceptual

Optically Tunable Threshold Switching and Thermally Activated Transport in Planar Ag/MAPbI$_3$ Thin Single-Crystal Devices

A perovskite crystal switches its conductivity when hit with light — a step toward light-controlled memory chips.

Halide perovskites are the crystals that revolutionized solar cells, but researchers are now discovering they can also act like tunable switches for memory and brain-inspired computing chips. In this study, the team grew ultra-thin, single-crystal flakes of a common perovskite (MAPbI3) — avoiding the messy grain boundaries found in typical thin films — and sandwiched them between silver electrodes to make simple two-terminal devices. These devices barely leak any current when idle and can be switched between resistance states, and shining light on them changes how easily they switch. The appeal is that single crystals let scientists see the material's true, intrinsic switching behavior without interference from manufacturing defects, which is a needed step before such 'light-tunable memory' devices could be engineered reliably.

Technical view

The authors fabricated planar Ag/MAPbI3/Ag two-terminal devices using thin single-crystal MAPbI3 grown by a space-confined method, eliminating grain-boundary artifacts that complicate polycrystalline-film studies. At room temperature the devices show ultra-low dark currents (10^-13 to 10^-12 A) and minimal I-V hysteresis, and they exhibit threshold switching whose characteristics can be optically modulated, alongside thermally activated transport suggesting an ionic-electronic conduction mechanism. This single-crystal platform isolates intrinsic mixed ionic-electronic transport and interfacial switching physics, giving device engineers a cleaner baseline for designing light-gated memristive or neuromorphic perovskite devices.

arXiv · cond-mat.mes-hallConceptual

Spin lifetime anisotropy in graphene induced by the SiO2 interface

The glass under a graphene chip secretly twists how electron 'spin' survives inside it.

Graphene, a one-atom-thick sheet of carbon, is promising for future computing that uses electron 'spin' (a tiny magnetic property) instead of just charge to store information, but it's usually placed on glassy silicon dioxide substrates, and that substrate quietly messes with how long spins last. Using detailed computer simulations of atoms and electrons, the researchers show the glass substrate creates a specific twisting effect (called a Rashba spin texture) that makes spins survive twice as long in one direction as another, and that the material's random atomic structure further scrambles things unevenly. Understanding exactly how this happens lets engineers design better substrates or coatings so spin-based memory and logic devices actually work as intended.

Technical view

Combining first-principles density matrix dynamics with tight-binding transport simulations, the authors quantify how electron-phonon scattering, impurity scattering, and electrostatic disorder from a SiO2 substrate govern spin relaxation in graphene, finding a predominantly Rashba-type helical spin texture yielding a spin lifetime anisotropy of 1/2 from the 2D interface, plus additional anisotropic components from bulk SiO2 symmetry breaking, captured via a newly developed model. This gives spintronics device designers a quantitative, mechanism-resolved picture of substrate-induced spin relaxation to guide substrate/encapsulation choices for graphene spin-transport devices.

arXiv · physics.chem-phRunnable

Simulating Ionic Liquid Fragmentation in Electrospray Thrusters with Foundation Models

AI models trained on chemistry try to predict how ionic-liquid rocket fuel shatters on impact.

Tiny satellite thrusters called electrospray thrusters spray charged liquid droplets, and over time these liquids splatter onto surfaces and break apart in ways that wear the thruster out — predicting exactly how they fragment matters for knowing how long a thruster will last. Simulating this precisely with full quantum chemistry is accurate but painfully slow, while faster approximate methods can miss real chemical reactions. This paper tests whether newer 'foundation model' AI systems, pretrained on huge amounts of atomic simulation data, can hit that quantum-level accuracy at a fraction of the cost when predicting how these liquid molecules break apart on impact. It's essentially a benchmark to see if AI can replace slow physics simulations for spacecraft engineering.

Technical view

The authors benchmark two pretrained machine-learning interatomic potentials, MACE-MP-0 (medium) and MACE-POLAR-1, against DFT/MD and ReaxFF for modeling ionic-liquid fragmentation on extractor surfaces relevant to electrospray-thruster lifetime, evaluating geometry optimization and presumably reaction/fragmentation pathway fidelity. The goal is determining whether foundation-model interatomic potentials can approach DFT-level chemical fidelity (capturing charge redistribution and neutral-product formation) at much lower computational cost than mixed quantum-classical MD. Aerospace propulsion researchers could use validated foundation models like these to run higher-throughput impact/degradation simulations for thruster lifetime prediction without full DFT/MD cost.

arXiv · cond-mat.softBuildable

Revisiting Safe Temperature for Environmental Accelerated Aging of Additively Manufactured Polymers

Baking 3D-printed plastic parts to fake years of aging can accidentally break them the wrong way.

Engineers often speed up aging tests by heating materials, so they can see in weeks what would normally take years of real-world wear, which matters a lot for 3D-printed plastic parts used underwater in ships and submarines. The common trick is to raise the temperature but stay below the point where the plastic would melt or soften, assuming that's automatically safe. This study looks specifically at 3D-printed ABS plastic (a common printer material) and shows that even 'safe-seeming' temperatures can trigger damage mechanisms that would never actually happen at normal operating temperatures, making the accelerated test misleading. Figuring out the real safe temperature window matters because it determines whether lab aging tests actually predict how these parts will hold up in the field.

Technical view

The study investigates fused deposition modeling (FDM)-printed Acrylonitrile Butadiene Styrene (ABS) specimens under environmental accelerated aging, examining whether temperatures held below the glass transition or melting point are genuinely representative of service conditions. It identifies that certain elevated-but-subthreshold temperatures can activate deformation and degradation mechanisms absent in real in-service use, meaning standard accelerated-aging protocols may overstate or mischaracterize failure modes for AM polymers in solvent/undersea environments. The findings inform revised temperature limits for accelerated aging protocols, directly relevant to qualification testing of additively manufactured parts for naval and marine applications.

arXiv · cond-mat.mtrl-sciBuildable

PACE-SIMS: Checkpoint-Gated Autonomous SIMS Characterization with AI-Agent Quality Control

An AI lab assistant runs multi-day chemistry scans almost solo, checking its own work along the way.

ToF-SIMS is a technique that probes the chemical makeup of a material's surface, but running it well normally requires an expert babysitting the instrument for days, constantly tweaking settings. This paper builds an AI-agent system where a human researcher just states the scientific question and quality bar, then the AI drafts a measurement plan, gets it approved, and runs the experiment on its own — pausing at key checkpoints to judge whether each measurement looks good, and deciding whether to fix, retry, or ask a human for help. They tested it on real samples (oxygen-enriched tungsten oxide films) over an 8-hour, 35-measurement blind study, showing the AI can handle a real multi-day analytical campaign with much less expert hand-holding.

Technical view

PACE-SIMS is an agentic workflow layered on ToF-SIMS acquisition that separates roles: a human specifies scientific goals and quality thresholds, an LLM-based agent proposes an experimental plan, and after human approval executes it autonomously with checkpoint gating — pausing to evaluate each measurement's quality against criteria and choosing to correct parameters, retry, or escalate to the human. Validation was a blind, randomized two-polarity study on 18O-enriched WOx films spanning 8.1 hours and 35 measurements, demonstrating closed-loop autonomous operation of a traditionally expert-intensive characterization technique. This is a template for agent-supervised instrument control extensible to other multi-parameter analytical techniques requiring in-the-loop quality judgment.

arXiv · cond-mat.softRunnable

Random close packing at extreme size ratios with an Adam-based inflation protocol

A smarter algorithm packs millions of wildly different-sized spheres tighter without getting stuck.

Imagine trying to pour a jar full of balls ranging from beach-ball-sized down to grain-of-sand-sized, all packed as tightly as possible without overlapping — that's the 'random close packing' problem, useful for modeling everything from granular materials to glasses. A classic method (Clarke-Wiley) grows the particles from tiny points, but when the size range is extreme, the growth process tends to stall because it uses one shared step size for every particle. This paper swaps in the Adam optimizer, a technique borrowed from machine learning that lets each particle adjust its own step size individually, which keeps the packing process moving smoothly even at extreme size disparities. They released free code and used it to pack millions of particles with size ratios up to 500,000-to-1, far beyond what was previously practical.

Technical view

The authors present rcpgenerator, open-source code generalizing the Clarke-Wiley inflation protocol for random close packing by replacing uniform-step relaxation with the Adam optimizer, giving each particle coordinate an adaptive step size and avoiding the stalling that occurs at large size ratios S=Dmax/Dmin. In 3D periodic tests they reach S~5×10^5 for continuous lognormal distributions (N~10^6 diameters) and pack up to N≈5.6×10^6 particles for power-law size distributions, achieving some of the densest reported packings at these extreme size ratios. This is directly usable by researchers needing dense polydisperse packings (e.g., for granular media, concrete, or amorphous solid simulations) via the released code.

arXiv · math.DSConceptual

Effective Dynamics of Disclination Pairs

Paired defects in a material either fly apart or snuff each other out, following surprisingly simple rules.

Materials like crystals or liquid crystals can contain tiny 'defects' called disclinations, points where the material's structure is twisted or wedged in a way that doesn't quite fit together smoothly. This paper studies a pair of such defects with opposite twist, confined inside a circular region, and asks how they move over time as the material relaxes. It finds two possible behaviors: the pair can either drift apart forever, or they can rush together and cancel each other out (annihilate), and it works out exactly which starting conditions lead to which outcome and how fast each process unfolds. Interestingly, when the pair is annihilating, their motion — after adjusting the timescale — turns out to follow the exact same mathematical law as a completely different kind of defect (an edge dislocation), hinting at a deep shared structure between different types of material defects.

Technical view

The paper analyzes the dissipative, radially symmetric dynamics of a wedge-disclination pair with opposite Frank angles confined to a circular domain, identifying two dynamical regimes — divergence and annihilation — along with their stationary points, stability classification, and characteristic relaxation timescales near those points. In the annihilating-dipole regime, after an appropriate time rescaling, the derived equation of motion is shown to coincide exactly with the known law of motion for an edge dislocation, establishing a mathematical correspondence between disclination-pair and dislocation dynamics. This gives a tractable analytic model useful for benchmarking numerical defect-dynamics simulations or extending gradient-flow theories of topological defects in ordered media.

arXiv · cond-mat.mtrl-sciRunnable

Energy-Dependent Dechanneling in Cu: Insights from Monte Carlo Channeling Simulations

A computer model reads ion 'echoes' bouncing off metal crystals to map invisible hidden defects.

When ions are fired into a crystal, they can travel down open channels between rows of atoms — like water flowing along a straight ditch — until they hit a defect and scatter off course. This 'channeling' effect lets scientists detect microscopic damage inside metals and semiconductors, such as the disruption caused when ions are implanted to make computer chips. The catch is that different defects — a single misplaced atom, a tangled dislocation, or a cluster of damage — leave subtly different fingerprints that also change with the ion beam's energy. The researchers built a Monte Carlo simulation (a method that plays out many random particle paths to mimic reality) that matches real measured spectra across a wide range of energies, letting them tell defect types apart and count how many there are.

Technical view

The paper presents McChasy, a Monte Carlo ion channeling/backscattering simulation code modeling dechanneling from point defects, dislocations, and extended defect clusters in Cu across a range of analyzing beam energies. By fitting simulated angular/energy backscattering spectra to experiment, the method extracts energy-dependent dechanneling rates that differentiate defect types via their distinct functional dependence on beam energy. This enables quantitative, depth-resolved identification of defect type and density from RBS/channeling data, relevant to characterizing ion-implantation damage in metals and semiconductors. Practitioners can use McChasy directly on their own channeling data or extend its defect-interaction models to other crystal systems.

arXiv · cond-mat.softBuildable

A Multi-scale Investigation of Aqueous Foams Stabilised by PNIPAM Microgels

Squishy temperature-tunable polymer beads make soap-free bubbles that last longer and pack tighter.

Foams — like bubble bath — need something clinging to each bubble's surface to keep it from popping. Here, researchers use tiny soft polymer beads called PNIPAM microgels as that stabilizer, tuning their squishiness by how tightly they're chemically stitched together (cross-linked). They bubbled gas through water containing these microgels and measured how easily foam formed and how long it survived, while separately studying how single microgels behave at a plain water-air surface. Softer, more numerous microgels made foam form more easily, produced smaller bubbles that held more liquid, and lasted longer before collapsing. This matters because foams appear everywhere from food to cosmetics to firefighting, and tunable, responsive stabilizers could let engineers dial in foam behavior on demand.

Technical view

The study links microgel cross-linker density (a proxy for particle softness/interfacial activity) and bulk concentration to macroscopic foam properties (foamability, bubble size, liquid fraction, stability) generated by gas sparging through PNIPAM microgel dispersions, correlating these with single air/water interface measurements. Lower cross-linking and higher concentration increase interfacial activity, yielding smaller bubbles, higher liquid fraction, and greater stability — consistent with softer, more deformable microgels packing and jamming more effectively at interfaces. This multi-scale approach (interface → film → bubble → bulk foam) gives a structure-property framework for engineering stimuli-responsive foam stabilizers, since PNIPAM is thermoresponsive. Replication would involve synthesizing PNIPAM microgels of varying cross-linker density and running parallel sparging/foam-stability and pendant-drop interfacial experiments.

arXiv · cond-mat.softBuildable

Universality in the deswelling of tangentially active polymer chains in dilute solutions

Self-propelled polymer chains shrink to the exact same universal shape no matter the solvent.

Picture a floppy chain of beads in water, where each bead pushes itself forward with its own tiny engine rather than being jostled by outside forces. Depending on how much the surrounding liquid likes or dislikes the polymer, a normal passive chain would be more bloated or more scrunched up. This study uses computer simulations to show that as you crank up the self-propulsion, active chains shrink regardless of solvent quality, and at one specific activity strength they all collapse to the same simple statistical shape — the one a purely random, non-interacting chain would have. This 'universal' behavior means one simple rule predicts very different starting conditions, useful for modeling active biological filaments or engineered self-propelled polymers without redoing the calculation every time.

Technical view

Using Brownian dynamics simulations of tangentially active polymer chains across the θ-to-athermal solvent crossover regime, the authors show that increasing Péclet number (activity-to-diffusion ratio) drives deswelling of the radius of gyration to ideal random-walk statistics at a Pe value independent of solvent quality — mirroring the universal scaling known for passive chains near the θ point. They further derive a novel scaling relation for the thermal blob size as a function of tangential activity, extending polymer blob theory to active systems. This gives a quantitative, solvent-quality-independent framework for predicting active polymer conformations, applicable to modeling active biopolymers or designing synthetic self-propelled polymer systems.

arXiv · cond-mat.mtrl-sciConceptual

Resonant Raman signatures of bright and momentum-dark exciton coupled by intervalley phonon scattering in monolayer WSe2

Tuned laser light reveals how a wonder-material's invisible 'dark' electron pairs talk to vibrating atoms.

In ultra-thin semiconductor sheets like tungsten diselenide, electrons and the holes they leave behind can pair up into particles called excitons — some 'bright' (they glow when light hits them) and others 'dark' (nearly invisible, hiding in a different momentum state). How these particles trade energy with the crystal's vibrations (phonons) matters for future opto-electronic devices, but dark excitons are hard to see directly. The researchers cooled an ultra-clean sample and shined a laser precisely tuned near the bright exciton's energy, watching how strongly the crystal vibrates back as they nudged the laser color. They found a telltale double-peaked pattern that a simple one-step explanation can't account for, showing instead that a phonon shuttles energy between the bright and a hidden dark exciton — giving an indirect window into otherwise-invisible states.

Technical view

Using cryogenic resonance Raman spectroscopy on hBN-encapsulated WSe2 monolayers, the authors map the resonance profile of the degenerate A1'/E' phonon mode while tuning excitation energy across the bright K-valley exciton (X_KK). They observe two asymmetric resonance peaks split by more than one phonon energy, inconsistent with first-order (single-phonon) Raman theory, and show the profile is reproduced by third-order Raman scattering involving a finite-momentum intervalley phonon coupling the bright X_KK exciton to a momentum-dark exciton state. This provides a spectroscopic handle on dark exciton energetics and intervalley exciton-phonon coupling without relying on photoluminescence, which dark states barely produce. Researchers studying TMD exciton dynamics could apply this resonant/third-order Raman framework to extract dark-state energies in other monolayer or heterostructure systems.

arXiv · cond-mat.mtrl-sciConceptual

Strain-controlled sign reversal of the anomalous Hall effect in Ru/[Co/Ni]$_N$ multilayers

Just flipping which side a thin metal layer sits on reverses a magnet's sideways electrical signal.

In magnetic metals, current flowing through can produce a small sideways voltage even without an external magnetic field — the anomalous Hall effect, rooted in quantum spin-orbit physics. Here, researchers stacked ultrathin cobalt/nickel layers with a ruthenium layer either underneath or on top, and found that simply swapping that stacking order — same materials, same thicknesses — flips the sign of this Hall signal from positive to negative. Combining electrical measurements with quantum calculations, they traced this to the fact that ruthenium underneath stretches the layers above it, subtly reshaping the electrons' behavior and how a quantum property called Berry curvature (a built-in 'twist' in electron momentum states) is distributed. This shows mechanical strain from a neighboring layer is a tunable knob for controlling these exotic magnetic effects, useful for future spintronic memory or logic devices.

Technical view

In Ru/[Co/Ni]_N multilayers, the authors observe a sign reversal of the anomalous Hall effect solely from reordering the Ru layer's stacking position (beneath vs. atop the Co/Ni stack), holding chemistry and nominal thickness fixed. Combining transport measurements across varying repeat number N with first-principles (DFT) calculations, they attribute the reversal to in-plane tensile strain induced by the Ru underlayer, which shifts the band structure near the Fermi level and redistributes Berry-curvature contributions to the intrinsic AHE. This identifies interfacial/stacking-induced strain as an independent control parameter for Berry-curvature-driven transport, decoupled from composition or field-based tuning. Spintronics practitioners could exploit stacking-order-induced strain as a design lever for tunable AHE-based sensors or topological transport devices.

arXiv · cond-mat.softBuildable

Density-Selected Topological Pathways in the Melting of Single-Particle-Thick Stripes

Melting a one-atom-thick striped pattern splits it into broken chunks or one giant web, depending on density.

Some 2D materials arrange into thin parallel stripes, like a zebra pattern one particle thick, when cold. As you heat the system, this striped order melts, but the usual ways of measuring 'how melted' something is don't fully capture what happens to the stripes' connectivity — whether they stay linked or break apart. Using simulations of particles with competing attractive and repulsive forces, the researchers heated the system and tracked graph-based measures (treating the stripe network like a map of connected roads) alongside standard ones. They found that the overall particle density determines whether heating breaks the stripes into small, finite, polymer-like clumps or keeps them joined into one sprawling, fluid, system-wide network — a distinction invisible to ordinary temperature or structure measurements alone.

Technical view

The authors run molecular dynamics simulations of a 2D system with competing (short-range attractive, long-range repulsive) interactions whose ground state is single-particle-thick stripes, heating along seven isochores and analyzing thermodynamic, orientational, dynamical, and graph-theoretic (connectivity) observables. They find a multistage melting process where stripe alignment loss and filament reconnection occur at distinct temperatures, and crucially that particle density determines whether the disordered filament network fragments into finite polymer-like clusters or persists as a single percolating network — a bifurcation standard order parameters fail to resolve but graph-based connectivity metrics do. This highlights topological analysis as a necessary complement to conventional order parameters for characterizing melting transitions in pattern-forming soft matter, and the same percolation/cluster-size toolkit could be applied to other 2D self-assembling systems.

arXiv · cond-mat.softConceptual

Magnetic active matter across scales

A tour of self-driving magnetic particles — from swimming bacteria to robot swarms — that organize via magnetism.

'Active matter' means things that move under their own power by burning energy, rather than being pushed — think swimming bacteria, self-propelling particles, or robots. This review focuses on active particles that also carry a built-in tiny magnet, where that magnetism isn't what drives their motion but instead controls how they attract, repel, or align with each other, much like bar magnets snapping together in certain arrangements. Examples range from real bacteria that navigate using Earth's magnetic field to engineered magnetic microswimmers, nanoparticles, and room-sized magnetic robots. The review surveys experiments and theory across all these size scales to explain how these magnetic 'handshakes' between self-moving units shape both individual paths and collective swarming behavior — a promising route toward smart materials or robot swarms that self-organize without central control.

Technical view

This review surveys self-propelled active matter systems in which individual units possess an intrinsic magnetic dipole moment mediating inter-particle interactions and self-organization, distinct from systems where an external field drives propulsion. It spans biological examples (magnetotactic bacteria) and synthetic platforms (colloidal microswimmers, magnetic nanoparticles, macroscopic granular robots), covering experiments and theoretical/simulation models incorporating pairwise dipolar interactions alongside self-propulsion. The review synthesizes how dipolar coupling shapes single-particle trajectories and collective phenomena (clustering, chain formation, collective motion) across length scales from nanometers to centimeters. It serves as a map of existing modeling frameworks and open questions for researchers designing new magnetically self-organizing active systems.

arXiv · cond-mat.softBuildable

Effect of Weak Non-Conservative Dynamics on Pattern Formation in Scalar Active Matter

Adding a little 'birth and death' to phase-separating active particles freezes their blobs at a fixed size forever.

When certain active materials, like clusters of bacteria or cells, separate into dense and dilute regions — similar to oil separating from water — that separation usually keeps growing into ever-bigger blobs over time. But real biological systems also grow or die, meaning mass isn't perfectly conserved, a 'weak non-conservative' effect. Using a mathematical model and simulations, the researchers added a small birth/death-like term and found that even a tiny amount of this halts the usual runaway growth, freezing the pattern at a specific, steady size instead. As they cranked up how energetic the particles were, the frozen patterns morphed from maze-like interconnected channels, to worm-like strands, to isolated round droplets — helping explain why living systems might naturally settle into stable patterns instead of merging into one blob or spreading out fully.

Technical view

The authors extend a minimal continuum (Cahn-Hilliard-like) model of scalar active matter phase separation by adding a reaction term representing weak mass non-conservation (growth/degradation), then use linear stability analysis and numerical simulation to study its effect. They find that even weak non-conservative terms arrest the usual unbounded coarsening of active phase separation, stabilizing microphase-separated steady states with a well-defined characteristic length set by the correlation function and static structure factor. Increasing activity drives a morphological sequence from labyrinthine/interconnected patterns to worm-like structures to isolated droplets, indicating the reaction term interacts with activity-driven dynamics to select pattern morphology and scale. This provides a minimal-model mechanism, replicable via standard Cahn-Hilliard-plus-reaction numerical schemes, for stable microphase patterns in growing/dying active systems like bacterial colonies or tissues.

arXiv · cond-mat.softConceptual

Lipid Controlled Non-Monotonic Assembly and Rheology of an Egg Yolk Protein at Water-Soybean Oil Interface

Egg yolk protein flips its behavior at oil-water interfaces depending on hidden lipids.

Mayonnaise and salad dressing stay creamy and don't separate because a protein from egg yolk called phosvitin coats the boundary between water and oil, acting like a molecular glue. Researchers wanted to know exactly how this protein behaves when it's mixed with the fatty lipids that naturally travel with it in egg yolk versus when it's alone. They tracked this by measuring 'interfacial tension' — basically how strongly the water and oil surface resists mixing — over time as the protein settled in, and also measured how stretchy and rigid the resulting film becomes. They found the protein's film-forming ability doesn't just steadily improve with more protein; it rises, then gets blocked at high concentrations, and lipids change this pattern in a 'non-monotonic' (up-and-down) way. Understanding this helps food scientists engineer better texture and shelf-stability in emulsified foods.

Technical view

The study characterizes dynamic interfacial tension and dilational rheology of phosvitin (PVT) adsorbing at a water/soybean oil interface, with and without co-existing lipids, to model food-emulsion stabilization mechanisms. Tension decay kinetics show enhanced adsorption with increasing bulk protein concentration up to a point, after which a positive activation energy barrier saturates the interfacial tension — indicating a kinetic bottleneck rather than simple diffusion-limited adsorption. Lipid presence modulates this concentration-dependent trend non-monotonically, suggesting lipid-protein competition or co-adsorption effects at the interface. Dilational rheology data on the resulting macromolecular film likely quantify viscoelastic moduli that practitioners could use to predict emulsion stability and optimize formulation ratios in food processing.

arXiv · cond-mat.mtrl-sciBuildable

Data-Efficient Adaptation of DPA-4 Force Fields to DFT+U Energetics: A Case Study in NiO

Scientists retaught an AI model correlated-electron physics in NiO using just 170 examples.

Machine-learning models that predict how atoms in materials push and pull on each other (force fields) are usually trained on huge, generic datasets, but that training can bake in the wrong physics for tricky materials like nickel oxide, where electrons strongly interact with each other. The researchers tested whether they could fix this by giving the AI a small, targeted set of correct, high-accuracy reference calculations instead of retraining from scratch. Using nickel oxide as a test case, they showed the pretrained model could adapt to the correct electronic behavior — even flipping which of two crystal shapes is more stable — using only about 170 extra examples. This matters because it means expensive, specialized simulations of tricky materials might be made cheap and fast without needing to build a whole new AI model from the ground up.

Technical view

The authors fine-tune the pretrained DPA-4 foundation MLFF on NiO using DFT+U (Hubbard-corrected) reference energetics, contrasting it against non-spin-polarized PBE and ferromagnetic PBE+U calculations that predict opposite relative stability of octahedral versus square-planar phases along a structural interpolation. With roughly 170 PBE+U labels, fine-tuned models reach ~0.5 meV/atom energy RMSE and ~30 meV/Å force RMSE, and critically, models previously fine-tuned to the opposite (no-U) surface still recover correct PBE+U phase ordering with comparable data efficiency. This demonstrates that source-level electronic-structure conventions embedded in foundation MLFFs can be efficiently corrected at the target level rather than requiring full retraining, a practical recipe for adapting foundation force fields to correlated materials.

arXiv · cond-mat.mtrl-sciBuildable

Lithography-free patterning of SrTiO$_3$-based two-dimensional electron gases using direct atomic layer processing

Etching-free trick draws electron 'wires' onto an oxide crystal using only chemistry, no lithography.

Certain oxide materials can host a razor-thin sheet of highly mobile electrons at their surface, called a two-dimensional electron gas, which is useful for advanced electronics. Normally, making patterned versions of this requires expensive lithography — essentially stenciling and etching, like in computer chip factories. Here, researchers instead deposited a thin patterned layer of titanium dioxide onto the crystal, then coated everything with aluminum; the aluminum reacts differently depending on whether that titanium dioxide layer is present, pulling oxygen out of the crystal only in the uncovered spots. That oxygen removal creates the conductive electron sheet exactly where wanted, with no post-processing cutting or etching needed. This offers a cheaper, more scalable way to make functional oxide-electronic circuits.

Technical view

The authors demonstrate lithography-free spatial patterning of a 2DEG at the SrTiO3(100) surface by pre-depositing a 15 nm TiO2 mask (via atomic layer processing) before blanket magnetron-sputtered Al deposition. In regions without the TiO2 mask, Al deposition drives oxygen-vacancy formation in SrTiO3, populating Ti 3d conduction bands and forming a confined 2DEG, while masked regions form an insulating AlOx overlayer without vacancy generation. Magneto-transport measurements report sheet carrier densities of ~5-7×10^13 cm^-2, comparable to conventional pulsed-laser-deposition-grown SrTiO3-based 2DEGs (e.g., LaAlO3/SrTiO3). This offers a scalable, mask-based alternative to conventional microfabrication for defining functional oxide-electronic device geometries directly during growth.

arXiv · physics.opticsBuildable

Aggregation-engineered loss-tolerant strong coupling in metallic microcavities

Messy, cheap dye films can still trap light and matter together as well as pristine ones.

When light and light-absorbing molecules (like dyes) interact strongly enough inside a mirrored cavity, they form a new hybrid state — like light and matter merging — which is a promising basis for future optical and even computing technologies. Normally this needs very high-quality, precisely ordered materials and mirrors, which is hard and expensive to scale up. This team instead used a cheap, simply spin-coated dye film (Rhodamine 6G mixed into a plastic-like polymer) inside low-quality silver mirrors, and deliberately embraced the fact that the dye molecules clump together ('aggregate') rather than treating that as a flaw. They found that by tuning how much dye they load and how they coat it, they can control this clumping to still get strong, robust light-matter coupling despite all the imperfections. This suggests cheaper, more flexible manufacturing routes for devices that exploit this quantum optical effect.

Technical view

The authors fabricate solution-processed Rhodamine 6G-PVA films in low-Q silver Fabry-Perot microcavities and observe angle-resolved anticrossing (Rabi splittings up to 324 meV) despite substantial metallic-mirror losses, contrary to the usual assumption that strong coupling requires high-finesse cavities and ordered excitonic media. A two-exciton coupled-oscillator model attributes the coupling strength to the relative population of monomeric versus aggregate dye species, which is tunable via dye loading concentration and spin-coating parameters — establishing aggregation as a controllable design lever rather than a defect. Angle-resolved photoluminescence measurements further probe the polariton branches' emission behavior. This provides a route to loss-tolerant, low-cost, solution-processable strong-coupling platforms for polaritonic devices without requiring high-Q optics or highly ordered films.

arXiv · cond-mat.mtrl-sciRunnable

Advancing in situ hydrogen embrittlement studies through an integrated charging cell for SEM micromechanical testing

New microscope-mounted rig lets scientists watch hydrogen make metal crystals brittle in real time.

Hydrogen can sneak into metals and make them crack far more easily — a problem called hydrogen embrittlement that plagues pipelines, storage tanks, and hydrogen-fuel infrastructure. To understand exactly how this happens at the tiniest scales, researchers need to squish microscopic metal pillars while simultaneously pumping hydrogen into the material and watching under an electron microscope, but existing setups for doing this are clunky and unreliable. This team built a more robust hydrogen-delivery system (using three electrodes to control the charging chemistry from the back side of the sample) that works cleanly inside a scanning electron microscope during mechanical tests. Testing it on a chromium-iron alloy, they showed hydrogen makes the metal both stronger to start bending and yet harder-working internally, activating more slip pathways and tangling up more defects (dislocations) — a sign of embrittlement. This tool should let researchers study hydrogen damage far more precisely, aiding safer materials for the hydrogen economy.

Technical view

The paper introduces a 3-electrode back-side electrochemical hydrogen-charging cell integrated into an SEM for in situ micromechanical testing, addressing reliability limitations of existing in situ H-charging setups. It is validated via micropillar compression of Fe-25Cr single crystals oriented along [110] during simultaneous H-charging, revealing increased yield strength and apparent strain-hardening rate under hydrogen exposure. Post-test electron microscopy shows hydrogen activates multiple slip systems and increases dislocation density and entanglement, consistent with hydrogen-enhanced forest hardening as a deformation mechanism. The setup provides a reusable experimental platform for quantitatively linking hydrogen concentration to microscale mechanical response and dislocation substructure evolution in metals.

arXiv · cond-mat.mtrl-sciBuildable

Deep-Learning-Accelerated Dopant Selection for High-k HfO2 Dielectrics: A Disorder-Resolved Study of Y, Si and Al

AI screens hundreds of dopant recipes to find the best chip insulator upgrade for HfO2.

Hafnium oxide is the key insulating material inside modern computer chip transistors, and tweaking its properties by adding small amounts of other elements ('doping') is one of the few ways engineers can still improve it without switching materials entirely. But picking the right dopant and amount has mostly been trial-and-error because three properties — stability, electrical insulation, and how well it stores charge — all depend on each other in complicated ways. This team built a computational pipeline combining fast machine-learning simulations and graph-based neural networks to rapidly screen combinations of three candidate dopants (aluminum, silicon, yttrium) across two crystal structures of hafnium oxide, capturing the randomness of real atomic arrangements. The tool let them systematically map out how formation energy, band gap, and dielectric behavior trade off against each other and uncover a general design rule connecting them. This kind of computational shortcut could speed up the search for better chip materials without costly trial-and-error lab experiments.

Technical view

The authors build a high-throughput screening pipeline for doped-HfO2 (Al, Si, Y dopants; monoclinic and orthorhombic polymorphs) combining special quasi-random structures (SQS) to capture configurational disorder, the SevenNet machine-learning interatomic potential for structural relaxation/energetics, and the ALIGNN graph neural network for property prediction (likely band gap and dielectric response). Across the dopant/polymorph/disorder space they identify a systematic relationship linking formation energy, band gap, and dielectric constant that constrains achievable property combinations. This establishes a data-driven, physics-grounded design principle for dopant selection that could replace empirical trial-and-error in high-k gate dielectric engineering, and the pipeline itself is reusable for screening other dopants or host oxides.

arXiv · cond-mat.mtrl-sciConceptual

First-principles cumulant approach to the vibronic structure of spin defects

New quantum theory finally explains the messy vibration 'sidebands' around diamond's famous defect qubit.

Tiny defects in diamond and similar materials — like the nitrogen-vacancy (NV) center — can act as single-photon light sources and quantum sensors, but predicting exactly what wavelengths of light they emit has been hard because the defect's vibrations (phonons) tangle with its electrons in complicated ways. Previous theories used shortcuts that don't fully capture this tangling. Here, researchers built a more rigorous mathematical framework (based on something called a 'cumulant' approach) that tracks electron-vibration interactions more completely from first principles, without relying on those older approximations. Applying it to the NV center in diamond, they found extra light-emission features spread across a surprisingly wide energy range persist even at absolute zero temperature, driven by unavoidable quantum jittering of atoms. This gives quantum-technology researchers a much more accurate predictive tool for designing and interpreting defect-based quantum devices.

Technical view

The authors develop a first-principles Green's function method using the retarded cumulant ansatz (RCA) to compute vibronic (electron-phonon coupled) spectral functions of spin defects, going beyond the adiabatic approximation and lowest-order perturbative treatments used in standard approaches. Applied to the NV- center in diamond, the method predicts multi-phonon sideband structure persisting over a 400 meV window even at zero temperature, attributed to zero-point quantum fluctuations rather than thermal effects. The results indicate that mode-, momentum-, spin-, and orbital-resolved electron-phonon coupling is necessary for quantitative spectral predictions, in contrast to simplified single-mode or configuration-coordinate models. This RCA framework offers a more accurate and general first-principles tool for predicting photoluminescence lineshapes of defect qubits, useful for designing and interpreting optically addressable spin defects in quantum sensing and communication applications.

arXiv · stat.APBuildable

Process-fracture mapping of a DLP-printed photopolymer using Bayesian active learning and surrogate-based sensitivity analysis

Smart algorithm picks the fewest 3D-print tests needed to map out when parts crack.

3D printing plastic parts with light (a method called DLP) involves several settings — like layer angle, UV exposure time, and print temperature — that all affect how easily the finished part cracks, but testing every possible combination in the lab would take forever. This research uses a smart statistical method (Bayesian active learning) that starts with just a couple of random test prints, builds a rough model of how fracture resistance depends on the settings, and then intelligently picks the next most-informative combination to test rather than guessing randomly. They measured how much force it takes to crack each printed sample using a precise camera-based technique (digital image correlation) that tracks how the material deforms right at the crack tip. This lets manufacturers efficiently discover which print settings make stronger, more crack-resistant parts using far fewer physical experiments than brute-force testing.

Technical view

The study applies Bayesian active learning with Gaussian process regression (GPR) and a modified upper-confidence-bound (UCB) acquisition function to efficiently map fracture resistance (critical J-integral, Jc) of DLP-printed photopolymers across four process parameters (layer angle, UV exposure time, layer height, print temperature). Jc is extracted from three-point-bend Mode I fracture tests combined with digital image correlation (DIC) to quantify crack-mouth opening displacement and hinge-point kinematics. Starting from just two randomly sampled conditions, the acquisition function sequentially selects the most informative next experiment, building a surrogate process-fracture map with far fewer physical tests than a full factorial design would require. The framework, paired with sensitivity analysis on the surrogate, gives practitioners a template for efficiently optimizing multi-parameter additive manufacturing processes against fracture performance rather than relying on exhaustive DOE testing.

arXiv · cond-mat.mtrl-sciBuildable

Magnetoelastic coupling descriptor for high-throughput ab initio search of magnetocaloric materials

A math trick spots materials that heat up or cool down sharply when magnetized.

Some magnetic materials warm up or cool down when a magnetic field is switched on or off — the magnetocaloric effect — which could one day power fridges without harmful gases. Finding the best materials for this is hard because it depends on a subtle coupling between magnetism and the shape of the crystal lattice. The researchers built a computational 'descriptor,' a number calculated from quantum physics simulations, that flags materials sitting right on the edge of an abrupt magnetic switch, where this effect is strongest. Scanning thousands of virtual compounds with it, they found two overlooked candidates, forms of Mn3Ge and Mn3Sb, worth testing in the lab.

Technical view

The authors derive a magnetoelastic coupling descriptor from Landau theory that predicts proximity to a first-order magnetostructural transition, computed via DFT structural optimization in the paramagnetic state modeled with special quasi-random collinear spin configurations. Validated against known magnetocalorics, it correctly flags compounds whose MCE originates in magnetoelastic rather than purely magnetic coupling. High-throughput application to L1_2 intermetallics identifies cubic Mn3Ge and Mn3Sb as new candidates with strong magnetoelastic coupling. The method offers a computationally tractable pre-screen usable ahead of full magnetostructural DFT+phonon calculations or experimental synthesis.

arXiv · quant-phConceptual

Improved quantum sampling methods for molecular simulations

Some 'quantum advantage' chemistry results might just be classical randomness in disguise.

A hot new approach called sample-based quantum diagonalization (SQD) uses a quantum computer to guess which electron arrangements matter most in a molecule, then lets a normal computer do the heavy math on just those. The idea is that the quantum computer's picks are smarter than random guessing, saving classical effort. This paper shows that if you don't carefully cap how much classical computing the algorithm is allowed to use, plain random guessing can match SQD's reported performance, because noise in the quantum device just adds variety rather than real quantum insight. That means some published claims of quantum benefit may not hold up under scrutiny. It's a call for stricter, fairer ground rules when comparing quantum and classical methods.

Technical view

SQD, a leading quantum-selected configuration interaction (QSCI) variant, samples electron configurations from noisy quantum hardware and iteratively refines a classical diagonalization subspace. The authors show that without an explicit cap on subspace size, uncontrolled growth lets classical uniform random sampling reproduce reported SQD benchmark accuracy, since measurement noise merely broadens configuration diversity rather than contributing genuine quantum structure. This implies many published SQD 'quantum advantage' comparisons are confounded by subspace size rather than sampling quality. The paper argues benchmarking protocols must fix and report diagonalization subspace dimension for fair quantum-vs-classical comparisons going forward.

arXiv · physics.chem-phBuildable

Relativistic Dirac-Coulomb-Breit Four-Component Multireference Perturbation Theory within the Small Tensor Product Distributed Active Space Framework

A new relativistic chemistry method reveals how much Einstein-style effects tweak heavy atoms' electrons.

Heavy atoms' electrons move fast enough that Einstein's relativity noticeably affects their behavior, and capturing this precisely in quantum chemistry is notoriously expensive to compute. This work builds a method combining a highly accurate four-part relativistic description of electrons with a way of splitting the 'how electrons avoid each other' calculation across many computers efficiently, letting it work on bigger atoms than before. Testing it on noble gases and related elements, they found a subtle magnetic-type electron interaction called the Breit term makes up nearly 4% of the total correlation energy for a heavy element like xenon. This gives chemists sharper tools and benchmarks for treating heavy elements accurately, relevant to fields like precision spectroscopy.

Technical view

The paper introduces 4C-MRPT2, a four-component multireference second-order perturbation theory compatible with Dirac-Coulomb, Dirac-Coulomb-Gaunt, and Dirac-Coulomb-Breit Hamiltonians, built on the memory-efficient, massively parallel STP-DAS framework to enable perturbative correlation treatment over very large external spaces. Benchmarks on noble-gas and group-13 atoms show the method recovers essentially all-electron dynamic correlation while resolving relativistic correlation effects atom-by-atom. The Breit contribution to correlation energy grows rapidly with atomic number, reaching ~4% of total correlation energy for Xe, quantifying a term often neglected in standard relativistic quantum chemistry. The STP-DAS scaling should let practitioners extend high-accuracy 4-component MRPT2 to larger heavy-element systems than previously tractable.

arXiv · cond-mat.mtrl-sciConceptual

Advances and opportunities for automated robotic preparation of 2D materials and fabrication of 2D heterostructures

Robots could soon stack atom-thin material sheets that scientists now assemble by hand.

Materials just one or a few atoms thick, like graphene, can be peeled off crystals and stacked like sheets of paper to create entirely new '2D heterostructure' materials with exotic properties. Right now these stacks are built by hand under microscopes, a slow and delicate process that's hard to scale. This paper reviews progress toward robots and automated systems that can find, pick up, align, and stack these ultrathin flakes instead of people. As scientists want to explore ever more complex combinations of these material sheets, manual assembly becomes the bottleneck, so automation is framed as essential to keep pace with the possibilities. This matters because 2D heterostructures are a promising platform for future electronics, sensors, and quantum devices.

Technical view

This is a review/perspective on robotic automation for mechanical exfoliation, identification, transfer, and stacking of van der Waals 2D crystals into heterostructures, a process historically performed manually via optical identification and micromanipulator-assisted transfer. The authors survey current automation approaches, such as machine-vision flake detection and robotic pick-and-place with alignment control, and argue that as heterostructure complexity (layer count, twist angle, material diversity) grows, manual fabrication throughput cannot keep pace with the combinatorial design space. It frames automation as key infrastructure for scaling up experimental discovery of twistronic, magnetic, and topological 2D heterostructure phenomena. Useful as a landscape reference for groups building or adopting robotic 2D-material fabrication pipelines.

arXiv · cond-mat.mtrl-sciConceptual

Soft-Phonon-Driven Effective Inversion-Symmetry Crossover in Quantum Paraelectrics

Wobbling atoms in a crystal can flip a symmetry-breaking light signal on and off with temperature.

Some crystals are almost, but not quite, symmetric inside, and a light-based technique called second-harmonic generation (SHG) is normally treated as proof that this tiny asymmetry exists. In the material KTaO3, a 'quantum paraelectric' that nearly but never quite develops a permanent internal electric polarization, the researchers found this SHG signal isn't a fixed fingerprint but changes with temperature in a surprising way. Combining laser measurements, X-ray scattering, and theory, they trace the cause to a 'soft phonon,' a pattern of atomic jiggling that gets more sluggish as temperature drops, whose thermal jostling disrupts a defect-related channel producing the SHG signal. This means an apparent change in symmetry breaking may actually be atomic vibrations scrambling the optical signal, which matters for correctly interpreting SHG experiments across many quantum materials.

Technical view

Using optical SHG, diffuse X-ray scattering, and microscopic theory on quantum paraelectric KTaO3, the authors show that an oxygen-defect-mediated nonlinear-optical channel couples to the host's soft transverse-optical polar phonon mode. Thermal fluctuations of this soft mode scramble the electronic phase coherence underlying the defect SHG response, suppressing the nonlinear signal in a temperature-dependent way that mimics an effective crossover in local inversion-symmetry breaking without any actual structural phase transition. This decouples SHG intensity trends from naive symmetry-breaking interpretations, showing phonon dynamics can modulate nonlinear-optical fingerprints independent of static structure. The finding is directly relevant to interpreting SHG data in other soft-mode or incipient ferroelectric systems where defect-lattice coupling may confound symmetry analysis.

arXiv · cond-mat.softConceptual

Spatially heterogeneous relaxational dynamics and the evolution of recoverable strain following flow cessation of a ductile nanocolloidal glass

After you stop stirring a thick nanoparticle paste, it keeps 'remembering' the flow for a long time.

Picture a thick paste made of nanoparticles, a colloidal glass, that's disordered like a liquid but behaves like a solid. When you shear it strongly and then suddenly stop, it doesn't instantly settle; internal stress fades away slowly over time in a pattern that's fast at first then increasingly gradual. Using a technique that tracks X-ray speckle patterns over time, like a precise motion camera at the nanoscale, the researchers watched the material's structure rearrange during this relaxation and found it wasn't uniform: different regions moved differently, including a slow leftover backflow motion, forming distinct bands. This reveals these soft, jammed materials carry a kind of internal memory and uneven dynamics that persist well after being disturbed, which matters for predicting how such materials behave in manufacturing or 3D printing.

Technical view

Combined rheology and X-ray photon correlation spectroscopy (XPCS) probe post-shear relaxation in a ductile nanocolloidal glass sheared to 300% strain and then held at fixed strain. Stress and the elastic component of recoverable strain both decay quasi-logarithmically with hold time at proportional rates, indicating a shared underlying relaxation mechanism largely independent of the initial shear rate. XPCS reveals spatially heterogeneous, banded dynamics during relaxation, including a convection-like backflow, with regions distinguishable by affine versus non-affine motion. The results link macroscopic stress/strain recovery directly to microscopic heterogeneous structural rearrangement, providing a benchmark dataset for models of aging and memory effects in soft jammed and glassy materials.

arXiv · cond-mat.mtrl-sciBuildable

Accurate Evaluation of Nanoscale Spatiotemporal Dynamics with Electron Correlation Microscopy

A microscopy trick borrowed from X-ray labs was quietly giving distorted answers — this fixes it.

Scientists can watch atoms rearrange over time inside nanoscale materials using electron correlation microscopy (ECM), a technique similar to a well-known X-ray method called XPCS but using electrons instead. The problem is researchers had been reusing the X-ray method's averaging math for ECM, but electrons produce different-sized speckle patterns from smaller sample regions, so that borrowed math introduces artificial errors, making things look falsely correlated or shifting the measured speed of atomic rearrangement. This paper works out new, physics-based averaging formulas tailored to electron microscopy's quirks and tests them against computer simulations of a metallic glass. The payoff is more trustworthy nanoscale dynamics measurements from electron microscopes, which are widely used across materials science.

Technical view

The authors identify that directly porting XPCS-style time- and azimuthal-averaging normalization schemes to electron correlation microscopy (ECM) introduces systematic artifacts, such as artificial anticorrelations and elevated baselines, due to ECM's smaller sampling volumes and larger relative speckle size in nanobeam electron diffraction. They derive ECM-specific, physics-motivated intensity normalization schemes over time- and azimuthally-averaged first-diffraction-ring intensities to suppress these biases. Validation against molecular dynamics simulations of a supercooled CuZr liquid shows the corrected normalization recovers accurate structural relaxation times and stretching exponents that the naive XPCS-style approach distorts. This gives ECM practitioners a corrected analysis pipeline directly applicable to nanobeam electron diffraction dynamics studies.

arXiv · physics.chem-phConceptual

A Perspective on Phase Space Electronic Structure Theory : From Its Surface Hopping Origins Through To Its Future Promise

Rethinking how atoms and electrons are calculated together could finally crack chemistry involving spin.

Standard quantum chemistry usually treats atomic nuclei as fixed while electrons zip around them, an approximation that works well most of the time but struggles with processes involving electron spin, like certain light-driven reactions. This perspective traces the history of an alternative, 'phase space electronic structure theory,' which grew out of older methods for simulating molecules jumping between energy states and instead lets the nuclei's motion be part of the core quantum description rather than an afterthought. Written for newcomers, it explains the physics intuition behind solving these equations in a moving reference frame, and argues this approach may be one of the few realistic routes to properly handling spin effects in chemistry. It matters because spin-related phenomena show up in photochemistry, magnetism, and quantum information, where existing tools currently fall short.

Technical view

This perspective traces phase space electronic structure theory (PSEST) from its roots in semiclassical surface-hopping dynamics to its current status as an alternative to Born-Oppenheimer electronic structure theory, in which nuclei are treated as dynamical rather than clamped. Largely equation-light, it builds physical intuition for solving the Schrödinger equation in a non-inertial nuclear frame and argues PSEST is currently one of few practical routes to properly incorporating electronic spin into ab initio electronic structure methods. The authors outline open problems, positioning PSEST as a growth area for spin-dependent chemical dynamics such as intersystem crossing and spin-orbit effects, beyond standard nonadiabatic methods. Useful as an entry point for researchers looking to develop or apply PSEST methods to spin-chemistry problems.

arXiv · cs.CEBuildable

Predicting Mechanical Properties of Lignin-Containing Polyurethane Rigid Foams from Microstructure Using Convolutional Neural Networks

AI reads foam's bubble patterns in microscope photos to predict its strength.

Rigid foams — like the stiff insulation in coolers and building panels — are increasingly made partly from lignin, a plant-based byproduct of paper-making, instead of pure petroleum plastic. The problem is that testing every batch's strength by physically crushing it is slow, wasteful, and impossible to do for every sample. So researchers took microscope images of the foam's internal bubble structure and fed them into a neural network (a type of AI good at recognizing patterns in images) trained to guess mechanical properties like density and strength just from the picture. This could let manufacturers screen foam quality instantly from an image instead of destroying every sample to test it.

Technical view

The authors trained a dual-head CNN on SEM micrographs of lignin-modified rigid polyurethane foams, using varying lignin-polyol substitution ratios, to jointly predict density, specific compression modulus, specific yield strength, and specific compression strength from cell-structure morphology alone. A weighted loss balances the multi-target regression heads across properties of differing scale/sensitivity. Practitioners could adapt this pipeline as a rapid QC tool, replacing destructive compression testing with image-based property inference, and extend it to other bio-based cellular polymers with sufficient paired SEM/mechanical training data.

arXiv · cond-mat.supr-conConceptual

Yttrium Superhydrides Revisited: Advanced Experimental and Theoretical Studies of YH$_6$, YH$_9$ and YH$_{10}$

Squeezed yttrium-hydrogen crystals superconduct near -50°F, and scientists just re-checked the numbers.

Some hydrogen-rich compounds, when squeezed to pressures rivaling Earth's core, become superconductors — materials that carry electricity with zero resistance — at temperatures far warmer than typical superconductors, though still very cold. Yttrium hydrides are star examples, with transition temperatures around -55°F to -38°F. This team re-measured three yttrium hydride phases using multiple independent techniques (electrical probes, radio-wave response, and pulsed strong magnets) plus theoretical calculations, to pin down exactly how sharp and robust these superconducting transitions are and how they behave under intense magnetic fields. Nailing down these details matters because it tests how close these materials are pushing the physical limits of superconductivity, informing the search for a room-temperature superconductor.

Technical view

Combining DC transport, contactless RF susceptibility, pulsed-field magnetometry up to 60 T, and first-principles calculations, the study characterizes YH6 (Tc=218-221K) and YH9 (Tc=235-237K) between 140-213 GPa, finding narrow transition widths (ΔTc=2-5K) near the thermal-fluctuation limit. For YH6 they extract an extended H-T phase diagram with dBc2/dT=-0.52 T/K, observe transition broadening above 30T, and find negligible normal-state magnetoresistance — constraints useful for benchmarking BCS/Eliashberg predictions against pressure-hydride superconductors and for calibrating future high-pressure superconductivity measurements.

arXiv · physics.chem-phBuildable

Second-Derivative-Corrected FANPT for Robust Continuation of Nonlinear Wavefunction Equations

A math fix makes quantum chemistry's shortcut-solver less likely to go off the rails.

Simulating how electrons behave in molecules requires solving fiendishly complex equations, and chemists often use approximate 'wavefunction' methods plus perturbation theory — starting from an easy solution and nudging it step by step toward the real answer — to make this tractable. One such method, called FANPT, sometimes takes a shortcut that skips over subtler mathematical corrections, which can make the calculation unstable or inaccurate for tricky molecules. This paper adds back one more layer of correction (called the second derivative, or 'Hessian') that was previously ignored, making the stepping-through-solutions process more reliable without much extra computational cost. It was tested on a well-studied benchmark molecule, lithium hydride, to show it works.

Technical view

The paper extends FANPT (Flexible Ansatz for N-body Perturbation Theory), used for continuation-based solving of nonlinear FANCI wavefunction equations, by retaining the overlap Hessian term (second-order parameter derivatives) while still truncating third-and-higher order terms, keeping the same response-matrix structure as the original quasilinear approximation but with an updated constant vector. Implemented for coupled-cluster wavefunctions within the FanPy/FANCI framework and validated on LiH, this should improve continuation robustness for cases where the original quasilinear FANPT diverges or requires excessive step subdivision. Researchers using FanPy for CI/CC wavefunction parameter continuation can adopt this as a drop-in replacement requiring only the modified constant-vector term.

arXiv · cond-mat.mtrl-sciConceptual

Symmetry-Dependent Mechanical and Vibrational Response of Formamidinium Lead Halide Perovskites: A DFT Study

Tiny crystal-shape shifts change how bendy and stable solar-cell perovskites are.

Perovskites are a promising class of crystal materials used in next-generation solar cells and LEDs, and one popular version is built from formamidinium, lead, and a halogen (chlorine, bromine, or iodine). These crystals can subtly distort from a perfectly symmetric cube shape, and this study uses computer simulations based on quantum physics (density functional theory) to figure out how that distortion affects the material's stiffness, how it vibrates, and how stable it stays. They calculated things like how hard it is to stretch, compress, or shear the crystal, and how sound travels through it, then compared the perfectly symmetric and slightly distorted versions. Knowing this helps engineers pick the right composition and structure so solar panels don't crack or degrade over time.

Technical view

Using DFT, the authors compute elastic tensors, bulk/shear/Young's moduli, Poisson's ratio, sound velocities, and Debye temperature for cubic versus pseudo-cubic (symmetry-reduced) phases of FAPbX3 (X=Cl,Br,I), correlating these with second Piola-Kirchhoff stress-strain curves under tension and compression. Results show the mechanical sensitivity to symmetry breaking depends strongly on halide identity, implying composition-dependent structural stability rather than a universal trend. This gives device engineers quantitative elastic/mechanical benchmarks for selecting halide composition and phase to optimize durability in perovskite photovoltaic and optoelectronic devices.

arXiv · cond-mat.mes-hallConceptual

Large bias-tunable magnetoresistance from spin-dependent interlayer hybridization in van der Waals antiferromagnet CrSBr-based heterostructures

A magnetic 2D material lets voltage dial electrical resistance up 350% just by tuning bias.

CrSBr is a 2D magnetic material — thin like graphene but magnetically ordered — that researchers are exploring for spintronics, a technology that uses electron spin, not just charge, to store and process information. By sandwiching it between layers of graphene and applying different voltages and magnetic field directions, the team found the electrical resistance changes dramatically (up to 350%) depending on both the applied voltage and the magnetic orientation, tracing out a distinctive M-shaped pattern. By carefully varying the magnetic field angle, they showed the effect comes from how the electron energy barrier at the junction shifts depending on magnetic alignment, not from simpler explanations like spin-filtering. This points to a new physical mechanism for building highly tunable magnetic sensors or memory devices.

Technical view

In hBN/graphene/CrSBr/graphene van der Waals heterostructures, the authors observe magnetoresistance up to 350% at 20K with symmetric M-shaped bias dependence peaking near ±0.5V. Sweeping the CrSBr magnetization angle θ via a hard-axis field reveals the tunnel barrier band-edge offset scales linearly with cos(θ/2) — a signature inconsistent with both the Jullière model and simple spin-filter projection, instead pointing to spin-dependent interlayer hybridization altering the band alignment. This establishes bias voltage as an independent tuning knob for MR in antiferromagnetic van der Waals junctions, offering a design lever for CrSBr-based spintronic sensors distinct from conventional spin-valve mechanisms.

arXiv · cond-mat.mtrl-sciConceptual

Many-Body Destabilization of Intermediate Oxygen-Hole States

Supercomputer math overturns a quantum-chemistry prediction about missing electrons in a battery-like material.

In certain oxide materials — relevant to things like battery electrodes — removing an electron from an oxygen atom creates a 'hole' that can either stay put in one spot (localized) or spread out across a bond between two oxygens (split). Standard approximate quantum calculations (hybrid DFT) predicted the spread-out 'split' version would be more stable in a manganese-oxide material with missing manganese atoms. This study used a much more rigorous but computationally expensive method, diffusion Quantum Monte Carlo, which more faithfully accounts for how electrons interact with each other, and found the opposite: the localized version is actually lower-energy and more stable. This matters because it shows that cheaper, more common calculation methods can get the wrong answer for these subtle electron behaviors, which are important for understanding battery material performance.

Technical view

For layered Na2-xMn3O7, hybrid DFT predicts a bond-centered 'split' oxygen-hole polaron is stabilized near ordered Mn vacancies, but diffusion Quantum Monte Carlo (DMC) — which captures many-body electron correlation more accurately than DFT — reverses this ordering, finding the localized oxygen polaron lower in energy, robust across trial wavefunctions from both hybrid and GGA DFT. Many-body spin density analysis shows the nominal split state partially collapses toward localization under DMC. This is a cautionary benchmark for practitioners: hybrid-DFT-predicted oxygen-hole states in correlated transition-metal oxides (relevant to Li/Na-ion cathode materials) should be cross-validated with QMC or similarly rigorous many-body methods before trusting energetic orderings.

arXiv · cond-mat.mtrl-sciConceptual

Strain-controlled magnetism and magnetoelasticity in monolayer NiPS$_3$ and CrPS$_4$

Stretching ultra-thin magnetic materials can flip their magnetism on and off like a switch.

NiPS3 and CrPS4 are magnetic materials so thin they're just one layer of atoms thick, and scientists want to know how physically stretching or compressing them changes their magnetic behavior — a coupling called magnetoelasticity. Using computer simulations, the researchers built a mathematical model that connects how atoms' magnetic interactions change with strain to the material's overall elastic (springiness) properties. They found NiPS3's magnetism barely reacts to stretching, staying in a fixed zigzag magnetic pattern, while CrPS4 is highly sensitive — strain can flip it between totally different magnetic arrangements and change the temperature at which its magnetism disappears. This shows that mechanically stretching certain 2D materials could become a lever for controlling magnetism in future ultra-compact electronic devices.

Technical view

The authors develop a first-principles strain-dependent Heisenberg model where strain derivatives of exchange couplings yield magnetostriction coefficients and magnetic renormalization of the elastic tensor, applied to monolayer NiPS3 and CrPS4. NiPS3 shows weak, nearly isotropic spin-lattice coupling consistent with its robust zigzag antiferromagnetic order, while CrPS4 exhibits strong anisotropic coupling driving strain-induced transitions between spin-spiral and ferromagnetic phases with substantial shifts in critical temperature and elastic response. This microscopic framework offers a general, materials-agnostic route to compute magnetoelastic coefficients from DFT exchange parameters, directly usable for predicting strain-tunable magnetic phase diagrams in other 2D van der Waals magnets.

arXiv · cond-mat.softConceptual

Microscopic derivation of a field equation for active Brownian particles

Physicists derived, from scratch, the equations describing how self-propelled particles clump together.

Active matter — like swarms of self-propelled particles, imagined as tiny robots or bacteria that constantly push themselves forward — can spontaneously separate into dense clusters and dilute regions, similar to oil separating from water, even though nothing is explicitly attracting them. Physicists have built successful top-down mathematical models (like 'Active Model B+') that describe this clumping by simply adding extra terms to known equations, but those terms were somewhat guessed rather than derived from the underlying particle physics. This paper instead starts from a detailed microscopic description of colliding, self-driven particles and mathematically derives those same top-down equations from first principles, in the regime where particles move in fairly straight lines for a while (high persistence). This gives the phenomenological model a rigorous physical foundation and connects its abstract coefficients to concrete, measurable particle properties.

Technical view

Starting from an Enskog-like kinetic theory for hard-core active Brownian particles in the high-persistence (large Péclet-number-adjacent) regime, the authors derive Active Model B+ (AMB+) — the standard phenomenological field theory for active phase separation with time-reversal-symmetry-breaking fluxes — from microscopic first principles. They propose an effective parametrization of the pair correlation function needed for the effective free energy to exhibit the two minima required for phase coexistence, and provide explicit leading-order-in-Péclet-number expressions for all AMB+ coefficients in terms of microscopic parameters (particle size, self-propulsion speed, persistence time). This gives practitioners a concrete mapping from measurable/simulatable ABP parameters to AMB+ field-theory coefficients, enabling quantitative (not just qualitative) comparison between particle-based simulations and continuum active-matter theory.

arXiv · quant-phConceptual

Impact of strain and dark states on spectroscopic measurements of silicon-vacancy centers in diamond

Diamond defects that could power quantum computers get thrown off by tiny internal strain.

Silicon-vacancy centers are single-atom-scale defects inside diamond that can trap and emit particles of light in a controllable way, making them promising building blocks for quantum computers and sensors. The problem is that when you pack many of these defects close together, they don't all behave the same — some go strangely quiet or 'dark' and stop emitting light as expected. The researchers built a computer simulation to recreate a real lab experiment that shines multiple laser pulses on a diamond sample and reads out the resulting light patterns, a technique that reveals hidden variation between defects. They found the culprit is random internal strain — tiny distortions in the diamond's crystal lattice around each defect — and that defects under enough strain essentially decouple from the light entirely. Understanding this matters because engineers need to know how much strain is tolerable before diamond-based quantum devices become unreliable.

Technical view

The authors developed a computational model simulating optical multidimensional coherent spectroscopy (MDCS) measurements on dense ensembles of SiV⁻ centers in diamond, targeting the detection-scheme-dependent spectral variability seen experimentally. The model incorporates randomly distributed axial and shear strain fields, extracting characteristic values of ~2.8×10⁻⁴ (axial) and ~3.5×10⁻⁵ (shear), and predicts that centers experiencing strain above ~1.5×10⁻⁵ become significantly decoupled from optical emission. This gives a quantitative strain threshold that practitioners can use to interpret MDCS lineshapes and to set material-quality targets for ensemble-based SiV⁻ quantum devices. The approach could be extended to other strain-sensitive color centers (e.g., germanium- or tin-vacancy) facing similar ensemble inhomogeneity issues.

arXiv · cond-mat.mtrl-sciBuildable

Structural, Optical and Magnetic Properties of Superparamagnetic Fe3O4@TiO2 and Fe3O4@SiO2@TiO2 CoreShell Nanostructures

Magnetic-plus-light-activated nanoparticles are being engineered as multitasking cancer-fighting tools.

This work builds tiny particles with a magnetic iron-oxide core wrapped in one or two outer shells, one of which is titanium dioxide, a material that responds strongly to light. The core-shell design is meant to combine several cancer-treatment tricks in a single nanoparticle: the magnetic core can be used for MRI scans and for heating tumors with magnetic fields (hyperthermia), while the light-responsive shell enables imaging and light-triggered therapies. The team made these layered nanoparticles and then used a battery of standard materials-science techniques — X-ray, infrared spectroscopy, powerful electron microscopes, light-reflection measurements, and precise magnetic sensors — to confirm their structure, optical behavior, and magnetic strength. The goal is a single multifunctional particle that doctors could someday use to both see and destroy tumors at once.

Technical view

The study reports synthesis and full characterization of Fe3O4@TiO2 and Fe3O4@SiO2@TiO2 core-shell nanostructures, using an intermediate SiO2 layer in one variant likely to control shell growth and reduce core-shell interfacial defects/quenching. Structural and compositional analysis (XRD, FTIR, TEM, HRSEM) confirms core-shell formation, while DRS and SQUID magnetometry characterize the TiO2 shell's optical bandgap/absorption and the particles' superparamagnetic behavior, respectively. The combination targets multimodal use — MRI contrast and magnetic hyperthermia from the Fe3O4 core, photoresponsive imaging/phototherapy from the TiO2 shell — positioning these as candidate multifunctional nanoplatforms for combined cancer diagnosis and therapy. Replication would require standard sol-gel or hydrothermal shell-coating protocols and access to SQUID magnetometry for quantitative superparamagnetic characterization.

Q

Quanta — Explained

2 new
Quanta MagazineConceptual★ flagship

Graduate Student Proves a Quantum Uncertainty Principle for Fractals

A grad student proved you can't pin down a quantum wave too sharply on a fractal.

Heisenberg's uncertainty principle says you can't simultaneously know a particle's exact position and its exact momentum — sharpen one and the other blurs. This story, reported by Quanta Magazine, describes a young mathematician proving a version of that same trade-off in a strange new setting: fractals, the infinitely detailed, self-repeating shapes that never smooth out no matter how far you zoom in. The result ties together three deep areas — chaos, quantum theory, and fractal geometry — to show that a quantum wave living on such a jagged structure can't be too concentrated in both a location sense and a frequency sense at once. Experts have called it a "foundational result," meaning it establishes a basic ground truth others can build on. It matters because understanding how waves behave on rough, chaotic, or fractal-like spaces underpins questions about quantum chaos and the fine structure of physical systems.

Technical view

The work establishes an uncertainty-principle-type theorem for quantum states supported on fractal sets, linking spectral/harmonic analysis, quantum ergodicity, and fractal geometry. In spirit it constrains simultaneous localization of a function and its Fourier transform when the underlying support has fractal (non-integer Hausdorff) dimension, extending classical concentration/uncertainty inequalities and connections to quantum chaos. Because this is a popular-science summary rather than the paper, the precise operator, measure class, and quantitative bounds aren't specified here; the substantive claim is that a rigorous, described-as-foundational lower bound on joint localization holds in the fractal regime. Researchers in harmonic analysis or quantum chaos would build on it by seeking the exact hypotheses on the fractal measure and the sharpness of the constants.

Quanta MagazineConceptual

Why Are Rivers So Mathematical?

One elegant equation explains why almost every river on Earth bends and branches the same way.

Rivers look chaotic and unique when you look at any single one, but zoom out and nearly all of them obey the same simple mathematical pattern relating their width, depth, slope, and how they meander or branch. This piece revisits a long-known scaling law — a formula that predicts how a river's shape changes as you scale up from a small stream to a massive river — and reports on new research extending that law to cover more situations, like different sediment types or river networks. The 'how' is essentially physics: water and sediment interact through erosion and deposition in ways that funnel countless possible river shapes toward a few predictable configurations, similar to how many physical systems settle into universal patterns. It matters because a single formula that reliably predicts river behavior helps with flood forecasting, landscape engineering, and even understanding rivers on other planets.

Technical view

The piece (a Quanta Magazine science article) covers extensions to a known scaling law governing fluvial geomorphology — relationships between channel width, depth, slope, discharge, and sediment transport that hold with striking consistency across river sizes and settings. New findings reportedly broaden the law's applicability, likely refining how self-organized criticality or optimal channel network theory explains river form. Practitioners in hydrology and geomorphology could use such refined scaling relationships to improve predictive models for channel evolution, flood risk, and sediment transport, and planetary scientists could apply them to interpret ancient river-like channels observed on Mars.

HN

What's Trending

60 new
Hacker News · 1198 ptsRunnable★ flagship

Muse Glimmer: 30B-parameter model optimized for always-on local agent workflows

A compact 30-billion-parameter AI model built to run quietly on your own machine all day.

This item is about "Muse Glimmer," described as a 30-billion-parameter language model tuned specifically for "always-on local agent workflows" — meaning an AI assistant that runs continuously on your own hardware rather than in the cloud. The "30B parameters" refers to its size: big enough to be genuinely capable but small enough to fit and run on a single powerful local computer, which keeps your data private and avoids per-use cloud fees. "Agent workflows" means the model is meant to act on tasks over time — monitoring, responding, chaining steps — not just answering a single question. No abstract or technical details were provided beyond the title, so specifics about its training, benchmarks, or architecture aren't available here. The general appeal is a practical, private, cost-free-to-run assistant that stays on in the background.

Technical view

Based solely on the title, Muse Glimmer is a ~30B-parameter LLM positioned for persistent, local (on-device) agentic use rather than cloud inference. That size class typically targets a single high-memory GPU or a capable workstation via quantization (e.g. 4-bit), balancing capability against the latency and memory constraints of always-on operation. "Always-on local agent" framing implies optimization for sustained tool-calling, low idle cost, and possibly long-context or fast-response inference, but no architecture, training data, quantization scheme, or benchmark results are given in the provided material. A practitioner would need the model card or weights to assess context length, tool-use performance, and hardware requirements before building on it.

Hacker News · 927 ptsConceptual

As AI eats the web, the internet’s collective memory is disappearing

AI scrapers and summarizers are quietly killing the web pages people used to click on and archive.

For decades, the open web worked because people clicked links, visited original sites, and services like the Internet Archive or search engines helped preserve a record of what existed online. Now AI chatbots and search summaries answer questions directly by ingesting and paraphrasing web content, so fewer people click through to original sources — which cuts the traffic and ad revenue that kept many sites (blogs, news outlets, forums) alive. As those sites shut down or get abandoned, their content vanishes, and because it's disappearing faster than archiving efforts can keep up, we're quietly losing a chunk of the internet's shared historical record. This matters because the web has functioned as a kind of collective memory, and AI's convenience is accelerating the erosion of the very source material it depends on.

Technical view

The piece describes how AI-driven content consumption — chatbot answers, AI-generated search summaries, and scraping for model training — is reducing referral traffic to original web sources, undermining the ad- and traffic-based economics that sustain much of the open web, and accelerating link rot and site closures faster than archival institutions (e.g., the Internet Archive) can capture them. This creates a feedback risk: as more original sources disappear, future AI training and retrieval systems have a shrinking, increasingly AI-generated corpus to draw from, raising concerns about information provenance and long-term degradation of retrievable primary sources. Relevant for anyone building retrieval-augmented systems or archival tooling, since it implies growing value (and urgency) in aggressive, provenance-preserving web archiving infrastructure.

Hacker News · 790 ptsConceptual

Tailscale Traces Database Corruption to 16y/o SQLite WAL-Reset Bug

Tailscale's database kept mysteriously corrupting itself — the culprit hid in SQLite for 16 years.

Tailscale, a networking/VPN company, noticed their database was quietly corrupting data and spent serious effort hunting down why. They eventually traced it to a subtle bug in SQLite — the tiny embedded database used inside countless apps — specifically in how it resets its 'write-ahead log' (WAL), a mechanism that safely records changes before applying them. The bug had apparently gone unnoticed for 16 years because it only triggers under a rare sequence of operations. It's a good reminder that even hugely trusted, heavily-used software can harbor decades-old edge-case bugs, and shows the painstaking detective work behind diagnosing 'impossible' production data corruption.

Technical view

Tailscale engineers root-caused intermittent database corruption to a bug in SQLite's WAL checkpoint/reset logic, present in the codebase for roughly 16 years before being triggered by their specific access pattern. The bug likely involves an ordering or race condition around WAL truncation/reset that only manifests under particular concurrency or crash-recovery conditions. It's a case study in production debugging methodology — log/binary analysis, minimal-repro construction, and eventual upstream patching. Teams running SQLite in WAL mode under high concurrency should review the writeup for the specific trigger conditions to check their own exposure.

Hacker News · 731 ptsRunnable

DeepSeek V4 Pro 0813

DeepSeek just dropped a newer, more powerful version of its AI model.

DeepSeek is a Chinese AI lab known for releasing strong, competitively-priced large language models that rival top US offerings. 'V4 Pro 0813' appears to be a dated release (August 13) of their next-generation flagship model, presumably improving reasoning, coding, or efficiency over prior versions. These releases matter because DeepSeek has repeatedly shown frontier-level AI capability doesn't require the biggest budgets, intensifying global competition and pushing prices down. Without more detail in the announcement itself, the specific improvements aren't yet clear.

Technical view

This references a dated build ('0813') of DeepSeek's V4 Pro line, presumably iterating on their prior V3/R1-style architecture — likely a sparse mixture-of-experts transformer with reinforcement-learning-tuned reasoning. No benchmark or architecture specifics are given here, so parameter count, context length, and training recipe can't be confirmed from this abstract alone. Anyone wanting to replicate or deploy it should check DeepSeek's official model card/weights for licensing, quantization options, and benchmarks against contemporaries like GPT and Qwen.

Hacker News · 713 ptsConceptual

AI is removing the middle class of software engineering?

Is AI quietly wiping out the mid-level software jobs that used to be a career ladder?

This piece asks whether AI coding tools are disproportionately eliminating 'middle class' software engineering jobs — solid, mid-level positions that aren't glamorous senior architect roles but aren't entry-level either. The worry is that AI now handles a lot of routine, well-specified coding work that used to be mid-career engineers' bread and butter, while humans are still needed for the hardest design calls and the simplest oversight tasks. This echoes a pattern seen in other automated industries, where the middle rungs of a career ladder get squeezed out first, potentially making it harder to climb from junior to senior.

Technical view

The argument centers on AI coding assistants and agentic coding systems increasingly automating tasks traditionally done by mid-level engineers — feature implementation, boilerplate, routine debugging — while senior engineers retain architecture/judgment roles and juniors remain needed for oversight/verification of AI output. This mirrors labor-economics 'job polarization' theory applied specifically to software. The abstract cites no supporting data (hiring trends, salary bands, task-automation studies), so the claim should be read as an argument to evaluate rather than an established finding.

Hacker News · 682 ptsBuildable

Stealing Reasoning Traces from Proprietary LLM APIs

Researchers found ways to extract the hidden 'thinking' that AI companies try to keep secret.

Many advanced AI models (like OpenAI's o1) generate an internal 'reasoning trace' — a scratchpad of step-by-step thinking — before giving their final answer, but companies deliberately hide this from users to protect their competitive edge and prevent misuse. This research explores techniques for reconstructing that hidden reasoning anyway, by cleverly probing the API's outputs, timing, or other side signals rather than being shown it directly. It matters both as a security concern — proprietary 'secret sauce' might be extractable — and as a transparency issue, since users might want to see the reasoning currently withheld from them.

Technical view

The work investigates side-channel or prompt-based extraction techniques for recovering hidden chain-of-thought traces from proprietary LLM APIs that expose only final outputs (e.g., OpenAI's o1/o3-style reasoning models, which summarize or hide raw CoT). Likely approaches include adversarial prompting, output-length/timing side channels, or exploiting partial leakage in response metadata to reconstruct intermediate reasoning steps. This bears on API providers' IP protection and on red-teaming/safety evaluation, since hidden reasoning is often where unsafe intermediate steps would otherwise be caught. Teams building or auditing reasoning-model APIs should review the specific extraction vectors to harden against them.

Hacker News · 642 ptsConceptual

Compression is prediction

The best way to predict what comes next and the best way to compress data are secretly the same trick.

This is a deep idea from information theory: if you can perfectly predict what's coming next in a sequence — the next word, pixel, or sound — you can also compress that sequence almost perfectly, because you only need to store the surprises, not the predictable parts. The reverse holds too: a great compressor is secretly a great predictor. This matters for AI because large language models are, at their core, next-word predictors, so their ability to compress text may be a solid proxy for how much they've genuinely 'understood' — an idea people use to argue that scaling up prediction accuracy is a real path toward intelligence.

Technical view

The prediction-compression equivalence follows from Shannon's source coding theorem: an optimal predictive model of a data distribution yields an optimal, entropy-rate-achieving code via arithmetic coding, and conversely a good compressor implies a good predictive model. This underlies claims that language-model pretraining loss (next-token prediction) directly measures compression ability, and has been invoked (e.g., the Hutter Prize, or Sutskever-style arguments) to justify scaling laws linking loss reduction to emergent capability. Practically, cross-entropy/perplexity on held-out data is literally a bits-per-token compression ratio, making compression benchmarks a legitimate stand-in for language-modeling benchmarks.

Hacker News · 537 ptsConceptual

License plate reader searches should require a warrant

Should police need a warrant before searching months of your car's location history?

Automatic license plate readers are cameras, often on streetlights or patrol cars, that continuously scan and log every passing car's plate along with time and location. Over months or years this builds a detailed movement history for ordinary people who've done nothing wrong, and today police can search that database freely, without a judge's approval. This piece argues such searches should require a warrant, just like searching your phone or home does, because aggregated location data can reveal deeply private things — where you worship, who you visit, your daily routine — even though each individual snapshot seems trivial. It's part of a bigger legal fight over how much surveillance data the government can collect and search without traditional Fourth Amendment protections.

Technical view

The argument extends the 'mosaic theory' of Fourth Amendment law (applied in cases like Carpenter v. United States for cell-site location data) to automatic license plate reader (ALPR) databases, contending that aggregated, retrospective queries constitute a 'search' requiring probable cause and a warrant, even though any single plate capture in public isn't private. This is relevant to ongoing litigation and legislative efforts (state-level ALPR retention/access laws) and to civil liberties groups tracking mass-surveillance database access policies. It grounds proposed statutory warrant requirements analogous to those now applied to CSLI and geofence warrants.

Hacker News · 506 ptsConceptual

OpenAI’s head of ethics leaves less than a year after joining

OpenAI's top ethics official is out after less than a year on the job.

OpenAI hired Chloe Bakalar as its head of ethics, a role meant to help the company navigate the moral questions raised by building powerful AI, but she departed in under a year. Leadership turnover in AI safety and ethics roles has been a recurring pattern at major labs, often fueling speculation about tension between commercial pressure to ship fast and the slower, more cautious work of ethical review. It matters because it feeds broader public concern about whether AI companies' safety and ethics commitments are taken seriously internally, especially as they race to deploy increasingly capable systems.

Technical view

This is a personnel/governance news item: OpenAI's head of ethics, Chloe Bakalar, resigned after under a year, joining a string of high-profile safety/ethics/governance departures from the company (echoing earlier exits from superalignment and policy teams). No stated reason for departure is given, so any causal narrative — burnout, disagreement over priorities, restructuring — should be treated as speculative pending primary sourcing. Worth watching for follow-on reporting on whether OpenAI's ethics function is being restructured or downsized.

Hacker News · 487 ptsRunnable

Qwen3.8-2.4T

A new Qwen AI model with 2.4 trillion parameters just landed on Hugging Face.

Qwen is Alibaba's family of open-weight AI models, and this listing is for a new release — 'Qwen3.8' — that's enormous: 2.4 trillion total parameters. It likely uses a 'mixture of experts' design (hinted by 'A95B') where only a fraction, around 95 billion, actually activates for any given request, keeping it fast despite its huge total size. It's released in FP8, a compact numerical format that shrinks memory use and speeds up computation while keeping most of the accuracy. This matters because it pushes open-weight AI closer to the scale of the biggest proprietary systems, giving developers a freely-downloadable model competitive with the largest closed ones.

Technical view

Qwen3.8-2.4T-A95B-FP8 is a large mixture-of-experts (MoE) model with 2.4T total parameters and roughly 95B active parameters per forward pass, released with native FP8 weights to cut memory footprint and inference cost. The architecture follows Qwen's established sparse MoE pattern (router-selected expert subsets per token), and the FP8 release suggests targeting H100/H200-class or newer hardware with native FP8 tensor-core support. Practitioners can pull weights directly from Hugging Face to fine-tune or serve via MoE/FP8-capable frameworks (e.g., vLLM, SGLang), though the total parameter count still demands multi-GPU/multi-node deployment despite sparse activation.

Hacker News · 464 ptsConceptual

Controversial creators are benefiting from monetization programs run by Meta

Meta pays creators by engagement, and some cashing in are deliberately controversial.

Meta runs programs that pay creators based on how much engagement and views their posts get on Facebook and Instagram. This piece looks at how creators known for stirring controversy or posting extreme content are cashing in through these payouts, because outrage and conflict tend to drive high engagement. The underlying problem is that platforms optimizing purely for attention can end up bankrolling exactly the kind of content their own policies claim to discourage. It matters because it exposes a gap between what a platform says it values and what its incentive systems actually reward.

Technical view

Meta's creator monetization tools (engagement bonuses, Reels payouts, ad-revenue sharing) pay out based on metrics like views, watch time, and engagement rate rather than any content-quality or policy-compliance signal. Reporting suggests creators producing controversial, borderline, or misinformation-adjacent content rank highly on these metrics and thus receive disproportionate payouts, echoing similar findings historically made about YouTube's and X's creator-payment systems. This is fundamentally an incentive-design problem at platform scale — engagement-weighted payouts systematically reward outrage over other content. Anyone building creator-economy or trust-and-safety tooling would look at decoupling eligibility from raw engagement and instead factoring in policy-violation history or a content-quality score.

Hacker News · 458 ptsRunnable

2026 Eclipse Webcams

Watch next year's solar eclipse live online, wherever on Earth you happen to be.

In 2026 a solar eclipse will sweep across part of the globe — a moment when the Moon passes in front of the Sun and briefly darkens the sky along a narrow path. Most people on Earth won't be standing in that path, so observatories, science groups, and enthusiasts set up cameras to livestream the event over the internet. This page collects those webcam feeds so anyone can watch totality unfold in real time from home, no travel, eclipse glasses, or clear local weather required. It matters because it opens up a rare, geographically limited astronomical event to a global audience.

Technical view

This is a curated aggregator of live video feeds from observatories, science-outreach organizations, and individual astronomers stationed along the 2026 eclipse's path of totality, compiled with schedule and time-zone information so viewers worldwide know when to tune in. Sites like this typically pull from institutions such as NASA, timeandddate.com, and university observatories and layer on stream metadata (start/end of totality, camera location, weather backup feeds). For a developer, reproducing this is primarily a content-curation and time-zone-conversion task rather than a novel technical build.

Hacker News · 443 ptsConceptual

How Claude marks AI-generated content

Anthropic explains how it tags Claude's writing and images as AI-made.

As AI-written text and AI-generated images become common, it's increasingly hard to tell what a person made versus what a machine produced. Claude, Anthropic's AI assistant, uses labeling techniques — like embedded metadata or standardized markers — to flag its own outputs as AI-generated so they can be identified later. Rather than relying on people to guess, the system attaches machine-readable signals directly to the content itself. This matters because transparency about AI origin helps fight misinformation, supports content moderation on other platforms, and builds public trust as more of the internet fills with AI-made material.

Technical view

This likely details Anthropic's implementation of content-provenance signals for Claude's outputs — such as C2PA-style metadata standards for generated images or disclosure conventions for generated text — describing how markers are attached and whether they're cryptographically signed to resist tampering versus being soft, strippable metadata. It probably also distinguishes between consumer-app behavior and API usage, since developers integrating Claude need to know whether markers survive re-encoding or export and whether they're programmatically queryable. This matters for anyone building downstream detection or moderation tooling that wants to rely on Anthropic's provenance signals rather than inferring AI origin heuristically.

Hacker News · 424 ptsConceptual

Go is an ideal language for AI-assisted software engineering

Go's strict simplicity means AI coding assistants rarely get it subtly wrong.

When AI tools like Claude write code, they tend to do best in languages that are simple, consistent, and hard to misuse — and Go, Google's programming language, is held up as a strong fit. Go has few ways to do the same thing, an enforced formatting style, and a deliberately small set of features, so an AI generating Go code has less room to produce code that looks right but is subtly broken. Fast compilation and strong built-in tooling let a human or AI quickly test whether generated code actually works. It matters because as more software gets written with AI help, the design of the language itself increasingly shapes how trustworthy that collaboration is.

Technical view

The argument centers on Go's minimal syntax surface, opinionated formatting (gofmt), static typing, and absence of complex generics or metaprogramming, which together shrink the space of plausible-but-wrong outputs an LLM can produce compared to more expressive languages like Python or Rust. Go's fast build times and strong standard library also support tight compile-test-fix loops well suited to iterative AI-assisted development, and its explicit error handling (no exceptions) makes control flow easier for a model to reason about locally without hidden state. Builders of AI coding agents might treat this as a rationale for prioritizing Go as a target language or for tuning linting/verification harnesses around Go's constrained idioms.

Hacker News · 424 ptsBuildable

Mojo 1.0

A Python-like language built for blazing-fast AI code hits its stable 1.0.

Mojo is a programming language designed to combine the ease of writing Python with the raw speed of lower-level languages like C++, aimed squarely at AI and machine-learning work. Reaching "1.0" means its creators consider it stable enough for real production use, with a promise that existing code won't break in future updates. The idea is to let developers write familiar, Python-like code that compiles down into fast code optimized for specialized AI chips, instead of forcing a rewrite in a harder systems language. It matters because AI development is often stuck choosing between easy-to-write Python and fast-but-painful C++/CUDA, and Mojo tries to erase that tradeoff.

Technical view

Mojo is a Python-syntax-compatible, statically compiled language from Modular built on MLIR, targeting high-performance numerical and AI kernel development with SIMD support, autotuning, and hardware-portable compilation across CPUs, GPUs, and other accelerators, without dropping to hand-written C++/CUDA. The 1.0 milestone signals a stability commitment (API/ABI guarantees) alongside a matured standard library, package manager, and Python interop story. Practitioners writing custom ML kernels or performance-critical training/inference code can use Mojo as a path from Python prototype to optimized deployment, potentially replacing hand-tuned CUDA or Triton kernels for some workloads.

Hacker News · 396 ptsRunnable

Grok 4.6

xAI's chatbot Grok ticks up another version number.

Grok is the AI chatbot built by Elon Musk's company xAI and woven into the X (formerly Twitter) platform. The "4.6" label marks an incremental update to the underlying model, presumably sharpening its reasoning, knowledge, or general capability compared to the prior version. Updates like this usually come from retraining or fine-tuning the model on more data and user feedback to make its answers more accurate or useful. It's part of the broader race among AI labs — OpenAI, Google, Anthropic, xAI — to build the most capable general-purpose assistant.

Technical view

This denotes a point release in xAI's Grok model family, presumably with incremental gains in reasoning, context handling, or benchmark performance over Grok 4.x predecessors, though specific architectural or training changes aren't detailed here. Point releases typically ship through the Grok API and X app; practitioners evaluating it would want benchmark comparisons (MMLU-style, coding, agentic tool-use evals) against Grok 4 and competitors like Claude and GPT-series models before adopting it in production. Treat any specific capability claims as unconfirmed until official release notes or benchmarks are published.

Hacker News · 383 ptsConceptual

Delta

A project named Delta surfaces — details are thin so far.

"Delta" appears to be the name of a new release, tool, or initiative, but the available information doesn't say what field it's in or what problem it solves. Names like this often get used for version releases, internal codenames, or products teased ahead of a fuller announcement. Without more context — what it does, who built it, why it matters — there isn't much to explain yet. It's worth keeping an eye on until more details emerge.

Technical view

There isn't enough information here to characterize Delta's technical scope, mechanism, or claimed results — the title alone doesn't indicate a domain, methodology, or outcome. This should be treated as a placeholder to revisit once release notes, documentation, or a paper surface. Any specifics beyond the name would be speculation without further sourcing.

Hacker News · 376 ptsConceptual

London Underground begins scanning passengers' faces

London's Tube now scans riders' faces against watchlists in real time.

The London Underground, the city's subway system, has started using facial recognition — cameras that analyze people's faces and compare them against watchlists — as part of station security. The system works by scanning live camera footage and flagging matches to staff or police in real time, aiming to catch known offenders or prevent crime. But it raises serious concerns: facial recognition can misidentify people, particularly those with darker skin tones, and the millions of daily riders scanned never explicitly agreed to it. It matters because it's a major expansion of biometric surveillance into everyday public life, testing how much monitoring people will accept in the name of safety.

Technical view

This describes deployment of live facial recognition (LFR) across London Underground stations, likely operating similarly to the Metropolitan Police's existing LFR systems: real-time video feeds run through a face-matching algorithm against a curated watchlist, with alerts routed to human operators for verification before any action is taken. Key technical and policy questions include the false-positive rate — a persistent criticism in prior UK LFR trials, with documented higher error rates for certain demographics — data retention for non-matched faces, and the legal basis under UK surveillance and biometrics law, including ICO oversight. Assessing the system responsibly would require the vendor's model details, watchlist criteria, and independently audited accuracy/bias figures.

Hacker News · 352 ptsConceptual

The hardest working font in Manhattan (2025)

One typeface quietly runs half the storefronts and signs across Manhattan.

This piece traces how a single font shows up everywhere across Manhattan's streets — on bodega awnings, restaurant menus, boutique signage, and official notices — far more than any single brand ever intended. It's the kind of story that makes you notice type the way you'd notice architecture once someone points it out. The 'approach' here is basically urban observation: walking the city, photographing signage, and tracing why sign shops, printers, and small businesses converge on the same handful of letterforms. It matters because typography is an invisible layer of a city's identity, quietly shaping how a place feels even though almost no one consciously registers it.

Technical view

This is a visual/cultural essay rather than a technical work, cataloguing the prevalence of a specific typeface (or family of similar faces) across Manhattan's commercial signage. The likely mechanism behind such ubiquity is supply-side: a small number of sign-making vendors, vinyl-lettering shops, or font licenses that are cheap, legible at a distance, and easy to cut become de facto defaults for small business owners with no design background. A practitioner interested in type-in-the-wild research could replicate this by systematically photographing storefront signage in a neighborhood and clustering fonts by shape metrics or vendor sourcing.

Hacker News · 350 ptsRunnable

llama.cpp

The scrappy C++ code that lets your laptop run ChatGPT-grade AI offline.

llama.cpp is an open-source project that lets you run large language models — the kind of AI that powers chatbots — directly on your own computer, including modest laptops and phones, instead of needing a data center. It solves the problem that these models are normally huge and need expensive specialized GPUs to run. The trick is writing extremely efficient, low-level C/C++ code and shrinking the model's numbers (a technique called quantization) so it fits in ordinary memory and runs fast on regular CPUs and consumer GPUs. It matters because it put private, offline AI into the hands of hobbyists, researchers, and developers everywhere, without cloud fees or sending your data to a company's servers.

Technical view

llama.cpp is a dependency-light C/C++ inference engine for LLaMA-family and other GGUF-format transformer models, supporting aggressive quantization (down to 2-4 bit weights) alongside CPU SIMD optimizations and partial/full GPU offload (CUDA, Metal, Vulkan, ROCm). It underpins a large ecosystem — Ollama, LM Studio, and countless local-AI tools — by exposing a simple CLI/server and language bindings. Practitioners can build on it by converting HuggingFace checkpoints to GGUF, tuning quantization levels for their hardware's memory/speed tradeoff, and integrating its OpenAI-compatible server API into existing applications.

Hacker News · 333 ptsConceptual

Grok Bot

An AI bot that answers your questions right inside your social feed.

Grok Bot refers to the AI assistant built by xAI (Elon Musk's AI company) that people can summon directly inside a social media feed — tagging it on a post to get an answer, fact-check, or explanation on the spot. Instead of opening a separate chat app, you interact with the AI where the conversation already is, which lowers the friction to ask it anything. The underlying idea is to make an AI assistant feel like a participant in public conversation rather than a private tool. It matters because it's part of a broader trend of AI chatbots moving from standalone apps into the platforms people already spend time in, changing how information and opinions circulate online.

Technical view

Grok Bot is xAI's Grok model deployed as an in-platform conversational agent, invoked via @-mentions or replies on X (formerly Twitter), returning generated responses inline in the thread. Architecturally this is a thin integration layer wrapping the Grok LLM API with platform-specific triggers, rate limiting, and context extraction from the surrounding post/thread. For a practitioner, the interesting angle is less the model itself and more the pattern of embedding an LLM as a reactive, mention-triggered agent within an existing social graph, which raises distinct challenges around moderation, latency, and misuse compared to a standalone chat interface.

Hacker News · 323 ptsRunnable

Show HN: iPhone app takes simultaneous images from 2 lenses, fuses into 1 photo

An iPhone app snaps two lenses at once and merges them into a better photo.

This is an iPhone app that fires both of the phone's camera lenses — say the wide and telephoto — at exactly the same moment, then digitally blends the two resulting images into a single photo. Normally when you switch lenses or zoom, you only ever capture from one lens at a time, which can mean losing detail or dynamic range that another lens might have captured better. By shooting simultaneously and fusing the frames, the app can combine the best qualities of each — more detail, better depth, or a more balanced exposure — into one final image. It matters because it's a clever workaround for hardware limits, squeezing more image quality out of the same phone camera you already own.

Technical view

The app captures near-simultaneous frames from two of the iPhone's physical camera modules (e.g. wide + telephoto) via AVFoundation's multi-camera capture APIs, then applies an image-fusion pipeline — likely involving alignment/registration between the differing fields of view and focal lengths, followed by blending for extended dynamic range, sharpness, or parallax-based depth information. This is conceptually similar to multi-camera HDR or depth-fusion techniques used in flagship camera pipelines, but implemented as an independent Show HN project rather than baked into iOS's native camera app. A developer could build on this by exploring AVCaptureMultiCamSession, homography-based frame alignment, and exposure-bracketed fusion algorithms.

Hacker News · 316 ptsConceptual

Grok 4.6 scores 61 on the Artificial Analysis Intelligence Index

xAI's newest model just cracked the top of an independent AI-smartness leaderboard.

Artificial Analysis is an independent group that benchmarks AI models across many different reasoning, math, and knowledge tests, then combines the results into a single score so people can compare models like cars on a spec sheet. Grok 4.6, the latest model from Elon Musk's xAI, scored 61 on this index, a number meant to summarize how 'intelligent' the model is relative to rivals like GPT, Gemini, and Claude. The 'how' here isn't a new technique so much as an aggregated report card: running the model through a battery of standardized tests and averaging the outcomes. It matters because these leaderboard numbers heavily influence which AI companies get attention, funding, and adoption, even though a single score can obscure real differences in how models behave on specific tasks.

Technical view

The Artificial Analysis Intelligence Index aggregates performance across a suite of reasoning, coding, math, and knowledge benchmarks (e.g. MMLU-style, GPQA, competition math) into one composite score for cross-model comparison. Grok 4.6 posting a 61 places it in the general vicinity of other current frontier models, though the raw number's meaning depends entirely on which benchmarks are weighted and how they've shifted version-to-version. Practitioners evaluating models for a specific use case should treat this composite as a rough triage signal only and drill into the underlying per-benchmark breakdown — especially task-specific evals matching their actual workload — before choosing a model.

Hacker News · 294 ptsConceptual

uBlock Origin Is Giving Up the Fight to Keep Ads Off Facebook

Facebook made its ads so sneaky that even the best ad blocker just gave up.

uBlock Origin is the most effective ad-blocking browser extension, and its maintainers have reportedly stopped trying to filter out ads specifically on Facebook. Normally ad blockers work by recognizing patterns in a webpage's code that mark something as an ad — a certain HTML structure, class name, or network request — and hiding it. The problem is Facebook has apparently redesigned its ad-serving so thoroughly, constantly shifting how ads are embedded and rendered, that the blocker's usual detection tricks keep breaking almost as fast as they're written, turning it into a losing game of whack-a-mole. It matters because it shows how a large platform can effectively out-engineer the tools people rely on for privacy and a cleaner browsing experience, tilting the balance back toward advertisers.

Technical view

uBlock Origin filters ads primarily via cosmetic and network-level rules (EasyList-style selectors and request-blocking patterns) that identify ad-serving DOM elements or endpoints. According to the linked reports, Facebook has made server-rendered ad markup increasingly indistinguishable from organic content — randomizing class names, mixing ad and feed content into the same DOM structures, and changing implementation frequently enough that filter-list maintainers can't keep pace without high false-positive rates that break the site. This is a notable case study in the adversarial dynamic between content platforms and blocklist-based extensions; anyone building a filter-list or anti-adblock countermeasure can look at Facebook's approach as an example of obfuscation-by-design rather than a single clever trick.

Hacker News · 269 ptsBuildable

WorldClaw Agentic 3D open-world generation at scale

AI agents that dream up entire explorable 3D worlds on their own.

WorldClaw is a system that uses AI 'agents' — software that can make its own decisions and take multi-step actions — to automatically generate large, open 3D worlds, the kind you'd walk around in a video game. Instead of a team of artists hand-building every building, landscape, and object, the idea is that AI agents plan and construct a coherent world at scale, filling it with structure and detail based on some starting description or goal. The 'how' involves chaining together generation steps — likely layout planning, then object placement, then detailing — with agents that can check and revise their own work as they go, rather than generating a whole world in one shot. It matters because building open, explorable virtual environments is normally one of the most labor-intensive parts of game and simulation development, and automating it could unlock far bigger and cheaper virtual worlds.

Technical view

WorldClaw applies an agentic pipeline to procedural 3D open-world generation, where AI agents iteratively plan, generate, and refine world layout, terrain, and object placement rather than relying on a single end-to-end generative model pass. This suggests a hierarchical approach — likely combining a planning/reasoning agent (deciding what goes where at a high level) with generation modules (producing meshes, terrain, or scene graphs) and a feedback loop for coherence and scale. For practitioners in game dev or simulation, the interesting angle is the 'agentic' framing itself: using LLM-style agents as orchestrators over traditional procedural-generation or 3D-asset tools to achieve world-scale consistency that pure diffusion-based 3D generation struggles with.

Hacker News · 257 ptsBuildable

Nvidia Nemotron 3.5 Lightning and NeMo Switchyard

Nvidia's newest AI models are built for speed, plus a system to route between them.

Nemotron is Nvidia's family of AI language models, and 'Lightning' is a new fast, lightweight version aimed at quick responses rather than maximum reasoning power. Alongside it, NeMo Switchyard is a tool for managing multiple AI models at once — like a smart dispatcher deciding which model should handle which request, whether that's the fast Lightning model for simple questions or a bigger, slower model for hard ones. This matters because running AI at scale isn't just about having one great model; it's about intelligently balancing cost, speed, and quality across many models depending on the task, and Nvidia is building infrastructure to do that automatically. It's part of Nvidia's push to be not just the hardware behind AI but also the software layer that companies use to deploy it.

Technical view

Nemotron 3.5 Lightning is a lower-latency, likely smaller-parameter variant in Nvidia's Nemotron model family, optimized for throughput and cost efficiency over raw benchmark-topping capability. NeMo Switchyard appears to be an orchestration/routing layer within Nvidia's NeMo framework for dynamically dispatching inference requests across multiple models (e.g. by task complexity or SLA requirements), analogous to model-routing systems seen elsewhere in the industry. Practitioners deploying multi-model inference stacks could use Switchyard to implement cost-aware routing policies, pairing Lightning for high-volume simple queries with larger Nemotron variants for complex reasoning, all within Nvidia's existing NeMo/Triton deployment tooling.

Hacker News · 254 ptsRunnable

Show HN: Woxi - Open-source Mathematica / Wolfram Language reimplementation

A free, Rust-built clone of Mathematica that starts in milliseconds and runs in your browser.

Wolfram Language (the engine behind Mathematica) is a powerful but expensive, proprietary tool for symbolic math, plotting, and computation. Woxi is an open-source reimplementation of that language written in Rust, meaning anyone can use it for free instead of paying for Mathematica. The clever part is how it's delivered: as a command-line tool, a Jupyter notebook plugin, a Python or npm package, or even compiled to WebAssembly so it runs directly inside a web page. It also starts up almost instantly (milliseconds instead of the several seconds Mathematica's kernel takes), which makes it practical for quick scripts and one-off calculations rather than just big interactive sessions.

Technical view

Woxi is a from-scratch Wolfram Language interpreter in Rust, paired with an iced-based GUI (Woxi Studio) and multiple embedding targets: CLI, Jupyter kernel, Python package, npm package, and a WASM module for browser execution. Its main selling points versus wolframscript/Mathematica are open licensing, near-instant startup (ms vs. seconds for the Wolfram kernel), and embeddability as a scripting language inside other applications. The project tracks language conformance against real Wolfram Language semantics, so practitioners can evaluate it as a lightweight, scriptable substitute for symbolic computation, automation, or teaching contexts where a full Mathematica license or kernel startup cost is prohibitive.

Hacker News · 253 ptsConceptual

Why tiny JPEGs look different in Chrome

Your tiny JPEG icon looks subtly different in Chrome than everywhere else — here's the rendering quirk why.

JPEG images save space by throwing away color detail the human eye barely notices, a trick called compression, but this can cause visible side effects when images are very small, like favicons or thumbnails. Different web browsers each have their own internal pipeline for decoding and scaling images, including how they handle color and sharpness, so the exact same JPEG file can come out looking slightly blurrier, darker, or differently colored depending on which browser opens it. This piece digs into what Chrome specifically does differently in that pipeline. It matters most to designers and developers who care about pixel-perfect small images and get confused when the same file looks inconsistent across browsers.

Technical view

The piece examines discrepancies in how Chrome's image decoding and scaling pipeline (built on the Skia graphics library) renders very small JPEGs compared to other browsers, likely touching on chroma subsampling (e.g., 4:2:0 color downsampling), gamma-correct vs. naive resampling, and color profile (sRGB) handling during downscale. These pipeline choices become visually significant at tiny dimensions where a handful of pixels carry disproportionate visual weight. Anyone shipping small compressed assets (favicons, sprites) can use this to understand and work around cross-browser rendering inconsistencies, e.g., by pre-scaling assets or avoiding aggressive JPEG compression for very small images.

Hacker News · 236 ptsConceptual

What sort of maths are LLMs good at?

Turns out large language models are surprisingly picky about which kinds of math they're actually good at.

Large language models (LLMs) like ChatGPT generate answers by predicting likely word patterns, which is very different from how a calculator or a human mathematician actually computes things. This raises the question of exactly which types of math problems they handle well versus where they quietly fail or hallucinate an answer. The likely approach is testing models across a spread of math tasks — simple arithmetic, algebra, geometry, formal proofs, competition-style problems — to map out a rough boundary between what LLMs reliably get right and where they falter. This matters because as people increasingly lean on AI for tutoring, research, or quick calculations, knowing where to trust it (and where to double-check) is essential.

Technical view

The piece surveys LLM performance across categories of mathematics, likely distinguishing pattern-matchable or language-adjacent tasks (informal proof sketches, word problems, symbolic manipulation with common structure) from tasks requiring precise multi-step numeric computation or novel formal reasoning, where models are more prone to error without external tools. Expect discussion of how techniques like chain-of-thought prompting or tool-augmentation (calculators, code execution) shift the boundary of reliable performance. Practitioners building math-adjacent AI applications can use this to decide where to trust raw model output versus routing to verified computation or symbolic solvers.

Hacker News · 235 ptsConceptual

Tim King, AmigaDOS developer, has died

A key builder of the Amiga's beloved operating system, AmigaDOS, has passed away.

AmigaDOS was the operating system that powered Commodore's Amiga computers, machines celebrated in the 1980s and 90s for pioneering multitasking and multimedia capabilities years ahead of their time. Tim King was one of the developers behind that system, contributing to software that let ordinary users run several programs at once on modest 1980s hardware, a big technical feat back then. This is a tribute marking his death and reflecting on that legacy. It matters as a moment of remembrance for a figure who helped shape an influential, fondly-remembered chapter of personal computing history.

Technical view

AmigaDOS was derived from the Tripos operating system and provided preemptive multitasking on Motorola 68k-based Amiga hardware at a time when most consumer computers were single-tasking, making it a notable technical achievement in OS design. Tim King contributed to this codebase during Commodore's Amiga era. The post is a retrospective/obituary rather than a technical release, useful primarily for those interested in the history of multitasking OS design and the Amiga platform's engineering culture.

Hacker News · 229 ptsConceptual

Someone is running mass vulnerability scans, spoofing AI bots like ClaudeBot

Attackers are faking Anthropic's web-crawler identity to sneak vulnerability scans past site defenses.

Legitimate AI companies run bots (like Anthropic's ClaudeBot) that crawl websites to gather training data, and many sites choose to allow these bots through their security filters. Someone appears to be exploiting that trust by spoofing the identifying label these bots send — essentially lying about who they are — so that mass automated scans probing sites for security weaknesses slip past defenses that would normally block or rate-limit unknown scanners. This matters because it shows a blind spot: simply trusting a bot's self-reported name isn't enough, and security teams need better ways to actually verify traffic really comes from the company it claims to.

Technical view

The report describes attackers spoofing the User-Agent (and possibly other headers) associated with known AI crawlers such as ClaudeBot to bypass allowlist rules or rate limits during mass automated vulnerability scanning. Since User-Agent strings are trivially forgeable, this undermines security postures that grant AI crawlers blanket trust without corroborating signals like reverse-DNS lookups against published IP ranges or cryptographic verification. Defenders can mitigate by validating crawler identity via IP/ASN allowlists or reverse-DNS checks rather than header content alone, and by auditing logs for traffic claiming bot identity from unexpected IP ranges.

Hacker News · 212 ptsConceptual

CFTC declares market emergency, orders Kalshi to continue to operate in New York

Federal regulators just overrode New York to keep a controversial prediction-market app running.

Kalshi is a platform where people can trade on the outcome of real-world events — essentially a regulated betting market dressed up as financial contracts — and it's been fighting with several states, including New York, who argue this amounts to illegal gambling under state law. The CFTC, the federal agency that oversees commodity and derivatives trading, declared an emergency and ordered Kalshi to keep operating in New York anyway, asserting that federal rules should override the state's objections. This matters because it's a high-stakes turf battle over who gets to regulate this fast-growing category of prediction markets — federal financial regulators or state gambling authorities — with implications for whether these platforms can operate nationwide.

Technical view

The CFTC invoked emergency authority to order Kalshi, an event-contract exchange it regulates under the Commodity Exchange Act, to continue operating in New York despite the state's gaming regulators treating it as unlawful gambling. This escalates an ongoing federal preemption dispute over whether CFTC-regulated event contracts fall outside state gambling law. The outcome will likely shape precedent for how prediction-market platforms navigate conflicting federal/state jurisdiction and could affect similar platforms' ability to operate across state lines.

Hacker News · 195 ptsConceptual

US hires over 2k video gamers as air traffic controllers

The FAA is betting that thousands of video gamers have the reflexes to guide airplanes safely.

Air traffic controllers need to track multiple moving objects, make split-second decisions, and stay calm under pressure — skills that overlap surprisingly well with what serious video gamers practice for hours. Facing a well-documented shortage of controllers, the US has recruited over 2,000 gamers into training pipelines, essentially treating gaming experience as a meaningful signal of aptitude for the job rather than a red flag. This matters because it's a practical, unconventional fix for a critical staffing crisis in aviation safety, and it reflects a broader shift toward recognizing gaming skill as transferable to high-stakes real-world work.

Technical view

The initiative recruits gamers at scale (2,000+) into the FAA's air traffic controller pipeline, presumably screening or sourcing candidates partly based on demonstrated reflexes, spatial reasoning, and multitasking ability honed through gaming, then routing them through standard controller training and simulator-based aptitude testing. This addresses a persistent controller staffing shortfall. It's notable as a case study in using non-traditional applicant pools and possibly simulator/game-based aptitude screening for safety-critical operational roles.

Hacker News · 189 ptsBuildable

What I learned by putting GitHub Copilot behind a MitM proxy

A developer cracked open GitHub Copilot's encrypted traffic to see exactly what it secretly sends and receives.

GitHub Copilot is an AI coding assistant, but like most closed-source tools, you can't normally see what data it's sending to its servers or exactly how it builds its suggestions — that's all hidden inside encrypted traffic. The author used a technique called a man-in-the-middle (MitM) proxy, which sits between your computer and the internet and, with a bit of setup, decrypts and displays that traffic so you can read it in plain text. By doing this, they could observe things like what code context gets sent, what telemetry is collected, and roughly how completions get requested and returned. This matters for anyone curious about privacy, data handling, or simply how these AI coding tools actually work under the hood, rather than trusting the marketing description.

Technical view

The author set up a MitM proxy (installing a trusted root certificate to intercept TLS) to decrypt and inspect GitHub Copilot's network requests and responses in real time, revealing implementation details normally invisible from the client side — likely including prompt/context payloads sent to Copilot's backend, telemetry data collection, and the structure of completion requests. This is a straightforward reverse-engineering technique replicable with tools like mitmproxy or Burp Suite against any TLS-based client. It's useful for developers or security researchers auditing what proprietary dev tools transmit, verifying vendor privacy claims, or understanding token/context-window usage patterns in practice.

Hacker News · 186 ptsConceptual

Facebook ads are so hard to block that uBlock Origin stopped filtering them

Facebook's ads got so deeply woven into the site that the top ad-blocker gave up fighting them.

uBlock Origin is the most popular free browser tool for stripping ads and trackers out of web pages before they load. Facebook has apparently made its ads nearly indistinguishable from real posts in the code sent to your browser, so blocking one risks breaking the whole feed. Rather than keep patching a losing battle, the extension's maintainers dropped the Facebook-specific ad rules. It's a small case study in how platforms can out-engineer ad blockers by making ads structurally identical to real content.

Technical view

uBlock Origin relies on cosmetic and network-request filter lists (like EasyList) to identify and hide ad DOM elements or block ad-serving requests. Facebook appears to have converged the markup/DOM structure and request patterns of sponsored posts with organic content closely enough that maintaining reliable, false-positive-free filters became untenable, so maintainers removed the dedicated Facebook ad-filtering rules rather than risk breaking the feed. This illustrates an arms-race dynamic where platforms can defeat pattern-based ad blocking simply by eliminating structural signals blockers depend on, rather than via anti-adblock scripts. Anyone maintaining filter lists or building blocking tools should note that DOM-based heuristics are increasingly fragile against first-party ad rendering.

Hacker News · 183 ptsConceptual

The Human Is the Loop

A meditation on what's left for people to do once AI can do the rest.

This piece flips the usual "human-in-the-loop" framing — where a person double-checks an AI's work — and asks what it means when the human becomes the actual loop, the thing keeping a process going by making judgment calls machines can't. It's likely an essay about AI-assisted work (coding, writing, research) and where human oversight, taste, or responsibility still has to sit even as automation handles more of the mechanics. Without more detail, expect a thought piece rather than a technical report. It matters because as AI tools take over more rote work, deciding exactly where humans stay essential is one of the big open questions.

Technical view

The title plays on the standard "human-in-the-loop" (HITL) framing from ML systems design, inverting it to suggest the human is the control loop itself rather than a periodic checkpoint within an automated one. It's likely relevant to practitioners designing AI-assisted workflows (agentic coding, review pipelines) who must decide which decision points require human judgment versus which can be delegated to a model. Given only the title, no specific method or result can be confirmed — treat this as an essay/opinion piece rather than an empirical contribution.

Hacker News · 179 ptsBuildable

Making holograms with a pen plotter

A hobbyist draws light itself, turning a cheap pen plotter into a hologram maker.

Holograms are usually made with lasers and specialized optics, but this project explores making them with a pen plotter — the same kind of machine that draws pictures with a physical pen on paper. The trick is that holograms don't strictly need photographic film; you can approximate the interference patterns that create a 3D image by physically scratching or drawing fine lines in the right geometric pattern, since it's really about controlling how light bounces off tiny ridges. The "how" is precise, repeatable mechanical drawing of closely spaced curves calculated to scatter light the way a real hologram would. It's a fun demonstration that some of optics' fanciest effects can be reproduced with cheap, everyday tools if you understand the underlying math.

Technical view

This is a DIY take on "scratch holography" or diffraction-grating imagery, using an XY pen plotter to physically inscribe closely-spaced arcs or lines on a reflective surface rather than exposing photographic film with laser interference. Each line acts as a tiny cylindrical diffraction element; by computing and plotting many overlapping arcs whose curvature encodes depth/parallax cues, the surface reconstructs a rough 3D image under point-source lighting. Replication requires a plotter with fine positioning resolution, a reflective medium (foil, plastic, or scored acrylic), and software to generate the arc geometry from a target 3D point cloud. It's a low-cost, laser-free entry point into holography/diffraction-optics experimentation for makers.

Hacker News · 169 ptsRunnable

LFM2.5 2.6B model competitive with 4x larger models

A tiny 2.6-billion-parameter AI model now punches like ones four times its size.

Large language models usually need to be huge to be smart, which makes them slow and expensive to run — especially on phones or laptops instead of big data centers. LFM2.5 is a new, compact model with 2.6 billion parameters (roughly, its size and capacity) that its makers claim performs as well as models about four times larger. That's achieved through better training techniques and architecture choices rather than just brute-force scale, squeezing more capability out of fewer parameters. This matters because smaller-but-smart models can run locally on everyday devices, cutting cost and latency for real applications.

Technical view

LFM2.5 is a 2.6B-parameter model claimed to match or approach the performance of models around 4x its parameter count on relevant benchmarks. Results like this typically come from architectural efficiency (e.g., hybrid attention/state-space or convolutional blocks), improved data curation, or distillation/training-recipe advances rather than raw scale. For practitioners, a competitive sub-3B model is attractive for edge and on-device deployment (mobile, embedded, low-latency inference) where memory and compute are constrained. Anyone evaluating it should check the specific benchmark suite behind the "4x larger" comparison before treating the claim as general-purpose superiority.

Hacker News · 167 ptsConceptual

Manus will return to operating as an independent company

The AI agent startup Manus is splitting off to run on its own again.

Manus is an AI "agent" product that made waves for autonomously completing multi-step tasks online, and it had been operating under a parent company's umbrella. This news is that it's becoming an independent company again — essentially a corporate restructuring or spin-off. For everyday readers, this is more business news than technical news: it signals confidence that the product can stand on its own, attract its own funding, and set its own direction rather than being just a feature of a bigger company. It matters for anyone tracking the fast-moving AI agent startup space and who might acquire, fund, or compete with these products next.

Technical view

Manus, the AI agent platform known for autonomous multi-step task execution (web browsing, tool use, file generation), is reportedly reverting to independent-company status after being under a parent organization. No technical details are given in the title; this is a corporate structure/governance change rather than a product or model update. Practitioners tracking the agent-startup landscape should watch for accompanying changes in funding, team, product roadmap, or API terms that often follow such spin-offs. No further technical claims can be inferred from the title alone.

Hacker News · 165 ptsRunnable

Delphi 13 Community Edition Is Now Available

Embarcadero's free version of the veteran Delphi programming tool gets its 13th release.

Delphi is a decades-old programming language and development environment, still used for building desktop and some mobile apps with a drag-and-drop visual interface. The "Community Edition" is a free version aimed at students, hobbyists, and small businesses who can't afford or don't need the full commercial license. This release, version 13, is simply the latest free build becoming available for download, presumably carrying whatever bug fixes and features shipped in the paid version. It matters mainly to the smaller but loyal community of developers who still maintain or build software in Delphi.

Technical view

Delphi is Embarcadero's Object Pascal-based RAD (rapid application development) IDE, and the Community Edition is a free, functionally-limited license tier (typically capped by revenue/team size) tracking the commercial release. Version 13 presumably ships the same compiler, VCL/FireMonkey framework updates, and IDE improvements as the corresponding paid release, gated by CE license terms (revenue thresholds, no enterprise support). Developers building cross-platform desktop/mobile apps in Object Pascal can download it directly to evaluate or maintain legacy Delphi codebases without a commercial license, subject to Embarcadero's CE eligibility rules. No specific new language or compiler features are stated in the title.

Hacker News · 163 ptsRunnable

Show HN: Git-knife – Edit commit messages, authors, and dates like a spreadsheet

Rewrite your messy git history in a spreadsheet instead of scary rebase commands.

Git keeps a permanent log of every code change, including who made it, when, and what they wrote as a description — but fixing mistakes in that history (a typo'd name, a wrong date, an embarrassing commit message) normally requires intimidating command-line tools like interactive rebase. Git-knife instead shows your commit history as rows in a spreadsheet-like grid, where you can click into a cell and edit the message, author, or date directly. Under the hood it still has to rewrite the underlying git history correctly and safely, but the interface hides that complexity. This matters because it makes a genuinely error-prone, expert-only git operation approachable for ordinary developers.

Technical view

Git-knife provides a spreadsheet/table UI over git commit metadata, letting a user directly edit commit message, author, and date fields for a range of commits and then commit those edits as a history rewrite. It's functionally an ergonomic front-end for what `git rebase -i` combined with `--amend`, `git filter-branch`, or `git filter-repo` would otherwise accomplish via scripted, error-prone command sequences. Since editing any commit rewrites its hash and every descendant's hash, expect it to perform a full rebase under the hood and to require force-pushing shared branches with the usual collaboration caveats. It's most useful for cleaning up local/feature-branch history (fixing authorship, squashing typos) before opening a PR, similar in spirit to GUI rebase editors but generalized to spreadsheet editing.

Hacker News · 163 ptsConceptual

How we used to get jobs: A newspaper classifieds story

Before LinkedIn, job hunting meant scanning tiny newspaper ads with a highlighter.

This is a history piece about how people used to find jobs before the internet — by reading classified ad sections in daily newspapers, where employers paid to run short, dense listings organized by category. Job seekers would scan pages of tiny print, circle promising ones, and respond by mail, phone, or showing up in person, a process far slower and more limited in reach than today's job boards. The story likely traces how this system worked day-to-day and how it eventually declined as sites like Craigslist and LinkedIn took over. It's a nostalgic lens on how much friction — and how much local, human editorial curation — used to sit between people and employment.

Technical view

This is a historical/journalistic retrospective on print newspaper classified advertising as the primary job-search channel prior to internet job boards, rather than a technical piece. It likely covers the economics of classifieds (once a major newspaper revenue line before Craigslist disrupted it), the format conventions of job listings, and the shift in labor-market information distribution from print/local to digital/global search and aggregation. For readers interested in media economics or the history of information markets, it's a useful case study in how a single distribution channel's collapse reshaped an entire industry and search behavior. There's no technical methodology to replicate; the value is narrative/historical context.

Hacker News · 161 ptsConceptual

Worms: The Future of Yesterday's Worms Today

A playful ode to the lowly earthworm — nature's original recycling engineer.

This piece takes a lighthearted look at worms, the squishy, segmented creatures most people ignore or squirm away from. It's really about how something so simple has quietly shaped soil, agriculture, and ecosystems for millions of years by breaking down dead matter and aerating the ground. The 'approach' here is more storytelling than science experiment — reframing a mundane creature as something worth a second look. It matters because the tiniest, least glamorous parts of nature often do the heaviest lifting for the systems we depend on.

Technical view

Without a fuller abstract, the piece reads as an essayistic reflection on annelid worms rather than a research report — likely touching on their ecological role in decomposition, soil structure, and nutrient cycling. Worms remain a live area of study in soil science and vermiculture (worm composting), and in synthetic biology as simple model organisms (e.g., C. elegans, though that's a nematode, not an earthworm). A reader interested in going deeper would look to soil ecology literature or composting/vermiculture guides rather than expecting a technical breakthrough here.

Hacker News · 159 ptsConceptual

U of Michigan drops first-semester grades to ‘curb mental health crisis’

Michigan hides freshman grades for a semester to ease students into college life.

The University of Michigan is changing how new students experience their first semester by not showing them their grades right away. The idea is that the shock of unfamiliar workloads, competitive classmates, and a new environment often sends first-year students into anxiety or depression, and constant grade-checking makes it worse. By removing that immediate feedback loop — students still do the work and get evaluated, they just don't see the letter grades — the university hopes people can focus on actually learning and adjusting rather than obsessively tracking a number. It's part of a broader trend of colleges rethinking how academic pressure contributes to a documented rise in student mental health problems.

Technical view

This is a policy change, not a technical one: the university appears to be withholding or delaying visibility of first-semester grades (likely still recorded internally, possibly with pass/fail or ungraded transcript notation) rather than eliminating assessment altogether. Similar approaches exist elsewhere as 'grace semesters' or pass/fail-first-term policies aimed at reducing GPA-driven stress during the transition period. The underlying claim connects grading transparency/frequency to mental health outcomes, an area studied in higher-ed psychology research, though the piece itself is a news report rather than a study.

Hacker News · 155 ptsConceptual

High-Res Photo Shows Sand-Capped Butte Rising from Mars Plain of Polygons

A dusty hill juts from a Martian plain cracked into giant honeycomb-like polygons.

This is a high-resolution photo from a Mars orbiter showing a butte — basically a small, steep-sided hill — capped with sand, standing above a flat plain covered in strange polygon-shaped cracks. Those polygons form the same way mud cracks do on Earth, but on Mars they're thought to come from underground ice expanding and contracting with temperature swings, splitting the ground into a tiled pattern. The butte itself is likely a leftover chunk of harder material that resisted erosion while the softer ground around it wore away. Images like this matter because they're clues to where water or ice existed on Mars, which shapes the hunt for past habitability.

Technical view

The image almost certainly comes from HiRISE (High Resolution Imaging Science Experiment) aboard the Mars Reconnaissance Orbiter, capable of resolving surface features down to roughly 25–30 cm per pixel. The polygonal patterned ground is consistent with thermal contraction cracking in ice-rich permafrost — analogous to periglacial polygon terrain on Earth — while the butte represents an erosional remnant, likely armored by a more resistant sand or duricrust cap that slowed weathering relative to the surrounding plain. Researchers use such imagery to map subsurface ice distribution and reconstruct the region's geomorphic history.

Hacker News · 153 ptsRunnable

A shell exclamation mark is not for yelling. Be lazy

That '!' in your terminal isn't shouting — it's a shortcut for typing less.

Most people think of an exclamation point as punctuation for excitement, but in a Unix shell like bash it's actually a command for 'history expansion' — a way to reuse things you've already typed instead of retyping them. For example, typing '!!' re-runs your last command, and '!$' grabs the last word from your previous command, which is handy when you forgot 'sudo' or want to reuse a filename. The 'approach' is just learning a handful of these shorthand patterns baked into the shell itself, no extra software needed. It matters because it turns tedious repetitive typing into a couple of keystrokes, which adds up fast for anyone living in a terminal.

Technical view

The article covers bash/zsh history expansion syntax: event designators like '!!' (previous command), '!n' (command number n), '!-n' (n commands back), and '!string' (most recent command starting with string), combined with word designators like '!$' (last argument), '!^' (first argument), and '!*' (all arguments). It likely also covers quick substitution via '^old^new^' and safety options like histverify to preview expansions before they execute. A practitioner can try these immediately in any bash/zsh session — no installation required, just muscle memory.

Hacker News · 144 ptsBuildable

HTML over WebSockets: real-time SPAs with barely any JavaScript

Skip the JavaScript framework — just stream HTML straight to the browser over a socket.

Modern web apps are usually built by sending raw data (JSON) to the browser and having a big pile of JavaScript turn that data into visible page updates — that's how frameworks like React work. This approach flips it around: the server does the work of building the actual HTML, and pushes finished HTML snippets to the browser over a WebSocket, a connection that stays open so updates can arrive instantly without reloading the page. The browser just needs a tiny bit of code to slot the new HTML into the right place. It matters because it means real-time features — live chat, dashboards, notifications — can be built with far less JavaScript and far less complexity than a typical single-page app.

Technical view

This describes a server-driven UI pattern in the vein of Phoenix LiveView, htmx, or Hotwire Turbo Streams: the server holds application state, renders HTML fragments on state change, and pushes them down a persistent WebSocket connection; a thin client-side runtime (often a DOM-diffing/morphing library) patches the existing DOM rather than re-rendering the whole page. This avoids shipping a client-side virtual DOM or state-management stack, at the cost of coupling UI updates to server round-trips and connection reliability. It's a solid pattern to replicate for internal tools, dashboards, or chat apps where reducing client complexity matters more than offline-capable rich interactivity.

Hacker News · 142 ptsRunnable

Shade Map

A map that shows you exactly where sun and shadow fall at any hour, any day.

Shade Map is an interactive online map that shows where sunlight and shadows actually land on real streets and buildings, at any date and time you pick — including future dates. It works by combining real building-height data with the astronomy of where the sun sits in the sky at a given moment and location, then casting virtual shadows from every building accordingly. You can drag a time slider and watch shadows sweep across a neighborhood exactly like they would in real life. It's genuinely useful for things like picking a shaded picnic spot, planning where to put solar panels, or checking if a new building will block a neighbor's sunlight.

Technical view

The tool overlays computed shadow geometry on standard map tiles by combining building-footprint and height data (likely derived from OpenStreetMap or similar sources) with solar position algorithms (azimuth/elevation as a function of date, time, and latitude/longitude) to ray-cast shadow polygons in real time, most plausibly rendered client-side via WebGL for interactive performance. Developers interested in the underlying technique would look at solar position formulas (e.g., NOAA's solar calculator equations) paired with 3D building extrusion and shadow-casting logic similar to what's used in game engines and GIS tools like CesiumJS.

Hacker News · 129 ptsBuildable

CSS properties you should know for better text designs

A few overlooked CSS properties turn cramped, ragged text into something that reads beautifully.

Web text often looks worse than it needs to because of small typographic details most developers never touch — like awkward line breaks, ugly leftover single words at the end of a paragraph, or straight quotation marks that don't hang neatly outside the text margin. This piece rounds up newer CSS properties that fix exactly those problems: things that automatically balance headline line lengths, prevent orphaned words, let punctuation marks tuck outside the margin so text edges look cleaner, and fine-tune spacing and hyphenation. The approach is simply flipping on these built-in browser features rather than hand-tweaking text with extra markup or JavaScript. It matters because good typography makes reading effortless, and now it's achievable with a few lines of CSS instead of custom hacks.

Technical view

Likely covered properties include text-wrap: balance (evens out line lengths in headings), text-wrap: pretty (avoids single-word orphan lines in body text), hanging-punctuation (lets quotes/punctuation sit outside the text box edge), hyphens: auto (language-aware automatic hyphenation, requires a lang attribute), and possibly text-box-trim / text-box-edge for precise control over leading whitespace around glyphs, along with font-variant-numeric for tabular figures. These are modern CSS Text Module Level 4 features with varying browser support, so a practitioner should check caniuse.com and provide fallbacks before relying on them in production.

Hacker News · 129 ptsConceptual

To save C, we must save ABI (2022)

C's real fragility isn't the language — it's the shaky handshake between compiled binaries.

When you compile a C program, the resulting machine code has to agree with other compiled code (like libraries) on things like how data is laid out in memory and how functions pass arguments — that agreement is called the ABI, or application binary interface. This piece argues that C's slow, cautious evolution isn't really about the language's syntax being hard to improve; it's that any change risks breaking that low-level compatibility contract, since so much existing software silently depends on it staying exactly the same. The 'approach' isn't a new tool but a call to treat ABI stability and evolution as seriously as the language spec itself, rather than as an afterthought. It matters because C sits underneath enormous amounts of critical software, and until its ABI story is taken seriously, the language stays stuck, unable to safely add features that could otherwise make it safer and more capable.

Technical view

The essay argues that C's practical evolution is bottlenecked less by WG14 language-design debates than by the lack of a rigorously specified, versioned ABI — struct layout, calling conventions, and symbol versioning are largely left to platform/compiler convention (e.g., the System V ABI) rather than the standard itself, making any change to core types or library interfaces a compatibility minefield. The author (writing as thephd, an active WG14 participant) advocates for treating ABI as a first-class, evolvable artifact — with mechanisms like ABI tagging/versioning and compiler-vendor commitments — so language and library improvements don't get vetoed purely on binary-compatibility fears. Readers wanting to go deeper should look at WG14 papers on ABI and existing prior art like Rust's approach to unstable ABI or the ELF symbol versioning system.

Hacker News · 113 ptsConceptual

Launch HN: Discovered Materials (YC P26) – AI agents to discover new materials

AI agents hunt for new materials to stop GPUs from cooking themselves alive.

Discovered Materials builds AI agents whose job is to find brand-new materials for chipmaking, tackling a growing problem: every new generation of AI chip runs hotter, with Nvidia's latest designs projected to throw off over 2 kilowatts of heat by 2026. The materials used to build a chip — for wiring, insulation, and packaging — determine both how much heat it generates and how well that heat escapes, so better materials mean cooler, more efficient chips. Instead of the traditional slow trial-and-error of materials science, their AI agents search through possible material combinations computationally to find promising candidates faster. This matters because keeping data centers cool already burns huge amounts of electricity and water, and the problem is only getting worse as chips get hungrier for power.

Technical view

The company targets thermal-management materials for semiconductors, motivated by TDP roughly doubling per generation (H100: 700W, Blackwell: 1.2kW, projected Rubin: 2.3kW), which drives datacenter cooling power and water demand. Their pitch is AI agents that automate materials discovery — likely combining simulation (e.g. DFT-style property prediction), ML surrogate models, and literature/experiment search to screen candidates for properties like thermal conductivity or interfacial resistance faster than manual R&D. As a YC-backed startup, practitioners in materials informatics or semiconductor packaging could watch for their tooling or dataset outputs as a potential integration point for computational materials screening pipelines.

Hacker News · 108 ptsConceptual

People who grew up with high economic connectedness earn more

Who your childhood friends were may predict your adult paycheck.

This refers to research on "economic connectedness" — essentially, how many friendships a person has that cross income lines, especially whether lower-income kids have friends who are better off. Researchers measure this using large-scale social network data (like anonymized friendship patterns from social media) rather than surveys, letting them study millions of people at once. The finding is that people who grew up more connected to higher-income peers tend to earn more as adults, suggesting these cross-class friendships open doors — job leads, role models, information — that pure neighborhood income or school quality don't fully capture. It matters because it reframes economic mobility as partly a social-network problem, not just a money or education problem.

Technical view

This builds on the "economic connectedness" metric popularized by Chetty et al.'s Social Capital I/II papers (Nature, 2022), which used de-identified Facebook friendship data to quantify cross-income-class social ties at the individual and ZIP-code level. The core empirical claim is that childhood economic connectedness is one of the strongest predictors of upward income mobility, outperforming other social capital measures like civic engagement or cohesion. Practitioners in social science or policy could access the underlying Social Capital Atlas dataset from Opportunity Insights to replicate or extend this as a covariate in mobility or inequality models.

Hacker News · 107 ptsConceptual

German advocacy group lodges criminal complaint over Meta AI glasses

A watchdog group says Meta's smart glasses may be quietly breaking privacy law.

A German consumer or privacy advocacy group has filed a criminal complaint against Meta over its AI-powered smart glasses, the kind with a built-in camera and AI assistant (like the Ray-Ban Meta glasses). The concern is that these glasses let wearers record or analyze people around them — faces, conversations, surroundings — without those bystanders' knowledge or consent, which can run afoul of strict privacy and recording laws. Filing a criminal complaint (rather than just a lawsuit) signals the group believes this crosses into actual illegal surveillance, not just a policy gray area. It matters because it's an early test case for how far AI-augmented wearables can go before regulators or courts push back.

Technical view

The complaint likely invokes German/EU legal frameworks such as GDPR (unlawful processing of third parties' biometric or personal data) and potentially Germany's criminal code provisions on unauthorized recording (§201 StGB covers non-consensual audio recording; image-rights protections add further exposure), alongside emerging EU AI Act concerns about real-time biometric processing. This sets a compliance precedent relevant to any company shipping camera-plus-AI wearables into EU markets, where bystander consent and data minimization requirements are far stricter than in the US.

Hacker News · 103 ptsConceptual

The lifesaving secret hidden inside a horseshoe crab's blue blood

An ancient sea creature's blue blood quietly keeps your vaccines and IV drugs safe.

Horseshoe crabs have blood that's blue instead of red because it uses copper instead of iron to carry oxygen. What makes it medically priceless is that their blood cells clot almost instantly around bacterial toxins, even in tiny, undetectable amounts — a built-in defense from living in bacteria-rich ocean mud for hundreds of millions of years. Pharmaceutical companies extract this blood (from crabs that are bled and then released) and use it as a super-sensitive test to make sure vaccines, IV fluids, and injectable drugs aren't contaminated before they reach patients. It matters both as a medical safety cornerstone and as a conservation issue, since demand for this blood puts pressure on wild crab populations, pushing researchers toward lab-made alternatives.

Technical view

The mechanism relies on hemocyanin (copper-based, giving the blue color) and, more specifically, amoebocytes whose clotting cascade — triggered when coagulogen is cleaved to coagulin — activates in the presence of bacterial lipopolysaccharide (endotoxin) at picogram-level sensitivity. This underlies the industry-standard LAL (Limulus Amoebocyte Lysate) assay used to test the sterility of injectable pharmaceuticals and medical devices. A synthetic alternative, recombinant Factor C (rFC), is now FDA- and European Pharmacopoeia-approved and is gradually displacing wild-harvested LAL, which practitioners in pharma QA/QC can adopt to reduce reliance on crab bleeding.

Hacker News · 102 ptsConceptual

Pixel Watch 5

Google's next smartwatch generation is here.

The Pixel Watch 5 is Google's newest smartwatch, the latest entry in its Wear OS lineup. Like its predecessors, it's likely aimed at everyday health tracking — things like heart rate, sleep, and fitness — plus smartphone notifications and apps on your wrist. Without more detail available, the key story is simply that Google continues to iterate on its watch hardware and software each year, competing with Apple Watch and Samsung's Galaxy Watch lineup. It matters to anyone shopping for a wearable or tracking how Google's hardware ambitions are evolving.

Technical view

As a successor product, the Pixel Watch 5 presumably updates internals (SoC, battery, sensor suite) and ships with the current Wear OS release, continuing Google's vertically-integrated hardware/software wearable strategy. Developers targeting Wear OS could evaluate new APIs or sensor capabilities exposed on this generation for health or fitness app development.

Hacker News · 102 ptsConceptual

Bluesky's active user base is shrinking as its focus expands beyond the app

Bluesky is spreading into new products while its core app loses users.

Bluesky, the decentralized Twitter-alternative social network, is reportedly seeing fewer people actively using its main app, even as the company behind it broadens its ambitions beyond just that one app — building out the wider AT Protocol ecosystem it runs on. This is a common growth-stage tension: chasing new features and platforms can mean less focus on keeping your existing core audience engaged. It matters because it's a real-time case study in whether a challenger social network can sustain momentum against giants like X and Threads once the initial hype fades.

Technical view

The piece likely tracks declining DAU/MAU figures for the flagship Bluesky app alongside the company's strategic pivot toward growing the broader AT Protocol ecosystem (third-party clients, feeds, and services built on the open protocol) rather than the single app. This is relevant to anyone building on or analyzing decentralized social protocols, where user retention metrics for the reference app don't necessarily capture protocol-wide adoption.

Hacker News · 100 ptsRunnable

Show HN: Write.md – A free, open-source, themeable Markdown editor for macOS

A free, themeable Markdown editor for Mac, built in the open.

Write.md is a new open-source app for Mac that lets you write in Markdown — a simple text format that turns plain symbols like asterisks into bold or italic text — with the bonus that you can customize its look with different themes. It's free and its source code is public, meaning anyone can inspect, modify, or contribute to it. This kind of tool appeals to writers, note-takers, and developers who want a lightweight, distraction-free place to draft text without the bloat of a full word processor. It matters as part of a broader trend of small, open, personally-crafted tools built by independent developers and shared on Hacker News.

Technical view

Write.md is a native macOS Markdown editor, open-sourced and built with theming as a core feature, fitting the pattern of lightweight text editors (similar in spirit to iA Writer or Typora but free/open). Since it's open source, developers can fork the repo, extend the theme engine, or study its implementation as a reference for building similar native macOS text-editing tools.

Hacker News · 99 ptsRunnable

Glaciers on the Climate Dashboard

A climate dashboard now tracks glaciers as they shrink in near real time.

This refers to glacier data being added or highlighted on a climate-tracking dashboard — a visual tool that shows key indicators of climate change over time. Glaciers are one of the clearest visible signs of a warming planet: as global temperatures rise, most glaciers lose more ice each year than they gain, and scientists track this "mass balance" to monitor the pace of change. Putting glaciers on a public dashboard makes this abstract global trend tangible and trackable for a general audience, not just specialists. It matters because visual, updated climate data helps the public and policymakers see change happening rather than relying on occasional reports.

Technical view

This likely integrates standardized glacier mass balance data — such as records from the World Glacier Monitoring Service (WGMS) — into a dashboard as a tracked climate indicator alongside metrics like sea level or CO2 concentration. Practitioners building climate visualization tools could look at similar public data feeds (WGMS, NSIDC) as a reusable, standardized data source for glacier-related indicators.

Hacker News · 97 ptsRunnable

Pixel 11 Pro Fold

Google's next foldable Pixel unfolds into a mini tablet in your pocket.

The Pixel 11 Pro Fold is the newest entry in Google's line of foldable smartphones — phones with a flexible screen and a hinge that let the device open up into a larger, tablet-sized display. The problem it's aiming at is the classic phone-versus-tablet trade-off: people want a device small enough for a pocket but big enough for reading, watching video, or running two apps side by side. Google's approach is to keep refining the hinge mechanism, the flexible display, and the software so the fold feels sturdy and the transition between 'phone mode' and 'tablet mode' is seamless rather than gimmicky. It matters because foldables are one of the few genuinely new phone shapes in years, and Google using its own Pixel line to push the format signals it sees folding screens as a real long-term bet rather than a novelty.

Technical view

The Pixel 11 Pro Fold continues Google's foldable line, pairing a book-style flexible-OLED inner display with a smaller cover screen and an internal hinge assembly, running Android with fold-aware multitasking (split-screen, app continuity between the two screens). As the successor to prior Pixel Fold models, it would be expected to iterate on hinge durability, crease reduction, and the custom Tensor silicon Google uses to tune on-device AI features for its hardware. Anyone tracking the device should watch for Google's own announcement for confirmed specs (chip, display size, camera, price) rather than assuming carryover from earlier Fold generations. As a shipping consumer product, it's directly usable/testable once released rather than something to prototype from.

Hacker News · 95 ptsBuildable

My Agent Setup

A peek into how one person actually wires up AI agents to get real work done.

'My Agent Setup' is the kind of write-up where someone walks through the specific tools, prompts, and workflows they use to get AI coding or research agents to do useful work day to day — not just the theory, but the concrete configuration. The real-world problem it addresses is that AI agents are flexible but need a lot of scaffolding — which model to use, what permissions to grant, how to organize memory and instructions — before they're actually reliable helpers rather than novelties. The approach is typically practical and personal: sharing the exact setup (config files, favorite skills or plugins, habits around reviewing agent output) that worked for one person, so others can borrow or adapt it. It matters because as agentic AI tools spread, these hands-on 'here's what I actually do' accounts are often more useful than official docs for figuring out what a good setup looks like in practice.

Technical view

Posts titled 'My Agent Setup' typically detail a working configuration for an AI coding/research agent (e.g. Claude Code or similar): which model tiers are assigned to which tasks, custom instructions or memory files, permission and tool-access settings, and any custom skills, hooks, or subagents layered on top. The substantive value for a practitioner is usually the specific configuration choices and rationale (why a given model, why certain guardrails or automations) rather than a novel technique, so it's most useful as a template to fork and adapt to one's own workflow. Without the actual post content, the concrete tool list and settings can't be confirmed here — but the format is inherently replicable since it's describing a real, running setup.