These notes address two problems. First, we investigate the question of "how many" are (in Baire sense) vector fields in L1t Lqx, q is an element of [1, infinity), for which existence and/or uniqueness of local, distributional solutions to the associated continuity equation holds. We show that, in certain regimes, existence of solutions (even locally in time, for at least one nonzero initial datum) is a meager property, whereas, on the contrary, uniqueness of solutions is a generic property. Secondly, despite the fact that non-uniqueness is a meager property, we prove that (Sobolev) counterexamples to uniqueness, both for the continuity equation and for the ODE, in the spirit of [5] and [12] respectively, form a dense subset of the natural ambient space they live in. (c) 2026 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
The increasing scale, distribution, and interconnection of software-intensive systems continue to change the landscape of software engineering research and practice, bringing the diffusion of two similar paradigms: Systems-of-Systems (SoS) and Software Ecosystems (SECO).SoS are characterized by the integration of operationally and managerially independent systems that join together to accomplish a common mission. SoS are central to domains such as transportation, healthcare, defense, smart cities, and industrial automation where heterogeneous systems must cooperate, exchange information, and adapt to evolving missions. On the other hand, SECO describe environments in which a platform and its surrounding network of developers, partners, and organizations co-create software offerings. In SECO, technical artifacts interact with economic and social processes. Modern digital platforms, mobile operating systems, cloud services, and enterprise platforms leverage the capabilities of their ecosystems.This editorial brings together perspectives that explore the shared challenges and complementary insights of SoS and SECO research, aiming to foster a richer understanding of complex software-intensive systems and highlight new opportunities for collaboration across communities. From the long-running, successful series of the International Workshop on Software Engineering for Systems-of-Systems and Software Ecosystems (SESoS), co-located with the IEEE/ACM International Conference on Software Engineering (ICSE), we present this special issue of the Journal of Systems and Software on the topics of SESoS 2024 in Lisbon, Portugal. From a total of 18 submissions, 7 articles were accepted in this special issue. The articles in this collection address fundamental questions of SoS and SECO, including the evolution of functional relations and experimentation practices, the key factors affecting developer experience, also related to women’s inclusion, as well as the adoption of GenAI-driven approaches for vulnerability fixing. These articles offer updates on current advances of SoS and SECO engineering to researchers and practitioners, highlighting opportunities for future research.
We present a complete classification of the distributed computational complexity of local optimization problems in directed cycles for both the deterministic and the randomized LOCAL model. We show that for any local optimization problem Π (that can be of the form min-sum, max-sum, min-max, or max-min, for any local cost or utility function over some finite alphabet), and for any constant approximation ratio α, the task of finding an α-approximation of Π in directed cycles has one of the following complexities: 1. O(1) rounds in deterministic LOCAL, O(1) rounds in randomized LOCAL, 2. Θ(log^* n) rounds in deterministic LOCAL, O(1) rounds in randomized LOCAL, 3. Θ(log^* n) rounds in deterministic LOCAL, Θ(log^* n) rounds in randomized LOCAL, 4. Θ(n) rounds in deterministic LOCAL, Θ(n) rounds in randomized LOCAL. Moreover, for any given Π and α, we can determine the complexity class automatically, with an efficient (centralized, sequential) meta-algorithm, and we can also efficiently synthesize an asymptotically optimal distributed algorithm. Before this work, similar results were only known for local search problems (e.g., locally checkable labeling problems). The family of local optimization problems is a strict generalization of local search problems, and it contains numerous commonly studied distributed tasks, such as the problems of finding approximations of the maximum independent set, minimum vertex cover, minimum dominating set, and minimum vertex coloring.