bluuebunny/crossref_metadata_2025_split huggingface dataset:
Post‐publication research integrity concerns in randomized clinical trials: A scoping review of the literature
Authors: Chien Patrick F. W. , Elsuity Mohamad A. , Rashwan Mosab M. , Núñez‐Núñez María , Khan Khalid S. , Zamora‐Romero Javier , Bueno‐Cavanillas Aurora , Fawzy Mohamed 
Published: April 2024

AbstractBackgroundPost‐publication handling of integrity concerns in randomized clinical trials (RCTs) is a contentious matter.ObjectivesWe undertook a scoping systematic review to map the literature regarding post‐publication integrity issues in RCTs.Search Strategy and Selection CriteriaFollowing prospective registration (https://osf.io/pgxd8) we initially searched PubMed and Scopus but subsequently extended it to include the Cochrane Library, and Google Scholar databases without language, article type or publication time restriction until November 2022. Reviewers independently selected published articles covering any aspect of post‐publication research integrity concerns in RCTs.Data Collection and AnalysisThe study findings grouped within domains relating to issues concerning post‐publication integrity were extracted in duplicate, verified by a third reviewer, and then tabulated.Main ResultsThe initial search captured 3159 citations, of which 89 studies were included in the review. Cross‐sectional studies constituted the majority of included studies (n = 34, 38.2%), followed by systematic reviews (n = 10, 11.2%), methodology reviews/studies (n = 9, 10.1%) and other types of descriptive studies (n = 8, 9.0%). A total of 21 articles (23.6%) covered the domain on general issues, 25 (28.1%) in the journal's instructions and policies domain, eight (9.0%) in the editorial and peer review domain, one (1.1%) in the correspondence and complaints (post‐publication peer review) domain, 12 (13.5%) in the investigation for concerns domain, six (6.7%) in the post‐investigation decisions and sanctions domain, none in the critical appraisal guidance domain, five (5.6%) in the integrity assessment in systematic reviews domain, and 26 (29.2%) in the recommendations for future research domain. A total of 12 of the selected articles (13.5%) covered two (n = 9) or three (n = 3) different domains.ConclusionsVarious research integrity domains and issues covering post‐publication aspects of RCT integrity were captured and gaps were identified, mostly related with the necessary implications for all stakeholders to improve research transparency. There is an urgent need for a multistakeholder consensus towards creating specific statements for addressing post‐publication integrity concerns in RCTs.
Risk factors for placenta accreta spectrum without prior cesarean section: A case–control study in China
Authors: You Huanyu , Wang Yan , Han Rui , Gu Jinyu , Zeng Lin , Zhao Yangyu 
Published: April 2024

AbstractObjectiveTo identify the risk factors for placenta accreta spectrum (PAS) disorders in women without prior cesarean section (CS).MethodsThis retrospective case–control study investigated patients without prior CS who gave birth at Peking University Third Hospital between January 1, 2015 and December 31, 2021. Patients diagnosed with PAS according to the clinical diagnostic criteria of the 2019 International Federation of Gynecology and Obstetrics (FIGO) classification were included as the study group. Patients were matched as the control group according to delivery date and placenta previa, in a 1:2 allocation ratio. Maternal characteristics were compared between the two groups.ResultsThe study included 348 patients in the study group and 696 in the control group. The multivariate analysis showed that the independent risk factors of PAS consisted of operative hysteroscopy (once: adjusted odds ratio [aOR] 2.38, 95% CI 1.28–4.24, P = 0.006; twice or more: aOR 5.43, 95% CI 1.04–28.32, P = 0.045), uterine curettage (once: aOR 2.54, 95% CI 1.80–3.58, P < 0.001; twice: aOR 3.01, 95% CI 1.81–5.02, P < 0.001; three or more times: aOR 9.18, 95% CI 4.64–18.18, P < 0.001), multifetal pregnancy (aOR 5.64, 95% CI 3.01–10.57, P < 0.001), adenomyosis (aOR 2.77, 95% CI 1.23–6.22, P = 0.014), in vitro fertilization (aOR 1.51, 95% CI 1.04–2.20, P = 0.030) and pre‐eclampsia (aOR 2.72, 95% CI 1.36–5.45, P = 0.005), and the independent protective factor was being multiparous (aOR 0.37, 95% CI 0.25–0.54, P < 0.001).ConclusionAfter controlling the effect of placenta previa, we found that patients with PAS without prior CS had unique maternal characteristics. Classification and quantification of the intrauterine surgeries they have undergone is essential for identifying high‐risk patients. Early identification of high‐risk groups by risk factors has the potential to improve the prognosis considerably.
Estimating fetal weight in gastroschisis: A 10 year audit of outcomes at the National Maternity Hospital
Authors: O’Keeffe Rachel , Mulligan Karen , McParland Peter , McAuliffe Fionnuala M. , Mahony Rhona , Corcoran Siobhan , O’Connor Clare , Carroll Stephen , Walsh Jennifer 
Published: April 2024

AbstractObjectiveTo identify whether conventional methods of estimating fetal growth (Hadlock's formula), which relies heavily on abdominal circumference measurements, are accurate in fetuses with gastroschisis.MethodsA retrospective cohort study was performed between the period January 1, 2011 and December 31, 2021 in a tertiary referral maternity hospital identifying all pregnancies with a diagnosis of gastroschisis. Projected fetal weight was obtained using the formula (EFW [Hadlock's formula] + 185 g × [X/7]) where X was the number of days to delivery.ResultsDuring the study period 41 cases were identified. The median maternal age was 25. The median BMI was 25 and 63% were primiparous women (n = 26). Median gestation at diagnosis was 21 weeks. Median gestation at delivery was 36 weeks. A total of 4.8% of mothers had a history of drug use (n = 2). The rate of maternal tobacco use was 21.9% (n = 9). A total of 4.8% of fetuses had additional congenital anomalies including amniotic band syndrome and myelomeningocele (n = 2).Estimated fetal weight (EFW) and birth weight data were available for 34 cases. A Wilcoxon signed‐rank test showed projected EFW using Hadlock's formula did not result in a statistically significant different birth weight (Z = −1.3, P = 0.169). Median projected weight and actual birth weight were 2241.35 and 2415 g respectively. Median difference was 0.64 g (95% CI: −148 to −28.5).ConclusionOur data showed accuracy using standard formulae for EFW in fetuses with gastroschisis.
Insecure attachment and eating disorder symptoms: Intolerance of uncertainty and emotion regulation as mediators
Authors: Jin Ling , Zamudio Gabriel , Wang Chiachih DC , Lin Stacy 
Published: April 2024

AbstractObjectiveLiterature on eating disorder (ED) symptoms of Black, Indigenous, and People of Color (BIPOC) group is extremely scarce. This study aimed to understand the mechanisms underlying the associations between insecure attachment and ED symptoms and examine whether these mechanisms differed between White and BIPOC groups.MethodThe study investigated direct and indirect relationship between attachment anxiety/avoidance and ED symptoms via intolerance of uncertainty (IU) and emotion regulation strategies of suppression and reappraisal. Further, we examined whether the proposed mechanisms equally represented White versus BIPOC using Multigroup Structural Equation Model (MG‐SEM). A total of 1227 college students (48.50% BIPOC and 51.50% White) completed research questionnaires.ResultsResults showed that IU and suppression mediated the relations between insecure attachment and ED symptoms for both White and BIPOC groups. Uniquely, reappraisal mediated the relations between insecure attachment and ED symptoms for the White group, but not for the BIPOC group.DiscussionThe implications of the findings for culturally informed practice are discussed, including targeting increasing tolerability of uncertainties and improving emotion regulation to mitigate ED symptoms for those with insecure attachment.
Persistence of IgG and neutralizing antibodies in Crimean−Congo hemorrhagic fever survivors
Authors: Vasmehjani Abbas Ahmadi , Pouriayevali Mohammad Hassan , Shahmahmoodi Shohreh , Salehi‐Vaziri Mostafa 
Published: April 2024

AbstractThe World Health Organization classified Crimean–Congo hemorrhagic fever (CCHF) as a high‐priority infectious disease and emphasized the performance of research studies and product development against it. Little information is available about the immune response due to natural CCHF virus (CCHFV) infection in humans. Here, we investigated the persistence of IgG and neutralizing antibodies in serum samples collected from 61 Iranian CCHF survivors with various time points after recovery (<12, 12−60, and >60 months after disease). The ELISA results showed IgG seropositivity in all samples while a pseudotyped based neutralization assay findings revealed the presence of neutralizing antibody in 29 samples (46.77%). For both IgG and neutralizing antibodies, a decreasing trend of titer was observed with the increase in the time after recovery. Not only the mean titer of IgG (772.80 U/mL) was higher than mean neutralizing antibody (25.64) but also the IgG persistence was longer. In conclusion, our findings provide valuable information about the long‐term persistence of humoral immune response in CCHF survivors indicating that IgG antibody can be detected at least 8 years after recovery and low titers of neutralizing antibody can be detected in CCHF survivors.
Fully automatic online geometric calibration for non‐circular cone‐beam CT orbits using fiducials with unknown placement
Authors: Ma Yiqun Q. , Reynolds Tess , Ehtiati Tina , Weiss Clifford , Hong Kelvin , Theodore Nicholas , Gang Grace J. , Stayman J. Webster 
Published: April 2024

AbstractBackgroundCone‐beam CT (CBCT) with non‐circular scanning orbits can improve image quality for 3D intraoperative image guidance. However, geometric calibration of such scans can be challenging. Existing methods typically require a prior image, specialized phantoms, presumed repeatable orbits, or long computation time.PurposeWe propose a novel fully automatic online geometric calibration algorithm that does not require prior knowledge of fiducial configuration. The algorithm is fast, accurate, and can accommodate arbitrary scanning orbits and fiducial configurations.MethodsThe algorithm uses an automatic initialization process to eliminate human intervention in fiducial localization and an iterative refinement process to ensure robustness and accuracy. We provide a detailed explanation and implementation of the proposed algorithm. Physical experiments on a lab test bench and a clinical robotic C‐arm scanner were conducted to evaluate spatial resolution performance and robustness under realistic constraints.ResultsQualitative and quantitative results from the physical experiments demonstrate high accuracy, efficiency, and robustness of the proposed method. The spatial resolution performance matched that of our existing benchmark method, which used a 3D‐2D registration‐based geometric calibration algorithm.ConclusionsWe have demonstrated an automatic online geometric calibration method that delivers high spatial resolution and robustness performance. This methodology enables arbitrary scan trajectories and should facilitate translation of such acquisition methods in a clinical setting.
Cumulative sum control charts for monitoring zero‐inflated COM‐Poisson processes
Authors: Tasias Konstantinos A. , Alevizakos Vasileios 
Published: April 2024

AbstractThe zero‐inflated Conway‐Maxwell Poisson (ZICMP) distribution models count data with many zero observations. ZICMP model has been developed assuming that zero observations exist with probability and the number of non‐conformities in a product unit follows the Conway‐Maxwell Poisson (COM‐Poisson) distribution with location parameter and dispersion parameter . This article presents four kinds of cumulative sum (CUSUM) charts for monitoring upward shifts in a ZICMP process. Three CUSUM schemes, namely ‐CUSUM, ‐CUSUM, and ‐CUSUM, have been designed to detect shift only in one parameter assuming that the other two are fixed and one CUSUM scheme, namely ‐CUSUM, has been designed to detect shifts in all the parameters. The performance of the proposed charts has been evaluated in terms of the average run‐length (ARL). Finally, a numerical example is given to demonstrate the application of the proposed charts.
Robust, Self‐Healing, and Multi‐Use Poly(Urethane‐Urea‐Imide) Elastomer as a Durable Adhesive for Thermal Interface Materials
Authors: Wu Zhiqiang , Dong Jie , Guo Han , Shang Rui , Qin Xiuzhi , Xia Yanfei , Li Xiuting , Zhao Xin , Ji Chengchang , Zhang Qinghua 
Published: April 2024

AbstractCurrently, research on thermal interface materials (TIMs) is primarily focused on enhancing thermal conductivity. However, strong adhesion and multifunctionality are also important characteristics for TIMs when pursing more stable interface heat conduction. Herein, a novel poly(urethane‐urea‐imide) (PUUI) elastomer containing abundant dynamic hydrogen bonds network and reversible disulfide linkages is successfully synthesized for application as a TIM matrix. The PUUI can self‐adapt to the metal substrate surface at moderate temperatures (80 °C) and demonstrates a high adhesion strength of up to 7.39 MPa on aluminum substrates attributed its noncovalent interactions and strong intrinsic cohesion. Additionally, the PUUI displays efficient self‐healing capability, which can restore 94% of its original mechanical properties after self‐healing for 6 h at room temperature. Furthermore, PUUI composited with aluminum nitride and liquid metal hybrid fillers demonstrates a high thermal conductivity of 3.87 W m−1 K−1 while maintaining remarkable self‐healing capability and adhesion. When used as an adhesive‐type TIM, it achieves a low thermal contact resistance of 22.1 mm2 K W−1 at zero pressure, only 16.7% of that of commercial thermal pads. This study is expected to break the current research paradigm of TIMs and offers new insights for the development of advanced, reliable, and sustainable TIMs.
Elastic membranes spanning deformable curves
Authors: Ballarin Francesco , Bevilacqua Giulia , Lussardi Luca , Marzocchi Alfredo 
Published: April 2024

AbstractWe perform a variational analysis of an elastic membrane spanning a closed curve which may sustain bending and torsion. First, we deal with parametrized curves and linear elastic membranes proving the existence of equilibria and finding first‐order necessary conditions for minimizers computing the first variation. Second, we study a more general case, both for the boundary curve and for the membrane, using the framed curve approach. The infinite dimensional version of the Lagrange multipliers' method is applied to get the first‐order necessary conditions. Finally, a numerical approach is presented and employed in several numerical test cases.
Ackermannian Completion of Separators
Authors: Leroux Jérôme 
Published: April 2024

AbstractVector addition systems (VAS for short), or equivalently vector addition systems with states, or Petri nets are a long established model of concurrency with extensive applications in modeling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem is reachability: whether from a given initial configuration there exists a sequence of valid execution steps that reaches a given final configuration. The complexity of the problem has remained unsettled since the 1960 s, and was recently proved to be Ackermannian-complete.In 2009, we proved that the reachability problem can be decided with a simple algorithm by observing that negative instances of the reachability problem can be witnessed by partitioning the set configurations into semilinear sets called complete separators. Since we can decide in elementary time if a pair of semilinear sets denotes a complete separator, the size of such a witness is Ackermannian in the worst case.In this paper, we show how recent results about the reachability problem can be combined to derive a matching upper-bound, i.e. for every negative instance of the reachability problem, we can effectively compute in Ackermannian time a complete separator witnessing that property.
Fair $$\omega $$-Regular Games
Authors: Hausmann Daniel , Piterman Nir , Sağlam Irmak , Schmuck Anne-Kathrin 
Published: April 2024

AbstractWe consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $$G=(V,E)$$

G
=
(
V
,
E
)

and a set of fair moves $$E_f\subseteq E$$

E
f

⊆
E

a player is said to play fair in G if they choose an edge $$e\in E_f$$

e
∈

E
f

infinitely often whenever the source node of e is visited infinitely often. Otherwise, they play unfair. We equip such games with two $$\omega $$
ω
-regular winning conditions $$\alpha $$
α
and $$\beta $$
β
deciding the winner of mutually fair and mutually unfair plays, respectively. Whenever one player plays fair and the other plays unfair, the fairly playing player wins the game. The resulting games are called fair$$\alpha /\beta $$

α
/
β

games.We formalize fair $$\alpha /\beta $$

α
/
β

games and show that they are determined. For fair parity/parity games, i.e., fair $$\alpha /\beta $$

α
/
β

games where $$\alpha $$
α
and $$\beta $$
β
are given each by a parity condition over G, we provide a polynomial reduction to (normal) parity games via a gadget construction inspired by the reduction of stochastic parity games to parity games. We further give a direct symbolic fixpoint algorithm to solve fair parity/parity games. On a conceptual level, we illustrate the translation between the gadget-based reduction and the direct symbolic algorithm which uncovers the underlying similarities of solution algorithms for fair and stochastic parity games, as well as for the recently considered class of fair games in which only one player is restricted by fair moves.
On-The-Fly Algorithm for Reachability in Parametric Timed Games
Authors: Dahlsen-Jensen Mikael Bisgaard , Fievet Baptiste , Petrucci Laure , de Pol Jaco van 
Published: April 2024

AbstractParametric Timed Games (PTG) are an extension of the model of Timed Automata. They allow for the verification and synthesis of real-time systems, reactive to their environment and depending on adjustable parameters. Given a PTG and a reachability objective, we synthesize the values of the parameters such that the game is winning for the controller. We adapt and implement the On-The-Fly algorithm for parameter synthesis for PTG. Several pruning heuristics are introduced, to improve termination and speed of the algorithm. We evaluate the feasibility of parameter synthesis for PTG on two large case studies. Finally, we investigate the correctness guarantee of the algorithm: though the problem is undecidable, our semi-algorithm produces all correct parameter valuations “in the limit”.
Decidable Verification under Localized Release-Acquire Concurrency
Authors: Singh Abhishek Kr , Lahav Ori 
Published: April 2024

AbstractState reachability for finite state concurrent programs running under Release-Acquire (RA) semantics is known to be undecidable, while under a weaker variant, called Weak-Release-Acquire (WRA), the problem is decidable. However, WRA allows many counterintuitive behaviors not allowed under RA, in which threads locally oscillate between observed values. We propose a strengthening of WRA in the form of a new memory model, which we call Localized Release-Acquire (LRA), that prunes these oscillatory behaviors. We provide semantics for LRA and show that verification under LRA is decidable by extending the potential-based technique used to prove decidability under WRA. The LRA model is still weaker than RA, and thus our results can be used to soundly verify programs under RA.
Witch 3: Validation of Violation Witnesses in the Witness Format 2.0
Authors: Ayaziová Paulína , Strejček Jan 
Published: April 2024

AbstractWitch 3 is a new validator of violation witnesses in the witness format 2.0. Note that our previous tool,Symbiotic-Witch 2, can validate only violation witnesses in the old GraphML format.Witch 3 validates witnesses of reachability of an error function, overflows, and invalid dereferences and deallocations. Similarly toSymbiotic-Witch 2, the tool is based on symbolic execution and uses parts of theSymbioticframework. Support of the witness format 2.0 inWitch 3 includes features not supported bySymbiotic-Witch 2, such as constraints on the program variables and function return values, specifying statements by column, and providing the concrete statement in which the violation occurs. These additional features can further restrict the explored state space, and, more importantly, allow for much more precise validation.
CPAchecker 2.3 with Strategy Selection
Authors: Baier Daniel , Beyer Dirk , Chien Po-Chun , Jankola Marek , Kettl Matthias , Lee Nian-Ze , Lemberger Thomas , Lingsch-Rosenfeld Marian , Spiessl Martin , Wachowitz Henrik , Wendler Philipp 
Published: April 2024

AbstractCPAcheckeris a versatile framework for software verification, rooted in the established concept ofconfigurable program analysis. Compared to the last publishedsystem descriptionat SV-COMP 2015, theCPAcheckersubmission to SV-COMP 2024 incorporates new analyses for reachability safety, memory safety, termination, overflows, and data races. To combine forces of the available analyses inCPAcheckerand cover the full spectrum of the diverse program characteristics and specifications in the competition, we usestrategy selectionto predict a sequential portfolio of analyses that is suitable for a given verification task. The prediction is guided by a set of carefully picked program features. The sequential portfolios are composed based on expert knowledge and consist of bit-precise analyses usingk-induction, data-flow analysis, SMT solving, Craig interpolation, lazy abstraction, and block-abstraction memoization. The synergy of various algorithms inCPAcheckerenables support for all properties and categories of C programs in SV-COMP 2024 and contributes to its success in many categories.CPAcheckeralso generates verification witnesses in the new YAML format.
Goblint: Abstract Interpretation for Memory Safety and Termination
Authors: Saan Simmo , Erhard Julian , Schwarz Michael , Bozhilov Stanimir , Holter Karoliine , Tilscher Sarah , Vojdani Vesal , Seidl Helmut 
Published: April 2024

AbstractGoblintis an abstract interpreter of C programs, focusing on the analysis of multi-threaded code. It is equipped with a variety of abstract domains, as well as analyses which allow it to reason about an array of program properties in a highly configurable manner.Goblinthas been extended with support for the detection of memory safety bugs and non-termination.
Symbiotic 10: Lazy Memory Initialization and Compact Symbolic Execution
Authors: Jonáš Martin , Kumor Kristián , Novák Jakub , Sedláček Jindřich , Trtík Marek , Zaoral Lukáš , Ayaziová Paulína , Strejček Jan 
Published: April 2024

AbstractSymbiotic 10 brings four substantial improvements. First, we extended our clone ofKleecalledJetKleewithlazy memory initialization. With this extension,JetKleecan symbolically execute a function without knowing its context. In SV-COMP, we use it to handle variables. Second, we have implemented the technique calledcompact symbolic executiontoSlowbeast. Third, we have implemented a non-trivialmay-happen-in-parallelanalysis, which improves slicing of parallel programs. Finally, we have implemented support for violation witnesses in the newwitness format 2.0.