wanyu/IteraTeR_v2 huggingface dataset:
Original:  Simulation results show that the proposed algorithms perform extremely close to the optimum , and significantly outperform the other representative benchmark algorithms.
Revised:  Simulation results show that the proposed algorithms perform extremely close to the optimum and significantly outperform the other representative benchmark algorithms.
Edit intent: fluency
Original: Leveraging recent advances on mobile edge computing (MEC), edge intelligence has emerged as a promising paradigm to support mobile artificial intelligent (AI) applications at the network edge.
Revised: Leveraging recent advances on mobile edge computing (MEC), edge intelligence has emerged as a promising paradigm to support mobile artificial intelligence (AI) applications at the network edge.
Edit intent: fluency
Original:  We provide a novel connection between StoqMA and the distribution testing via reversible circuits.
Revised:  We provide a novel connection between StoqMA and distribution testing via reversible circuits.
Edit intent: fluency
Original:   ] Second, by showing distinguishing reversible circuits with random ancillary bits is StoqMA-complete (as a comparison, distinguishing quantum circuits is \mathsf{QMA}-complete [JWB05]), we construct soundness error reduction of \mathsf{StoqMA}.
Revised:  ]. Second, by showing distinguishing reversible circuits with random ancillary bits is StoqMA-complete (as a comparison, distinguishing quantum circuits is \mathsf{QMA}-complete [JWB05]), we construct soundness error reduction of \mathsf{StoqMA}.
Edit intent: fluency
Original:   ] Second, by showing distinguishing reversible circuits with random ancillary bits is StoqMA-complete (as a comparison, distinguishing quantum circuits is \mathsf{QMA}-complete [JWB05]), we construct soundness error reduction of \mathsf{StoqMA}.
Revised:  ] Second, by showing distinguishing reversible circuits with ancillary random bits is StoqMA-complete (as a comparison, distinguishing quantum circuits is \mathsf{QMA}-complete [JWB05]), we construct soundness error reduction of \mathsf{StoqMA}.
Edit intent: fluency
Original:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Revised:  -complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Edit intent: clarity
Original:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Revised:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Edit intent: coherence
Original:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Revised:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Edit intent: fluency
Original:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any random ancillary bit and with perfect soundness are contained in \mathsf{NP}.
Revised:  This new \mathsf{StoqMA-complete problem further signifies that \mathsf{StoqMA} with perfect completeness (\mathsf{StoqMA}_1) is contained in \mathsf{eStoqMA}, which leads us to an alternating proof for \mathsf{StoqMA}_1 \subseteq \mathsf{MA} previously proved in }%DIFDELCMD < [%%% BBT06, BT10 . Additionally, we show that both variants of \mathsf{StoqMA} that without any ancillary random bit and with perfect soundness are contained in \mathsf{NP}.
Edit intent: fluency
Original:  By exploiting the observation that strong ambient fields can simplify control of networked dynamics, our findings open the possibility of running public information campaigns using insights from social network theory without costly or invasive levels of data collection.
Revised:  By exploiting the observation that strong ambient fields can simplify control of networked dynamics, our findings open the possibility of efficiently computing and implementing public information campaigns using insights from social network theory without costly or invasive levels of data collection.
Edit intent: clarity
Original:  OpenStreetMap (OSM) is a rich source of openly available  volunteered geographic information that has a high potential to complement these representations.
Revised:  OpenStreetMap (OSM) is a rich source of openly available , volunteered geographic information that has a high potential to complement these representations.
Edit intent: fluency
Original:  In this article, we propose OSM2KG -- a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph.
Revised:  In this article, we propose OSM2KG - a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph.
Edit intent: fluency
Original:  Our experiments conducted on several OSM datasets  as well as the Wikidata and DBpedia knowledge graphs  demonstrate that OSM2KG can reliably discover identity links.
Revised:  Our experiments conducted on several OSM datasets , as well as the Wikidata and DBpedia knowledge graphs demonstrate that OSM2KG can reliably discover identity links.
Edit intent: fluency
Original:  Our experiments conducted on several OSM datasets  as well as the Wikidata and DBpedia knowledge graphs  demonstrate that OSM2KG can reliably discover identity links.
Revised:  Our experiments conducted on several OSM datasets as well as the Wikidata and DBpedia knowledge graphs , demonstrate that OSM2KG can reliably discover identity links.
Edit intent: fluency
Original:  The EcM tree species had higher fungal biomass, fungal growth and bacterial biomass, while AM species showed higher total microbial biomass and bacterial growth.
Revised:  The EcM tree species had higher fungal biomass, fungal growth and bacterial biomass, while AM species showed higher bacterial growth.
Edit intent: clarity
Original:  The results indicated that microbial community composition and functioning differed between groups of tree species with distinct litter qualities that mediate soil C/N ratio and soil pH .
Revised:  The results indicated that microbial community composition and functioning differed between groups of tree species with distinct litter qualities that generate soil C/N ratio and soil pH .
Edit intent: clarity
Original:  In light of previous studies of soil C stocks, the results support that tree species mediated microbial and particularly bacterial processing may be an important driver of mineral soil C stocks and forms in AM vs. EcM species.
Revised:  The results suggest that tree species-mediated microbial community composition and activity may be important drivers of the different vertical soil C distribution previously observed in AM and EcM tree species.
Edit intent: clarity
Original: Stimulation methods that utilise more than one stimulation frequency have been developed in steady-state visual evoked potential (SSVEP) brain-computer interfaces (BCIs) for the purpose of increasing the number of targets that can be presented simultaneously.
Revised: Stimulation methods that utilise more than one stimulation frequency have been developed for steady-state visual evoked potential (SSVEP) brain-computer interfaces (BCIs) for the purpose of increasing the number of targets that can be presented simultaneously.
Edit intent: fluency
Original: Stimulation methods that utilise more than one stimulation frequency have been developed in steady-state visual evoked potential (SSVEP) brain-computer interfaces (BCIs) for the purpose of increasing the number of targets that can be presented simultaneously.
Revised: Stimulation methods that utilise more than one stimulation frequency have been developed in steady-state visual evoked potential (SSVEP) brain-computer interfaces (BCIs) with the purpose of increasing the number of targets that can be presented simultaneously.
Edit intent: style
Original:  A concept "order" was defined as the sum of absolute values of the coefficients in the linear interaction .
Revised:  A concept of order, defined as the sum of absolute values of the coefficients in the linear interaction .
Edit intent: clarity
Original:  A concept "order" was defined as the sum of absolute values of the coefficients in the linear interaction .
Revised:  A concept "order" was defined as the sum of absolute value of the coefficients in the linear interaction .
Edit intent: fluency
Original:  Results show that, compared to the standard CCA formulation, the proposed multi-frequency CCA (MFCCA ) has a 20\% improvement in decoding accuracy on average at order 2. Although the proposed methods were only tested with two input frequencies, the technique is capable of handling more than two simultaneous input frequencies .
Revised:  Results show that, compared to the standard CCA formulation, the proposed MFCCA has a 20\% improvement in decoding accuracy on average at order 2. Although the proposed methods were only tested with two input frequencies, the technique is capable of handling more than two simultaneous input frequencies .
Edit intent: clarity
Original:  Results show that, compared to the standard CCA formulation, the proposed multi-frequency CCA (MFCCA ) has a 20\% improvement in decoding accuracy on average at order 2. Although the proposed methods were only tested with two input frequencies, the technique is capable of handling more than two simultaneous input frequencies .
Revised:  Results show that, compared to the standard CCA formulation, the proposed multi-frequency CCA (MFCCA ) has a 20\% improvement in decoding accuracy on average at order 2, while keeping its generality and training-free characteristics .
Edit intent: coherence
Original: In his paper "Kings in Bipartite Hypertournaments" (Graphs \& Combinatorics 35, 2019)  Petrovic stated two conjectures on 4-kings in multipartite hypertournaments.
Revised: In his paper "Kings in Bipartite Hypertournaments" (Graphs \& Combinatorics 35, 2019) , Petrovic stated two conjectures on 4-kings in multipartite hypertournaments.
Edit intent: fluency
Original:  Finally, we conduct simulations in order to numerically analyze and compare the performance of the mechanisms ad confirm the theoretical properties of the market model.
Revised:  Finally, we conduct simulations in order to numerically analyze and compare the performance of the mechanisms and confirm the theoretical properties of the market model.
Edit intent: fluency
Original:  The main structural traits we derive , and that allow fast and reliable optimization of relaxations , are the resemblance of optimal values of f, Lipschitzness of gradients, and convexity  .
Revised:  The main structural traits we derive and that allow fast and reliable optimization of relaxations , are the resemblance of optimal values of f, Lipschitzness of gradients, and convexity .
Edit intent: fluency
Original:  The main structural traits we derive , and that allow fast and reliable optimization of relaxations , are the resemblance of optimal values of f, Lipschitzness of gradients, and convexity  .
Revised:  The main structural traits we derive , and that allow fast and reliable optimization of relaxations are the resemblance of optimal values of f, Lipschitzness of gradients, and convexity .
Edit intent: fluency
Original:  The main structural traits we derive and that allow fast and reliable optimization of relaxations are the resemblance of optimal values of f, Lipschitzness of gradients, and convexity.
Revised:  The main structural traits we derive and that allow fast and reliable optimization of relaxations are the consistency of optimal values of f, Lipschitzness of gradients, and convexity.
Edit intent: clarity
Original:  Because a multiscale spatial splitting gives a "good" splitting of the solution space, one can achieve an efficient temporal splitting .
Revised:  Because a multiscale spatial splitting gives a "good" decomposition of the solution space, one can achieve an efficient temporal splitting .
Edit intent: clarity
Original:  We present a theoretical result, which was derived in our earlier paper and adopted in this paper for multiscale problems.
Revised:  We present a theoretical result, which was derived in our earlier work and adopt it in this paper for multiscale problems.
Edit intent: clarity
Original: We study a market of investments on networks, where each agent (vertex) can invest in any enterprise linked to him , and at the same time, raise capital for his firmown enterprise from other agents he is linked to.
Revised: We study a market of investments on networks, where each agent (vertex) can invest in any enterprise linked to him , and at the same time, raise capital for her firm's enterprise from other agents he is linked to.
Edit intent: fluency
Original: We study a market of investments on networks, where each agent (vertex) can invest in any enterprise linked to him , and at the same time, raise capital for his firmown enterprise from other agents he is linked to.
Revised: We study a market of investments on networks, where each agent (vertex) can invest in any enterprise linked to him , and at the same time, raise capital for his firmown enterprise from other agents she is linked to.
Edit intent: fluency
Original:  Our main objective is to examine the role of collaterals in handling the strategic risk that can propagate to a systemic risk throughout the network in a cascade of defaults.
Revised:  Our main objective is to examine the role of collateral contracts in handling the strategic risk that can propagate to a systemic risk throughout the network in a cascade of defaults.
Edit intent: clarity
Original:  We take a mechanism design approach and solve for the optimal scheme of collateral contracts that capital raisers offer their investors.
Revised:  We take a mechanism-design approach and solve for the optimal scheme of collateral contracts that capital raisers offer their investors.
Edit intent: fluency
Original: We design a fixed-parameter deterministic algorithm for computing a maximum weight feasible set under a \ell-matchoid of rank k , parameterized by \ell and k.
Revised: We consider the problem of optimizing a coverage function under a \ell-matchoid of rank k , parameterized by \ell and k.
Edit intent: clarity
Original:  While it has been argued that intelligent agents have an incentive to avoid modifying their utility function so that their future instances will work towards the same goals , it is not clear whether this also applies in non-dualistic scenarios, where the agent is embedded in the environment.
Revised:  It has been argued that intelligent agents have an incentive to avoid modifying their utility function so that their future instances will work towards the same goals , it is not clear whether this also applies in non-dualistic scenarios, where the agent is embedded in the environment.
Edit intent: coherence
Original:  While it has been argued that intelligent agents have an incentive to avoid modifying their utility function so that their future instances will work towards the same goals , it is not clear whether this also applies in non-dualistic scenarios, where the agent is embedded in the environment.
Revised:  While it has been argued that intelligent agents have an incentive to avoid modifying their utility function so that their future instances work towards the same goals , it is not clear whether this also applies in non-dualistic scenarios, where the agent is embedded in the environment.
Edit intent: clarity
Original:  In contrast to Everitt et al. (2016) , who formally show that providing an option to self-modify is harmless for perfectly rational agents , we show that for agents with bounded rationality  , self-modification may cause exponential deterioration in performance and gradual misalignment of a previously aligned agent.
Revised:  In contrast to Everitt et al. (2016) formally show that providing an option to self-modify is harmless for perfectly rational agents , we show that for agents with bounded rationality , self-modification may cause exponential deterioration in performance and gradual misalignment of a previously aligned agent.
Edit intent: coherence
Original:  Specifically, we introduce several types of a bounded-rational agent, which either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an innacurate model of the environment, or (4) uses the wrong temporal discounting factor.
Revised:  We examine four ways in which an agent can be bounded-rational agent, which either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an innacurate model of the environment, or (4) uses the wrong temporal discounting factor.
Edit intent: clarity
Original:  Specifically, we introduce several types of a bounded-rational agent, which either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an innacurate model of the environment, or (4) uses the wrong temporal discounting factor.
Revised:  Specifically, we introduce several types of a bounded-rational : it either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an innacurate model of the environment, or (4) uses the wrong temporal discounting factor.
Edit intent: clarity
Original:  Specifically, we introduce several types of a bounded-rational agent, which either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an innacurate model of the environment, or (4) uses the wrong temporal discounting factor.
Revised:  Specifically, we introduce several types of a bounded-rational agent, which either (1) doesn't always choose the optimal action, (2) is not perfectly aligned with human values, (3) has an inaccurate model of the environment, or (4) uses the wrong temporal discounting factor.
Edit intent: fluency
Original:  We show that while in the cases (2)-(4) the misalignment caused by the agent's imperfection does not worsen over time, with (1) the misalignment may grow exponentially.
Revised:  We show that while in the cases (2)-(4) the misalignment caused by the agent's imperfection does not increase over time, with (1) the misalignment may grow exponentially.
Edit intent: clarity
Original:  However, due to the increasing complexity of network protocols and components , it becomes harder and harder to maintain .
Revised:  However, due to the increasing complexity of network protocols and components .
Edit intent: clarity
Original:  Therefore, investigating and understanding how data is leaked from the information transport platform/ protocols can lead us to a more secure environment.
Revised:  Therefore, investigating and understanding how data is leaked from the information transmission platforms and protocols can lead us to a more secure environment.
Edit intent: clarity
Original:  In this paper, we propose an iterative framework to find the most vulnerable information fields in a network protocol systematically .
Revised:  In this paper, we propose a framework to systematically find the most vulnerable information fields in a network protocol systematically .
Edit intent: clarity
Original:  In this paper, we propose an iterative framework to find the most vulnerable information fields in a network protocol systematically .
Revised:  In this paper, we propose an iterative framework to find the most vulnerable information fields in a network protocol .
Edit intent: clarity
Original:  To this end, focusing on the Transport Layer Security (TLS) protocol, we perform different machine-learning-based fingerprinting attacks by collecting data from more than 70 domains (websites) to understand how and where this information leakage occurs in the TLS protocol.
Revised:  To this end, focusing on the transport layer security (TLS) protocol, we perform different machine-learning-based fingerprinting attacks by collecting data from more than 70 domains (websites) to understand how and where this information leakage occurs in the TLS protocol.
Edit intent: fluency
Original:  To this end, focusing on the Transport Layer Security (TLS) protocol, we perform different machine-learning-based fingerprinting attacks by collecting data from more than 70 domains (websites) to understand how and where this information leakage occurs in the TLS protocol.
Revised:  To this end, focusing on the Transport Layer Security (TLS) protocol, we perform different machine-learning-based fingerprinting attacks on the collected data from more than 70 domains (websites) to understand how and where this information leakage occurs in the TLS protocol.
Edit intent: clarity
Original:  Then, by employing the interpretation techniques developed in the machine learning community , and using our framework, we find the most vulnerable information fields in the TLS protocol.
Revised:  Then, by employing the interpretation techniques developed in the machine learning community and applying our framework, we find the most vulnerable information fields in the TLS protocol.
Edit intent: clarity
Original:  Our findings demonstrate that the TLS handshake (which is mainly unencrypted), the TLS record length appears in the TLS application data header, and the initialization vector (IV) field are among the most critical leaker parts in this protocol, respectively.
Revised:  Our findings demonstrate that the TLS handshake (which is mainly unencrypted), the TLS record length appearing in the TLS application data header, and the initialization vector (IV) field are among the most critical leaker parts in this protocol, respectively.
Edit intent: fluency