arXiv:2607. 21421v1 Announce Type: new Abstract: Generative models can support decision-making under uncertainty by producing ensembles of plausible future system trajectories, but statistical plausibility does not ensure structural feasibility.
arXiv:2607. 21421v2 Announce Type: replace Abstract: Data-driven generative models can extend partially observed simulation trajectories into ensembles of alternative future scenarios.
arXiv:2608. 08689v1 Announce Type: new Abstract: The state evolution of a complex system arises jointly from object laws, relational propagation, domain conservation, and unmodeled error.
arXiv:2606. 03067v1 Announce Type: cross Abstract: A recurring data mining task in complex networks is to determine how individual nodes contribute to system behavior.
arXiv:2404. 02692v3 Announce Type: replace-cross Abstract: The explosion of data available in life sciences is fueling an increasing demand for expressive models and computational methods.
arXiv:2607. 17082v2 Announce Type: replace-cross Abstract: Large language model agents solve tasks by generating trajectories that interleave planning, tool calls, and intermediate results.
arXiv:2508. 18173v2 Announce Type: replace Abstract: The discovery of symbolic governing equations is a central goal in science; yet, it remains challenging particularly for graph dynamical systems, where the network topology further shapes the system behavior.
arXiv:2608. 15645v1 Announce Type: new Abstract: Transporting a causal conclusion from a source study population to a target one is a fundamental problem in causal inference.
arXiv:2605. 18250v2 Announce Type: replace-cross Abstract: Many dynamical systems can be described in terms of structured flows combining source/sink behavior, cyclic dynamics, and topology-constrained transport.
arXiv:2607. 17082v1 Announce Type: new Abstract: Large language model agents solve tasks by generating trajectories that interleave planning, tool calls, and intermediate results.
The paper introduces the Distinguish-or-Homogenize principle, where an agent can either spend resources to differentiate between latent fault models or alter the system state so that the remaining models share a common acceptable policy, eliminating further diagnosis. This leads to the Last-Chance Policy Identification (LCPI) framework, which evaluates correctness at the reached state rather than the initial one, and defines the Last Identifiable Margin (LIM) as the boundary between distinguishing and homogenizing. For deterministic diagnostic graphs, an Exact-LIM recursion is provided, while for noisy finite-horizon recovery the authors propose Risk-Budgeted Compatibility Planning (RBCP), which searches a compatibility-aware frontier under a hard worst-case failure constraint, demonstrating improved risk-feasible recovery in microservice and MiniGrid scenarios.
The paper introduces a constraint‑aware conditional generative framework for creating synthetic origin‑destination demand data in hierarchical logistics networks. By modeling demand as a conditional distribution over destinations given each origin, the method incorporates differentiable operational constraints directly into the generative objective, allowing topology‑aware synthesis that remains operationally feasible. Experiments on industrial fulfillment and transportation networks show a 16% performance gain over graph neural network baselines, 87% operational compliance, and efficient cold‑start adaptation, supporting capacity planning, network design evaluation, and routing optimization.
arXiv:2608. 07809v1 Announce Type: new Abstract: A world model is only useful for physical AI if it changes what the agent does, and only safe if it declines to do so when it is wrong.