wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our work conveys both theoretical and practical implications , and provides more nuanced and fine-grained results for studying online  manipulation.
Revised:  Our work conveys both theoretical and practical implications , and provides more nuanced and fine-grained results for studying online information manipulation.
Edit intent: clarity
Original:  We prove that the five axioms plus Coherent IIA single out a voting procedure studied in our recent work: Split Cycle.
Revised:  We prove that the five axioms plus Coherent IIA single out a method of determining defeats studied in our recent work: Split Cycle.
Edit intent: clarity
Original:  In particular, Split Cycle is the most resolute voting procedure satisfying the six axioms for democratic defeat.
Revised:  In particular, Split Cycle provides the most resolute voting procedure satisfying the six axioms for democratic defeat.
Edit intent: clarity
Original:  In particular, Split Cycle is the most resolute voting procedure satisfying the six axioms for democratic defeat.
Revised:  In particular, Split Cycle is the most resolute definition of defeat among any satisfying the six axioms for democratic defeat.
Edit intent: clarity
Original: We consider a variational model for single-image super-resolution based on the assumption that the image gradient of the target image is sparse.
Revised: We consider a variational model for single-image super-resolution based on the assumption that the gradient of the target image is sparse.
Edit intent: clarity
Original: It is well known that every stable matching instance I has a \emph{rotation poset R(I) that can be computed efficiently and the downsets of R(I) are in one-to-one correspondence with the stable matchings of I. Furthermore, for every poset P, an instance I(P) can be constructed efficiently so that the rotation poset of I(P) is isomorphic to P.
Revised: It is well known that every stable matching instance I has a \emph{rotation poset R(I) that can be computed efficiently and the downsets of R(I) are in one-to-one correspondence with the stable matchings of I. Furthermore, for every poset P, an instance I(P) can be constructed efficiently so that the rotation poset of I(P) is isomorphic to P.
Edit intent: fluency
Original:  In this case, we say that I(P) realizes P.
Revised:  In this case, we say that I(P) realizes P.
Edit intent: fluency
Original:  To make the problem of sampling stable matchings more tractable , Bhatnagar et al.
Revised:  To make the problem of sampling stable matchings , Bhatnagar et al.
Edit intent: clarity
Original:  We prove that there is a constant k so that every rotation poset is realized by some instance in the first three models for some fixed constant k.
Revised:  We prove that there is a constant k so that every rotation poset is realized by some instance in the first three models for some fixed constant k.
Edit intent: fluency
Original: Modern user-facing , latency-sensitive web services include numerous distributed, intercommunicating microservices that promise to simplify software development and operation.
Revised: Modern user-facing latency-sensitive web services include numerous distributed, intercommunicating microservices that promise to simplify software development and operation.
Edit intent: fluency
Original:  Under this natural metric, the celebrated HyperLogLog sketch of Flajolet et al. (2007 ) has an MVP approaching 6(3\ln 2-1)\approx 6.48 for estimating cardinalities up to  \\%DIF > standard error, we cannot do better  2 ^{64.
Revised:  Under this natural metric, the celebrated HyperLogLog sketch of Flajolet et al. (2007 ) has an MVP approaching 6(3\ln 2-1)\approx 6.48 for estimating cardinalities up to \\%DIF > standard error, we cannot do better than a 2 ^{64.
Edit intent: clarity
Original:  }   We develop a new class of "curtain" sketches that are a bit more complex than Martingale LogLog but with substantially better%DIFDELCMD < \MVPs%%% , e.g., Martingale Curtain has MVP  \MVP \approx 2.31.
Revised:  } We develop a new %DIFDELCMD < \MVPs%%% , e.g., Martingale Curtain has MVP \MVP \approx 2.31.
Edit intent: clarity
Original: The issue in solving social problems is how to respect minority opinions , which are often ignored in general majority rules.
Revised: Respecting minority opinions is vital in solving social problems is how to respect minority opinions , which are often ignored in general majority rules.
Edit intent: clarity
Original: The issue in solving social problems is how to respect minority opinions , which are often ignored in general majority rules.
Revised: The issue in solving social problems . However, minority opinions are often ignored in general majority rules.
Edit intent: coherence
Original:  To build consensus on pluralistic values and make social choices in consideration of minority opinions, we propose aggregation methods that give weighting to the minority's positionality on cardinal cumulative voting.
Revised:  To build consensus on pluralistic values and make social choices that consider minority opinions, we propose aggregation methods that give weighting to the minority's positionality on cardinal cumulative voting.
Edit intent: clarity
Original:  From these calculation results, we found that minority opinions are  likely to be reflected as weighting increases proportionally in two of the above three methods.
Revised:  From these calculation results, we found that minority opinions are more likely to be reflected as weighting increases proportionally in two of the above three methods.
Edit intent: clarity
Original:  In addition, we can know the contents such as the number and positionality of the minority from the analysis of the aggregation results.
Revised:  In addition, it is possible to visualize the number and positionality of the minority from the analysis of the aggregation results.
Edit intent: clarity
Original:  It will be useful for promoting mutual understanding between the majority and minority by  visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Revised:  These results will be useful for promoting mutual understanding between the majority and minority by visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Edit intent: clarity
Original:  It will be useful for promoting mutual understanding between the majority and minority by  visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Revised:  It will be useful to promote mutual understanding between the majority and minority by visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Edit intent: coherence
Original:  It will be useful for promoting mutual understanding between the majority and minority by  visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Revised:  It will be useful for promoting mutual understanding between the majority and minority by interactively visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Edit intent: fluency
Original:  It will be useful for promoting mutual understanding between the majority and minority by  visualizing the contents of the proposed aggregation methods interactively in the consensus-building process.
Revised:  It will be useful for promoting mutual understanding between the majority and minority by visualizing the contents of the proposed aggregation methods in the consensus-building process.
Edit intent: clarity
Original:  With the further development of information technology, the consensus building on cardinal choices based on big data will be necessary.
Revised:  With the further development of information technology, the consensus building based on big data will be necessary.
Edit intent: clarity
Original:  We would like to use the proposed aggregation methods for making social choices for pluralistic values such as social, environmental, and economic.
Revised:  We recommend the use of our proposed aggregation methods for making social choices for pluralistic values such as social, environmental, and economic.
Edit intent: clarity
Original:  We would like to use the proposed aggregation methods for making social choices for pluralistic values such as social, environmental, and economic.
Revised:  We would like to use the proposed aggregation methods to make social choices for pluralistic values such as social, environmental, and economic.
Edit intent: fluency
Original:  Several concepts of fairness have been established, and envy-freeness is one of the most widely studied notions of fairness.
Revised:  Envy-freeness is one of the most widely studied notions of fairness.
Edit intent: coherence
Original:  Since  envy-free allocations do not always exist when items are indivisible, several relaxations have been considered.
Revised:  Since complete envy-free allocations do not always exist when items are indivisible, several relaxations have been considered.
Edit intent: clarity
Original:  However, despite significant efforts by many researchers for several years, it is only known that an EFX allocation always exists when there are at most three agents and their valuations are additive or when all agents have identical valuations .
Revised:  However, despite significant efforts by many researchers for several years, it is known that a complete EFX allocation always exists when there are at most three agents and their valuations are additive or when all agents have identical valuations .
Edit intent: clarity
Original:  However, despite significant efforts by many researchers for several years, it is only known that an EFX allocation always exists when there are at most three agents and their valuations are additive or when all agents have identical valuations .
Revised:  However, despite significant efforts by many researchers for several years, it is only known that an EFX allocation always exists only in limited cases .
Edit intent: clarity
Original:  In this paper, we show that an EFX allocation always exists when every agent has one of the two additive valuations.
Revised:  In this paper, we show that a complete EFX allocation always exists when every agent has one of the two additive valuations.
Edit intent: clarity
Original:  I present a class of models that bridge two concepts form distant fields: combinatory logic (or  lambda calculus) and RNA molecular biology.
Revised:  I present a class of models that bridge two concepts from distant fields: combinatory logic (or lambda calculus) and RNA molecular biology.
Edit intent: fluency
Original:  I present a class of models that bridge two concepts form distant fields: combinatory logic (or  lambda calculus) and RNA molecular biology.
Revised:  I present a class of models that bridge two concepts form distant fields: combinatory logic (or lambda calculus) and molecular biology.
Edit intent: clarity
Original:  A set of simple RNA editing rules can make it possible to compute any computable function with identical algorithmic complexity to that of Turing machines.
Revised:  A set of basic RNA editing rules can make it possible to compute any computable function with identical algorithmic complexity to that of Turing machines.
Edit intent: clarity
Original:  Experimental validation of this theory may greatly impact our understanding of memory, cognition, development, cancer , evolution, and the early stages of life.
Revised:  Experimental validation of this theory may immensely impact our understanding of memory, cognition, development, cancer , evolution, and the early stages of life.
Edit intent: clarity
Original:  Experimental validation of this theory may greatly impact our understanding of memory, cognition, development, cancer , evolution, and the early stages of life.
Revised:  Experimental validation of this theory may greatly impact our understanding of memory, cognition, development, disease , evolution, and the early stages of life.
Edit intent: clarity
Original:  Yet we currently have no biologically plausible model capable of universal computation, i.e., Turing-equivalent in scope.
Revised:  Yet we currently do not know of a naturally existing biological system capable of universal computation, i.e., Turing-equivalent in scope.
Edit intent: clarity
Original:  The most plausible of these models does not strictly mimic the operation rules of combinatory logic or lambda calculus;
Revised:  In the most plausible of these models does not strictly mimic the operation rules of combinatory logic or lambda calculus;
Edit intent: fluency
Original: We identify all [1, \lambda, 8]-cycle regular I-graphs , all [1, \lambda, 8]-cycle regular double generalized Petersen graphs , and the unique 1, \lambda, 6%DIFDELCMD < ]%%% -cycle regular folded hypercube .
Revised: We identify all [1, \lambda, 8]-cycle regular I-graphs and all [1, \lambda, 8]-cycle regular double generalized Petersen graphs , and the unique 1, \lambda, 6%DIFDELCMD < ]%%% -cycle regular folded hypercube .
Edit intent: coherence
Original: We identify all [1, \lambda, 8]-cycle regular I-graphs , all [1, \lambda, 8]-cycle regular double generalized Petersen graphs , and the unique 1, \lambda, 6%DIFDELCMD < ]%%% -cycle regular folded hypercube .
Revised: We identify all [1, \lambda, 8]-cycle regular I-graphs , all [1, \lambda, 8]-cycle regular double generalized Petersen graphs 1, \lambda, 6%DIFDELCMD < ]%%% -cycle regular folded hypercube .
Edit intent: clarity
Original:  As a consequence we describe linear recognition algorithms for the first two graph families, and a quasilinear recognition algorithm for the folded hypercubes ] ]  ] .
Revised:  As a consequence we describe linear recognition algorithms for the first two graph families, and a quasilinear recognition algorithm for the folded hypercubes ], ] ] .
Edit intent: fluency
Original: The Grammar of Institutions, or Institutional Grammar (IG) , is an established approach to encode policy information in terms of institutional statements based on a set of pre-defined syntactic components.
Revised: The Grammar of Institutions, or Institutional Grammar , is an established approach to encode policy information in terms of institutional statements based on a set of pre-defined syntactic components.
Edit intent: clarity
Original:  This codebook provides coding guidelines for a revised version of the IG , the Institutional Grammar 2.0 (IG 2.0).
Revised:  This codebook provides coding guidelines for a revised version of the Institutional Grammar , the Institutional Grammar 2.0 (IG 2.0).
Edit intent: fluency
Original:  Following this, detailed coding guidelines are provided for both regulative and constitutive statements across all levels of expressiveness, along with the encoding instructions for hybrid and polymorphic institutional statements.
Revised:  Detailed coding guidelines are provided for both regulative and constitutive statements across all levels of expressiveness, along with the encoding instructions for hybrid and polymorphic institutional statements.
Edit intent: coherence
Original:  Links to additional resources such as the underlying scientific literature (that offers  comprehensive treatment of the underlying theoretical concepts) as well as tool support are referred to in the concluding section of the codebook.
Revised:  Links to additional resources such as the underlying scientific literature (that offers a comprehensive treatment of the underlying theoretical concepts) as well as tool support are referred to in the concluding section of the codebook.
Edit intent: fluency
Original:  Links to additional resources such as the underlying scientific literature (that offers  comprehensive treatment of the underlying theoretical concepts) as well as tool support are referred to in the concluding section of the codebook.
Revised:  Links to additional resources such as the underlying scientific literature (that offers comprehensive treatment of the underlying theoretical concepts) are referred to in the concluding section of the codebook.
Edit intent: coherence
Original:  Our general results concerning VER do not just apply to allocation problems but to any collective choice problem in which agents have ordinal preferences over discrete outcomes.
Revised:  Our results about VER do not just apply to allocation problems but to any collective choice problem in which agents have ordinal preferences over discrete outcomes.
Edit intent: clarity
Original:  Our general results concerning VER do not just apply to allocation problems but to any collective choice problem in which agents have ordinal preferences over discrete outcomes.
Revised:  Our general results concerning VER do not just apply to allocation problems but to all collective choice problems in which agents have ordinal preferences over discrete outcomes.
Edit intent: clarity
Original:  Our main contribution is an allocation mechanism, called the vigilant eating rule (VER), that applies to nearly arbitrary feasibility constraints.
Revised:  We devise an allocation mechanism, called the vigilant eating rule (VER), that applies to nearly arbitrary feasibility constraints.
Edit intent: clarity
Original:  Preliminary numerical experiments show that traditional one-by-one enumeration schemes cannot compete against compressed enumeration when the degree of compression is high.
Revised:  Numerical experiments show that traditional one-by-one enumeration schemes cannot compete against compressed enumeration when the degree of compression is high.
Edit intent: clarity
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. Many NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: clarity
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: fluency
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: fluency
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set \textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: fluency
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{ andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: clarity
Original: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching andList k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Revised: A bipartite graph G=(A,B,E) is {\cal H}-convex, for some family of graphs {\cal H}, if there exists a graph H\in {\cal H} with V(H)=A such that the set of neighbours in A of each b\in B induces a connected subgraph of H. A variety of well-known NP-complete problems, including Dominating Set ,Feedback Vertex Set ,\textsc{Induced Matching List k-Colouring , become polynomial-time solvable for {\mathcal H}-convex graphs when {\mathcal H} is the set of paths.
Edit intent: fluency
Original: We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs , for any constant d>2, unless ETH fails.
Revised: We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH fails.
Edit intent: clarity
Original:  Besides being a simple and explicit model pertinent to slender structures, this rod theory also allows us to test our general theory and its numerical implementation using B-Splines .
Revised:  Besides being a simple and explicit model pertinent to slender structures, this rod theory also allows us to test our general theory and its numerical implementation using B-splines .
Edit intent: fluency