https://goodboop.ai/ What’s climbing in AI, compilers, robots and math. https://arxiv.org/abs/2611.14516 https://arxiv.org/abs/2611.14516 2026-11-10 We present TorchCurves, a PyTorch library that treats vector-valued parametric curves as learnable primitives. Its central operation maps batches of scalar inputs to points on curves represented in B-spline or Legendre polynomial bases, with differentiation through both inputs and coefficients. Curve coefficients can be optimized jointly with the surrounding model or produced by another network. T https://arxiv.org/abs/2611.14515 https://arxiv.org/abs/2611.14515 2026-11-10 Reinforcement learning with verifiable rewards (RLVR) produces rich training experience, yet outcome rewards reduce each attempt to a single number and leave most of this information unused. Training-time scaffolds, such as strategies or hints added to the prompt during training, offer a natural way to turn this information into guidance, but their design and adaptation are largely left to humans https://arxiv.org/abs/2611.14514 https://arxiv.org/abs/2611.14514 2026-11-10 LLM agents are increasingly used for open-ended, data-driven scientific discovery, yet most of them evaluate hypotheses pointwise, testing an empirical claim $h$ only against its complement $\neg h$. When evidence rejects $h$, the agent learns that one explanation is unlikely but not which alternative the evidence supports. To recover that alternative, we introduce Contrastive Discovery, which rep https://arxiv.org/abs/2611.14204 https://arxiv.org/abs/2611.14204 2026-11-10 Scientific codes are under pressure to run on HPC machines shaped by AI workloads, without a rewrite every time the hardware moves. This paper looks at accelerating ICON microphysics and argues that starting from the scientific problem — not a double-precision reference binary — opens more room for performance-portable implementations. https://arxiv.org/abs/2611.14201 https://arxiv.org/abs/2611.14201 2026-11-10 Guarded Kleene algebra with tests can reason about programs with if and while, and it has a fast decision procedure. Real languages also have break and goto. CFGKAT adds that non-local control flow, and this paper gives it a sound, complete axiomatization of program equivalence — something the extra jumps made surprisingly hard. https://arxiv.org/abs/2611.14147 https://arxiv.org/abs/2611.14147 2026-11-10 Information-flow security tries to stop confidential data leaking through a program’s behavior. In quantum programs the state can be superposed or entangled, and execution mixes classical and quantum variables. This paper builds semantic foundations and verification methods for those leaks. https://arxiv.org/abs/2611.14488 https://arxiv.org/abs/2611.14488 2026-11-10 Memory-augmented robot policies are supposed to remember what happened in an episode. Many of them just sample frames on a clock and stamp each one with its time step. This paper shows that a brief pause or a fidget — something that changes nothing about the task — is enough to throw those memories off, because the policy has learned to treat time passing as if it were work. https://arxiv.org/abs/2611.14470 https://arxiv.org/abs/2611.14470 2026-11-10 Preventing human error in physical assembly tasks requires assistance systems that can intervene before mistakes are made. This is especially challenging in settings where users are free to choose the construction order and correctness depends on the evolving assembly rather than a fixed next step. We present TanCRAFT, a four-stage real-time predictive assistance system that tracks the scene state https://arxiv.org/abs/2611.14440 https://arxiv.org/abs/2611.14440 2026-11-10 Understanding 4D scenes is a core challenge in visual intelligence, requiring models to jointly capture scene geometry, appearance, and dynamics from partial observations. However, existing approaches are subdivided into feedforward models for direct geometric prediction, and generative models for visual synthesis. We introduce UGG, a unified framework for 4D scene understanding that jointly model https://arxiv.org/abs/2611.14485 https://arxiv.org/abs/2611.14485 2026-11-10 This paper presents a novel fourth-order, L-stable exponential time differencing (ETD) Runge-Kutta type scheme incorporating a dimensional splitting integrating factor method for the numerical solution of nonlinear reaction-diffusion systems. The method, ETDRK4RDP-IF, is obtained by approximating the matrix exponential operators in the classical dimensionally split ETDRK-IF scheme with an accurate https://arxiv.org/abs/2611.14349 https://arxiv.org/abs/2611.14349 2026-11-10 For nonlocal interface evolution problems such as the Mullins-Sekerka flow, certain parametric schemes discretize only the interface and approximate the Dirichlet-to-Neumann map by boundary elements. Their error analysis requires bounds on how this discrete operator changes as the polygon moves. In that analysis, the polygons are only Lipschitz and close to a smooth curve only in a Lipschitz norm, https://arxiv.org/abs/2611.14426 https://arxiv.org/abs/2611.14426 2026-11-10 Branch-and-bound comes from operations research; A* comes from AI. They share a search skeleton but explore the space differently, and that can change how long a solve takes. This paper lines them up on the resource-constrained project scheduling problem, spells out how their ingredients correspond, and measures where each one pulls ahead. https://arxiv.org/abs/2611.14423 https://arxiv.org/abs/2611.14423 2026-11-10 We study the parameter estimation for the stochastic logistic and Lotka--Volterra diffusions from discrete, irregularly spaced observations corrupted by measurement noise, a setting typical of microbiome time series. For the logistic equation, the growth rate acts as a time change and does not enter the stationary law, so it can be identified only from the temporal structure of the data. We prove https://arxiv.org/abs/2611.14158 https://arxiv.org/abs/2611.14158 2026-11-10 Multiscale materials simulations keep solving mechanical fields on high-resolution 3D volumes, which gets expensive fast. Neural surrogates can take over some of that work, but most are trained for a fixed loading and don’t say how the network should grow when the volume gets finer. This paper studies how those strain-field networks scale and whether they still generalize. https://arxiv.org/abs/2611.14119 https://arxiv.org/abs/2611.14119 2026-11-10 High-order harmonic generation turns an infrared laser into extreme-ultraviolet light, but the conversion efficiency depends on a messy tradeoff between the single-atom response and macroscopic phase matching. The useful region looks like a thin ridge in pressure and length. This paper uses physics-informed Bayesian optimization to find it. https://arxiv.org/abs/2611.14484 https://arxiv.org/abs/2611.14484 2026-11-10 Electric flux strings underpin confinement in gauge theories. In two spatial dimensions, their evolution involves competing processes of charge motion, pair creation, and transverse deformation. Accessing these dynamics beyond perturbative limits challenges classical approaches, as entanglement growth restricts the times accessible to tensor-network simulations. Here we use quantum simulation to i https://arxiv.org/abs/2611.14461 https://arxiv.org/abs/2611.14461 2026-11-10 A service that needs fresh quantum keys must wait for key release, and may be denied it, before protected computation starts. We quantify this cost for a trusted stationary UAV serving two ground gateways, each obtaining its keys from one finite-key decoy-state BB84 attempt with parameters fixed in advance. A count-level Monte Carlo model, reproduced by a semi-analytic model, links key acceptance https://arxiv.org/abs/2611.14482 https://arxiv.org/abs/2611.14482 2026-11-10 The Tolman--Oppenheimer--Volkoff equations admit singular solutions in which a negative point mass is surrounded by a self-gravitating fluid. For a $Γ$-law polytropic equation of state, these solutions, which we call singustars, are thick shells bounded by two zero-pressure surfaces around a naked, repulsive, negative-mass singularity, with a Schwarzschild exterior. They form a two-parameter famil https://arxiv.org/abs/2611.14455 https://arxiv.org/abs/2611.14455 2026-11-10 In this paper, we have generalized Poisson's(1993) calculation for the case of gravitational radiation from a particle in a circular orbit around a black hole to the case of the wormhole. Considering the motion of a test particle around a Schwarzschild like wormhole and using Teukolsky formalism, we have obtained an analytical result of flux at infinity under the assumption of small velocities. Fo https://github.com/ggml-org/llama.cpp/releases/tag/b12284 https://github.com/ggml-org/llama.cpp/releases/tag/b12284 2026-11-11 Adds OCP FP8 support on CUDA, including FP8 paths for GEMV. https://github.com/huggingface/lerobot/releases/tag/v0.7.0 https://github.com/huggingface/lerobot/releases/tag/v0.7.0 2026-11-05 Latest LeRobot release, with an accompanying post on the Hugging Face blog. https://github.com/Qiskit/qiskit/releases/tag/2.6.2 https://github.com/Qiskit/qiskit/releases/tag/2.6.2 2026-11-05 Patch release: safer QPY loading, QASM3 export of decomposed gate params, and a recursion-limit fix. https://github.com/llvm/llvm-project/releases/tag/llvmorg-23.1.5 https://github.com/llvm/llvm-project/releases/tag/llvmorg-23.1.5 2026-11-03 Point release for the 23.1 line, with packaged Linux builds and backend fixes. https://github.com/vllm-project/vllm/releases/tag/v0.33.0rc3 https://github.com/vllm-project/vllm/releases/tag/v0.33.0rc3 2026-11-02 Release candidate: 927 commits from 389 contributors, including new models such as Reflection Beam-1.0. https://github.com/JuliaLang/julia/releases/tag/v1.10.13 https://github.com/JuliaLang/julia/releases/tag/v1.10.13 2026-11-02 Thirteenth patch on the 1.10 LTS line. https://github.com/pytorch/pytorch/releases/tag/v2.15.0 https://github.com/pytorch/pytorch/releases/tag/v2.15.0 2026-10-28 Latest stable PyTorch release. https://github.com/leanprover-community/mathlib4/releases/tag/v4.36.0-rc2 https://github.com/leanprover-community/mathlib4/releases/tag/v4.36.0-rc2 2026-10-28 mathlib cut matching the Lean 4.36.0-rc2 toolchain. https://github.com/triton-lang/triton/releases/tag/v3.9.0 https://github.com/triton-lang/triton/releases/tag/v3.9.0 2026-10-27 Dialect, frontend, backend, and compiler work in the 3.9 line. https://github.com/leanprover/lean4/releases/tag/v4.36.0-rc2 https://github.com/leanprover/lean4/releases/tag/v4.36.0-rc2 2026-10-27 Release candidate 2 for Lean 4.36.0. https://github.com/modular/modular/releases/tag/max/v26.7.0 https://github.com/modular/modular/releases/tag/max/v26.7.0 2026-10-22 MAX 26.7 adds Muse Glimmer and MiMo-V2.6-Flash, video input for Qwen3.5 and Qwen3-VL, and a Decisions API. https://github.com/jax-ml/jax/releases/tag/jax-v0.12.0.1 https://github.com/jax-ml/jax/releases/tag/jax-v0.12.0.1 2026-10-22 Patch on the 0.12 line that restores vectorized CPU intrinsics on Windows. https://github.com/rust-lang/rust/releases/tag/1.99.1 https://github.com/rust-lang/rust/releases/tag/1.99.1 2026-10-16 Patch release that restores a missing wcslen symbol on UEFI and embedded targets. https://github.com/ros2/ros2/releases/tag/release-humble-20260914 https://github.com/ros2/ros2/releases/tag/release-humble-20260914 2026-09-14 Humble Hawksbill Patch Release 15 binary packages. https://github.com/ziglang/zig/releases/tag/0.15.1 https://github.com/ziglang/zig/releases/tag/0.15.1 2025-08-29 Latest stable Zig release. Older than the rest of this list — still the current tagged stable. https://github.com/sympy/sympy/releases/tag/1.14.0 https://github.com/sympy/sympy/releases/tag/1.14.0 2025-04-27 Current stable SymPy release (April 2025).