wanyu/IteraTeR_v2 huggingface dataset:
Original:  Record linkage is increasingly being used by  statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Revised:  Record linkage is increasingly being used by statistical, health, government and business organisations to link administrative, survey, and other files to create a robust file for more complete and comprehensive analysis.
Edit intent: clarity
Original:  Record linkage is increasingly being used by  statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Revised:  Record linkage is increasingly being used by statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more comprehensive analysis.
Edit intent: clarity
Original:  Despite this increase, there has been little work on developing tools to assess the  accuracy of linked files.
Revised:  Therefore, it becomes necessary to assess the accuracy of linked files.
Edit intent: coherence
Original:  The aim  is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses  indicated promising results for finding the optimal cut-off value as well as efficient block size .
Revised:  The aim of this paper is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses indicated promising results for finding the optimal cut-off value as well as efficient block size .
Edit intent: clarity
Original:  The aim  is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses  indicated promising results for finding the optimal cut-off value as well as efficient block size .
Revised:  The aim is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses indicated promising results for finding the optimal cut-off value as well as efficient block size .
Edit intent: fluency
Original:  The aim  is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses  indicated promising results for finding the optimal cut-off value as well as efficient block size .
Revised:  The aim is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate and False Negative Rate (FNR) . The analyses indicated promising results for finding the optimal cut-off value as well as efficient block size .
Edit intent: clarity
Original:  The aim  is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses  indicated promising results for finding the optimal cut-off value as well as efficient block size .
Revised:  The aim is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate . The analyses indicated promising results for finding the optimal cut-off value as well as efficient block size .
Edit intent: clarity
Original:  The aim  is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses  indicated promising results for finding the optimal cut-off value as well as efficient block size .
Revised:  The aim is to facilitate optimal choice of block size and cut-off value to achieve high accuracy in terms of minimizing the average False Discovery Rate (FDR) and False Negative Rate (FNR) . The analyses indicated promising results .
Edit intent: coherence
Original: We construct recursively-presented finitely-generated torsion groups which have a bounded torsion and whose word problem is conjunctive equivalent (in particular positive and Turing equivalent) to a given recursively enumerable set.
Revised: We construct recursively-presented finitely-generated torsion groups which have bounded torsion and whose word problem is conjunctive equivalent (in particular positive and Turing equivalent) to a given recursively enumerable set.
Edit intent: fluency
Original:  We propose QBRICKS , the first development environment for certified quantum programs featuring clear separation between code and proof, scale-invariance specification and proof , high degree of proof automation and allowing to encode quantum programs in a natural way, i.e. close to textbook style.
Revised:  We propose Qbricks , the first development environment for certified quantum programs featuring clear separation between code and proof, scale-invariance specification and proof , high degree of proof automation and allowing to encode quantum programs in a natural way, i.e. close to textbook style.
Edit intent: fluency
Original:  This environment features a new domain-specific  language for quantum programs, namely QBRICKS-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics , used for both specification (parametrized, versatile) and automation(closure properties).
Revised:  This environment features a new domain-specific circuit-building language for quantum programs, namely QBRICKS-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics , used for both specification (parametrized, versatile) and automation(closure properties).
Edit intent: clarity
Original:  This environment features a new domain-specific  language for quantum programs, namely QBRICKS-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics , used for both specification (parametrized, versatile) and automation(closure properties).
Revised:  This environment features a new domain-specific language for quantum programs, namely Qbricks-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics , used for both specification (parametrized, versatile) and automation(closure properties).
Edit intent: fluency
Original:  This environment features a new domain-specific  language for quantum programs, namely QBRICKS-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum semantics , used for both specification (parametrized, versatile) and automation(closure properties).
Revised:  This environment features a new domain-specific language for quantum programs, namely QBRICKS-DSL , together with a new logical specification language QBRICKS-SPEC . Especially, we introduce and intensively build upon HOPS, a higher-order extension of the recent path-sum symbolic representation , used for both specification (parametrized, versatile) and automation(closure properties).
Edit intent: clarity
Original:  To illustrate the opportunity of QBRICKS , we implement the first scale-invariant verified implementations of non-trivial quantum algorithms, namely phase estimation (QPE) -- the purely quantum part of Shor algorithm for integer factoring -- and Grover search.
Revised:  To illustrate the opportunity of Qbricks , we implement the first scale-invariant verified implementations of non-trivial quantum algorithms, namely phase estimation (QPE) -- the purely quantum part of Shor algorithm for integer factoring -- and Grover search.
Edit intent: fluency
Original:  To illustrate the opportunity of QBRICKS , we implement the first scale-invariant verified implementations of non-trivial quantum algorithms, namely phase estimation (QPE) -- the purely quantum part of Shor algorithm for integer factoring -- and Grover search.
Revised:  To illustrate the opportunity of QBRICKS , we implement the first scale-invariant verified implementations of non-trivial quantum algorithms, including the quantum part of Shor algorithm for integer factoring -- and Grover search.
Edit intent: clarity
Original:  It proves by fact that applying formal verification to real quantum programs is possible and should be further developed .
Revised:  These breakthroughs were amply facilitated by the specification and automated deduction principles introduced within Qbricks .
Edit intent: coherence
Original:  It uses onboard sensing of velocity, yaw rate, and height as inputs, and then estimates the relative position of other robots in its own body frame by fusing these quantities with ranging measurements obtained from onboard ultra wide-band (UWB) antennas.
Revised:  It uses onboard sensing of velocity, yaw rate, and height as inputs, and then estimates the relative position of other robots by fusing these quantities with ranging measurements obtained from onboard ultra wide-band (UWB) antennas.
Edit intent: clarity
Original:  Experiments are conducted on a team of 5 Crazyflie 2.0 quadrotors, demonstrating autonomous formation flight and pattern formation, and coordinated flight through a window.
Revised:  Real-world experiments are conducted on a team of 5 Crazyflie 2.0 quadrotors, demonstrating autonomous formation flight and pattern formation, and coordinated flight through a window.
Edit intent: clarity
Original:  Experiments are conducted on a team of 5 Crazyflie 2.0 quadrotors, demonstrating autonomous formation flight and pattern formation, and coordinated flight through a window.
Revised:  Experiments are conducted on a team of 5 Crazyflie 2.0 quadrotors, demonstrating autonomous formation flight and coordinated flight through a window.
Edit intent: clarity
Original: \noindent We address the issue of market making on electronic markets when taking into account the self exciting property of market order flow .
Revised: \noindent We address the issue of market making on electronic markets when taking into account the self exciting property of market order flows .
Edit intent: fluency
Original:  We consider a market with order flows driven by Hawkes processes where one market makeroperates, aiming at optimizing its profit .
Revised:  We consider a market model with one market maker and order flows driven by Hawkes processes where one market makeroperates, aiming at optimizing its profit .
Edit intent: clarity
Original:  We characterize an optimal control solving this problem by proving existence and uniqueness of a viscosity solution to the associated Hamilton Jacobi Bellman equation.
Revised:  We characterize an optimal control by proving existence and uniqueness of a viscosity solution to the associated Hamilton Jacobi Bellman equation.
Edit intent: clarity
Original:  We characterize an optimal control solving this problem by proving existence and uniqueness of a viscosity solution to the associated Hamilton Jacobi Bellman equation.
Revised:  We characterize an optimal control solving this problem by proving existence and uniqueness of a viscosity solution to the associated Hamilton-Jacobi-Bellman equation.
Edit intent: fluency
Original:  Finally we propose a methodology to approximate the optimal strategy .
Revised:  Finally we propose a fully consistent numerical method allowing to implement this optimal strategy in practice .
Edit intent: clarity
Original:  The positioning performance of the proposed method was verified using a realtime Android application on several mobile devices under a large indoor office environment.
Revised:  The positioning performance of the proposed method was verified using a real-time Android application on several mobile devices under a large indoor office environment.
Edit intent: fluency
Original:  We propose a class of valid inequalities, which we call the poly-bimatroid inequalities and prove that these inequalities, along with trivial bound constraints, fully describe the convex hull of the epigraph of a bisubmodular function.
Revised:  We propose valid inequalities, which we call the poly-bimatroid inequalities and prove that these inequalities, along with trivial bound constraints, fully describe the convex hull of the epigraph of a bisubmodular function.
Edit intent: clarity
Original:  We propose a class of valid inequalities, which we call the poly-bimatroid inequalities and prove that these inequalities, along with trivial bound constraints, fully describe the convex hull of the epigraph of a bisubmodular function.
Revised:  We propose a class of valid inequalities, namely the poly-bimatroid inequalities and prove that these inequalities, along with trivial bound constraints, fully describe the convex hull of the epigraph of a bisubmodular function.
Edit intent: clarity
Original:  We develop a cutting plane algorithm for general bisubmodular minimization problems using the poly-bimatroid inequalities.
Revised:  Furthermore, we develop a cutting plane algorithm for general bisubmodular minimization problems using the poly-bimatroid inequalities.
Edit intent: coherence
Original:  We develop a cutting plane algorithm for general bisubmodular minimization problems using the poly-bimatroid inequalities.
Revised:  We develop a cutting plane algorithm for constrained bisubmodular minimization based on the poly-bimatroid inequalities.
Edit intent: clarity
Original:  Our computational experiments on a robust coupled sensor placement problem show that our algorithm can solve highly non-linear problems that do not admit compact mixed-integer linear formulations.
Revised:  Our computational experiments on a robust coupled sensor placement show that our algorithm can solve highly non-linear problems that do not admit compact mixed-integer linear formulations.
Edit intent: clarity
Original:  It verifies that the framework %DIF > and compress the scale of parameters more than 6\times without  could extend the existing semi-supervised  methods to the scenarios with the extremely small scale of labelled data.
Revised:  It verifies %DIF > and compress the scale of parameters more than 6\times without could extend the existing semi-supervised methods to the scenarios with the extremely small scale of labelled data.
Edit intent: clarity
Original:  It verifies that the framework %DIF > and compress the scale of parameters more than 6\times without  could extend the existing semi-supervised  methods to the scenarios with the extremely small scale of labelled data.
Revised:  It verifies that the framework %DIF > and compress the scale of parameters more than 6\times without could extend the existing semi-supervised methods to the scenarios with the extremely small scale of labeled data.
Edit intent: fluency
Original:  The hypothesis, well known today as Cerny conjecture, claims that (n-1)^2 is a precise upper bound on the length of such a word over alphabet \Sigma of letters on edges of \Gamma for every complete n-state DFA.
Revised:  The hypothesis, mostly known today as Cerny conjecture, claims that (n-1)^2 is a precise upper bound on the length of such a word over alphabet \Sigma of letters on edges of \Gamma for every complete n-state DFA.
Edit intent: clarity
Original:  The hypothesis was formulated distinctly in 1966 by Starke.
Revised:  The hypothesis was formulated in 1966 by Starke.
Edit intent: clarity
Original:  A special classes of matrices induced by words in the alphabet of labels on edges of the underlying graph of DFA are used to prove the conjecture.
Revised:  A special classes of matrices induced by words in the alphabet of labels on edges is used to prove the conjecture.
Edit intent: clarity
Original:  The last one is based on  connection between length of  u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s  .
Revised:  The proof is based on connection between length of u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s .
Edit intent: clarity
Original:  The last one is based on  connection between length of  u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s  .
Revised:  The last one is based on the connection between length of u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s .
Edit intent: fluency
Original:  The last one is based on  connection between length of  u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s  .
Revised:  The last one is based on connection between length of words u and dimension of the space generated by solution L_x of matrix equation M_uL_x=M_s for synchronizing word s .
Edit intent: fluency
Original: The rapid proliferation of decentralized marketplace applications demands scaling solutions beyond pairwise channels in order to facilitate high volumes of consumer-provider payment transactions.
Revised: The rapid proliferation of decentralized marketplace applications demands scaling solutions beyond state channels in order to facilitate high volumes of consumer-provider payment transactions.
Edit intent: clarity
Original:  In this work, we propose Plasma Go, a sidechain mechanism for payment transactions where the computational and monetary costs of the required on-chain activity do not depend on the number of sidechain transactions.
Revised:  In this work, we propose Plasma Go, a sidechain mechanism for payment transactions where the computational and monetary costs of the on-chain activity do not depend on the number of sidechain transactions.
Edit intent: clarity
Original:  Indeed, Plasma Go combines pairwise payment channels and the Plasma construct of off-chain activity with root-chain notarization, to yield a mechanism where consumers and providers are guaranteed safety of their sidechain funds without the typical requirement of having them be online.
Revised:  Indeed, Plasma Go combines pairwise payment channels and the Plasma construct of off-chain activity with root-chain notarization, to yield a mechanism where consumers and providers are guaranteed safety of their sidechain funds without the typical requirement of having to be online.
Edit intent: clarity
Original: The rapid proliferation of decentralized marketplace applications demands scaling solutions beyond state channels in order to facilitate high transaction volumes.
Revised: Decentralized marketplace applications demand fast, cheap and easy-to-use cryptocurrency payment mechanisms to facilitate high transaction volumes.
Edit intent: clarity
Original:  In this work, we propose PayPlace, a scalable sidechain mechanism that supports large numbers of marketplace-style payment transactions off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers each establish a unidirectional payment channel with the marketplace operator to pay for their transactions.
Revised:  In this work, we propose PayPlace, a scalable off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers each establish a unidirectional payment channel with the marketplace operator to pay for their transactions.
Edit intent: clarity
Original:  In this work, we propose PayPlace, a scalable sidechain mechanism that supports large numbers of marketplace-style payment transactions off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers each establish a unidirectional payment channel with the marketplace operator to pay for their transactions.
Revised:  In this work, we propose PayPlace, a scalable sidechain mechanism that supports large numbers of marketplace-style payment transactions off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers establish a virtual unidirectional payment channel with the marketplace operator to pay for their transactions.
Edit intent: clarity
Original:  In this work, we propose PayPlace, a scalable sidechain mechanism that supports large numbers of marketplace-style payment transactions off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers each establish a unidirectional payment channel with the marketplace operator to pay for their transactions.
Revised:  In this work, we propose PayPlace, a scalable sidechain mechanism that supports large numbers of marketplace-style payment transactions off-chain without mandating an increase in computational or monetary costs of the on-chain activity required for securing the off-chain transactions . Using PayPlace, consumers each establish a unidirectional payment channel with an intermediary operator to pay for their transactions.
Edit intent: clarity
Original:  However, unlike traditional state channelswhere funds received off-chain are locked in the channel until the recipient withdraws them on the root chain, the PayPlace operator can reference funds accrued in these channels to in-turn make tamper-proof off-chain payments to service providers.
Revised:  Unlike state channels, however, the PayPlace operator can reference funds accrued in these channels to in-turn make tamper-proof off-chain payments to service providers.
Edit intent: clarity
Original:  PayPlace provably mitigates well-known attacks and drawbacks in previous sidechain designs and ensures that consumers and providers are guaranteed safety of their sidechain fundswithout the typical requirement of having to be online .
Revised:  PayPlace provably mitigates well-known drawbacks in previous sidechain designs and ensures that consumers and providers are guaranteed safety of their sidechain fundswithout the typical requirement of having to be online .
Edit intent: clarity
Original:  PayPlace provably mitigates well-known attacks and drawbacks in previous sidechain designs and ensures that consumers and providers are guaranteed safety of their sidechain fundswithout the typical requirement of having to be online .
Revised:  PayPlace provably mitigates well-known attacks and drawbacks in previous sidechain designs and ensures that neither consumers nor merchants need to be online to ensure continued safety of their sidechain fundswithout the typical requirement of having to be online .
Edit intent: clarity
Original:  PayPlace provably mitigates well-known attacks and drawbacks in previous sidechain designs and ensures that consumers and providers are guaranteed safety of their sidechain fundswithout the typical requirement of having to be online .
Revised:  PayPlace provably mitigates well-known attacks and drawbacks in previous sidechain designs and ensures that consumers and providers are guaranteed safety of their notarized funds .
Edit intent: clarity