Papers for

emergency response coordinators

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Uav fleet improves dynamic wireless map tracking with weighted age metric

Weighted-AoI-Driven UAV Trajectory and Reporting for Dynamic CKM Tracking

Abstract: Existing channel knowledge map (CKM) construction assumes quasi-static environments, failing when channels rapidly decorrelate. This paper investigates continuous online dynamic CKM tracking over an airborne 2D plane via a UAV fleet. We formulate a long-term error minimization problem under UAV mobility and reporting constraints. This problem, however, is intractable with unobservable errors for unmeasured cells. To tackle this, we propose a metric-driven scheduling approach featuring the Weighted-Age of Information (W-AoI). W-AoI evaluates cells by combining exact temporal staleness with spatial uncertainty predicted by a 2D U-Net. We prove that top-$K$ W-AoI selection maximizes the one-slot error reduction bound. Guided by this guarantee, we develop a lightweight greedy trajectory policy incorporating continuous along-path sensing. Simulations demonstrate our method reduces steady-state error by 3.8 dB$^2$ and 4.8 dB$^2$ over AoI-only and FIFO baselines, closely approaching an idealized oracle.

Tue 10 NovMachine Learning
The gist
Wireless signals change quickly in some environments, making it hard to keep accurate maps of them. The authors study how a group of drones flying over an area can keep an up-to-date map by choosing where and when to collect measurements. They create a method that looks at both how old the data is and how uncertain the map is in different places, helping the drones to decide what to measure next. Their tests show this approach lowers mapping errors compared to simpler methods.
Open → 2611.13726v1

Forecasting low blood pressure burden during surgery improves early warnings

Forecasting cumulative intraoperative hypotension burden: patient-disjoint evaluation of quantile boosting and alert policies

Abstract: Background: Binary hypotension forecasts do not describe the depth and duration of future low pressure. Burden forecasts may support graded early warning, but better forecast scores need not yield more useful alerts. Objective: To evaluate conditional quantiles of the next 15-minute mean arterial pressure (MAP) deficit below 65 mmHg and distinguish forecasting performance from episode-warning performance. Methods: Public VitalDB numeric arterial MAP was reduced to 10-second medians without forward filling. Subject-disjoint training, validation and test splits included 70,402, 14,270 and 15,575 labeled windows. We compared climatology, calibrated persistence, last-MAP-only boosting, and direct and residual quantile boosting, with and without additional MAP-history features. Patient-weighted pinball loss and subject-bootstrap intervals evaluated forecasting. Validation selected alert thresholds before a hash-recorded test evaluation. Results: In the test split, the prespecified residual-versus-persistence comparison at the 90th percentile yielded losses of 2.256 and 2.900 mmHg-min, respectively (difference -0.644; 95% interval -0.814 to -0.487). Direct prediction achieved 2.196, and direct prediction with additional MAP features achieved 2.193. Episode-warning results were sensitive to the alert rule and operating threshold. Conclusions: This retrospective benchmark separates burden-forecast skill from warning-policy performance. Findings support further study of direct burden estimation; they do not establish patient benefit, prospective reliability or transportability beyond the source hospital.

Fri 6 NovArtificial Intelligence
The gist
Low blood pressure during surgery can be dangerous, but current forecasts only predict if it will happen, not how bad it will be. This paper studies ways to predict the depth and duration of low blood pressure in the next 15 minutes, helping doctors get better early warnings. The researchers tested several prediction methods using patient data and found that some new methods predict the burden more accurately than simpler ones. However, how useful these predictions are in practice depends on how alerts are set up, and more testing is needed before using this in other hospitals.
Open → 2611.09259v1

Doppler shifts from LEO satellites enable precise positioning without GNSS

Beyond GNSS: Leveraging LEO Satellite Signals of Opportunity for Doppler Positioning

Abstract: Large constellations of low Earth orbit (LEO) satellites provide ubiquitous global connectivity; yet, their rapid motion introduces significant Doppler shift effects. While challenging for communication, these effects can be leveraged for precise user terminal (UT) positioning, particularly in GNSS-denied environments where traditional satellite-based navigation struggles. Unlike GNSS, most LEO satellites lack dedicated navigation signals, motivating signals-of-opportunity (SOPs) approaches that repurpose existing LEO signals and use publicly available two-line element (TLE) files for orbital information, although ephemeris errors can limit accuracy. This article explores the fundamental principles, challenges, and enabling technologies for LEO-based Doppler shift positioning, highlighting its advantages over conventional non-Doppler methods, and discussing future research directions. Furthermore, to facilitate realistic and reproducible performance evaluation beyond stochastic modeling, we propose SionnaNTN-RT, a ray tracing framework for non-terrestrial network (NTN) built upon Sionna, enabling end-to-end simulation of Doppler-based positioning. Simulation results demonstrate that Doppler-based positioning can achieve high positioning accuracy in both urban and open-sky environments, highlighting its promise for next-generation positioning systems.

Mon 2 NovInformation Theory
The gist
Traditional GPS systems sometimes fail when their signals are blocked or unavailable. The authors show that signals from low Earth orbit (LEO) satellites, which move fast and cause changes in signal frequency called Doppler shifts, can help find locations even when GPS is not an option. Their research uses existing satellite signals and publicly available satellite orbit data to calculate positions. They also developed a simulation tool to realistically test this approach and found it works well in both city and open areas.
Open → 2611.03440v1

Adaptive algorithms improve mobile network coverage in changing environments

Adaptive Coverage Algorithms for Mobile Ad Hoc Networks in Dynamic Worlds

Abstract: This paper extends an existing framework for the coordination of mobile agents in unknown worlds, by considering the possibility of dynamic instability. In the original problem, known as the Partially Observable Cooperative Guard Art Gallery Problem (POCGAGP) (arXiv:2512.09495), the multi-agent system must establish a communication network which completely covers an initially unknown constrained space. However, the POCGAGP fails to account for the unpredictability often seen in real-world deployment. To address this, the dynamic case (DPOCGAGP) introduces two settings which can influence the mobile network during deployment: Agent Loss and World Change, which represent dynamic changes to the world. Within this study, we present advancements to two state-of-the-art algorithms, the Centralized Agent-Directed Exploration for Network Coverage (CADENCE), and its decentralized analogue, DADENCE, to provide solutions in these cases. We then compare their performance against another state-of-the-art benchmark algorithm, and show that the adapted algorithms outperform across our benchmark test set, which comprises over 4500 test cases of varied size and structure.

Fri 30 OctRoboticsMultiagent Systems
The gist
Covering an unknown space using moving agents who communicate is tricky when things change unexpectedly, like agents disappearing or the environment shifting. The authors extended previous work by allowing these networks to adapt to such changes during deployment. They improved two existing algorithms, making the networks more reliable and effective even when things are unstable. Their new methods performed better than a strong baseline across thousands of varied tests.
Open → 2610.41936v1

Multiple agents boost user confidence in VR evacuation training

Influence of Agent Number and Behavior on Users' Psychological Responses in VR Evacuation Training

Abstract: This study aims to build effective drill software by combining a virtual simulation of a disaster with multiple agents capable of expressing emotions. We evaluated how the number of agents and their emotional and behavioral actions during evacuation influence users in a virtual space. The results showed that users tended to act more confidently when many agents evacuated with them, and that the evacuation route chosen by the agents influenced the users' decision-making. These findings indicate that users' evacuation behavior is shaped not only by the environment itself but also by the collective behavior of surrounding agents, underscoring the need to consider how agent behavior affects users' psychological states during training.

Wed 28 OctHuman-Computer InteractionMultimediaRobotics
The gist
When people practice escaping dangers in virtual reality, the number and actions of nearby virtual characters affect how they feel and behave. The authors found that users act more confidently when many characters evacuate with them. Also, the paths chosen by these characters influence the users' decisions where to go. This means that in virtual training, not just the environment but how other people act matters a lot.
Open → 2610.38536v1

Mixed evacuation problem solvable efficiently with ellipsoid method

Polynomial-Time Solvability of the Mixed Evacuation Problem

Abstract: The mixed evacuation problem is a variant of the dynamic transshipment problem where there exist two modes of transportation and we allocate supplies to each mode of transportation in such a way that we can send all the supplies from sources to sinks within a given time limit. It is known that this problem can be solved in polynomial time when the number of sources and sinks is small. In this paper, we prove that the mixed evacuation problem can be solved in polynomial time with the ellipsoid method.

Tue 27 OctData Structures and Algorithms
The gist
The mixed evacuation problem involves sending supplies from multiple starting points to destinations using two types of transportation, all within a set time. Previously, solving this problem efficiently was only possible when there were few starting and ending points. The authors show that using a mathematical tool called the ellipsoid method, this problem can be solved efficiently even when there are many sources and sinks. This means it is possible to plan such mixed transportation routes in a reasonable amount of time for larger cases.
Open → 2610.37065v1

UAV swarm search guided by uncertainty in GNSS-denied maritime areas

Localization-Uncertainty-Aware UAV Swarm Search for GNSS-Denied Maritime Surveillance

Abstract: This paper studies UAV swarm search in GNSS-denied maritime environments, where inter-UAV ranging drives cooperative localization and uncertainty propagates along the multi-hop reference chain, affecting connectivity, collision avoidance, and search effectiveness. We propose an uncertainty-aware control barrier function (CBF) framework approximating cascading localization covariance through Fisher information matrices. First, the cascading covariance model captures how ranging noise and neighbor uncertainty accumulate along the localization chain. Second, uncertainty-tightened CBFs incorporate the covariance model and its rate into margins for connectivity maintenance and collision avoidance, with conditional invariance and graceful-degradation bounds. Third, a hierarchical Voronoi-target strategy with formation keeping supports efficient forward-looking coverage. The distributed controller is validated with a standard unbiased extended Kalman filter in the loop. The framework is demonstrated on several polygon shapes and swarm sizes from 6 to 30 sUAVs. An estimator-in-the-loop run completes the search in 302.5 s, 20 Monte Carlo deployments confirm repeatable completion with all local QPs feasible and containment in at least 98.97% of UAV-frames, and six MBZIRC runs provide estimator-in-the-loop evidence. The source code is publicly available.

Mon 26 OctRobotics
The gist
Finding targets at sea without GPS is challenging for drone swarms because they rely on each other to figure out where they are. The authors created a method that tracks how location errors grow as drones share signals and adjusts their movements to keep them connected, avoid crashes, and cover the search area well. Their approach uses math to estimate uncertainty and plans paths so drones keep safe margins and maintain good coverage. They tested it with simulations and real-world drone contests, showing reliable search completion.
Open → 2610.34873v1

GeoAI framework ranks urban basins to screen flood risk with human feedback

A Topology-Guided GeoAI Agentic Framework for Urban Flood Screening

Abstract: Open-world geographic artificial intelligence (GeoAI) agents can transform public geospatial data into accessible decision support for real-world challenges, but must balance autonomous reasoning with reliable spatial analysis and human oversight. We present a topology-guided GeoAI agentic framework for urban flood screening that takes a place name, drawn region, or uploaded boundary and returns ranked candidate basins with an interactive map and report. A deterministic controller retrieves public elevation, rainfall, soil, land-cover, exposure, and infrastructure layers, extracts terrain depressions with discrete Morse theory, and ranks basins with a relative flood-priority score. The language model acts only at recorded decision points: selecting a persistence threshold from a precomputed candidate table, drafting recommendations from computed evidence, and reviewing each recommendation against the same evidence. Three human-in-the-loop checkpoints let users revise the threshold, factor weights, or recommendation. In a College Park, Maryland case study, the selected threshold reduced 278 raw terrain minima to 70 basins, with 77% of these basins' lowest points also identified as sinks by a separately computed eight-direction (D8) flow-routing model. Across four further study areas, agreement ranged from 61% to 83%. By combining open data, explicit spatial reasoning, traceable evidence, and human oversight, the framework enables transparent first-pass flood screening while keeping consequential recommendations inspectable and user-controlled.

Thu 22 OctArtificial Intelligence
The gist
Flooding in cities can be hard to predict because it depends on lots of natural and human factors. The authors created a computer system that uses maps and public data to find low-lying areas where water might collect, scoring them to show which are most at risk of flooding. The system uses a step-by-step logic and lets people check and adjust its choices to make sure results are clear and trustworthy. They tested it in Maryland and other places, finding good agreement with existing flood models while keeping humans in control.
Open → 2610.30660v1

Controlled emergence offers balanced system design methods for adaptable intelligence

The Forward/Inverse Duality of Controlled Emergence:A Computational Design Program from Explanation to Engineering

Abstract: The macroscopic capabilities of intelligent systems arise from the local interactions of many simple units. When such systems are deployed in the real world, their behaviour must nevertheless be constrained, leaving designers caught between releasing adaptability and preventing loss of control, yet without formal tools to resolve the dilemma. This paper proposes a unified research program for controlled emergence that restates this tension as a pair of dual problems: the forward problem explains macroscopic behaviour from local rules, and the inverse problem solves for controllable rules and readout mechanisms from a desired target. We take an augmented quintuple as the formal object shared by both ends, and decompose ``engineering'' into three independently measurable coordinates: controllability, reproducibility, and degree of formalizability. On this basis we give three testable working hypotheses (critical scale; the cooperation and trade-off between constraint and adaptability; minimal constraint) and one feasibility criterion, which reduce inverse design from unconstrained optimization to interval checking. The program takes explicit failure boundaries as its premise, does not pursue complete control, and always preserves the system's room for self-organization. The reduced pilot experiment attached to this paper serves only to verify the executability of the research protocol and does not constitute a statistical test of the working hypotheses. This design language generalizes to multi-agent artificial intelligence, the industrial internet, and emergency response systems, all of which must confront emergence and controllability at once.

Mon 19 OctArtificial Intelligence
The gist
Complex systems like AI or networks come from many simple parts working together, but it's hard to control them while keeping their flexibility. The paper by the authors explains this challenge with two connected problems: predicting overall system behavior from rules, and designing rules to get a desired outcome. They propose a new design approach that balances control and adaptability without trying to fully control the system. This method can help make systems that organize themselves while still following certain constraints.
Open → 2610.25630v1

AutoMARS enables automatic risk comparison across supply chain locations

AutoMARS: Automatic and Scalable Multi-Agent Large Language Model Framework for Supply Chain Risk Assessment

Abstract: We propose AutoMARS (Automatic Multi-Agent Risk Assessment), an agentic framework for automatic and scalable comparative risk assessment in supply chain networks. The framework enables end-to-end execution of analytical workflows by automatically planning tasks, coordinating specialized agents, invoking external analytical tools, and synthesizing domain-specific results into integrated risk evaluations. AutoMARS further supports scalable risk comparison across multiple locations by parallelizing independent analytical tasks. The framework adopts a multi-domain, multi-agent, and multi-tool architecture that integrates heterogeneous risk factors from socioeconomic, disaster, environmental, and transportation domains. Through coordinated agent interactions and tool integration, AutoMARS enables structured, systematic, and interpretable comparative analysis to support supply chain risk-aware location evaluation.

Mon 12 OctArtificial Intelligence
The gist
Supply chains can face many risks from different areas like disasters, environment, or transportation problems. The authors created AutoMARS, a system where many specialized agents work together automatically to analyze and compare risks in different places. This helps businesses see which locations are safer or riskier to operate from by combining information from many sources. AutoMARS organizes the work so the analysis is clear, structured, and done faster by running tasks in parallel.
Open → 2610.17206v1

Large language models improve team robot rescue in changing disaster areas

Persistent LLM Orchestration of Heterogeneous Robot Teams via Partial Delegation to Multi-Agent Protocols

Abstract: Natural language specifications let non-expert users task robot teams, and large language models (LLMs) have recently proven effective at grounding such semantic specifications into plans for heterogeneous teams. Existing approaches assume missions that terminate and environments that, while unknown, do not change, but both assumptions fail in many emerging applications. For example, a disaster-response mission does not terminate, and its environment changes continuously as hazards spread and evacuees move. We identify three ways an LLM orchestrator breaks in this setting: its prompt grows without bound, its reasoning degrades as agents and targets accumulate, and it stops actively monitoring after covering the search space once. We build on the successful framework of grounded generative intelligence, and address each issue with a classical idea. A Markovian state summary, rebuilt from the semantic map at every invocation, replaces the growing interaction history. Partial delegation lets the orchestrator assign a subset of robots to an autonomous multi-agent protocol and reserve its reasoning for generating subtasks that require detailed parameters and careful ordering. Lastly, observation staleness, surfaced explicitly in the prompt, together with task-and event-triggered re-prompting, keeps the team vigilant. In a simulated urban search-and-rescue mission with spreading fire and moving evacuees, our framework rescues 98% of civilians versus 89% for the strongest baseline while using six times fewer tokens. Additional ablations isolate the contribution of each mechanism.

Sat 10 OctMultiagent SystemsRobotics
The gist
Robots working together in disaster zones need to respond to changes like spreading fire and moving people, but current plans often assume missions end or conditions stay the same. The authors found that using large language models (LLMs) to guide robots can struggle when missions don’t end and the environment keeps changing. They improved this by summarizing the robot team’s state, letting some robots work autonomously together, and reminding the system to update tasks when new events happen. Their approach saved more people in a simulated rescue with less computing effort than other methods.
Open → 2610.15224v1

Team awareness types shape robot coordination in complex tasks

A Taxonomy on Collective Awareness

Abstract: As robotic teams tackle increasingly complex tasks in dynamic and unstructured environments, effective coordination requires agents to maintain accurate, aligned representations of their environment, teammates, and mission state. We argue that Mutual Awareness, Shared Situational Awareness, and Team Situational Awareness --- three concepts widely invoked in the multi-robot systems literature --- are not interchangeable: they form a containment hierarchy in which each type subsumes the previous in scope, and span a distribution spectrum from fully individualized understanding (MA) to fully uniform understanding (SSA), with TSA occupying a mixed position. We establish this through a two-dimensional taxonomy organized along the object of awareness and awareness distribution axes. Treating these terms as synonyms obscures the precise coordination requirements each imposes on a robotic system. A Search and Rescue case study with heterogeneous aerial and ground robots grounds each taxonomy position in concrete coordination requirements. These findings provide a conceptual foundation for principled specification, design, and comparison of collective awareness in multi-robot systems.

Mon 5 OctRobotics
The gist
Robotic teams need to understand their environment, teammates, and current mission in different ways to work well together. The authors explain that mutual awareness (each robot knows its own view), shared situational awareness (all robots have the same view), and team situational awareness (a mix of both) are different levels of shared understanding. They created a system to organize these types based on what robots are aware of and how evenly that awareness is spread. Using a search and rescue example with flying and ground robots, they show how different levels of awareness change what coordination is needed.
Open → 2610.06427v1

CatBoost machine learning improves wildfire detection from satellite images

Comparing a gradient boosting algorithm to the GOES FDC for wildfire detection

Abstract: Wildfires pose severe risks to human life, ecosystems, and property. This study presents a machine learning approach for wildfire detection from GOES ABI imagery. A CatBoost model was trained on a large dataset with thousands of ABI images and over 300,000 matching VIIRS fire detections. An evaluation on a separate dataset across five regions showed that the learned CatBoost model outperformed the operational GOES Fire Detection and Characterization (FDC) product. It achieved higher precision, recall, and F1 scores both within and outside the training area. The CatBoost model achieved F1 scores that were 0.16 to 0.38 higher than the GOES FDC in all regions. In addition, out of 51 historical fire events, the CatBoost detected 26 fires before both VIIRS and GOES FDC, compared to only six earlier detections by the GOES FDC. Importantly, the CatBoost model achieved accurate wildfire detection also during nighttime, whereas the GOES FDC obtained very low recall values, around 0.03. This study demonstrates that machine learning models may offer significant improvements over existing geostationary fire products, including higher accuracy, fewer false alarms, and earlier detection.

Thu 1 OctComputer Vision and Pattern RecognitionMachine Learning
The gist
Detecting wildfires quickly and accurately is important to protect people and nature. This study tested a machine learning tool called CatBoost using satellite images and found it was better at spotting fires than the current GOES FDC system. CatBoost detected more fires, made fewer mistakes, and caught fires earlier, even at night when GOES FDC struggled. This suggests machine learning can help improve wildfire warnings from satellite data.
Open → 2610.01994v1

Uav swarms manage communication to improve search and rescue success

Managing Context and Communication in Distributed Agentic UAV Swarms

Abstract: Unmanned aerial vehicle (UAV) swarms increasingly rely on language-model agents to provide adaptive mission-level reasoning in uncertain environments. Fully distributed control, in which each UAV hosts an independent Small Language Model (SLM), removes reliance on a centralized coordinator but introduces an information-management problem: long-running interaction histories can degrade the reasoning context, while indiscriminate information dissemination increases communication and inference overhead. We address these challenges with a distributed UAV-agent architecture that enables continuous local SLM control through an event-driven reason-act-observe lifecycle. Runtime knowledge is represented as structured atomic notes and organized into core, local, and peer-specific memory. A deterministic interest-aware gossip engine selectively disseminates these notes according to recipient-specific semantic novelty and recency. We evaluate the architecture using ten UAVs in a simulated search-and-rescue mission. Our approach completes all experimental runs, whereas unrestricted flooding messages completes only 70-85\%, and delegating forwarding decisions to the SLM prevents mission completion in every run. Compared with unrestricted flooding, our approach approximately halves inference-token consumption, reduces transmitted data, and achieves lower survivor-count error.

Thu 1 OctMultiagent SystemsArtificial IntelligenceMachine Learning
The gist
UAV swarms equipped with small language models can work together without a central controller, but this causes too much communication and confusion over time. The authors created a system where each drone keeps track of important information locally and only shares new, relevant facts with other drones. This selective communication helps the drone team finish search-and-rescue missions more reliably and efficiently than other methods. Their tests using ten drones showed better accuracy and less wasted communication.
Open → 2610.01569v1

Robot teams improve mission info sharing using new communication method

DORA: Divergence-Oriented Data-Relay Algorithm for Partially Connected Robot Teams

Abstract: Teams of unmanned aerial vehicles (UAVs) deployed for search and monitoring missions frequently operate as partially connected networks, forcing each robot to trade off exploring the environment against relaying information to teammates. This tradeoff is especially acute when robots are semantically heterogeneous: an observation that appears uninformative to the robot that made it may be critical to a teammate with complementary detection capabilities. In this work, we formalize this setting as the heterogeneous mission-aware coverage (HMAC) problem, which couples complete multi-robot coverage of an area with capability-constrained mission-relevant target (MRT) discovery under intermittent communication. We then present DORA, a divergence-oriented data-relay algorithm that drives communication by the value of information to the team rather than by discovery alone. DORA quantifies the mission-relevant divergence between a robot's current information state and its estimate of each teammate's knowledge, capturing mission relevance, discovery novelty, sensor uncertainty, and the age of information. We evaluate DORA in simulation across four environments with differing object densities and spatial structure, and validate it on a physical UAV platform. Our results show that DORA improves MRT resolution delay by up to 74.8% over traditional time-based communication scheduling methods.

Mon 28 SeptRobotics
The gist
When flying robots look for things in an area, they need to decide whether to keep exploring or share info with teammates. This is tricky when each robot senses different things that matter more to others. The authors created a way to measure how useful new info is to teammates and use that to decide when to communicate. This method helps teams find targets faster by focusing on sharing valuable info, even with unreliable communication. They tested it both in simulations and on real drones, showing big improvements.
Open → 2609.36395v1

WeatherDiagFlow improves radar forecasts with evidence and audits

WeatherDiagFlow: Evidence-Grounded Radar Nowcasting with Diagnostic Flow Refinement

Abstract: Radar nowcasting is essential for short-term warning and emergency response, yet conventional systems mainly return future radar fields and provide limited support for operational communication and post-event verification. We formulate radar nowcasting as an evidence-grounded forecast--bulletin--audit task, in which a numerical forecaster produces both future radar fields and structured diagnostic evidence. Forecast-time bulletins use only model-available evidence, whereas post-event audits incorporate future radar truth only after the forecast horizon is observed. Based on this task formulation, WeatherDiagFlow predicts motion, growth and decay, heavy-echo risk, and uncertainty to condition rolling flow refinement, while frozen-scaffold residual calibration improves long-lead strong-echo preservation. A multi-agent layer converts the structured evidence into operational bulletins and independently generates verification audits without feeding textual outputs back into the forecaster. Experiments on FJRADAR demonstrate competitive overall performance and improved strong-echo event skill. WeatherDiagFlow therefore connects numerical prediction, evidence-grounded reporting, and auditable verification under a leakage-controlled protocol.

Thu 24 SeptMachine LearningMultimedia
The gist
Short-term weather forecasts from radar help with emergency warnings but usually only show future radar images without much explanation. The authors present WeatherDiagFlow, which not only predicts future radar but also provides clear evidence and reports about what the forecast means and how confident it is. This system also checks its own forecasts against real radar data afterward to verify accuracy. By combining predictions, evidence, and audits, WeatherDiagFlow aims to make radar forecasts easier to understand and trust.
Open → 2609.29772v1

Minimal communication achieves strong team coordination in resource games

Achieving Robust Performance using Minimal Communication in Resource Allocation Games

Abstract: Increasingly, resource allocation games are being proposed to model team coordination in denied communication environments. Of particular interest is understanding the impact of communication denial on the quality of emergent team coordination. In this work, we consider the situation with an arbitrary communication network and use the Price of Anarchy to quantify the quality of emergent behavior. Our main result is a computationally efficient algorithm that calculates a minimal communication network that has the same performance guarantee as the full information case. Additionally, we provide efficient algorithms that compute a Nash and a strict Nash equilibrium in the full information setting. Finally to support these algorithms, we provide sufficient conditions for the existence of a strict Nash equilibrium, characterize strict Nash equilibria across all communication networks, and show that each strict Nash equilibrium in the full information case has a necessary and sufficient set of communication links that induce it. We conclude by giving an execution time experiment of the proposed algorithm and examine several example games.

Tue 22 SeptComputer Science and Game Theory
The gist
When teams try to share resources without fully talking to each other, their coordination can suffer. This paper looks at how much communication is really needed to keep teamwork just as good as if everyone could talk all the time. The authors created a fast way to find the smallest communication setup that still keeps team performance high. They also figured out when teams can be stable in their choices and how communication affects that. They tested their methods on example games to show it works efficiently.
Open → 2609.26670v1

Secure software approaches improve voice data segregation across domains

SoK: Secure Software-Based Multi-Domain Data Segregation

Abstract: Modern mission-critical coordination demands seamless communication across multiple domains. Traditionally, Voice Communication Systems (VCS) have relied on physically separated Red/Black architectures to ensure voice and data segregation. While these hardware-based methods provide strong security assurances and remain foundational in high-security contexts, they can introduce significant complexity and scalability challenges as mission parameters expand into highly dynamic, multi-domain integrations. As defence, emergency response, and critical infrastructure operations increasingly require interoperable, flexible, and cost-efficient communication environments, there is a growing need to understand whether software-based approaches can provide comparable assurance while supporting modern operational requirements. This SoK characterises a transition to software-based Multi-Domain Data Segregation (MDDS) by integrating systems security, networking, and cryptography. Its goal is to consolidate existing research, identify shared architectural patterns, and address the security challenges facing next-generation high-assurance software-based VCS architectures. By assessing software-defined and virtualized approaches, this SoK supports the development of scalable, high-assurance VCS architectures that facilitate secure real-time coordination across diverse operational domains. Specifically, this SoK examines the security implications of Software-Defined Networking, Network Slicing, Separation Kernels, and Cross-Domain Solutions while addressing challenges posed by quantum computing through Post-Quantum Cryptography (PQC). This SoK provides a comprehensive analysis of the shift from hardware isolation to software segregation, serving as a crucial foundation for researchers and industry stakeholders aiming to enhance secure and adaptable VCS infrastructures for mission-critical operations.

Mon 7 SeptCryptography and Security
The gist
Voice communication systems need to keep important information separated across different groups for security reasons. Traditionally, they use special hardware to do this, which is safe but can be complicated and hard to scale. The authors review how software methods might provide similar security while being more flexible and easier to manage. They look at how new networking and encryption techniques can help protect communication across multiple domains, even against future threats like quantum computing.
Open → 2609.07701v1