wanyu/IteraTeR_full_sent huggingface dataset:
Original:  In particular, we prove a Fundamental Theorem of Asset Pricing and a Superhedging Theorem which both encompass the formulations of [ BN15  ] and [ BFH+16  ].
Revised:  In particular, we prove a Fundamental Theorem of Asset Pricing and a Superhedging Theorem which both encompass the formulations of [ BN15 ] and [ Burzoni, M., Frittelli, M., Hou, Z., Maggis, M., ].
Edit intent: meaning-changed
Original:  In particular, we prove a Fundamental Theorem of Asset Pricing and a Superhedging Theorem which both encompass the formulations of [ BN15  ] and [ BFH+16  ].
Revised:  In particular, we prove a Fundamental Theorem of Asset Pricing and a Superhedging Theorem which both encompass the formulations of [ BN15 ] and [ BFH+16 Obloj, J. (2019). Pointwise arbitrage pricing theory in discrete time. Mathematics of Operations Research ].
Edit intent: meaning-changed
Original:  Furthermore we explain how to extend an \mathcal{M on a set \Omega to a pathwise duality without changing the superhedging price.
Revised:  In bringing the two streams of literature together, we also examine and relate their many different notions of arbitrage. We also clarify the relation between robust and classical \mathbb{P on a set \Omega to a pathwise duality without changing the superhedging price.
Edit intent: meaning-changed
Original:  However, Nash (1951)'s noncooperative games - in which each player acts independently without collaboration with any of the others - has become the dominant ideology in economics, game theory, and related fields. A simple falsification of this noncooperative theory is scientific publication: It is a rather competitive game, yet  collaboration is widespread.
Revised:  However, Nash (1951)'s noncooperative games - in which each player acts independently without collaboration with any of the others " (Nash, 1951)---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups. Thus, one needs to extend the noncooperative framework to study strategic games like scientific publication, which is a rather competitive game, yet collaboration is widespread.
Edit intent: meaning-changed
Original:  In this paper, I propose a novel way to rationally play games of conflict and cooperation under the Principle of Free Will - players are free to cooperate to coordinate their actions or act independently .
Revised:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently .
Edit intent: meaning-changed
Original:  In this paper, I propose a novel way to rationally play games of conflict and cooperation under the Principle of Free Will - players are free to cooperate to coordinate their actions or act independently . Anyone with a basic game theory background will be familiar with the setup in this paper, which is based on simple game trees. In fact, one hardly needs any mathematics to follow the arguments .
Revised:  In this paper, I propose a novel way to rationally play games of conflict and cooperation under the Principle of Free Will - players are free to cooperate to coordinate their actions or act independently .
Edit intent: coherence
Original:  However, neither cooperative games nor noncooperative games---in which "each player participant independently without collaboration with any of the others" (Nash, 1951) ---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Revised:  However, neither cooperative games nor non-cooperative games -- in which "each player participant independently without collaboration with any of the others" (Nash, 1951) ---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Edit intent: fluency
Original:  However, neither cooperative games nor noncooperative games---in which "each player participant independently without collaboration with any of the others" (Nash, 1951) ---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Revised:  However, neither cooperative games nor noncooperative games---in which "each player acts independently without collaboration with any of the others" (Nash, 1951) ---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Edit intent: clarity
Original:  However, neither cooperative games nor noncooperative games---in which "each player participant independently without collaboration with any of the others" (Nash, 1951) ---fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Revised:  However, neither cooperative games nor noncooperative games---in which "each player participant independently without collaboration with any of the others" (Nash, 1951) -- fully capture the competition between and across individuals and groups, and the strategic partnerships that give rise to such groups.
Edit intent: fluency
Original:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently  .
Revised:  In this paper, I propose , to the best of my knowledge, the first solution to the long-standing open problem of strategic cooperation first identified by von Neumann (1928). I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently .
Edit intent: meaning-changed
Original:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently  .
Revised:  In this paper, I propose a novel framework and a solution concept: I introduce the equilibrium system solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently .
Edit intent: meaning-changed
Original:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently  .
Revised:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional strategic games in which players are free to cooperate to coordinate their actions or act independently .
Edit intent: clarity
Original:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently  .
Revised:  In this paper, I propose a novel framework and a solution concept: I introduce the recursive backward induction solution in coalitional extensive-form games in which players are free to cooperate to coordinate their actions or act independently . Coalitional strategic games unify the study of strategic competition as well as cooperation including logrolling and corruption which have been studied in specific frameworks .
Edit intent: meaning-changed
Original:  We provide an atomistic, dynamic picture of the unbinding process, suggesting that the lock-and-key mechanism may need revision in terms of many routes to the lock that might be relevant for other receptor-ligand bonds.
Revised:  We provide an atomistic, dynamic picture of the unbinding process, replacing a simple two-state picture with one that involves many routes to the lock that might be relevant for other receptor-ligand bonds.
Edit intent: clarity
Original:  We provide an atomistic, dynamic picture of the unbinding process, suggesting that the lock-and-key mechanism may need revision in terms of many routes to the lock that might be relevant for other receptor-ligand bonds.
Revised:  We provide an atomistic, dynamic picture of the unbinding process, suggesting that the lock-and-key mechanism may need revision in terms of many routes to the lock and rate-dependent induced-fit motions for intermediates, which might be relevant for other receptor-ligand bonds.
Edit intent: meaning-changed
Original:  Here, we show that selection acting on any relevant physical property of a protein, e. g. the elastic energy of an important conformational change , can give rise to such a sector.
Revised:  Here, we show that selection acting on any relevant physical property of a protein, represented by an additive trait, can give rise to such a sector. As an illustration of a selected trait, we consider the elastic energy of an important conformational change , can give rise to such a sector.
Edit intent: meaning-changed
Original:  Here, we show that selection acting on any relevant physical property of a protein, e. g. the elastic energy of an important conformational change , can give rise to such a sector. We demonstrate that the main signature of these physical sectors lies in the small-eigenvalue modes of the covariance matrix of the selected sequences.
Revised:  Here, we show that selection acting on any relevant physical property of a protein, e. g. the elastic energy of an important conformational change within an elastic network model, and we show that selection acting on this energy leads to correlations among residues. For this concrete example and more generally, we demonstrate that the main signature of these physical sectors lies in the small-eigenvalue modes of the covariance matrix of the selected sequences.
Edit intent: meaning-changed
Original:  This simple, generic model leads us to propose a principled method to identify  sectors, along with the magnitudes of mutational effects, from sequence data  .
Revised:  This simple, generic model leads us to propose a principled method to identify sectors, along with the magnitudes of mutational effects, from sequence data . We further demonstrate the robustness of these functional sectors to various forms of selection, and the robustness of our approach to the identification of multiple selected traits .
Edit intent: meaning-changed
Original:  That same regression model quantifies the short term value of the treatment allocation and this comparison favors smaller \Delta with the RDD being best.
Revised:  We point to additional advantages of tie-breakers versus RDD: for a nonparametric regression the boundary bias is much less severe and for quadratic regression, the variance is greatly reduced. For a two line model we can quantify the short term value of the treatment allocation and this comparison favors smaller \Delta with the RDD being best.
Edit intent: meaning-changed
Original: In this paper we introduce some new copulas emerging from shock models , motivated by applications, i. e. the reflected maxmin copulas with dependent endogenous shocks and their extension to multivariate case. Our main goal is to show that reflected maxmin copulas exhibit conceptually better characteristics as the original maxmin copulas .
Revised: In this paper we introduce some new copulas emerging from shock models , motivated by applications, i. e. the reflected maxmin copulas (RMM for short) are not just some specific singular copulas; they contain many important absolutely continuous copulas including the negative quadrant dependent part of the URLenstern class. The main goal of this paper is to develop the RMM copulas with dependent endogenous shocks and give evidence that RMM copulas may exhibit some characteristics better than the original maxmin copulas .
Edit intent: meaning-changed
Original:  Even more, using this result we find also the limit of the iteration procedure of the maxmin transformation thus answering a question proposed earlier by Durante, Omladic, Orazem, and Ruzi\'{c}.
Revised:  (2) Using this result we find also the limit of the iteration procedure of the maxmin transformation thus answering a question proposed earlier by Durante, Omladic, Orazem, and Ruzi\'{c}.
Edit intent: coherence
Original:  Even more, using this result we find also the limit of the iteration procedure of the maxmin transformation thus answering a question proposed earlier by Durante, Omladic, Orazem, and Ruzi\'{c}.
Revised:  Even more, using this result we find also the limit of the iteration procedure of the MM transformation thus answering a question proposed earlier by Durante, Omladic, Orazem, and Ruzi\'{c}.
Edit intent: meaning-changed
Original:  The third main result of ours is the multivariate (dependent ) reflected maxmin copula which is conceptually simpler than the standard version of it, Ora\v{z}em, and Ru\v{z}i\'{c}} . In all our copulas the idiosyncratic and systemic shocks are combined via asymmetric linking functions as opposed to Marshall copulas where symmetric linking functions are used.
Revised:  (3) We give the multivariate dependent RMM copula that compares to the MM version given by Durante, Omladi\v{c, Ora\v{z}em, and Ru\v{z}i\'{c}} . In all our copulas the idiosyncratic and systemic shocks are combined via asymmetric linking functions as opposed to Marshall copulas where symmetric linking functions are used.
Edit intent: meaning-changed
Original: We describe the substitutive structure of Jeandel-Rao aperiodic Wang tilings \Omega_0. We introduce twelve sets of Wang tiles \{\mathcal{T_{i}\}_{1\leq i\leq 12} together with their associated Wang shifts \{i\}_{1\leq i\leq 12}.
Revised: Jeandel and Rao proved that 11 is the size of the smallest set of Wang tiles \{\mathcal{T_{i}\}_{1\leq i\leq 12} together with their associated Wang shifts \{i\}_{1\leq i\leq 12}.
Edit intent: meaning-changed
Original:  We introduce twelve sets of Wang tiles \{\mathcal{T_{i}\}_{1\leq i\leq 12} together with their associated Wang shifts \{i\}_{1\leq i\leq 12}.
Revised:  We introduce twelve sets of Wang tiles _{i}\}_{1\leq i\leq 12} together with their associated Wang shifts \{i\}_{1\leq i\leq 12}.
Edit intent: meaning-changed
Original:  Using a method proposed in earlier work, we prove the existence of recognizable 2-dimensional morphisms \omega_i:i+1}%DIFDELCMD < \to%%% \Omega_i for every i\in\{0, 1, 2 , 3,6,7,8,9,10,11\} that are onto up to a shift.
Revised:  Using a method proposed in earlier work, we prove the existence of recognizable 2-dimensional morphisms \omega_i:i+1}%DIFDELCMD < \to%%% , 3,6,7,8,9,10,11\} that are onto up to a shift.
Edit intent: coherence
Original:  Using a method proposed in earlier work, we prove the existence of recognizable 2-dimensional morphisms \omega_i:i+1}%DIFDELCMD < \to%%% \Omega_i for every i\in\{0, 1, 2 , 3,6,7,8,9,10,11\} that are onto up to a shift. Each \omega_i maps a tile on a tile or on a domino of two tiles . We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Revised:  Using a method proposed in earlier work, we prove the existence of recognizable 2-dimensional morphisms \omega_i:i+1}%DIFDELCMD < \to%%% \Omega_i for every i\in\{0, 1, 2 , %DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Edit intent: meaning-changed
Original:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Revised:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% %DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Edit intent: clarity
Original:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Revised:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% %DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto.
Edit intent: coherence
Original:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% \Omega_4 that is unfortunately not onto. The Wang shift \Omega _{12 subshift X_0 of the Jeandel-Rao tilings \Omega_0 .
Revised:  We also prove the existence of a topological conjugacy \eta:\Omega_6%DIFDELCMD < \to%%% \Omega_5 which shears Wang tilings by the action of the matrix%DIFDELCMD < \left(smallmatrix 1 & 1\\ 0 & 1 smallmatrix\right) %%% and an embedding \pi:\Omega_5%DIFDELCMD < \to%%% i.e., unit squares with colored edges, that admit valid (contiguous edges of adjacent tiles have the same color) tilings of the plane none of them being invariant under a nontrivial translation. In this contribution, we study the Wang shift \Omega _{12 subshift X_0 of the Jeandel-Rao tilings \Omega_0 .
Edit intent: meaning-changed
Original:  The Wang shift \Omega _{12 subshift X_0 of the Jeandel-Rao tilings \Omega_0 .
Revised:  The Wang shift \Omega _{12 subshift X_0 of \Omega_0 such that any tiling in X_0 can be decomposed uniquely into 19 distinct patches of sizes ranging from 45 to 112 that are equivalent to a set of self-similar and aperiodic 19 Wang tiles. We think that this gives an almost complete description of the substitutive structure of Jeandel-Rao tilings \Omega_0 .
Edit intent: meaning-changed
Original:  The Wang shift \Omega _{12 subshift X_0 of the Jeandel-Rao tilings \Omega_0 . The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Revised:  The Wang shift \Omega _{12 subshift X_0 of the Jeandel-Rao %DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Edit intent: fluency
Original:  The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Revised:  The subshift X_0%DIFDELCMD < \subsetneq%%% tilings as we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Edit intent: clarity
Original:  The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Revised:  The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set for any shift-invariant probability measure on \Omega_0. The proof is based on twelve elementary steps where ten of them are using the same procedure allowing to desubstitute Wang tilings from the existence of a subset of marker tiles. The two other steps are adding decorations to deal with fault lines and are changing the base of the \mathbb{Z Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Edit intent: meaning-changed
Original:  The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and sheering topological conjugacy from a set of Wang tiles.
Revised:  The subshift X_0%DIFDELCMD < \subsetneq%%% \Omega_0 is proper due to some horizontal fracture of 0's or 1's in tilings in \Omega_0 and we believe that \Omega_0\setminus X_0 is a null set . Algorithms are provided to find markers, recognizable substitutions and shear conjugacy from a set of Wang tiles.
Edit intent: clarity
Original: We establish the lattice theorem,  rural hospitals theorem,  and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Revised: We establish several structural results for the set of competitive equilibria in bilateral trading networks with transfers in the case of imperfectly transferable utility and frictions: The lattice theorem, rural hospitals theorem, and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Edit intent: meaning-changed
Original: We establish the lattice theorem,  rural hospitals theorem,  and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Revised: We establish the lattice theorem, the rural hospitals theorem, and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Edit intent: coherence
Original: We establish the lattice theorem,  rural hospitals theorem,  and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Revised: We establish the lattice theorem, rural hospitals theorem, the existence of side-optimal equilibria, compactness of the set of equilibria and a group-incentive-compatibility result for terminal buyers (sellers) with unit demand, in a general bilateral trading network without making the assumption of quasi-linear utility in transfers.
Edit intent: meaning-changed