bluuebunny/crossref_metadata_2025_split huggingface dataset:
Sarcopenia is associated with an increase in long-term use of analgesics after elective surgery under general anesthesia
Authors: Sun Mingyang , Chen Wan-Ming , Wu Szu-Yuan , Zhang Jiaqiang 
Published: January 2023

PurposeTo elucidate the association of presurgical sarcopenia and long-term non-opioid analgesic and opioid use after elective surgery under general anesthesia.MethodsWe conducted this population-based propensity score matched to investigate the effects of sarcopenia and long-term non-opioid analgesic and opioid use after elective surgery under general anesthesia between 1 October 2016 and 31 December 2019 from Taiwan’s National Health Insurance Research Database. Sarcopenia is a disease and coded as M62.84 in the International Classification of Diseases, 10th Revision, Clinical Modification. The primary outcome was the combined rate of the long-term use of all non-opioid analgesics or opioids over 3 and 6 months after elective surgery. By performing a logistic regression analysis, we calculated the adjusted ORs (aORs) with 95% CIs to identify the independent predictors for long-term non-opioid analgesic and opioid use after surgery.ResultsIn total, 2860 patients underwent elective surgery. The 3-month non-opioid analgesic and opioid use rates were respectively 49.7% and 1.8% in the sarcopenia group and 37.9% and 0.9% in the non-sarcopenia group; by contrast, 6-month non-opioid analgesic and opioid use rates were respectively 31.6% and 1.2% in the sarcopenia group and 17.2% and 0.3% in the non-sarcopenia group. Moreover, presurgical sarcopenia increased the risk of long-term non-opioid analgesic and opioid use after elective surgery under general anesthesia (aORs for non-opioid analgesic use over 3 and 6 months after surgery: 1.17 (95% CI 1.05 to 2.23) and 1.26 (95% CI 1.04 to 1.45), respectively; aORs for opioid use over 3 and 6 months after surgery: 1.17 (95% CI 1.07 to 2.21) and 1.23 (95% CI 1.10 to 3.64), respectively).ConclusionSarcopenia is associated with higher rates of long-term non-opioid analgesic and opioid use after elective surgery under general anesthesia.SummaryThe aim of this study was to compare the long-term use of non-opioid analgesics and opioids after elective surgery under general anesthesia between patients with and without sarcopenia. Results suggest that patients with sarcopenia are more likely to have increased use of non-opioid analgesics and opioids after surgery. Further research is needed to determine if sarcopenia can be modified prior to surgery and if this impacts the need for long-term pain management with these medications.
Snowmass white paper: beyond the standard model effects on neutrino flavor
Authors: Argüelles C. A. , Barenboim G. , Bustamante M. , Coloma P. , Denton P. B. , Esteban I. , Farzan Y. , Martínez E. Fernández , Forero D. V. , Gago A. M. , Katori T. , Lehnert R. , Ross-Lonergan M. , Suliga A. M. , Tabrizi Z. , Anchordoqui L. , Chakraborty K. , Conrad J. , Das A. , Fong C. S. , Littlejohn B. R. , Maltoni M. , Parno D. , Spitz J. , Tang J. , Wissel S. 
Published: January 2023

AbstractNeutrinos are one of the most promising messengers for signals of new physics Beyond the Standard Model (BSM). On the theoretical side, their elusive nature, combined with their unknown mass mechanism, seems to indicate that the neutrino sector is indeed opening a window to new physics. On the experimental side, several long-standing anomalies have been reported in the past decades, providing a strong motivation to thoroughly test the standard three-neutrino oscillation paradigm. In this Snowmass21 white paper, we explore the potential of current and future neutrino experiments to explore BSM effects on neutrino flavor during the next decade.
Bremsstrahlung as a probe of baryon stopping in heavy-ion collisions
Authors: Nese Sigurd , Nystrand Joakim 
Published: January 2023

AbstractIn collisions between heavy ions at ultra-relativistic energies the participating protons lose energy, which is converted into new particles. As the protons slow down, they emit bremsstrahlung radiation. The yield and angular distribution of the emitted radiation are sensitive probes of how much energy the incoming protons have lost. In this paper, the spectrum of bremsstrahlung radiation is calculated for different stopping scenarios, and the results are compared with the expected yield of photons from hadronic interactions.
Executing Microservice Applications on Serverless, Correctly
Authors: Kallas Konstantinos , Zhang Haoran , Alur Rajeev , Angel Sebastian , Liu Vincent 
Published: January 2023

While serverless platforms substantially simplify the provisioning, configuration, and management of cloud applications, implementing correct services on top of these platforms can present significant challenges to programmers. For example, serverless infrastructures introduce a host of failure modes that are not present in traditional deployments. Individual serverless instances can fail while others continue to make progress, correct but slow instances can be killed by the cloud provider as part of resource management, and providers will often respond to such failures by re-executing requests. For functions with side-effects, these scenarios can create behaviors that are not observable in serverful deployments.
In this paper, we propose mu2sls, a framework for implementing microservice applications on serverless using standard Python code with two extra primitives: transactions and asynchronous calls. Our framework orchestrates user-written services to address several challenges, such as failures and re-executions, and provides formal guarantees that the generated serverless implementations are correct. To that end, we present a novel service specification abstraction and formalization of serverless implementations that facilitate reasoning about the correctness of a given application’s serverless implementation. This formalization forms the basis of the mu2sls prototype, which we then use to develop a few real-world microservice applications and show that the performance of the generated serverless implementations achieves significant scalability (3-5× the throughput of a sequential implementation) while providing correctness guarantees in the context of faults, re-execution, and concurrency.
MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code
Authors: Michael Alexandra E. , Gollamudi Anitha , Bosamiya Jay , Johnson Evan , Denlinger Aidan , Disselkoen Craig , Watt Conrad , Parno Bryan , Patrignani Marco , Vassena Marco , Stefan Deian 
Published: January 2023

Most programs compiled to WebAssembly (Wasm) today are written in unsafe languages like C and C++.
Unfortunately, memory-unsafe C code remains unsafe when compiled to Wasm—and attackers can exploit
buffer overflows and use-after-frees in Wasm almost as easily as they can on native platforms. Memory-
Safe WebAssembly (MSWasm) proposes to extend Wasm with language-level memory-safety abstractions to
precisely address this problem. In this paper, we build on the original MSWasm position paper to realize this vision. We give a precise and formal semantics of MSWasm, and prove that well-typed MSWasm programs are, by construction, robustly memory safe. To this end, we develop a novel, language-independent memory-safety property based on colored memory locations and pointers. This property also lets us reason about the security guarantees of a formal C-to-MSWasm compiler—and prove that it always produces memory-safe programs (and preserves the semantics of safe programs). We use these formal results to then guide several implementations: Two compilers of MSWasm to native code, and a C-to-MSWasm compiler (that extends Clang). Our MSWasm compilers support different enforcement mechanisms, allowing developers to make security-performance trade-offs according to their needs. Our evaluation shows that on the PolyBenchC suite, the overhead of enforcing memory safety in software ranges from 22% (enforcing spatial safety alone) to 198% (enforcing full memory safety), and 51.7% when using hardware memory capabilities for spatial safety and pointer integrity.
More importantly, MSWasm’s design makes it easy to swap between enforcement mechanisms; as fast (especially hardware-based) enforcement techniques become available, MSWasm will be able to take advantage of these advances almost for free.
The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding
Authors: Castellan Simon , Clairambault Pierre 
Published: January 2023

We introduce a multi-token machine for Idealized Parallel Algol (IPA), a higher-order concurrent programming language with shared state and semaphores. Our machine takes the shape of a compositional interpretation of terms as Petri structures, certain coloured Petri nets. For the purely functional fragment of IPA, our machine is conceptually close to Geometry of Interaction token machines, originating from Linear Logic and presenting higher-order computation as the low-level process of a token walking through a graph (a proof net) representing the term. We combine here these ideas with folklore ideas on the representation of first-order imperative concurrent programs as coloured Petri nets.
To prove our machine computationally adequate with respect to the reference operational semantics, we follow game semantics and represent types as certain games specifying dependencies and conflict between computational events. Petri strategies are those Petri structures obeying the rules of the game extracted from the type. We show how Petri strategies unfold to concurrent strategies in the sense of concurrent games on event structures. This link with concurrent strategies not only allows us to prove adequacy of our machine, but also lets us generate operationally a causal description of the behaviour of programs at higher-order types, which is shown to coincide with that given denotationally by the interpretation in concurrent games.
FlashFill++: Scaling Programming by Example by Cutting to the Chase
Authors: Cambronero José , Gulwani Sumit , Le Vu , Perelman Daniel , Radhakrishna Arjun , Simon Clint , Tiwari Ashish 
Published: January 2023

Programming-by-Examples (PBE) involves synthesizing an "intended program" from a small set of user-provided input-output examples. A key PBE strategy has been to restrict the search to a carefully designed small domain-specific language (DSL) with "effectively-invertible" (EI) operators at the top and "effectively-enumerable" (EE) operators at the bottom. This facilitates an effective combination of top-down synthesis strategy (which backpropagates outputs over various paths in the DSL using inverse functions) with a bottom-up synthesis strategy (which propagates inputs over various paths in the DSL). We address the problem of scaling synthesis to large DSLs with several non-EI/EE operators. This is motivated by the need to support a richer class of transformations and the need for readable code generation. We propose a novel solution strategy that relies on propagating fewer values and over fewer paths.
Our first key idea is that of "cut functions" that prune the set of values being propagated by using knowledge of the sub-DSL on the other side. Cuts can be designed to preserve completeness of synthesis; however, DSL designers may use incomplete cuts to have finer control over the kind of programs synthesized. In either case, cuts make search feasible for non-EI/EE operators and efficient for deep DSLs. Our second key idea is that of "guarded DSLs" that allow a precedence on DSL operators, which dynamically controls exploration of various paths in the DSL. This makes search efficient over grammars with large fanouts without losing recall. It also makes ranking simpler yet more effective in learning an intended program from very few examples. Both cuts and precedence provide a mechanism to the DSL designer to restrict search to a reasonable, and possibly incomplete, space of programs.
Using cuts and gDSLs, we have built FlashFill++, an industrial-strength PBE engine for performing rich string transformations, including datetime and number manipulations. The FlashFill++ gDSL is designed to enable readable code generation in different target languages including Excel's formula language, PowerFx, and Python. We show FlashFill++ is more expressive, more performant, and generates better quality code than comparable existing PBE systems. FlashFill++ is being deployed in several mass-market products ranging from spreadsheet software to notebooks and business intelligence applications, each with millions of users.
You Only Linearize Once: Tangents Transpose to Gradients
Authors: Radul Alexey , Paszke Adam , Frostig Roy , Johnson Matthew J. , Maclaurin Dougal 
Published: January 2023

Automatic differentiation (AD) is conventionally understood as a family of distinct algorithms, rooted in two “modes”—forward and reverse—which are typically presented (and implemented) separately. Can there be only one? Following up on the AD systems developed in the JAX and Dex projects, we formalize a decomposition of reverse-mode AD into (i) forward-mode AD followed by (ii) unzipping the linear and non-linear parts and then (iii) transposition of the linear part.
To that end, we define a (substructurally) linear type system that can prove a class of functions are (algebraically) linear. Our main results are that forward-mode AD produces such linear functions, and that we can unzip and transpose any such linear function, conserving cost, size, and linearity. Composing these three transformations recovers reverse-mode AD. This decomposition also sheds light on checkpointing, which emerges naturally from a free choice in unzipping let expressions. As a corollary, checkpointing techniques are applicable to general-purpose partial evaluation, not just AD.
We hope that our formalization will lead to a deeper understanding of automatic differentiation and that it will simplify implementations, by separating the concerns of differentiation proper from the concerns of gaining efficiency (namely, separating the derivative computation from the act of running it backward).
A Calculus for Amortized Expected Runtimes
Authors: Batz Kevin , Kaminski Benjamin Lucien , Katoen Joost-Pieter , Matheja Christoph , Verscht Lena 
Published: January 2023

We develop a weakest-precondition-style calculus à la Dijkstra for reasoning about
amortized expected runtimes of randomized algorithms with access to dynamic memory
— the aert calculus. Our calculus is truly quantitative, i.e. instead of Boolean valued predicates, it manipulates real-valued functions.	En route to the aert calculus, we study the ert calculus for reasoning about
expected runtimes
of Kaminski et al. [2018] extended by capabilities for handling dynamic memory, thus enabling
compositional
and
local
reasoning about
randomized data structures
. This extension employs
runtime separation logic
, which has been foreshadowed by Matheja [2020] and then implemented in Isabelle/HOL by Haslbeck [2021]. In addition to Haslbeck’s results, we further prove soundness of the so-extended ert calculus with respect to an operational Markov decision process model featuring countably-branching nondeterminism, provide extensive intuitive explanations, and provide proof rules enabling separation logic-style verification for upper bounds on expected runtimes. Finally, we build the so-called
potential method
for amortized analysis into the ert calculus, thus obtaining the aert calculus. Soundness of the aert calculus is obtained from the soundness of the ert calculus and some probabilistic form of telescoping.	Since one needs to be able to handle
changes in potential
which can in principle be both positive or negative, the aert calculus needs to be — essentially — capable of handling certain signed random variables. A particularly pleasing feature of our solution is that, unlike e.g. Kozen [1985], we obtain a loop rule for our signed random variables, and furthermore, unlike e.g. Kaminski and Katoen [2017], the aert calculus makes do without the need for involved technical machinery keeping track of the integrability of the random variables.

Finally, we present case studies, including a formal analysis of a randomized delete-insert-find-any set data structure [Brodal et al. 1996], which yields a constant expected runtime per operation, whereas no deterministic algorithm can achieve this.
LEF1 Creates Memories in iNKT Cells That Potentiate Antitumor Immunity
Authors: Van Kaer Luc 
Published: January 2023

AbstractInvariant natural killer T (iNKT) cells are a subset of innate-like T cells with great potential for developing cancer immunotherapies, including approaches based on chimeric antigen receptors (CAR). In this issue, Ngai and colleagues report that the transcription factor lymphoid enhancer-binding factor 1 (LEF1) optimizes functional properties of iNKT cells that promote antitumor immunity, raising enthusiasm for the development of robust cancer immunotherapies based on CAR-modified iNKT cells.See related article by Ngai et al., p. 171 (2).
The Proportion of Dietary Salt Replaced With Potassium-Enriched Salt in the SSaSS: Implications for Scale-Up
Authors: Yin Xuejun , Paige Ellie , Tian Maoyi , Li Qiang , Huang Liping , Yu Jie , Rodgers Anthony , Elliott Paul , Wu Yangfeng , Neal Bruce 
Published: January 2023

Background:
The SSaSS (Salt Substitute and Stroke Study) recently reported definitive effects of a potassium-enriched salt on cardiovascular outcomes and death. Quantifying the amount of potassium-enriched salt used by trial participants is important for understanding the magnitude of the effect of potassium-enriched salt on risk reduction and how population-wide scale-up might be achieved.

Methods:
Baseline and annual 24-hour urine samples were collected from subgroups of participants in SSaSS throughout the 5-year follow-up. The mean difference in 24-hour potassium excretion between the 2 groups was used to estimate the quantity of potassium-enriched salt consumed in the intervention group. The corresponding projected difference in sodium intake between groups was calculated and compared with the observed difference.

Results:
The potassium-enriched salt group, compared to the regular salt group, had a mean increase in 24-hour urinary potassium excretion of 0.80 g/d (95% CI, 0.71–0.90), which equates to consumption of 8.8 g/d (95% CI, 7.8–9.9) of potassium-enriched salt. Based on 8.8 g/d potassium-enriched salt consumption, the projected difference in 24-hour urinary sodium excretion was −0.79 g/d. This compares to an observed difference of −0.35 g/d (95% CI, −0.55 to −0.15) and suggests that 72% of baseline regular salt intake was replaced by potassium-enriched salt.

Conclusions:
The smaller than anticipated between-group difference in sodium excretion likely results from the joint use of regular salt and potassium-enriched salt in the intervention group. Our findings suggest that even an incomplete replacement of regular salt with potassium-enriched salt can deliver significant health gains.

Registration:

URL:
https://www.clinicaltrials.gov
; Unique identifier: NCT02092090.
Aortic Valve Reconstruction With Autologous Pericardium Versus a Bioprosthesis: The Ozaki Procedure in Perspective
Authors: Unai Shinya , Ozaki Shigeyuki , Johnston Douglas R. , Saito Tomohiro , Rajeswaran Jeevanantham , Svensson Lars G. , Blackstone Eugene H. , Pettersson Gösta B. 
Published: January 2023

Background
We assessed the Ozaki procedure, aortic valve reconstruction using autologous pericardium, with respect to its learning curve, hemodynamic performance, and durability compared with a stented bioprosthesis.

Methods and Results

From January 2007 to January 2016, 776 patients underwent an Ozaki procedure at Toho University Ohashi Medical Center. Learning curves, aortic regurgitation (AR), and peak gradient, assessed by serial echocardiograms, valve rereplacement, and survival were investigated. Valve performance and durability were compared with 627 1:1 propensity‐matched patients receiving stented bovine pericardial valves implanted from 1982 to 2011 at Cleveland Clinic. Learning curves were observed for aortic clamp and cardiopulmonary bypass times, AR prevalence, and early mortality. Decreased aortic clamp time was observed over the first 300 cases. New surgeons performing parts of the procedure after case 400 resulted in a slight increase in aortic clamp and cardiopulmonary bypass times. Among matched patients, the Ozaki cohort had more AR than the PERIMOUNT cohort (severe AR at 1 and 6 years, 0.58% and 3.6% versus 0.45% and 1.0%, respectively;
P
[trend]=0.006), although with a steep learning curve. Peak gradient showed the opposite trend: 14 and 17 mm Hg for Ozaki and 24 and 28 mm Hg for PERIMOUNT at these times (
P
[trend]
<
0.001). Freedom from rereplacement was similar (
P
=0.491). Survival of the Ozaki cohort was 85% at 6 years.

Conclusions
Patients undergoing the Ozaki procedure had lower gradients but more recurrent AR than those receiving PERIMOUNT bioprostheses. Although recurrent AR is concerning, results confirm low risk and good midterm performance of the Ozaki procedure, supporting its continued use.
A skeptic’s guide to Sherwin Carlquist’s inferences of xylem function
Authors: Olson Mark E. 
Published: January 2023

Summary
Sherwin Carlquist’s work was filled with inferences of xylem function, and yet he did not carry out xylem physiological or biomechanical measurements. Moreover, his quantitative analyses were rudimentary and he disliked the standard scientific practice of quantifying uncertainty with statistical analyses. Also, took few pains to explain to other functional xylem biologists why his comparative approach was useful and appropriate. Here, I discuss why nevertheless his papers are extremely valuable contributions to inferences of xylem function. The most important insight is that Sherwin used a valid and essential approach for the inference of biological function, known as the comparative method. Together with optimality models, population biology (including xylem physiology), and studies of developmental potential, the comparative method is an indispensable part of a maximally supported inference of xylem structure–function relation. Detecting his insightful inferences of function often requires reading around his various idiosyncrasies, including the lack of statistics and instead his reliance on his extraordinary memory to detect patterns. With this guide to reading Carlquist’s work, I hope to give functional xylem physiologists better access to the richest and most wide-ranging body of functional hypotheses found in the xylem literature.
Platikos and moirikos: Ancient Horoscopic Practice in the Light of Vettius Valens’ Anthologies
Authors: Gansten Martin 
Published: January 2023

Abstract
From the ancient practice, implied by many textual sources although never formally prescribed, of identifying the twelve horoscopic places (the δωδεκάτροπος dōdekatropos) with the zodiacal signs, recent scholarship has often concluded that such identification constituted a tenet of ancient astrology even at a conceptual level. On the basis of a close reading of Vettius Valens’ Anthologies, supported by other ancient sources, this paper argues that while the places, like other elements of horoscopic practice, were often provisionally approximated by sign position alone, calculation of places by degree, with boundaries differing from those of the zodiacal signs, was consistently upheld in principle as more accurate and useful. Specifically, Valens’ preference appears to have been for places calculated from the quadrants formed by the intersections of horizon and meridian, a method also occasionally used in the Anthologies for defining planetary configurations and for annual transmission (παράδοσις paradosis). In several cases, such methods are explicitly employed even for horoscopes presented in a simple, signs-only format.