bluuebunny/crossref_metadata_2025_split huggingface dataset:
Separating insider and informed behavior: Evidence from a natural setting
Authors: Hegarty Tadgh 
Published: April 2024

AbstractPrevious literature has established the need to separate insider from expert trading in both financial and betting markets. This type of separation proves difficult to achieve because experts and insiders co‐exist in most market settings. Utilizing novel betting markets in which expert skill bettors are unable to use their expert knowledge, this study uncouples insider from expert betting, and allows more direct measurement of insider trading than in previous empirical tests. Evidence is presented in favor of some predictions from the highly cited Shin model of insider trading. Price setters charge an extra premium in markets with high proportions of insiders when compared to equivalent markets. The insiders accurately predict event outcomes, and their presence exacerbates a well known bias in betting market prices whereby returns on betting favorites is higher than for bets on longshots.
Does capitalism disfavor women? Evidence from life satisfaction
Authors: Berggren Niclas , Bjørnskov Christian 
Published: April 2024

AbstractThere is concern, especially in certain feminist circles, that capitalism disfavors women. This could take many forms, for example, lower wages for the same work, reduced career opportunities, disparities in ownership, and the upholding of traditional gender roles, and it could result in capitalism conferring more life satisfaction on men than on women. We test empirically whether this concern is justified. Using the epidemiological approach to rule out reverse causality, we first confirm previous findings that most areas of economic freedom (legal quality in particular, but also monetary stability, openness, and regulation) are beneficial for general life satisfaction. When looking at women and men separately, we find virtually no statistically significant differences, and in the cases we do, the estimates reveal a more beneficial outcome for women. Hence, we conclude that capitalism does not seem to favor men more than women in terms of life satisfaction.
Characterization of Starch Properties in Diverse Pea Accessions: Structural, Morphological, Thermal, Pasting, and Retrogradation Analysis
Authors: Shevkani Khetan , Singh Narpinder , Kaur Navpreet , Isono Naoto , Noda Takahiro 
Published: April 2024

AbstractThe present work evaluates starch from 29 diverse pea accessions for structural (amylose content and amylopectin chain length distribution), granule size distribution, thermal, pasting, and retrogradation properties. Amylose content and the proportion of amylopectin chains with the degree of polymerization (DP) of 6–10, 11–20, and >20 vary in the range from 21.4% to 57.0%, 17.9% to 25.8%, 64.0% to 66.5%, and 9.4% to 16.7%, respectively. Starches with a higher proportion of small granules (<5 µm) have a greater proportion of amylopectin chains with DP > 10 and exhibit higher transition temperatures/enthalpy and vice versa. Retrogradation in starch pastes relates negatively to the proportion of amylopectin chains with DP < 10. Paste viscosities relate negatively with amylopectin chains with DP > 10, amylose content, and retrogradation while positively with transition temperatures/enthalpy and the potential of granules to swell.
Single‐cell transcriptome sequencing analysis reveals intra‐tumor heterogeneity in esophageal squamous cell carcinoma
Authors: Nie Yuanliu , Yao Guangyue , Wei Yanjun , Wu Sheng , Zhang Wentao , Xu Xiaoying , Li Qiang , Zhou Fengge , Yang Zhe 
Published: April 2024

AbstractEsophageal squamous cell carcinoma (ESCC) is a prevalent malignant tumor of the digestive system that poses a significant threat to human life and health. It is crucial to thoroughly investigate the mechanisms of esophageal carcinogenesis and identify potential key molecular events in its carcinogenesis. Single‐cell transcriptome sequencing is an emerging technology that has gained prominence in recent years for studying molecular mechanisms, which may help to further explore the underlying mechanisms of the ESCC tumor microenvironment in depth. The single‐cell dataset was obtained from GSE160269 in the Gene Expression Omnibus database, including 60 tumor samples and four paracancer samples. The single‐cell data underwent dimensional reduction clustering analysis to identify clusters and annotate expression profiles. Subcluster analysis was conducted for each cellular taxon. Copy number variation analysis of tumor cell subpopulations was performed to primarily identify malignant cells within them. A proposed chronological analysis was performed to obtain the process of cell differentiation. In addition, cell communication, transcription factor analysis, and tumor pathway analysis were also performed. Relevant risk models and key genes were established by univariate COX regression and LASSO analysis. The key genes obtained from the screen were subjected to appropriate silencing and cellular assays, including CCK‐8, 5‐ethynyl‐2′‐deoxyuridine, colony formation, and western blot. Single‐cell analysis revealed that normal samples contained a large number of fibroblasts, T cells, and B cells, with fewer other cell types, whereas tumor samples exhibited a relatively balanced distribution of cell types. Subclassification analysis of immune cells, fibroblasts, endothelial cells, and epithelial cells revealed their specific spatial characteristics. The prognostic risk model, we constructed successfully, achieved accurate prognostic stratification for ESCC patients. The screened key gene, UPF3A, was found to be significantly associated with the development of ESCC by cellular assays. This process might be linked to the phosphorylation of ERK and P38. Single‐cell transcriptome analysis successfully revealed the distribution of cell types and major expressed factors in ESCC patients, which could facilitate future in‐depth studies on the therapeutic mechanisms of ESCC.
Globular adiponectin induces esophageal adenocarcinoma cell pyroptosis via the miR‐378a‐3p/UHRF1 axis
Authors: Wang Jun , Cheng Yan , Xiaoran Yin , Chen Fengrong , Jie Wu , Yahui Huang , Yue Wang , Dong Liu , Yumei Luo , Cheng Feng , Libo Zhang , Jun Zhang 
Published: April 2024

AbstractBackgroundAntiapoptosis is a major factor in the resistance of tumor cells to chemotherapy and radiotherapy. Thus, activation of cell pyroptosis may be an effective option to deal with antiapoptotic cancers such as esophageal adenocarcinoma (EAC).MethodsDifferential expression of ubiquitin‐like versus PHD and ring finger structural domain 1 (UHRF1) in EAC and near normal tissues was analyzed, as well as the prognostic impact on survival in EAC. Also, the same study was done for globular adiponectin (gAD). Simultaneously, the mRNA expression of UHRF1 was observed in different EAC cell lines. Real time cellular analysis (RTCA) was used to detect cell proliferation, and flow cytometry and inverted fluorescence microscopy were used to detect pyroptosis. Biocredit analysis was conducted to observe the correlation between UHRF1 and key pyroptosis proteins. OD values and CCK8 assay were used to determine the effect of miR‐378a‐3p on EAC cells. Quantitative real‐time polymerase chain reaction and Western blot were used to detect the correlation between UHRF1, gAD, and miR‐378a‐3p in EAC cells. Moreover, in vivo and in vitro experiments were performed to detect the relevant effects on tumor migration and invasion after inhibiting UHRF1 expression.ResultsUHRF1 was negatively correlated with the survival of patients with EAC, while miR‐378a‐3p showed the opposite effect. Additionally, gAD promoted EAC cell pyroptosis, upregulated miR‐378a‐3p, and significantly inhibited the proliferation of EAC cells. gAD directly reduced UHRF1 expression in EAC cells by upregulating miR‐378a‐3p. In cell migration and invasion assays, inhibition of UHRF1 expression significantly suppressed EAC cell metastasis. In animal experiments, we again demonstrated that gAD induced pyroptosis in EAC cells by inhibiting the expression of UHRF1.ConclusiongAD‐induced upregulation of miR‐378a‐3p significantly inhibited the proliferation of EAC by targeting UHRF1. Therefore, gAD may serve as an alternative therapy for chemotherapy‐ and radiation‐refractory EAC or other cancers with the same mechanism of pyroptosis action.
Torque‐tuned I‐V characteristics in a piezoelectric semiconductor composite fiber
Authors: Zhang Gongye , Mei Yanjie , Mi Changwen , Qu Yilin 
Published: April 2024

AbstractThis paper studies the multi‐physical fields in a torsional composite fiber composed of a non‐piezoelectric semiconductor (PS) core coated with a piezoelectric dielectric shell. Based on the three‐dimensional framework of piezoelectricity and drift‐diffusion theory, we develop a nonlinear one‐dimensional model that incorporates the warping deformation, shear deformation, and axial variations of the electric field and charge transportations. A One‐dimensional model is linearized for small perturbations of charges, and we obtain the analytical solutions for single rods or PN junctions when torques are applied, which explicitly illustrates the electromechanical fields and redistribution of mobile charges. We also examine how the thickness of the composite rods affects the interaction between the piezoelectric and semiconductor components in the model. The optimal thickness ratio for maximizing the overall mobility of carriers has been discovered. This enables us to modify the thickness ratio to achieve the greatest PS interaction performance. Based on the nonlinear equations, we analyze the relationships between electric currents and applied voltages on the end of rods. Finally, we examine how twisting moments influence the characteristics of this I‐V relationship. The presented study provides a potential application for mechanical switches or sensors for PSs.
Determinization of Integral Discounted-Sum Automata is Decidable
Authors: Almagor Shaull , Dafni Neta 
Published: April 2024

AbstractNondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite automata equipped with a discounting factor $$\lambda >1$$

λ
>
1

, and whose transitions are labelled by weights. The value of a run of an NDA is the discounted sum of the edge weights, where the i-th weight is divided by $$\lambda ^{i}$$

λ
i

. NDAs are a useful tool for modelling systems where the values of future events are less influential than immediate ones.While several problems are undecidable or open for NDA, their deterministic fragment (DDA) admits more tractable algorithms. Therefore, determinization of NDAs (i.e., deciding if an NDA has a functionally-equivalent DDA) is desirable.Previous works establish that when $$\lambda \in \mathbb {N}$$

λ
∈
N

, then every complete NDA, namely an NDA whose states are all accepting and its transition function is complete, is determinizable. This, however, no longer holds when the completeness assumption is dropped.We show that the problem of whether an NDA has an equivalent DDA is decidable when $$\lambda \in \mathbb {N}$$

λ
∈
N

(in particular, it is in $$\textsf{EXPSPACE}$$
EXPSPACE
and is $$\mathsf {PSPACE-hard}$$

PSPACE
-
hard

).
Checking History-Determinism is NP-hard for Parity Automata
Authors: Prakash Aditya 
Published: April 2024

AbstractWe show that the problem of checking if a given nondeterministic parity automaton simulates another given nondeterministic parity automaton is NP-hard. We then adapt the techniques used for this result to show that the problem of checking history-determinism for a given parity automaton is NP-hard. This is an improvement from Kuperberg and Skrzypczak’s previous lower bound of solving parity games from 2015. We also show that deciding if Eve wins the one-token game or the two-token game of a given parity automaton is NP-hard. Finally, we show that the problem of deciding if the language of a nondeterministic parity automaton is contained in the language of a history-deterministic parity automaton can be solved in quasi-polynomial time.
Monoidal Extended Stone Duality
Authors: Birkmann Fabian , Urbat Henning , Milius Stefan 
Published: April 2024

AbstractExtensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental for proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions, subsuming various incarnations of classical extended Stone and Priestley duality as a special case. Guided by these categorical foundations, we investigate residuation algebras, which are algebraic models of language derivatives, and show the subcategory of derivation algebras to be dually equivalent to the category of profinite ordered monoids, restricting to a duality between boolean residuation algebras and profinite monoids. We further extend this duality to capture relational morphisms of profinite ordered monoids, which dualize to natural morphisms of residuation algebras.
Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory)
Authors: Stein Dario , Samuelson Richard 
Published: April 2024

AbstractWe introduce a compositional framework for convex analysis based on the notion ofconvex bifunctionof Rockafellar. This framework is well-suited to graphical reasoning, and exhibits rich dualities such as the Legendre-Fenchel transform, while generalizing formalisms like graphical linear algebra, convex relations and convex programming. We connect our framework to probability theory by interpreting the Laplace approximation in its context: The exactness of this approximation on normal distributions means that logdensity is a functor from Gaussian probability (densities and integration) to concave bifunctions and maximization.
CTMCs with Imprecisely Timed Observations
Authors: Badings Thom , Volk Matthias , Junges Sebastian , Stoelinga Marielle , Jansen Nils 
Published: April 2024

AbstractLabeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters but may be uncertain. Thus, we consider a setting in which we are given a sequence of imprecisely timed labels called the evidence. The problem is to compute reachability probabilities, which we condition on this evidence. Our key contribution is a method that solves this problem by unfolding the CTMC states over all possible timings for the evidence. We formalize this unfolding as a Markov decision process (MDP) in which each timing for the evidence is reflected by a scheduler. This MDP has infinitely many states and actions in general, making a direct analysis infeasible. Thus, we abstract the continuous MDP into a finite interval MDP (iMDP) and develop an iterative refinement scheme to upper-bound conditional probabilities in the CTMC. We show the feasibility of our method on several numerical benchmarks and discuss key challenges to further enhance the performance.
Dissipative quadratizations of polynomial ODE systems
Authors: Cai Yubo , Pogudin Gleb 
Published: April 2024

AbstractQuadratization refers to a transformation of an arbitrary system of polynomial ordinary differential equations to a system with at most quadratic right-hand side. Such a transformation unveils new variables and model structures that facilitate model analysis, simulation, and control and offer a convenient parameterization for data-driven approaches. Quadratization techniques have found applications in diverse fields, including systems theory, fluid mechanics, chemical reaction modeling, and mathematical analysis.In this study, we focus on quadratizations that preserve the stability properties of the original model, specifically dissipativity at given equilibria. This preservation is desirable in many applications of quadratization including reachability analysis and synthetic biology. We establish the existence of dissipativity-preserving quadratizations, develop an algorithm for their computation, and demonstrate it in several case studies.
Towards Safe Autonomous Driving: Model Checking a Behavior Planner during Development
Authors: König Lukas , Heinzemann Christian , Griggio Alberto , Klauck Michaela , Cimatti Alessandro , Henze Franziska , Tonetta Stefano , Küperkoch Stefan , Fassbender Dennis , Hanselmann Michael 
Published: April 2024

AbstractAutomated driving functions are among the most critical software components to develop. Before deployment in series vehicles, it has to be shown that the functions drive safely and in compliance with traffic rules. Despite the coverage that can be reached with very large amounts of test drives, corner cases remain possible. Furthermore, the development is subject to time-to-delivery constraints due to the highly competitive market, and potential logical errors must be found as early as possible. We describe an approach to improve the development of an actual industrial behavior planner for the Automated Driving Alliance between Bosch and Cariad. The original process landscape for verification and validation is extended with model checking techniques. The idea is to integrate automated extraction mechanisms that, starting from the C++ code of the planner, generate a higher-level model of the underlying logic. This model, composed in closed loop with expressive environment descriptions, can be exhaustively analyzed with model checking. This results, in case of violations, in traces that can be re-executed in system simulators to guide the search for errors. The approach was exemplarily deployed in series development, and successfully found relevant issues in intermediate versions of the planner at development time.
Mata: A Fast and Simple Finite Automata Library
Authors: Chocholatý David , Fiedor Tomáš , Havlena Vojtěch , Holík Lukáš , Hruška Martin , Lengál Ondřej , Síč Juraj 
Published: April 2024

AbstractMata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding.The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.
Rabin Games and Colourful Universal Trees
Authors: Majumdar Rupak , Sağlam Irmak , Thejaswini K. S. 
Published: April 2024

AbstractWe provide an algorithm to solve Rabin and Streett games over graphs with n vertices, m edges, and k colours that runs in $$\tilde{O}\left( mn(k!)^{1+o(1)} \right) $$

O
~

m
n

(
k
!
)

1
+
o
(
1
)

time and $$O(nk\log k \log n)$$

O
(
n
k
log
k
log
n
)

space, where $$\tilde{O}$$

O
~

hides poly-logarithmic factors. Our algorithm is an improvement by a super quadratic dependence on k! from the currently best known run time of $$O\left( mn^2(k!)^{2+o(1)}\right) $$

O

m

n
2

(
k
!
)

2
+
o
(
1
)

, obtained by converting a Rabin game into a parity game, while simultaneously improving its exponential space requirement.Our main technical ingredient is a characterisation of progress measures for Rabin games using colourful trees and a combinatorial construction of succinctly-represented, universal colourful trees. Colourful universal trees are generalisations of universal trees used by Jurdziński and Lazić (2017) to solve parity games, as well as of Rabin progress measures of Klarlund and Kozen (1991). Our algorithm for Rabin games is a progress measure lifting algorithm where the lifting is performed on succinct, colourful, universal trees.
Verification under TSO with an infinite Data Domain
Authors: Abdulla Parosh Aziz , Atig Mohamed Faouzi , Furbach Florian , Garg Shashwat 
Published: April 2024

AbstractWe examine verification of concurrent programs under the total store ordering (TSO) semantics used by thex86architecture. In our model, threads manipulate variables over infinite domains and they can check whether variables are related for a range of relations. We show that, in general, the control state reachability problem is undecidable. This result is derived through a reduction from the state reachability problem of lossy channel systems with data (which is known to be undecidable).In the light of this undecidability, we turn our attention to a more tractable variant of the reachability problem. Specifically, we study context bounded runs, which provide an under-approximation of the program behavior by limiting the possible interactions between processes. A run consists of a number of contexts, with each context representing a sequence of steps where a only single designated thread is active. We prove that the control state reachability problem under bounded context switching is PSPACE complete.
ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution)
Authors: Bajczi Levente , Ádám Zsófia , Micskei Zoltán 
Published: April 2024

AbstractConcurrentWitness2Testis a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance ofConcurrentWitness2Testcorroborates the usefulness of the proposed approach.
Goblint Validator: Correctness Witness Validation by Abstract Interpretation
Authors: Saan Simmo , Erhard Julian , Schwarz Michael , Bozhilov Stanimir , Holter Karoliine , Tilscher Sarah , Vojdani Vesal , Seidl Helmut 
Published: April 2024

AbstractGoblintis an abstract interpretation framework for C programs with a specialty in concurrency. Using a novel approach, we turn it into a validator of YAML correctness witnesses for all SV-COMP categories. We describe its results at SV-COMP 2024 which includes the first large-scale evaluation of our validator.
AISE: A Symbolic Verifier by Synergizing Abstract Interpretation and Symbolic Execution (Competition Contribution)
Authors: Wang Zhen , Chen Zhenbang 
Published: April 2024

Abstractis a static verifier that can verify the safety properties of C programs. The core of is a program verification framework that synergizes abstract interpretation and symbolic execution in a novel manner. Compared to the individual application of symbolic execution or abstract interpretation, has better efficiency and precision. The implementation of is based on and .