wanyu/IteraTeR_v2 huggingface dataset:
Original:  The evolution projects the high-dimensional sequence space onto a low-dimensional space of mechanical modes, in accord with the observed dimensional reduction between genotype and phenotype of proteins.
Revised:  The evolution reduces the high-dimensional sequence space onto a low-dimensional space of mechanical modes, in accord with the observed dimensional reduction between genotype and phenotype of proteins.
Edit intent: clarity
Original:  The evolution projects the high-dimensional sequence space onto a low-dimensional space of mechanical modes, in accord with the observed dimensional reduction between genotype and phenotype of proteins.
Revised:  The evolution projects the high-dimensional sequence space to a low-dimensional space of mechanical modes, in accord with the observed dimensional reduction between genotype and phenotype of proteins.
Edit intent: fluency
Original:  A particular application of this approach leads to the converse of Kostina and Verd \'u%DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz for channel coding , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Revised:  A particular application of this approach leads to \'u%DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz for channel coding , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Edit intent: coherence
Original:  A particular application of this approach leads to the converse of Kostina and Verd \'u%DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz for channel coding , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Revised:  A particular application of this approach leads to the converse of Kostina and Verd %DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz for channel coding , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Edit intent: fluency
Original:  A particular application of this approach leads to the converse of Kostina and Verd \'u%DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz for channel coding , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Revised:  A particular application of this approach leads to the converse of Kostina and Verd \'u%DIFDELCMD < } %%% on the minimum excess distortion probability of a finite blocklength lossy joint source-channel code and to the converse of Wolfowitz , showing thereby that our LP relaxation is asymptotically tight with increasing blocklengths for channel coding, lossless source coding and joint source-channel coding with the excess distortion probability as the loss criterion.
Edit intent: coherence
Original:  We demonstrate how the optimization formulation and the lift-and-project method can be extended to networked settings  .
Revised:  We demonstrate how the optimization formulation and the lift-and-project method are extended to networked settings .
Edit intent: clarity
Original: One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function f:\{0,1\}^n \to {\mathbb R}.
Revised: One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function f:\{0,1\}^n \to {\mathbb R}.
Edit intent: fluency
Original:  The thus created offspring \xi' replaces \xi if and only if f(\xi') > f(\xi).
Revised:  The thus created offspring \xi' replaces \xi if and only if f(\xi') > f(\xi).
Edit intent: fluency
Original:  The thus created offspring \xi' replaces \xi if and only if f(\xi') > \ge f(\xi).
Revised:  The thus created offspring \xi' replaces \xi if and only if f(\xi') \ge f(\xi).
Edit intent: clarity
Original:  The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in \Delta is called the sphericity of G, and if the collection of spheres are non-overlapping, then the value d is called the contact-dimension of G. In this paper, we study the geometric representation of a complete bipartite graph K_{n,n} in various L^p metrics and connect it to the complexity of the  closest pair problem.
Revised:  The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in \Delta is called the sphericity of G, and if the collection of spheres are non-overlapping, then the value d is called the contact-dimension of G. In this paper, we study the sphericity and contact dimension of the complete bipartite graph K_{n,n} in various L^p metrics and connect it to the complexity of the closest pair problem.
Edit intent: clarity
Original:  The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in \Delta is called the sphericity of G, and if the collection of spheres are non-overlapping, then the value d is called the contact-dimension of G. In this paper, we study the geometric representation of a complete bipartite graph K_{n,n} in various L^p metrics and connect it to the complexity of the  closest pair problem.
Revised:  The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in \Delta is called the sphericity of G, and if the collection of spheres are non-overlapping, then the value d is called the contact-dimension of G. In this paper, we study the geometric representation of a complete bipartite graph K_{n,n} in various L^p -metrics and consequently connect the complexity of the closest pair problem.
Edit intent: coherence
Original:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Frankl Maehara, DCG'88%DIFDELCMD < ] %%% and Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Revised:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Maehara, DCG'88%DIFDELCMD < ] %%% and Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Edit intent: fluency
Original:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Frankl Maehara, DCG'88%DIFDELCMD < ] %%% and Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Revised:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Frankl %DIFDELCMD < ] %%% and Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Edit intent: fluency
Original:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Frankl Maehara, DCG'88%DIFDELCMD < ] %%% and Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Revised:  Our upper and lower bounds are slightly weaker than that in }%DIFDELCMD < [%%% Frankl Maehara, DCG'88%DIFDELCMD < ] %%% Maehara, DCG'91%DIFDELCMD < ]%%% , respectively.
Edit intent: coherence
Original:  However, our proofs are arguably simpler than previous works including Bilu%DIFDELCMD < & %%% Linial, JCTB'05 , which also uses spectral analysis.
Revised:  However, our proofs are arguably simpler than previous works including %DIFDELCMD < & %%% Linial, JCTB'05 , which also uses spectral analysis.
Edit intent: fluency
Original:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Revised:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Edit intent: fluency
Original:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Revised:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman %DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Edit intent: fluency
Original:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Revised:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from %DIFDELCMD < & %%% Williams, FOCS'15 .
Edit intent: fluency
Original:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% Williams, FOCS'15 .
Revised:  The hardness result is obtained by a reduction from the bichromatic variant of the closest pair problem in the Hamming metric whose hardness was recently established in%DIFDELCMD < [%%% Alman Williams, FOCS'15%DIFDELCMD < ]%%% . In addition, we prove subquadratic-time hardness for the closest pair (and thus bichromatic closest pair) problem in the L^\infty metric, which does not follow from Alman%DIFDELCMD < & %%% problems .
Edit intent: fluency
Original: OpenFlow is a protocol-implementing Software Defined Networking, a new networking paradigm, which segregates packet forwarding and accounting  from the routing decisions and advanced protocols  .
Revised: OpenFlow is a protocol implementing Software Defined Networking, a new networking paradigm, which segregates packet forwarding and accounting from the routing decisions and advanced protocols .
Edit intent: fluency
Original:  However, unlike many previous works that also used the same high level strategy, we do %DIFDELCMD < {\em %%% not reason about a two-party communication problem that is induced by a cut in the graph.
Revised:  However, unlike many previous works that also used the same high level strategy, we do %DIFDELCMD < {\em %%% not reason about a two-party communication problem that is induced by a cut in the graph.
Edit intent: fluency
Original:  We demonstrate that convexity is an inherent property of complex networks not present in a random graph . According to our perception of convexity, a convex network is such in which every connected subset of nodes induces a convex subgraph.
Revised:  We demonstrate that convexity is an inherent property of complex networks not present in a random graph . According to our perception of convexity, convex network is such in which every connected subset of nodes induces a convex subgraph.
Edit intent: clarity
Original:  These are macro elements that consist of one or more micro elements over one or more micro time steps . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal mechanisms that support their  function.
Revised:  These are macro elements that consist of one or more micro elements over one or more micro updates . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal mechanisms that support their function.
Edit intent: clarity
Original:  These are macro elements that consist of one or more micro elements over one or more micro time steps . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal mechanisms that support their  function.
Revised:  These are macro elements that consist of one or more micro elements over one or more micro time steps . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal micro elements that support their function.
Edit intent: clarity
Original:  These are macro elements that consist of one or more micro elements over one or more micro time steps . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal mechanisms that support their  function.
Revised:  These are macro elements that consist of one or more micro elements over one or more micro time steps . Cause-effect power was evaluated based on the inputs and outputs of the black boxes, ignoring the internal mechanisms that support their input-output function.
Edit intent: clarity
Original:  We show that a macro, black-box system can have higher {\Phi} than its micro constituents either by implementing more selective mechanisms (lower degeneracy) or by composing a system having more common inputs and outputs (  higher integration).
Revised:  We show that a macro, black-box system can have higher {\Phi} than its micro constituents by having more mechanisms ( higher integration).
Edit intent: clarity
Original:   These local maxima correspond to macro levels of organization at which causal features of physical systems emerge , and provide a natural focus for scientific inquiries.
Revised:  These local maxima correspond to macro levels of organization at which emergent cause-effect properties of physical systems emerge , and provide a natural focus for scientific inquiries.
Edit intent: clarity
Original:   These local maxima correspond to macro levels of organization at which causal features of physical systems emerge , and provide a natural focus for scientific inquiries.
Revised:  These local maxima correspond to macro levels of organization at which causal features of physical systems come into focus , and provide a natural focus for scientific inquiries.
Edit intent: clarity
Original:   These local maxima correspond to macro levels of organization at which causal features of physical systems emerge , and provide a natural focus for scientific inquiries.
Revised:  These local maxima correspond to macro levels of organization at which causal features of physical systems emerge , and provide a natural vantage point for scientific inquiries.
Edit intent: clarity
Original: Multi-view queries on a multi-view product image database with bag-of-visual words (BoWs) have been shown to improve the average precision significantly compared to traditional single view queries on single view databases .
Revised: Multi-view product image queries can improve retrieval performance over single view queries on single view databases .
Edit intent: clarity
Original: Multi-view queries on a multi-view product image database with bag-of-visual words (BoWs) have been shown to improve the average precision significantly compared to traditional single view queries on single view databases .
Revised: Multi-view queries on a multi-view product image database with bag-of-visual words (BoWs) have been shown to improve the average precision significantly compared to traditional single view queries significantly .
Edit intent: coherence
Original:  In this paper, we investigate the performance of deep convolutional neural networks (ConvNets) on multi-view product image search and compare to the classical BoWs.
Revised:  In this paper, we investigated the performance of deep convolutional neural networks (ConvNets) on multi-view product image search and compare to the classical BoWs.
Edit intent: fluency
Original: The measurement of quantum signals that traveled through long distances is of fundamental and technical interest.
Revised: The measurement of quantum signals that traveled through long distances is of fundamental and technological interest.
Edit intent: fluency
Original:  Finding such structures necessitates we move from considering exclusively pairwise interactions to capturing higher order relations, considerations naturally expressed in the language of algebraic topology.
Revised:  Finding such structures necessitates we move from considering pairwise interactions to capturing higher order relations, considerations naturally expressed in the language of algebraic topology.
Edit intent: clarity
Original:  Finding such structures necessitates we move from considering exclusively pairwise interactions to capturing higher order relations, considerations naturally expressed in the language of algebraic topology.
Revised:  Finding such structures necessitates we move from considering exclusively pairwise interactions to capturing higher order relations, concepts naturally expressed in the language of algebraic topology.
Edit intent: clarity
Original:  In this parlance, clusters of all-to-all connected sets of brain regions that may readily share information to perform a coordinated function are calledcliques .
Revised:  cliques .
Edit intent: clarity
Original:  We detect cliques  in the average structural connectomes of 8 healthy adults scanned in triplicate and discover the presence of more high-dimensional cliques than expected in null networks constructed via wiring minimization .
Revised:  We detect cliques in the average structural connectomes of 8 healthy adults and discover the presence of more high-dimensional cliques than expected in null networks constructed via wiring minimization .
Edit intent: clarity
Original:  We detect cliques  in the average structural connectomes of 8 healthy adults scanned in triplicate and discover the presence of more high-dimensional cliques than expected in null networks constructed via wiring minimization .
Revised:  We detect cliques in the average structural connectomes of 8 healthy adults scanned in triplicate and discover the presence of more large cliques than expected in null networks constructed via wiring minimization .
Edit intent: clarity
Original:  Complementary to theis study of locally dense structures, we employ a tool calledpersistent homology to locatecycles , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Revised:  persistent homology to locatecycles , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Edit intent: clarity
Original:  Complementary to theis study of locally dense structures, we employ a tool calledpersistent homology to locatecycles , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Revised:  Complementary to theis study of locally dense structures, we employ a tool calledpersistent homology cycles , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Edit intent: clarity
Original:  Complementary to theis study of locally dense structures, we employ a tool calledpersistent homology to locatecycles , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Revised:  Complementary to theis study of locally dense structures, we employ a tool calledpersistent homology to locate , topological cavities of different dimensions, around which information may flow in either diverging or converging patterns.
Edit intent: coherence
Original:  These cycles exist consistently across subjects, differ from those observed in null model networks, and -- importantly -- link regions of early and late evolutionary origin in long loops, underscoring their unique role in controlling brain function  .
Revised:  These cavities exist consistently across subjects, differ from those observed in null model networks, and -- importantly -- link regions of early and late evolutionary origin in long loops, underscoring their unique role in controlling brain function .
Edit intent: clarity
Original:  These cycles exist consistently across subjects, differ from those observed in null model networks, and -- importantly -- link regions of early and late evolutionary origin in long loops, underscoring their unique role in controlling brain function  .
Revised:  These cycles exist consistently across subjects, differ from those observed in null model networks, and link regions of early and late evolutionary origin in long loops, underscoring their unique role in controlling brain function .
Edit intent: coherence
Original: Similar to face-to-face communication in daily life, more and more evidence suggests that human emotion also spread in online social media through virtual interactions.
Revised: Similar to face-to-face communication in daily life, more and more evidence suggests that human emotions also spread in online social media through virtual interactions.
Edit intent: fluency
Original:  However, the mechanism underlying the emotion contagion, like whether different feelings diffuse unlikely or how the spread is coupled with the social network, is rarely investigated.
Revised:  However, the mechanism underlying the emotion contagion, like whether different feelings spread unlikely or how the spread is coupled with the social network, is rarely investigated.
Edit intent: fluency
Original:  Indeed, because of the costly expense and spatio-temporal limitations, it is challenging for conventional questionnaires or controlled experiments.
Revised:  Indeed, due to the costly expense and spatio-temporal limitations, it is challenging for conventional questionnaires or controlled experiments.
Edit intent: fluency
Original:  While given the instinct of collecting natural affective responses of massive connected individuals, online social media offer us an ideal proxy to tackle this issue from the perspective of computational social science.
Revised:  While given the instinct of collecting natural affective responses of massive connected individuals, online social media offer an ideal proxy to tackle this issue from the perspective of computational social science.
Edit intent: clarity