wanyu/IteraTeR_full_sent huggingface dataset:
Original: In this paper we study the optimal mechanism in selling information to decision makers with private prior knowledge about payoff relevant state. When the underlying decision problem has a continuum of actions, optimal mechanism has a continuum of experiments . Buyers with more extreme private beliefs purchase less amount of information at lower prices.
Revised: I consider the monopolistic pricing of informational good. A buyer's willingness to pay for information is from inferring the unknown payoffs of actions in decision making. A monopolistic seller and the buyer each observes a private signal about the payoffs. The seller's signal is binary and she can commit to sell any statistical experiment of her signal to the buyer. Assuming that buyer's decision problem involves rich actions, I characterize the profit maximizing menu. It contains a continuum of experiments . Buyers with more extreme private beliefs purchase less amount of information at lower prices.
Edit intent: meaning-changed
Original:  When the underlying decision problem has a continuum of actions, optimal mechanism has a continuum of experiments . Buyers with more extreme private beliefs purchase less amount of information at lower prices. When distribution of decision maker`s type becomes more dispersed, more buyers will be included in the market and all buyer type will be sold a more informative experiment .
Revised:  When the underlying decision problem has a continuum of actions, optimal mechanism has a continuum of experiments . Buyers with more extreme private beliefs purchase less amount of information . I also find a complementarity between buyer's private information and information provision: when buyer's private signal is more informative, the optimal menu contains more informative experiments .
Edit intent: meaning-changed
Original: We study matching policies in a dynamic exchange market with random compatibility, in which some agents are easier to match than others. In steady state this asymmetry creates an endogenous imbalance: hard-to-match agents wait for partners, while easy-to-match agents can match almost immediately upon arrival and leave the market quickly .
Revised: We study dynamic matching in exchange markets with easy- and hard-to-match agents wait for partners, while easy-to-match agents can match almost immediately upon arrival and leave the market quickly .
Edit intent: clarity
Original:  A greedy policy, which attempts to match agents upon arrival, does not account for the positive externality  waiting agents generate as they make it easier to match agents that arrive in the future , and may result in more unmatched than other policies.
Revised:  A greedy policy, which attempts to match agents upon arrival, ignores the positive externality waiting agents generate as they make it easier to match agents that arrive in the future , and may result in more unmatched than other policies.
Edit intent: clarity
Original:  A greedy policy, which attempts to match agents upon arrival, does not account for the positive externality  waiting agents generate as they make it easier to match agents that arrive in the future , and may result in more unmatched than other policies.
Revised:  A greedy policy, which attempts to match agents upon arrival, does not account for the positive externality that waiting agents generate as they make it easier to match agents that arrive in the future , and may result in more unmatched than other policies.
Edit intent: fluency
Original:  A greedy policy, which attempts to match agents upon arrival, does not account for the positive externality  waiting agents generate as they make it easier to match agents that arrive in the future , and may result in more unmatched than other policies. While this trade-off between a "thickermarket" and quick matching is present in small markets we show that it vanishes in large markets and the greedy policy nevertheless dominates any other dynamic matching policy.
Revised:  A greedy policy, which attempts to match agents upon arrival, does not account for the positive externality waiting agents generate by facilitating future matchings. We prove that this trade-off between a "thickermarket" and quick matching is present in small markets we show that it vanishes in large markets and the greedy policy nevertheless dominates any other dynamic matching policy.
Edit intent: clarity
Original:  While this trade-off between a "thickermarket" and quick matching is present in small markets we show that it vanishes in large markets and the greedy policy nevertheless dominates any other dynamic matching policy. As arrival rate increases the greedy policy matches a (weakly) higher fraction of agents than any other policy and leads to (weakly) lower average waiting time than any other policy.
Revised:  While this trade-off between a "thickermarket" and quick matching is present in small markets we show that it vanishes in large markets ; A greedy policy leads to shorter waiting times, and more agents matched than any other policy.
Edit intent: clarity
Original:  We test our large market predictions with kidney exchange data from the National Kidney Registry (NKR). Numerical simulations show that, in line with our predictions, the greedy policy matches patient-donor pairs significantly faster (roughly 20-30 days) than other commonly used policies and at most 1 \\%DIF < percent fewer pairs than the patient policy.
Revised:  We test our large market predictions with kidney exchange data from the National Kidney Registry . Greedy matching achieves as many transplants as commonly-used policies (1.6 \\%DIF < percent fewer pairs than the patient policy.
Edit intent: meaning-changed
Original:  This unexpected link between adaptation and oscillation is shown to underlie several known examples of dynamical quorum sensing, and as such may also be a source of inadvertent group behaviour in large populations of URLanisms.
Revised:  The unexpected link between adaptation and oscillation is shown to underlie several known examples of dynamical quorum sensing, and as such may also be a source of inadvertent group behaviour in large populations of URLanisms.
Edit intent: fluency
Original: Dynamical quorum sensing is one of the simplest group behaviours in cell populations, where collective oscillations emerge via mutual signaling beyond a critical cell density. Although many examples are documented, no unifying principle has yet been proposed. Here, by considering the response of cells to the extracellular signal and vice versa, we develop a quantitative theory for the phenomenon, and present a necessary condition for collective oscillations in a communicating population.
Revised: Collective oscillation of cells in a population has been reported under diverse biological contexts and with vastly different molecular constructs. Could there be common principles similar to those that govern spontaneous oscillation in mechanical or electrical systems? Here, we answer this question in the affirmative by categorising the response of cells to the extracellular signal and vice versa, we develop a quantitative theory for the phenomenon, and present a necessary condition for collective oscillations in a communicating population.
Edit intent: clarity
Original:  Here, by considering the response of cells to the extracellular signal and vice versa, we develop a quantitative theory for the phenomenon, and present a necessary condition for collective oscillations in a communicating population. We further show that a sufficient condition for oscillations is fulfilled by adaptive cells which reset their signal secretion rate upon prolonged stimulation. These general results were elucidated from non-equilibrium thermodynamic principles, where stimulated energy release from active cells drives oscillations in the medium. The unexpected link between adaptation and oscillation is shown to underlie several known examples of dynamical quorum sensing , and as such may also be a source of inadvertent group behaviour in large populations of URLanisms.
Revised:  Here, by considering the response of individual cells against a time-varying signal. A positive intracellular signal relay of sufficient gain from participating cells is required to sustain the oscillations, together with phase matching. The two conditions yield quantitative predictions for the onset cell density and frequency in terms of measured single-cell and signal response functions. Through mathematical constructions, we show that cells that adapt to a constant stimulus fulfil the phase requirement by developing a leading phase in an "active" frequency window that enables cell-to-signal energy flow. Analysis of dynamical quorum sensing , and as such may also be a source of inadvertent group behaviour in large populations of URLanisms.
Edit intent: meaning-changed
Original:  The unexpected link between adaptation and oscillation is shown to underlie several known examples of dynamical quorum sensing , and as such may also be a source of inadvertent group behaviour in large populations of URLanisms.
Revised:  The unexpected link between adaptation and oscillation is shown to underlie several known examples of dynamical quorum sensing in several cellular systems with increasing biological complexity reaffirms the pivotal role of adaptation in powering oscillations in an otherwise dissipative cell-to-cell communication channel. The physical conditions identified can be used to design synthetic oscillatory systems
Edit intent: meaning-changed
Original:  Our analysis relies on an optimal decomposition of the expected utility of the Principal in terms of the reservation utility of the Agent . In particular, this allows us to derive the Borch rule as a necessary optimality condition for this decomposition to hold, which sheds a new light on this economic concept .
Revised:  Our analysis relies on an optimal decomposition of the expected utility of the Principal in terms of the reservation utility of the Agent and works both in a discrete time and continuous time setting .
Edit intent: meaning-changed
Original: In nonlinear time series analysis and dynamical systems theory, Takens' embedding theorem states that the sliding window embedding of a generic observation along finite, uniformly sampled trajectories in a state space, recovers a sampling of the region traversed by the dynamics.
Revised: In nonlinear time series analysis and dynamical systems theory, Takens' embedding theorem states that the sliding window embedding of a generic observation along trajectories in a state space, recovers a sampling of the region traversed by the dynamics.
Edit intent: clarity
Original: In nonlinear time series analysis and dynamical systems theory, Takens' embedding theorem states that the sliding window embedding of a generic observation along finite, uniformly sampled trajectories in a state space, recovers a sampling of the region traversed by the dynamics.
Revised: In nonlinear time series analysis and dynamical systems theory, Takens' embedding theorem states that the sliding window embedding of a generic observation along finite, uniformly sampled trajectories in a state space, recovers the region traversed by the dynamics.
Edit intent: clarity
Original:  We also present numerical experiments showing that we can recover low dimensional representations of the underlying dynamics on state space, by using the persistent cohomology of sliding window embeddings and Eilenberg-MacLane (i.e., circular and real projective) coordinates.
Revised:  We also present numerical experiments showing how to recover low dimensional representations of the underlying dynamics on state space, by using the persistent cohomology of sliding window embeddings and Eilenberg-MacLane (i.e., circular and real projective) coordinates.
Edit intent: clarity
Original:  In this paper, we consider this issue for the first time, and propose an efficient framework for the parameter estimation from incomplete heavy-tailed time series based on the stochastic approximation expectation maximization (SAEM) coupled with a Markov Chain Monte Carlo (MCMC) procedure.
Revised:  In this paper, we consider this issue for the first time, and propose an efficient framework for parameter estimation from incomplete heavy-tailed time series based on the stochastic approximation expectation maximization (SAEM) coupled with a Markov Chain Monte Carlo (MCMC) procedure.
Edit intent: fluency
Original:  In this paper, we consider this issue for the first time, and propose an efficient framework for the parameter estimation from incomplete heavy-tailed time series based on the stochastic approximation expectation maximization (SAEM) coupled with a Markov Chain Monte Carlo (MCMC) procedure.
Revised:  In this paper, we consider this issue for the first time, and propose an efficient framework for the parameter estimation from incomplete heavy-tailed time series based on a stochastic approximation expectation maximization (SAEM) coupled with a Markov Chain Monte Carlo (MCMC) procedure.
Edit intent: fluency
Original:  Our results hold under the ]  condition of No Strict Arbitrage and under the efficient friction hypothesis .
Revised:  Our results hold under the Bouchard, B., Deng, S. and Tan, X., Super-replication with proportional transaction cost under model uncertainty, Math. Fin., 29(3):837-860, 2019] condition of No Strict Arbitrage and under the efficient friction hypothesis .
Edit intent: meaning-changed
Original:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with  efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Revised:  This paper presents OpenMPL [1], an open-source layout decomposition framework, with efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Edit intent: clarity
Original:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with  efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Revised:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with well-separated peripheral processing and the core solving steps. We demonstrate the flexibility of the framework with efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Edit intent: meaning-changed
Original:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with  efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Revised:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with efficient implementations of various state-of-the-art algorithms , which enable us to reproduce most of the recent results on widely-recognized benchmarks and promising results are demonstrated .
Edit intent: meaning-changed
Original:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with  efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks and promising results are demonstrated .
Revised:  This paper presents OpenMPL [1], an open-source multiple patterning layout decomposition framework, with efficient implementations of various state-of-the-art algorithms . Experiments are conducted on widely-recognized benchmarks . We believe OpenMPL can pave the road for developing layout decomposition engines and stimulate further researches on this problem .
Edit intent: meaning-changed
Original: Due to the low density of envelope (Env) spikes on the surface of HIV-1, neutralizing IgG antibodies rarely bind bivalently using both antigen-binding arms (Fabs) to crosslink between spikes  , instead resorting to weaker monovalent binding that is more sensitive to Env mutations.
Revised: Due to the low density of envelope (Env) spikes on the surface of HIV-1, neutralizing IgG antibodies rarely bind bivalently using both antigen-binding arms (Fabs) to crosslink between spikes (inter-spike crosslinking) , instead resorting to weaker monovalent binding that is more sensitive to Env mutations.
Edit intent: meaning-changed
Original:  Here we investigated whether linkers with different rigidities could enhance diFab potency by synthesizing DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and created a model that predicts their neutralization potencies .
Revised:  Anticipating future experiments to improve synthetic antibodies, we investigate whether linkers with different rigidities could enhance diFab potency by synthesizing DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and created a model that predicts their neutralization potencies .
Edit intent: meaning-changed
Original:  Here we investigated whether linkers with different rigidities could enhance diFab potency by synthesizing DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and created a model that predicts their neutralization potencies .
Revised:  Here we investigated whether linkers with different rigidities could enhance diFab potency by modeling DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and created a model that predicts their neutralization potencies .
Edit intent: clarity
Original:  Here we investigated whether linkers with different rigidities could enhance diFab potency by synthesizing DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and created a model that predicts their neutralization potencies .
Revised:  Here we investigated whether linkers with different rigidities could enhance diFab potency by synthesizing DNA-Fabs containing different combinations of rigid dsDNA and flexible single-stranded DNA (ssDNA) and characterizing their neutralization potential .
Edit intent: clarity
Original:  Model predictions , verified by experimental data, show that although a long flexible polymer may be capable of bivalent binding, it exhibits weak neutralization due to the large loss in entropic degrees of freedom during bivalent binding .
Revised:  Model predictions , verified by experimental data, show that although a long flexible polymer may be capable of bivalent binding, it exhibits weak neutralization due to the large loss in entropic degrees of freedom when both Fabs are bound .
Edit intent: meaning-changed
Original:  In contrast, the strongest neutralization potencies  require a rigid linker that optimally spans the distance between two Fab binding sites on an Env trimer  .
Revised:  In contrast, the strongest neutralization potencies require a rigid linker that optimally spans the distance between two Fab binding sites on an Env trimer , and avidity can be further boosted by incorporating more Fabs into these constructs .
Edit intent: meaning-changed
Original:  These results inform the design of bivalent anti-HIV-1 therapeutics that utilize avidity effects to remain potent against HIV-1 in the face of the rapid mutation of Env spikes.
Revised:  These results inform the design of multivalent anti-HIV-1 therapeutics that utilize avidity effects to remain potent against HIV-1 in the face of the rapid mutation of Env spikes.
Edit intent: meaning-changed
Original:  By localizing the probability distortion and restricting to a smaller class of random variables, we  construct a conditional expectation in such a way that it coincides with the original nonlinear expectation at time zero, but has a time-consistent dynamics in the sense that the tower property remains valid.
Revised:  By localizing the probability distortion and restricting to a smaller class of random variables, we introduce a so-called distorted probability and construct a conditional expectation in such a way that it coincides with the original nonlinear expectation at time zero, but has a time-consistent dynamics in the sense that the tower property remains valid.
Edit intent: meaning-changed
Original:  A ore fundamental problem when extending the distorted expectation to a dynamic setting is %DIFDELCMD < {\it %%% time-inconsistency , that is, the usual "tower property" fails.
Revised:  A more fundamental problem when extending the distorted expectation to a dynamic setting is %DIFDELCMD < {\it %%% time-inconsistency , that is, the usual "tower property" fails.
Edit intent: fluency
Original:  With these tools, which allow one to characterize topological invariants such as loops in high-dimensional data, we are able to gain understanding into low-dimensional structures in networks in a way that complements traditional approaches  based on pairwise interactions.
Revised:  With these tools, which allow one to characterize topological invariants such as loops in high-dimensional data, we are able to gain understanding into low-dimensional structures in networks in a way that complements traditional approaches that are based on pairwise interactions.
Edit intent: coherence
Original:  In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in the networks.
Revised:  In the present paper, we use persistent homology to analyze networks that we construct from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in the networks.
Edit intent: clarity
Original:  In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in the networks.
Revised:  In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients . We thereby explore the persistence of topological structures such as loops at different scales in the networks.
Edit intent: coherence
Original:  In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in the networks.
Revised:  In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in these networks.
Edit intent: clarity
Original:  We show that SPECS is able to consistently estimate an appropriate linear combination of the cointegrating vectors that may occur in the underlying DGP , while simultaneously enabling the correct recovery of sparsity patterns in the corresponding parameter space .
Revised:  Under an asymptotic regime in which both the number of parameters and time series observations jointly diverge to infinity, we show that SPECS is able to consistently estimate an appropriate linear combination of the cointegrating vectors that may occur in the underlying DGP , while simultaneously enabling the correct recovery of sparsity patterns in the corresponding parameter space .
Edit intent: meaning-changed