Phase behavior of Cacio e Pepe sauce

“Pasta alla Cacio e pepe” is a traditional Italian dish made with pasta, pecorino cheese, and pepper. Despite its simple ingredient list, achieving the perfect texture and creaminess of the sauce can be challenging. In this study, we systematically explore the phase behavior of Cacio e pepe sauce, focusing on its stability at increasing temperatures for various proportions of cheese, water, and starch. We identify starch concentration as the key factor influencing sauce stability, with direct implications for practical cooking. Specifically, we delineate a regime where starch concentrations below 1% (relative to cheese mass) lead to the formation of system-wide clumps, a condition determining what we term the “Mozzarella Phase” and corresponding to an unpleasant and separated sauce. Additionally, we examine the impact of cheese concentration relative to water at a fixed starch level, observing a lower critical solution temperature that we theoretically rationalized by means of a minimal effective free-energy model. We further analyze the effect of a less traditional stabilizer, trisodium citrate, and observe a sharp transition from the Mozzarella Phase to a completely smooth and stable sauce, in contrast to starch-stabilized mixtures, where the transition is more gradual. Finally, we present a scientifically optimized recipe based on our findings, enabling a consistently flawless execution of this classic dish

Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants

Given the uncertain evolutionary status of blue supergiant stars, their multiplicity properties hold vital clues to better understand their origin and evolution. As part of The Binarity at LOw Metallicity (BLOeM) campaign in the Small Magellanic Cloud, we present a multi-epoch spectroscopic survey of 128 supergiant stars of spectral type B5–F5, which roughly correspond to initial masses in the 6–30 M⊙ range. The observed binary fraction for the B5–9 supergiants is 25 ± 6% (10 ± 4%) and 5 ± 2% (0%) for the A–F stars, which were found using a radial-velocity (RV) variability threshold of 5 km s−1 (10 km s−1) as a criterion for binarity. Accounting for observational biases, we find an intrinsic multiplicity fraction of less than 18% for the B5–9 stars and 8−7+9% for the AF stars, for the orbital periods up to 103.5 days and mass ratios (q) in the 0.1 < q < 1 range. The large stellar radii of these supergiant stars prevent short orbital periods, but we demonstrate that this effect alone cannot explain our results. We assessed the spectra and RV time series of the detected binary systems and find that only a small fraction display convincing solutions. We conclude that the multiplicity fractions are compromised by intrinsic stellar variability, such that the true multiplicity fraction may be significantly smaller. Our main conclusions from comparing the multiplicity properties of the B5–9- and AF-type supergiants to that of their less evolved counterparts is that such stars cannot be explained by a direct evolution from the main sequence. Furthermore, by comparing their multiplicity properties to red supergiant stars, we conclude that the AF supergiant stars are neither progenitors nor descendants of red supergiants

Token-driven totally asymmetric simple exclusion processes

We consider a family of totally asymmetric simple exclusion processes (TASEPs), consisting of particles on a lattice that require binding by a “token” in various physical configurations to advance over the lattice. Using a combination of theory and simulations, we address the following questions: (i) How does token binding kinetics affect the current-density relation on the lattice? (ii) How does this current-density relation depend on the scarcity of tokens? (iii) How do tokens propagate the effects of the locally imposed disorder (such as a slow site) over the entire lattice? (iv) How does a shared pool of tokens couple concurrent TASEPs running on multiple lattices? and (v) How do our results translate to TASEPs with open boundaries that exchange particles with the reservoir? Since real particle motion (including in biological systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations

Cooperative software verification via dynamic program splitting

Cooperative software verification divides the task of software verification among several verification tools in order to increase efficiency and effectiveness. The basic approach is to let verifiers work on different parts of a program and at the end join verification results. While this idea is intuitively appealing, cooperative verification is usually hindered by the fact that program decomposition (1) is often static, disregarding strengths and weaknesses of employed verifiers, and (2) often represents the decomposed program parts in a specific proprietary format, thereby making the use of off-the-shelf verifiers in cooperative verification difficult. In this paper, we propose a novel cooperative verification scheme that we call dynamic program splitting (DPS). Splitting decomposes programs into (smaller) programs, and thus directly enables the use of off-the-shelf tools. In DPS, splitting is dynamically applied on demand: Verification starts by giving a verification task (a program plus a correctness specification) to a verifier V1. Whenever V1 finds the current task to be hard to verify, it splits the task (i.e., the program) and restarts verification on subtasks. DPS continues until (1) a violation is found, (2) all subtasks are completed or (3) some user-defined stopping criterion is met. In the latter case, the remaining uncompleted subtasks are merged into a single one and are given to a next verifier V2, repeating the same procedure on the still unverified program parts. This way, the decomposition is steered by what is hard to verify for particular verifiers, leveraging their complementary strengths. We have implemented dynamic program splitting and evaluated it on benchmarks of the annual software verification competition SV-COMP. The evaluation shows that cooperative verification with DPS is able to solve verification tasks that none of the constituent verifiers can solve, without any significant overhead

Research Data for "Quantum Many-Body Scars beyond the PXP Model in Rydberg Simulators"

Persistent revivals recently observed in Rydberg atom simulators have challenged our understanding of thermalization and attracted much interest to the concept of quantum many-body scars (QMBSs). QMBSs are non-thermal highly excited eigenstates that coexist with typical eigenstates in the spectrum of many-body Hamiltonians, and have since been reported in multiple theoretical models, including the so-called PXP model, approximately realized by Rydberg simulators. At the same time, questions of how common QMBSs are and in what models they are physically realized remain open. In this Letter, we demonstrate that QMBSs exist in a broader family of models that includes and generalizes PXP to longer-range constraints and states with different periodicity. We show that in each model, multiple QMBS families can be found. Each of them relies on a different approximate ⁡(2) algebra, leading to oscillatory dynamics in all cases. However, in contrast to the PXP model, their observation requires launching dynamics from weakly entangled initial states rather than from a product state. QMBSs reported here may be experimentally probed using Rydberg atom simulator in the regime of longer-range Rydberg blockades

An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?

Asynchronous Boolean networks are a type of discrete dynamical system in which each variable can take one of two states, and a single variable state is updated in each time step according to pre-selected rules. Boolean networks are popular in systems biology due to their ability to model long-term biological phenotypes within a qualitative, predictive framework. Boolean networks model phenotypes as attractors, which are closely linked to minimal trap spaces (inescapable hypercubes in the system’s state space). In biological applications, attractors and minimal trap spaces are typically in one-to-one correspondence. However, this correspondence is not guaranteed: motif-avoidant attractors (MAAs) that lie outside minimal trap spaces are possible. MAAs are rare and poorly understood, despite recent efforts. In this contribution to the BMB & JMB Special Collection “Problems, Progress and Perspectives in Mathematical and Computational Biology”, we summarize the current state of knowledge regarding MAAs and present several novel observations regarding their response to node deletion reductions and linear extensions of edges. We conduct large-scale computational studies on an ensemble of 14 000 models derived from published Boolean models of biological systems, and more than 100 million Random Boolean Networks. Our findings quantify the rarity of MAAs; in particular, we only observed MAAs in biological models after applying standard simplification methods, highlighting the role of network reduction in introducing MAAs into the dynamics. We also show that MAAs are fragile to linear extensions: in sparse networks, even a single linear node can disrupt virtually all MAAs. Motivated by this observation, we improve the upper bound on the number of delays needed to disrupt a motif-avoidant attractor

RefinedProsa: Connecting response-time analysis with C verification for interrupt-free schedulers

There has been a recent upsurge of interest in formal, machine-checked verification of timing guarantees for C implementations of real-time system schedulers. However, prior work has only considered tick-based schedulers, which enjoy a clearly defined notion of time: the time "quantum". In this work, we present a new approach to real-time systems verification for interrupt-free schedulers, which are commonly used in deeply embedded and resource-constrained systems but which do not enjoy a natural notion of periodic time. Our approach builds on and connects two recently developed Rocq-based systems—RefinedC (for foundational C verification) and Prosa (for verified response-time analysis)—adapting the former to reason about timed traces and the latter to reason about overheads. We apply the resulting system, which we call RefinedProsa, to verify Rössl, a simple yet representative, fixed-priority, non-preemptive, interrupt-free scheduler implemented in C

LNCS

Cooperative verification is gaining momentum in recent years. The usual setup in cooperative verification is that a verifier A is run with some pre-defined resources, and if it is not able to verify the program, the verification task is passed to a verifier B together with information learned about the program by verifier A, then the chain can continue to a verifier C, and so on. This scheme is static: tools run one after another in a fixed pre-defined order and fixed parameters and resource limits (the scheme may differ for properties to be analyzed, though). Bubaak is a program analysis tool that allows to run multiple program verifiers in a dynamically changing combination of parallel and sequential portfolios. Bubaak starts the verification process by invoking an initial set of tasks; every task, when it is done (e.g., because of hitting a time limit or finishing its job), rewrites itself into one or more successor tasks. New tasks can be also spawned upon events generated by other tasks. This all happens dynamically based on the information gathered by finished and running tasks. During their execution, tasks that run in parallel can exchange (partial) verification artifacts, either directly or with Bubaak as an intermediary

2025_SCACCHI_JCIS

This data set contains the simulation input files, scripts, and figures data belonging to the publication Alberto Scacchi, Carlo Rigoni, Mikko P. Haataja, Jakko V. I. Timonen, and Maria Sammalkorpi, "A Coarse-grained Model for Aqueous Two-phase Systems: Application to Ferrofluids", Journal of Colloids and Interface Science (2025). https://doi.org/10.1016/j.jcis.2025.01.256

Computational design and fabrication of modular robots with untethered control

Natural organisms utilize distributed actuation through their musculoskeletal systems to adapt their gait for traversing diverse terrains or to morph their bodies for varied tasks. A longstanding challenge in robotics is to emulate this capability of natural organisms, which has motivated the development of numerous soft robotic systems. However, such systems are generally optimized for a single functionality, lack the ability to change form or function on demand, or remain tethered to bulky control systems. To address these limitations, we present a framework for designing and controlling robots that utilize distributed actuation. We propose a novel building block that integrates 3D-printed bones with liquid crystal elastomer (LCE) muscles as lightweight actuators, enabling the modular assembly of musculoskeletal robots. We developed LCE rods that contract in response to infrared radiation, thereby providing localized, untethered control over the distributed skeletal network and producing global deformations of the robot. To fully capitalize on the extensive design space, we introduce two computational tools: one for optimizing the robot's skeletal graph to achieve multiple target deformations, and another for co-optimizing skeletal designs and control gaits to realize desired locomotion. We validate our framework by constructing several robots that demonstrate complex shape morphing, diverse control schemes, and environmental adaptability. Our system integrates advances in modular material building, untethered and distributed control, and computational design to introduce a new generation of robots that brings us closer to the capabilities of living organisms