\emph{which
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
\emph{Ab initio} derivation of the crystal field parameters for lanthanide ions: The f$^1$ case
arXiv:2511.18837v2 Announce Type: replace Abstract: The crystal field theory as explained by Abragam and Bleaney in their landmark 1970 book on transition-ion electron paramagnetic resonance remains a cornerstone in the development of luminescence applications and molecular magnets based on the $f$-elements. The modern numerical derivation of the 27 $B_k^q$ Stevens crystal field parameters (CFPs), which describe the splitting of the energy levels of a central ion, is traditionally achieved...
ClawXiv: a signed archival workflow and distributed publication architecture for human--AI collaborative research
arXiv:2604.16476v2 Announce Type: replace Abstract: We propose \emph{ClawXiv}, a workflow and archive architecture for mixed human--AI research. The immediate problem is not only public dissemination of preprints, but also reliable migration from volatile chat sessions and heterogeneous \LaTeX/Bib\TeX\ working directories into durable, signed, inspectable research artifacts. ClawXiv distinguishes four states: \emph{legacy seed}, \emph{normalized project}, \emph{signed bundle}, and...
DisFlow: Scene Flow from Distance Field for Object Pose, Velocity Tracking, and Dynamic Object Reconstruction
Announce Type: new Abstract: We present \emph{DisFlow}, a novel framework for online scene flow estimation from distance field that enables \emph{6DoF dynamic object pose estimation}, \emph{motion tracking}, and \emph{surface reconstruction}. The scene is represented by Gaussian Process Implicit Surfaces (GPIS), with surface normals serving as derivative constraints, enabling accurate signed distance computations near the surface and gradient queries with uncertainty. With this...
Regret Minimization with Adaptive Opponents in Repeated Games
arXiv:2606.06486v1 Announce Type: new Abstract: In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play. The standard metric of \emph{external regret} in online learning is known to fail to capture such adaptivity. To account for players' counterfactual reasoning, we introduce {\tt Repeated Policy Regret (RP-Regret)}, a game-theoretic metric that measures the difference between the \emph{realized} and the...
Beyond Outerplanarity
Announce Type: replace Abstract: We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes with convex drawings: \emph{outer $k$-planar} graphs, where each edge is crossed by at most $k$ other edges; and \emph{outer $k$-quasi-planar} graphs, where no $k$ edges can mutually cross. We show that the outer $k$-planar graphs are $\lfloor3.5\sqrt{k}\rfloor$-degenerate, and...
Perception First: A Frontier Native-Video Model with Self-Consistency for Implicit Video Question Answering
arXiv:2606.01485v1 Announce Type: new Abstract: We describe our submission to the VRR Challenge @ CVPR 2026, built on the \emph{ImplicitQA} / \emph{VRR-QA} benchmark~\cite{implicitqa}: multiple-choice video question answering in which answers are deliberately \emph{not} observable in any single frame and must be inferred from spatial layout, motion, depth, viewpoint, causality, and social context across discontinuous frames of creative video. We conduct a systematic, training-free study...
Revisiting the expressiveness of metric temporal logic : A tale of "Je t'aime, moi non plus."
Announce Type: replace Abstract: The expressiveness of Metric Temporal Logic (MTL) has been extensively studied throughout the last two decades. In particular, it has been shown that the \emph{interval-based} semantics of MTL is strictly more expressive than the \emph{pointwise} one. These results may suggest that enabling the evaluation of formulae at arbitrary time points \emph{instead of} positions of timed events increases the expressive power of MTL.
Extreme Points of the $(0,\delta)$-LDP Polytope with Small Input Size and Arbitrary Output Sizes
Announce Type: new Abstract: The structure of locally differentially private (LDP) mechanisms can be understood through the geometry of the corresponding privacy polytope. While the extreme points of the \( (\epsilon,0)\)-LDP polytope are well characterized (Kairouz \emph{et al.}, 2014; Holohan \emph{et al.}, 2017; Pensia \emph{et al.}, 2017), comparatively little is known for the \((\epsilon,\delta)\)-LDP polytope with \(\delta>0\). Recent work (Elangovan and Jog, 2024) has shown that even...
Maximum Matching and Related Problems in Catalytic Logspace
arXiv:2604.24275v2 Announce Type: replace Abstract: Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this area is that bipartite maximum matching can be computed in catalytic logspace with a polynomial-time bound, Agarwala and Mertz (2025). In this paper, we show that we can construct a \emph{maximum matching} in \emph{general graphs} in CL, and, in...
World-Language-Action Model for Unified World Modeling, Language Reasoning, and Action Synthesis
arXiv:2606.05979v1 Announce Type: new Abstract: We propose world-language-action (WLA) models as a new class of embodied foundation models. WLA takes textual instructions, images, and robot states as inputs to jointly predict textual subtasks, subgoal images, and robot actions, conjoining the \emph{world modeling interface} to learn from extensive egocentric videos as in the world-action model (WAM) and the \emph{language reasoning} capacities to solve complex long-horizon tasks as in...