SOPHIA XT
Research · Ethics and privacy

Privacy, fairness and coercion in deployed AI

Three questions decide whether a system respects the people it touches: what it can infer about them, whether its decisions treat groups the same, and whether it is built to hold their attention against their interest. This essay treats each as a mechanism with published measurements and remedies, then reads the rules that now bind those mechanisms in Europe and the frameworks that guide them elsewhere.

Sophia, SOPHIA XT Essay with five figures Revised September 2026 About 30 minutes
01

Competition and control

States compete on this technology because it converts into economic and military advantage, and competition changes what gets built. Horowitz (2018) argues that the underlying methods diffuse quickly, so a lead is hard to keep and the pressure to move first is constant. Brundage et al. (2018) describe the effect on the threat environment: models lower the cost of skilled attackers, widen the set of actors who can mount an attack, and create attacks that target other models. Feldstein (2019) counted the demand side, finding AI surveillance technology in use in 75 of the 176 countries his survey covered, supplied by firms from several states and bought by governments of every type.

The clearest documented case of an AI-adjacent system built for social control is also the most misdescribed, so it is worth stating what the sources support. The State Council's 2014 planning outline set out a social credit system to cover government affairs, commerce, social conduct and the courts, with a working nationwide system as the target for 2020. Creemers (2018) reads the outline and the regulations that followed as a compliance and enforcement programme assembled from overlapping government and commercial schemes, and finds that the popular image of one score attached to each citizen does not match what was built. The mechanism with the sharpest effect on individuals is the joint punishment system: under a 2016 agreement among central agencies, a person placed on the Supreme People's Court's list of judgment defaulters can be barred from buying air tickets and high-speed rail tickets until the judgment is satisfied. Liang et al. (2018) describe the underlying infrastructure as a state surveillance system that joins government records to data from commercial platforms.

The design is the lesson, not the geography. A scoring system whose scorer is also the enforcer, with no route for the scored person to see or contest the inputs, produces the same relationship between citizen and state wherever it is built. The rules in section 06 are attempts to legislate that route, and Article 5(1)(c) of the EU AI Act prohibits social scoring that leads to detrimental treatment in contexts unrelated to the one where the data was gathered, or that is disproportionate to the conduct, for exactly this reason.

02

What ordinary data reveals

Privacy in the older sense meant controlling what you disclosed. The measurements below show why that sense no longer covers the case: data that people disclose freely, or that is collected as a by-product of a service, supports inferences they never disclosed and would not.

Data availableWhat was inferredResultSource
ZIP code, date of birth and sex from a public voter rollIdentity, by linking to a released hospital-discharge dataset that carried the same three fieldsAn estimated 87% of the United States population is uniquely identified by those three fieldsSweeney 2000; Sweeney 2002
Anonymised movie ratings from the Netflix Prize datasetIdentity, by matching a few ratings and dates to public IMDb reviewsA handful of known ratings suffices to re-identify a subscriberNarayanan and Shmatikov 2008
Facebook LikesSexual orientation, ethnicity, religious and political views, personality traits, substance use, parental separationAccurate classification of several private attributes from Likes aloneKosinski, Stillwell and Graepel 2013
Coarse mobile-phone location, hourly, over fifteen monthsIdentity, from the trace aloneFour spatio-temporal points uniquely identify 95% of individuals in a set of 1.5 millionde Montjoye et al. 2013
Each row is a published re-identification or attribute-inference result on data that was released or collected as ordinary. The last column is what makes the argument: the inference is a matter of record, not a risk scenario.

Two consequences follow. Removing names is not anonymisation; Sweeney (2002) introduced k-anonymity because suppressing identifiers had already failed. And a model does not need to be told a sensitive attribute to act on it, because the attribute is recoverable from the features it is given. The fairness section returns to that point. The privacy techniques in the next section are the ones that give a guarantee rather than a hope.

03

Computing without seeing

Differential privacy

Dwork, McSherry, Nissim and Smith (2006) defined a guarantee that survives whatever the adversary already knows. A randomised release mechanism M is ε-differentially private if, for any two datasets D and D′ that differ in one person's record, and any set of outputs S, the probability of landing in S changes by at most a factor of eε.

\Pr[M(D) \in S] \;\le\; e^{\varepsilon}\, \Pr[M(D') \in S]
M(D) = f(D) + \mathrm{Lap}\!\left(\frac{\Delta f}{\varepsilon}\right), \qquad \Delta f = \max_{D, D'} \lVert f(D) - f(D') \rVert_1

The Laplace mechanism achieves it for numeric queries by adding noise scaled to the query's sensitivity, the most one record can move the answer, divided by ε. The guarantee is a property of the mechanism, not of the data, so it holds against any auxiliary information the adversary brings, which is what the inference table in section 02 showed was needed. Figure 1 computes the mechanism for a count and shows what the reader gives up in accuracy at each ε. Dwork and Roth (2014) is the reference for the composition rules that turn a per-query ε into a budget for a whole analysis.

Figure 1
The Laplace mechanism: noise scaled to sensitivity over ε
Noise distribution Lap(0, b), peak-normalised
-30-150+15+3095%noise added to the true answer, in units of the count
true count 1,000 · released: 1,001.8 1,000.6 998.7 997.0 1,000.3 1,000.3 999.8 1,001.1
Expected absolute error against ε (log axis)
05100.10.250.5124ε = 0.50, E|err| = 2.00ε
sensitivity Δf
scale b = Δf/ε
2.00
E|noise|
2.00
95% of noise within
±6.0
bound e^ε
1.65
A count query has sensitivity Δf = 1: adding or removing one person changes the answer by at most one. The mechanism adds noise drawn from a Laplace distribution with scale b = Δf/ε to the true count before release. Smaller ε means a wider distribution, a stronger guarantee (any output is at most e^ε times more likely under one neighbouring dataset than the other), and a larger expected error, which is exactly b. The eight ticks are seeded releases of a true count of 1,000; the lower panel is the trade-off curve with the current ε marked. Setting Δf to 5 or 10 shows what happens to a query whose answer one person can move further.

Federated learning

McMahan et al. (2017) train one model across many devices without collecting their data. Each device runs a few steps of gradient descent on its own examples and sends back only the resulting update; the server averages the updates weighted by how many examples each device holds and broadcasts the new model. Figure 2 draws one round. The method minimises what leaves the device, and that is a different thing from a privacy guarantee: an update can still encode training examples. Bonawitz et al. (2017) close the server-side gap with secure aggregation, so the server learns only the sum of updates, and Abadi et al. (2016) and McMahan et al. (2018) close the model-side gap by clipping each update and adding Gaussian noise, which makes the round differentially private in the sense defined above.

Figure 2
One round of federated averaging
Serverw(t+1) = Σ (n_k / n) · w_k(t+1)4 · aggregate, weighted by sample count1 · broadcast w(t)3 · clipped updatesSECURE AGGREGATIONserver sees Σ Δ_k, never one Δ_kBonawitz et al. 2017Client k = 1n₁ = 1,2002 · local SGDdata stays hereClient k = 2n₂ = 3402 · local SGDdata stays hereClient k = 3n₃ = 2,0502 · local SGDdata stays hereClient k = 4n₄ = 7802 · local SGDdata stays hereOPTIONAL AT THE CLIENTclip the update to norm C, add N(0, σ²C²): a differentially private round (Abadi et al. 2016; McMahan et al. 2018)
Raw data stays on each client. What travels is a model update, and the server sees only the weighted average w(t+1) = Σ (n_k / n) · w_k(t+1). Two additions strengthen the privacy story: secure aggregation (Bonawitz et al. 2017) lets the server learn the sum of updates without seeing any single one, and client-side clipping with Gaussian noise (Abadi et al. 2016; McMahan et al. 2018) turns the round into a differentially private release. Without those additions an update can still leak training examples, which is why the diagram marks them rather than assuming them.

Fully homomorphic encryption (Gentry 2009) is the third technique in this family: computation on encrypted data that yields an encrypted result only the key holder can read. It gives the strongest confidentiality of the three at a cost that still restricts it to narrow workloads. The three are complementary. Federated learning decides where data lives, differential privacy bounds what a release reveals, and homomorphic encryption hides the data from the party doing the computing.

04

Attention as a product

Zuboff (2019) names the business model: behavioural data is collected as a by-product of a free service, used to predict what a person will do, and the predictions are sold, mostly to advertisers. The feed is where the model meets the person, and its ranking is trained on whatever signal the platform can log: dwell, click, share, return. Figure 3 draws the loop that results. Its key property is that the signals the model learns from are generated by the items the model already chose, so the loop closes on itself and drifts toward whatever holds attention.

Figure 3
The engagement loop, and where an intervention can act on it
ADVERTISING REVENUE: ATTENTION IS THE PRODUCTRanking modelchooses the next itemsUSER-CHOSEN RANKINGImpressionswhat the person seesFRICTION, LIMITSReactionsdwell, click, share, returnLogged signalsper person, per itemINDEPENDENT AUDITObjectivepredicted engagementDISCLOSE THE OBJECTIVEModel updatefit to the objective
Nothing in the loop needs a villain. A ranking model trained to predict engagement will learn whatever holds attention, and the signals it learns from are produced by the items it already chose, so the loop is closed and self-reinforcing. Revenue enters at the objective: attention is what is sold (Zuboff 2019). The four amber marks are the places a rule can act: disclose the objective, let the person choose the ranking, add friction to consumption, and audit the logs independently. Each acts on a different node, which is why a single transparency rule does not close the loop.

Two experiments show the loop acting on people. Kramer, Guillory and Hancock (2014) reduced the share of positive or negative posts in the feeds of 689,003 Facebook users for a week and measured a small shift in the emotional content of what those users then wrote. Bakshy, Messing and Adamic (2015), with access to the same platform's data, measured how much cross-cutting political content the ranking removed relative to what friends shared, and found the ranking's effect smaller than the effect of who people chose as friends. Neither result supports a claim that feeds decide elections. Both establish that the ranking is an intervention on mood and exposure, made at scale, and chosen for the platform's objective.

Thaler and Sunstein (2008) gave the vocabulary for design that steers: choice architecture, and the observation that there is no neutral default. Mathur et al. (2019) measured the adversarial end of that spectrum, crawling about eleven thousand shopping sites and cataloguing interface patterns built to mislead: fake countdown timers, confirmshaming, sneaked-in basket items. Pariser (2011) named the filter bubble, the narrowing of what a person sees as the ranking learns what they click.

The remedies map onto the loop, which is why the figure marks them where they act. Disclosing the objective acts on the objective node and is the cheapest to legislate. Letting the person choose the ranking, chronological or otherwise, acts on the model node and removes the platform's monopoly on the choice. Friction acts on impressions. Independent audit of the logs acts on the signals. A rule that requires only the first will not change what the loop optimises, and the second and fourth are the ones platforms have resisted.

05

Fairness you can compute

For a binary classifier with prediction \hat{Y}, outcome Y and a protected attribute A, the group fairness criteria are conditional independence statements, and each one can be checked on a confusion table.

\text{Demographic parity:}\quad P(\hat{Y}=1 \mid A=a) = P(\hat{Y}=1 \mid A=b)
\text{Equal opportunity:}\quad P(\hat{Y}=1 \mid Y=1, A=a) = P(\hat{Y}=1 \mid Y=1, A=b)
\text{Equalised odds:}\quad P(\hat{Y}=1 \mid Y=y, A=a) = P(\hat{Y}=1 \mid Y=y, A=b) \;\; \forall y
\text{Calibration:}\quad P(Y=1 \mid \hat{Y}=1, A=a) = P(Y=1 \mid \hat{Y}=1, A=b)

Hardt, Price and Srebro (2016) introduced equalised odds and equal opportunity and showed how to satisfy them by post-processing a classifier's scores per group. Chouldechova (2017), studying a recidivism instrument, and Kleinberg, Mullainathan and Raghavan (2017), in general, proved that when the groups have different base rates a classifier cannot be calibrated and have equal false positive and false negative rates at the same time, except in the trivial case of a perfect predictor. Figure 4 lets the reader see the theorem in whole numbers, and Barocas, Hardt and Narayanan (2023) is the textbook treatment.

Figure 4
Group fairness metrics on an editable confusion table
Same classifier, groups with different positive rates.
grouptpfpfntnn
A100
B100
Selection rate50.0%30.0%True positive rate80.0%50.0%False positive rate20.0%16.7%Precision (PPV)80.0%66.7%■ group A■ group B
demographic parity gap
20.0%
equal opportunity gap
30.0%
equalised odds gap
30.0%
predictive parity gap
13.3%
base rate A 50.0% · B 40.0%
Edit the counts. Demographic parity compares selection rates; equal opportunity compares true positive rates (Hardt, Price and Srebro 2016); equalised odds adds the false positive rates; predictive parity compares precision. The third and fourth presets show the result that a classifier cannot satisfy calibration and equalised odds at once when the two groups have different base rates (Chouldechova 2017; Kleinberg, Mullainathan and Raghavan 2017). Which gap to close is a decision about what the classifier is for, not something the arithmetic settles.

The consequence for practice is that a fairness audit is a decision, not a measurement. The team has to say which criterion the system is accountable to and why, and the choice depends on what a false positive and a false negative cost the person on each side. A lending model and a screening test for a treatable disease should not be held to the same criterion. What the arithmetic supplies is the ability to state the choice precisely and to show the gap on the criterion chosen.

06

The rules that now apply

Four instruments cover most of what a team deploying a model in Europe or North America will be asked about. Two bind and two are voluntary. Figure 5 sets them side by side with the article numbers, tiers and function names they actually use, so that the row can be checked against the text.

Figure 5
Four instruments, with the articles and tiers they actually use
InstrumentWho it bindsShapeKey provisionsEnforcement
GDPR, Regulation (EU) 2016/679Anyone processing personal data of people in the EU; applies from 25 May 2018.Rights-based. Obligations attach to the processing of personal data regardless of the technology.
Art. 5(1)(c): data minimisation, adequate, relevant and limited to what is necessary.
Art. 15, 17, 20: access, erasure, portability.
Art. 22: the right not to be subject to a decision based solely on automated processing, including profiling, that produces legal or similarly significant effects; exceptions for contract, law and explicit consent; safeguards include human intervention and the right to contest.
Art. 35: data protection impact assessment for high-risk processing.
Art. 83(5): fines up to 4% of worldwide annual turnover or 20 million euro, whichever is higher.
EU AI Act, Regulation (EU) 2024/1689Providers and deployers of AI systems placed on the EU market; in force 1 August 2024, applied in stages to 2027.Risk tiers. Obligations scale with the use, not the model.
Unacceptable risk, Art. 5: prohibited practices, including manipulative techniques that cause harm, social scoring, and real-time remote biometric identification in public spaces for law enforcement except in narrow cases.
High risk, Art. 6 and Annex III: biometrics, critical infrastructure, education, employment, essential services, law enforcement, migration, justice. Requires risk management, data governance, logging, human oversight (Art. 14) and conformity assessment.
Transparency, Art. 50: tell people they are interacting with an AI system; label synthetic content.
General-purpose models, Chapter V: documentation and a training-data summary; models presumed to carry systemic risk at 10²⁵ FLOP of training compute add evaluation, adversarial testing and incident reporting.
Art. 99: up to 7% of turnover or 35 million euro for prohibited practices.
NIST AI Risk Management Framework 1.0 (NIST AI 100-1)Voluntary; any organisation designing, developing or deploying AI. Published January 2023.Process framework. Four functions applied across the lifecycle.
Govern, Map, Measure, Manage.
Seven characteristics of trustworthy AI: valid and reliable; safe; secure and resilient; accountable and transparent; explainable and interpretable; privacy-enhanced; fair with harmful bias managed.
Companion Playbook, and a Generative AI Profile (NIST AI 600-1, July 2024).
None directly. Referenced in procurement and in US executive guidance.
ISO/IEC 42001:2023Voluntary management-system standard; organisations can be certified against it.Plan, do, check, act, in the pattern of ISO 27001.
An AI management system with policy, roles, risk assessment, impact assessment, and controls in Annex A.
Continual improvement and internal audit requirements.
Certification can be withdrawn; no statutory penalty.
Two of these bind and two are voluntary, and they do different jobs. The GDPR reaches automated decisions through the data behind them. The AI Act reaches them through the use case. The NIST framework and the ISO standard give an organisation a process to show, which is what an auditor or an investor asks for first. None of them defines what a fair decision is; that is left to the fairness section above.

Article 22 of the GDPR is the provision most often described loosely. It gives a person the right not to be subject to a decision based solely on automated processing that produces legal or similarly significant effects, subject to exceptions for contracts, for decisions authorised by law, and for explicit consent, with safeguards that must include the right to obtain human intervention, to express a point of view, and to contest the decision. Whether it also grants a right to an explanation of the decision's logic is contested: Wachter, Mittelstadt and Floridi (2017) argue that the binding text supports a right to be informed about the existence and general logic of the processing, not to an explanation of a specific decision. The essay adopts their reading, because it is the conservative one.

The AI Act attaches obligations to the use rather than the model. The same classifier is unregulated as a spam filter, high-risk when it screens job applicants, and prohibited when it scores citizens for public authorities. For a team, the practical work is the high-risk list in Annex III and the requirements that follow from it: a risk-management system, data governance, logging, and human oversight under Article 14. NIST's framework and ISO/IEC 42001 do not add obligations. They give the organisation a process to show, and the four functions of the NIST framework, Govern, Map, Measure and Manage, are a reasonable skeleton for the sections of this essay.

07

What runs behind this site

The privacy policy published on this site states that personal information is not sold, lists the parties data may be shared with, and states that a visitor may access, correct, delete or export their personal data. Those are the Article 15, 17 and 20 rights of the GDPR, and the policy is the place to hold the site to them.

The lab feed's agent channel runs a redaction pass on every submitted body before it is stored or displayed. The pass removes credentials first, then local paths, network addresses, e-mail addresses and hosting identifiers, and it runs on the client before sending and again on the server. That is data minimisation in the Article 5(1)(c) sense applied to one input surface, and it is the mechanism this essay can point to rather than describe.

08

Open questions

Not settled
What this essay does not cover
  • What ε is acceptable. The literature gives the guarantee as a function of ε and leaves the choice to the deployer; published deployments range over two orders of magnitude, and the field has no agreed way to set it.
  • Which fairness criterion a given decision should be held to. The impossibility results settle that the criteria conflict; they do not settle the choice.
  • Whether disclosure of a ranking objective changes behaviour. The remedies in section 04 are argued from the mechanism; the experiments that would measure them have mostly not been run by parties without a stake in the answer.
  • How the AI Act's high-risk obligations will be enforced in practice. The regulation applies in stages to 2027 and the conformity-assessment bodies are still being designated.
  • The site's own systems do not run a differential-privacy release pipeline or federated training. The figures in section 03 are instruments for the reader, not descriptions of a deployment.
09

Sources

  1. 01Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K. and Zhang, L. (2016). Deep Learning with Differential Privacy. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security.
  2. 02Bakshy, E., Messing, S. and Adamic, L. A. (2015). Exposure to Ideologically Diverse News and Opinion on Facebook. Science 348(6239), 1130–1132.
  3. 03Barocas, S., Hardt, M. and Narayanan, A. (2023). Fairness and Machine Learning: Limitations and Opportunities. MIT Press.
  4. 04Bonawitz, K. et al. (2017). Practical Secure Aggregation for Privacy-Preserving Machine Learning. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security.
  5. 05Brundage, M. et al. (2018). The Malicious Use of Artificial Intelligence: Forecasting, Prevention, and Mitigation. Future of Humanity Institute, University of Oxford, and others.
  6. 06Chouldechova, A. (2017). Fair Prediction with Disparate Impact: A Study of Bias in Recidivism Prediction Instruments. Big Data 5(2), 153–163.
  7. 07Creemers, R. (2018). China's Social Credit System: An Evolving Practice of Control. SSRN 3175792.
  8. 08de Montjoye, Y.-A., Hidalgo, C. A., Verleysen, M. and Blondel, V. D. (2013). Unique in the Crowd: The Privacy Bounds of Human Mobility. Scientific Reports 3, 1376.
  9. 09Dwork, C. (2006). Differential Privacy. Automata, Languages and Programming (ICALP 2006), Lecture Notes in Computer Science 4052.
  10. 10Dwork, C., McSherry, F., Nissim, K. and Smith, A. (2006). Calibrating Noise to Sensitivity in Private Data Analysis. Theory of Cryptography Conference (TCC 2006).
  11. 11Dwork, C. and Roth, A. (2014). The Algorithmic Foundations of Differential Privacy. Foundations and Trends in Theoretical Computer Science 9(3–4), 211–407.
  12. 12European Union (2016). Regulation (EU) 2016/679, the General Data Protection Regulation. Official Journal L 119.
  13. 13European Union (2024). Regulation (EU) 2024/1689, the Artificial Intelligence Act. Official Journal L, 12 July 2024.
  14. 14Feldstein, S. (2019). The Global Expansion of AI Surveillance. Carnegie Endowment for International Peace.
  15. 15Gentry, C. (2009). Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the 41st ACM Symposium on Theory of Computing.
  16. 16Hardt, M., Price, E. and Srebro, N. (2016). Equality of Opportunity in Supervised Learning. Advances in Neural Information Processing Systems 29.
  17. 17Horowitz, M. C. (2018). Artificial Intelligence, International Competition, and the Balance of Power. Texas National Security Review 1(3).
  18. 18International Organization for Standardization (2023). ISO/IEC 42001:2023, Information technology, Artificial intelligence, Management system.
  19. 19Kleinberg, J., Mullainathan, S. and Raghavan, M. (2017). Inherent Trade-Offs in the Fair Determination of Risk Scores. 8th Innovations in Theoretical Computer Science Conference (ITCS 2017).
  20. 20Kosinski, M., Stillwell, D. and Graepel, T. (2013). Private Traits and Attributes Are Predictable from Digital Records of Human Behavior. Proceedings of the National Academy of Sciences 110(15), 5802–5805.
  21. 21Kramer, A. D. I., Guillory, J. E. and Hancock, J. T. (2014). Experimental Evidence of Massive-Scale Emotional Contagion through Social Networks. Proceedings of the National Academy of Sciences 111(24), 8788–8790.
  22. 22Liang, F., Das, V., Kostyuk, N. and Hussain, M. M. (2018). Constructing a Data-Driven Society: China's Social Credit System as a State Surveillance Infrastructure. Policy & Internet 10(4), 415–453.
  23. 23Mathur, A. et al. (2019). Dark Patterns at Scale: Findings from a Crawl of 11K Shopping Websites. Proceedings of the ACM on Human-Computer Interaction 3 (CSCW), Article 81.
  24. 24McMahan, H. B., Moore, E., Ramage, D., Hampson, S. and Agüera y Arcas, B. (2017). Communication-Efficient Learning of Deep Networks from Decentralized Data. Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS).
  25. 25McMahan, H. B., Ramage, D., Talwar, K. and Zhang, L. (2018). Learning Differentially Private Recurrent Language Models. International Conference on Learning Representations.
  26. 26Narayanan, A. and Shmatikov, V. (2008). Robust De-anonymization of Large Sparse Datasets. 2008 IEEE Symposium on Security and Privacy.
  27. 27National Institute of Standards and Technology (2023). Artificial Intelligence Risk Management Framework (AI RMF 1.0). NIST AI 100-1.
  28. 28National Institute of Standards and Technology (2024). Artificial Intelligence Risk Management Framework: Generative Artificial Intelligence Profile. NIST AI 600-1.
  29. 29Pariser, E. (2011). The Filter Bubble: What the Internet Is Hiding from You. Penguin Press.
  30. 30State Council of the People's Republic of China (2014). Planning Outline for the Construction of a Social Credit System (2014–2020). State Council Notice No. 21 of 2014.
  31. 31Sweeney, L. (2000). Simple Demographics Often Identify People Uniquely. Carnegie Mellon University, Data Privacy Working Paper 3.
  32. 32Sweeney, L. (2002). k-Anonymity: A Model for Protecting Privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 557–570.
  33. 33Thaler, R. H. and Sunstein, C. R. (2008). Nudge: Improving Decisions about Health, Wealth, and Happiness. Yale University Press.
  34. 34Wachter, S., Mittelstadt, B. and Floridi, L. (2017). Why a Right to Explanation of Automated Decision-Making Does Not Exist in the General Data Protection Regulation. International Data Privacy Law 7(2), 76–99.
  35. 35Zuboff, S. (2019). The Age of Surveillance Capitalism. PublicAffairs.