wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, classifying disinformation is performative, and thus a fixed rule  becomes less effective over time  . Encoding our domain as a Markov decision process, we demonstrate that no penalty based on a static rule, no matter how large, can incentivize adequate effort by the platform . Penalties based on an adaptive rule can incentivize optimal effort, but counterintuitively, only if the regulator sufficiently overreacts to harmful events by requiring a greater-than-optimal level of effort.
Revised:  However, classifying disinformation is performative, and thus a fixed rule for classifying disinformation becomes less effective over time . Encoding our domain as a Markov decision process, we demonstrate that no penalty based on a static rule, no matter how large, can incentivize adequate effort by the platform . Penalties based on an adaptive rule can incentivize optimal effort, but counterintuitively, only if the regulator sufficiently overreacts to harmful events by requiring a greater-than-optimal level of effort.
Edit intent: clarity
Original:  However, classifying disinformation is performative, and thus a fixed rule  becomes less effective over time  . Encoding our domain as a Markov decision process, we demonstrate that no penalty based on a static rule, no matter how large, can incentivize adequate effort by the platform . Penalties based on an adaptive rule can incentivize optimal effort, but counterintuitively, only if the regulator sufficiently overreacts to harmful events by requiring a greater-than-optimal level of effort.
Revised:  However, classifying disinformation is performative, and thus a fixed rule becomes less effective over time . Encoding our domain as a Markov decision process, we demonstrate that no penalty based on a static rule, no matter how large, can incentivize adequate effort . Penalties based on an adaptive rule can incentivize optimal effort, but counterintuitively, only if the regulator sufficiently overreacts to harmful events by requiring a greater-than-optimal level of effort.
Edit intent: clarity
Original:  We therefore push for mechanisms that elicit platforms' costs of precautionary effort in order to bypass such an overreaction .
Revised:  We prescribe the design of mechanisms that elicit platforms' costs of precautionary effort in order to bypass such an overreaction .
Edit intent: clarity
Original:  We therefore push for mechanisms that elicit platforms' costs of precautionary effort in order to bypass such an overreaction .
Revised:  We therefore push for mechanisms that elicit platforms' costs of precautionary effort relating to the control of disinformation .
Edit intent: clarity
Original: We consider the problem of assigning agents to resources in the two-sided preference  model with upper and lower-quota requirements on resources.
Revised: We consider the problem of assigning agents to resources under the two-sided preference model with upper and lower-quota requirements on resources.
Edit intent: clarity
Original:  This setting (known as the HRLQ setting) models real-world applications like assigning students to colleges or courses, resident doctors to hospitals and so on.
Revised:  This setting models real-world applications like assigning students to colleges or courses, resident doctors to hospitals and so on.
Edit intent: clarity
Original:  In presence of lower-quotas, an instance may not admit a stable matching that fulfils the lower-quotas.
Revised:  In presence of lower-quotas, an instance may not admit a stable matching that satisfies the lower-quotas.
Edit intent: clarity
Original:  Prem Krishnaa et al.
Revised:  Krishnaa et al.
Edit intent: clarity
Original:  They investigate the complexity of computing a maximum size envy-free matching (MAXEFM) and a maximum size relaxed stable matching (MAXRSM) that fulfils the lower-quotas.
Revised:  They investigate the problem of computing a maximum size envy-free matching (MAXEFM) and a maximum size relaxed stable matching (MAXRSM) that fulfils the lower-quotas.
Edit intent: clarity
Original:  They investigate the complexity of computing a maximum size envy-free matching (MAXEFM) and a maximum size relaxed stable matching (MAXRSM) that fulfils the lower-quotas.
Revised:  They investigate the complexity of computing a maximum size envy-free matching (MAXEFM) and a maximum size relaxed stable matching (MAXRSM) that satisfies the lower-quotas.
Edit intent: clarity
Original:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider  natural parameters derived from the instance -- the number of  lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a  lower-quota hospital, to name a few .
Revised:  In this work, we investigate parameterized complexity of MAXEFM and MAXRSM. We consider natural parameters derived from the instance -- the number of lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a lower-quota hospital, to name a few .
Edit intent: fluency
Original:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider  natural parameters derived from the instance -- the number of  lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a  lower-quota hospital, to name a few .
Revised:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider several natural parameters derived from the instance -- the number of lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a lower-quota hospital, to name a few .
Edit intent: clarity
Original:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider  natural parameters derived from the instance -- the number of  lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a  lower-quota hospital, to name a few .
Revised:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider natural parameters derived from the instance -- the number of lower-quota , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a lower-quota hospital, to name a few .
Edit intent: fluency
Original:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider  natural parameters derived from the instance -- the number of  lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a  lower-quota hospital, to name a few .
Revised:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider natural parameters derived from the instance -- the number of lower-quota hospitals , deficiency of the instance, maximum length of the preference list of a lower-quota hospital, to name a few .
Edit intent: coherence
Original:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider  natural parameters derived from the instance -- the number of  lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a  lower-quota hospital, to name a few .
Revised:  In this work, we investigate the parameterized complexity of MAXEFM and MAXRSM. We consider natural parameters derived from the instance -- the number of lower-quota hospitals , deficiency of the instance, size of a maximum matching, size of a stable matching, length of the preference list of a lower-quota , among others .
Edit intent: coherence
Original:  We show that MAXRSM problem does not admit an FPT algorithm unless P=NP for two natural parameters but admits a polynomial size kernel for a combination of parameters in a special case.
Revised:  We show that MAXRSM problem does not admit an FPT algorithm unless P=NP for two natural parameters . We present a kernelization result on a combination of parameters in a special case.
Edit intent: clarity
Original: We consider the problem of assigning agents to resources under the two-sided preference list model with upper and lower-quota requirements on resources.
Revised: We consider the problem of assigning agents to resources under the two-sided preference list model with upper and lower-quotas on resources.
Edit intent: clarity
Original:  [ SAGT 2020 ] explore two alternative optimality notions for the instances with lower-quotas -- envy-freeness and relaxed stability.
Revised:  [ 17 ] explore two alternative optimality notions for the instances with lower-quotas -- envy-freeness and relaxed stability.
Edit intent: clarity
Original:  [ SAGT 2020 ] explore two alternative optimality notions for the instances with lower-quotas -- envy-freeness and relaxed stability.
Revised:  [ SAGT 2020 ] explore two optimality notions for the instances with lower-quotas -- envy-freeness and relaxed stability.
Edit intent: clarity
Original:  [ SAGT 2020 ] explore two alternative optimality notions for the instances with lower-quotas -- envy-freeness and relaxed stability.
Revised:  [ SAGT 2020 ] explore two alternative optimality notions for this setting -- envy-freeness and relaxed stability.
Edit intent: clarity
Original:  They show that both these optimization problems are NP-hard and not approximable within a constant factor unless P = NP.
Revised:  They show that both these optimization problems cannot be approximated within a constant factor unless P = NP.
Edit intent: clarity
Original:  In this work, we investigate parameterized complexity of MAXEFM and MAXRSM. We consider several natural parameters derived from the instance -- the number of resources with non-zero lower-quota, deficiency of the instance, maximum length of the preference list of a resource with non-zero lower-quota, among others.
Revised:  In this work, we investigate parameterized complexity of MAXEFM and MAXRSM. We consider several parameters derived from the instance -- the number of resources with non-zero lower-quota, deficiency of the instance, maximum length of the preference list of a resource with non-zero lower-quota, among others.
Edit intent: clarity
Original:  We present a kernelization result on a combination of parameters and FPT algorithms for both problems.
Revised:  We present kernelization results and FPT algorithms on a combination of parameters and FPT algorithms for both problems.
Edit intent: clarity
Original:  We present a kernelization result on a combination of parameters and FPT algorithms for both problems.
Revised:  We present a kernelization result on a combination of parameters for both problems.
Edit intent: clarity
Original:  The ``position paradigm'' , in which genomes are represented as permutations signifying the position (and orientation) of each region, enables a refined model-based approach, where one can select biologically plausible rearrangements and assign to them relative probabilities/costs.
Revised:  The "position paradigm" , in which genomes are represented as permutations signifying the position (and orientation) of each region, enables a refined model-based approach, where one can select biologically plausible rearrangements and assign to them relative probabilities/costs.
Edit intent: fluency
Original:  In our recently-introduced framework of genome algebras {\em  , each genome corresponds to an element that simultaneously incorporates all of its inherent physical symmetries.
Revised:  In our recently-introduced framework of {\em , each genome corresponds to an element that simultaneously incorporates all of its inherent physical symmetries.
Edit intent: clarity
Original:  The approach can be viewed as a methodology framework that allows to enhance "stiffness resistance"  of pretty much all the known numerical methods for solving two-point BVPs.
Revised:  The approach can be viewed as a methodology framework that allows to enhance "stiffness resistance" capabilities of pretty much all the known numerical methods for solving two-point BVPs.
Edit intent: clarity
Original:  Goal-directed behavior is determined from the posterior distribution of z by planning, using active inference , to minimize the }  free energy for goal observation .
Revised:  Goal-directed behavior is determined from the posterior distribution of z by planning, using active inference , to minimize the } free energy for goal observation .
Edit intent: fluency
Original:  A relaxed control approach is adopted, and an optimal randomized control can be obtained in the system with finite banks by applying Ekeland's variational principle.
Revised:  A weak formulation is adopted, and an optimal randomized control can be obtained in the system with finite banks by applying Ekeland's variational principle.
Edit intent: clarity
Original:  It is shown that the limiting optimal relaxed control is linked to a solution of a stochastic Fokker-Planck-Kolmogorov (FPK) equation.
Revised:  It is shown that the limiting optimal control is linked to a solution of a stochastic Fokker-Planck-Kolmogorov (FPK) equation.
Edit intent: clarity
Original:  By mimicking online learning and federated learning on  CIFAR-10, we show that the model accuracy will significantly drop by a single update step on the trigger batch after the accumulative phase.
Revised:  By mimicking online learning and federated learning on CIFAR-10, we show that model accuracy significantly drops by a single update step on the trigger batch after the accumulative phase.
Edit intent: clarity
Original:  Reconfigurable intelligent surfaces (RISs) can be used in combination with UAVs with the aim to improve the communication performance without increasing complexity at the UAVs' side.
Revised:  Reconfigurable intelligent surfaces (RISs) can be used in combination with UAVs with the aim to improve the communication performance without increasing complexity at the UAV side.
Edit intent: fluency
Original:  In this paper, we propose a synergetic UAV-RIS communication system, utilizing a UAV with a  directional antenna aiming to the RIS. Also, we present the link budget analysis and closed-form expressions for the outage probability as well as for an important second order statistical parameter of the proposed synergetic UAV-RIS communication system, the average outage duration.
Revised:  In this paper, we propose a synergetic UAV RIS communication system, utilizing a UAV with a directional antenna aiming to the RIS. Also, we present the link budget analysis and closed-form expressions for the outage probability as well as for an important second order statistical parameter of the proposed synergetic UAV-RIS communication system, the average outage duration.
Edit intent: fluency
Original: Contemporary mobile applications (apps) are designed to track, use, and share users  data, often without their consent, which result in potential privacy and transparency issues.
Revised: Contemporary mobile applications (apps) are designed to track, use, and share users ' data, often without their consent, which result in potential privacy and transparency issues.
Edit intent: fluency
Original: Contemporary mobile applications (apps) are designed to track, use, and share users  data, often without their consent, which result in potential privacy and transparency issues.
Revised: Contemporary mobile applications (apps) are designed to track, use, and share users data, often without their consent, which results in potential privacy and transparency issues.
Edit intent: fluency
Original:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Revised:  To investigate whether mobile apps have always been (non-)transparent regarding how they collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Edit intent: clarity
Original:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Revised:  To investigate whether mobile apps are transparent about the collect information about users , we perform a longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Edit intent: coherence
Original:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Revised:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the historical versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Edit intent: clarity
Original:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android applications comprising 5,240 app releases or versions between 2008 and 2016.
Revised:  To investigate whether mobile apps are transparent about the collect information about users and apps comply with their privacy policies, we performed longitudinal analysis of the different versions of 268 Android apps. These apps comprise 5,240 app releases or versions between 2008 and 2016.
Edit intent: clarity
Original:  We detect inconsistencies between apps' behaviors and  stated use of data collection , to reveal compliance issues.
Revised:  We detect inconsistencies between apps' behaviors and the stated use of data collection , to reveal compliance issues.
Edit intent: fluency
Original:  We utilize machine learning techniques to classify the privacy policy text to identify the purported practices that collect and/or share users' personal information  such as phone numbers and email addresses.
Revised:  We utilize machine learning techniques for the classification of the privacy policy text to identify the purported practices that collect and/or share users' personal information such as phone numbers and email addresses.
Edit intent: clarity
Original:  We utilize machine learning techniques to classify the privacy policy text to identify the purported practices that collect and/or share users' personal information  such as phone numbers and email addresses.
Revised:  We utilize machine learning techniques to classify the privacy policy text to identify the purported practices that collect and/or share users' personal information , such as phone numbers and email addresses.
Edit intent: fluency
Original:  We then uncover the actual data leaks of an app through static and dynamic analysis.
Revised:  We then uncover the data leaks of an app through static and dynamic analysis.
Edit intent: clarity
Original:  Over time, our results show a steady increase in the overall number of apps' data collection practices that are undisclosed in the privacy policies.
Revised:  Over time, our results show a steady increase in the number of apps' data collection practices that are undisclosed in the privacy policies.
Edit intent: clarity
Original:  This  is particularly troubling since privacy policy is the primary tool for describing the app's privacy protection practices.
Revised:  This behavior is particularly troubling since privacy policy is the primary tool for describing the app's privacy protection practices.
Edit intent: clarity
Original:  The discrepancies between the purported and  actual data practices show that privacy policies are often incoherent with the apps' behaviors, thus defying the ` notice and choice' principle when users install apps.
Revised:  The discrepancies between the purported and the actual data practices show that privacy policies are often incoherent with the apps' behaviors, thus defying the ` notice and choice' principle when users install apps.
Edit intent: fluency
Original:  The discrepancies between the purported and  actual data practices show that privacy policies are often incoherent with the apps' behaviors, thus defying the ` notice and choice' principle when users install apps.
Revised:  The discrepancies between the purported and actual data practices show that privacy policies are often incoherent with the apps' behaviors, thus defying the ' notice and choice' principle when users install apps.
Edit intent: fluency
Original: Fitting network models to neural activity is becoming an important tool in neuroscience.
Revised: Fitting network models to neural activity is an important tool in neuroscience.
Edit intent: clarity
Original:  Although this is widely used, we show that the resulting model does not produce realistic neural activity and wrongly estimates the connectivity matrix when neurons that are not recorded have a substantial impact on the recorded network .
Revised:  Although this is widely used, we show that the resulting model does not produce realistic neural activity .
Edit intent: clarity
Original:  This dissimilarity is defined via summary statistics commonly used in neuroscience , and the optimization is efficient because it relies on back-propagation through the stochastically simulated spike trains.
Revised:  This dissimilarity is defined via summary statistics commonly used in neuroscience and the optimization is efficient because it relies on back-propagation through the stochastically simulated spike trains.
Edit intent: fluency
Original:  A key new technique is a unary representation of small integers, which is shown to be robust against ``randomized response'' noise.
Revised:  A key new technique is a unary representation of small integers, which we show to be robust against ``randomized response'' noise.
Edit intent: clarity
Original:  However, the quality of synthetic aperture radar images depends on accurate and precise motion estimation of the radar antennas as well as generating informative viewpoints with the UAV . This paper presents a complete and automatic airborne ground-penetrating synthetic aperture radar (GPSAR) system.
Revised:  However, the quality of synthetic aperture radar images depends on accurate and precise motion estimation of the radar antennas as well as generating informative viewpoints with the MAV . This paper presents a complete and automatic airborne ground-penetrating synthetic aperture radar (GPSAR) system.
Edit intent: clarity
Original:  A custom mission planning framework allows generation and automatic execution of stripmap and circular GPSAR trajectories controlled above ground level as well as aerial imaging survey flights.
Revised:  A custom mission planning framework allows generation and automatic execution of stripmap and circular (GPSAR) trajectories controlled above ground level as well as aerial imaging survey flights.
Edit intent: clarity
Original:  A factor graph based state estimator fuses measurements from dual receiver real-time kinematic (RTK) global navigation satellite system (GNSS) and an inertial measurement unit (IMU) to obtain precise, high rate platform positions and orientations.
Revised:  A factor graph based state estimator fuses measurements from dual receiver real-time kinematic (RTK) global navigation satellite system (GNSS) and inertial measurement unit (IMU) to obtain precise, high rate platform positions and orientations.
Edit intent: fluency